Public report of langchain-ai/langgraph, published 25 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 25 October 2026, 09:14 UTC · Survey ID cd_59f202b676ef4f559633ee2c467554f3
langchain-ai/langgraph
Measured 25 October 2026, 09:08 UTC, at code version 4c52e12
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
Code coverage is not measured: JavaScript/TypeScript suite (CouldNotMeasureTestRunFailed).
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Up 2 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: 71,175 lines of product code in 9 projects, tests not counted · Estimated rebuild effort: about 1.2 person-years · Weakest lens: Production Readiness, 52
Findings by how serious they are
32 critical616 serious104 minor
19 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
25 October 2026, 09:08 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
68of 68 dimensions measured by tools.
730of 752 findings point to an exact file and line, so you can open each one in the code. The other 22 concern the repository as a whole, such as missing documentation.
68dimensions across 6 lenses, read from 71,175 lines of product code in 9 projects.
langchain-ai/langgraph falls short of our standard for production, held back most by its Production Readiness lens, the way the code is tested, built, released and run. It scores 59 out of 100 and is rated Adequate, and 30 of its 32 critical findings are security problems.
Production Readiness, at 52, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 6 points. Replacing the two packages under a banned licence comes next, worth about 5 points. Raising Production Readiness to 70 would lift the score to about 63.
Eleven secrets can leak from the build pipeline. Nine known security holes in the packages the code depends on can be used by attackers, and seven weaknesses in the code could be used by an attacker. Limiting each secret to its own step, updating the vulnerable packages and fixing the weaknesses the scanner points to would close these risks. Setting a waiting period for automatic updates would fix the automatic dependency update that takes a new release at once, and the password or key in the code's history needs replacing, with the old one switched off. The two packages under a licence on your banned list need replacing, or clearing with your legal team.
The product code is 71,175 lines, about €180,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 19 findings
These 19 critical or serious findings were in the previous survey, on 11 October 2026, and are gone from this one.
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · Medium CVE: [GHSA redacted] REDACTED
Exception handling · Swallowed exception (caught, then discarded) libs/sdk-py/langgraph_sdk/stream/sync_controller.py
Rebuild cost: about €180,000 · Estimate
Cost to rebuild
€60,000 to €300,000, for 1,000 to 3,172 hours of work, about 1.2 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 59. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 71,175 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 6 points · Low effort · ADR Quality
2
Resolve the 2 Banned license finding(s) in License Compliance.
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.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €180,000 to build again, about 1.2 person-years of work. Its weakest lens is Production Readiness, at 52 (Adequate). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.5 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 4% to 8% on every change. The history of the code shows how much it changes: about 29,640 lines over the last 90 days, which is about 120,207 lines a year. At that pace, the extra work comes to an estimated 11.2 to 67.4 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
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.
216 modules, with 136 dependencies between them. Every module uses only modules listed above it, so there are no loops.
The table shows the 40 modules with the most connections; 176 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.
checkpoint.langgraph.cache.base uses checkpoint.langgraph.checkpoint.serde.base, so a change to checkpoint.langgraph.checkpoint.serde.base can break checkpoint.langgraph.cache.base, while a change to checkpoint.langgraph.cache.base can't break checkpoint.langgraph.checkpoint.serde.base.
Position
Below the diagonal: checkpoint.langgraph.cache.base uses a module listed above it, which is the healthy direction.
checkpoint.langgraph.checkpoint.base uses checkpoint.langgraph.checkpoint.serde.base, so a change to checkpoint.langgraph.checkpoint.serde.base can break checkpoint.langgraph.checkpoint.base, while a change to checkpoint.langgraph.checkpoint.base can't break checkpoint.langgraph.checkpoint.serde.base.
Position
Below the diagonal: checkpoint.langgraph.checkpoint.base uses a module listed above it, which is the healthy direction.
checkpoint.langgraph.checkpoint.serde uses checkpoint.langgraph.checkpoint.serde.base, so a change to checkpoint.langgraph.checkpoint.serde.base can break checkpoint.langgraph.checkpoint.serde, while a change to checkpoint.langgraph.checkpoint.serde can't break checkpoint.langgraph.checkpoint.serde.base.
Position
Below the diagonal: checkpoint.langgraph.checkpoint.serde uses a module listed above it, which is the healthy direction.
cli.langgraph_cli.deploy uses cli.langgraph_cli.host_backend, so a change to cli.langgraph_cli.host_backend can break cli.langgraph_cli.deploy, while a change to cli.langgraph_cli.deploy can't break cli.langgraph_cli.host_backend.
Position
Below the diagonal: cli.langgraph_cli.deploy uses a module listed above it, which is the healthy direction.
cli.langgraph_cli.deploy uses cli.langgraph_cli.image_reference, so a change to cli.langgraph_cli.image_reference can break cli.langgraph_cli.deploy, while a change to cli.langgraph_cli.deploy can't break cli.langgraph_cli.image_reference.
Position
Below the diagonal: cli.langgraph_cli.deploy uses a module listed above it, which is the healthy direction.
cli.langgraph_cli.deploy uses cli.langgraph_cli.schemas, so a change to cli.langgraph_cli.schemas can break cli.langgraph_cli.deploy, while a change to cli.langgraph_cli.deploy can't break cli.langgraph_cli.schemas.
Position
Below the diagonal: cli.langgraph_cli.deploy uses a module listed above it, which is the healthy direction.
langgraph.langgraph.errors uses langgraph.langgraph.types, so a change to langgraph.langgraph.types can break langgraph.langgraph.errors, while a change to langgraph.langgraph.errors can't break langgraph.langgraph.types.
Position
Below the diagonal: langgraph.langgraph.errors uses a module listed above it, which is the healthy direction.
langgraph.langgraph.graph uses langgraph.langgraph.channels.base, so a change to langgraph.langgraph.channels.base can break langgraph.langgraph.graph, while a change to langgraph.langgraph.graph can't break langgraph.langgraph.channels.base.
Position
Below the diagonal: langgraph.langgraph.graph uses a module listed above it, which is the healthy direction.
langgraph.langgraph.graph._branch uses langgraph.langgraph._internal._runnable, so a change to langgraph.langgraph._internal._runnable can break langgraph.langgraph.graph._branch, while a change to langgraph.langgraph.graph._branch can't break langgraph.langgraph._internal._runnable.
Position
Below the diagonal: langgraph.langgraph.graph._branch uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel._read uses langgraph.langgraph._internal._runnable, so a change to langgraph.langgraph._internal._runnable can break langgraph.langgraph.pregel._read, while a change to langgraph.langgraph.pregel._read can't break langgraph.langgraph._internal._runnable.
Position
Below the diagonal: langgraph.langgraph.pregel._read uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel.protocol uses langgraph.langgraph.types, so a change to langgraph.langgraph.types can break langgraph.langgraph.pregel.protocol, while a change to langgraph.langgraph.pregel.protocol can't break langgraph.langgraph.types.
Position
Below the diagonal: langgraph.langgraph.pregel.protocol uses a module listed above it, which is the healthy direction.
langgraph.langgraph.stream._mux uses langgraph.langgraph.stream._types, so a change to langgraph.langgraph.stream._types can break langgraph.langgraph.stream._mux, while a change to langgraph.langgraph.stream._mux can't break langgraph.langgraph.stream._types.
Position
Below the diagonal: langgraph.langgraph.stream._mux uses a module listed above it, which is the healthy direction.
sdk-py.langgraph_sdk._async.threads uses sdk-py.langgraph_sdk._async.http, so a change to sdk-py.langgraph_sdk._async.http can break sdk-py.langgraph_sdk._async.threads, while a change to sdk-py.langgraph_sdk._async.threads can't break sdk-py.langgraph_sdk._async.http.
Position
Below the diagonal: sdk-py.langgraph_sdk._async.threads uses a module listed above it, which is the healthy direction.
sdk-py.langgraph_sdk._async.threads uses sdk-py.langgraph_sdk.schema, so a change to sdk-py.langgraph_sdk.schema can break sdk-py.langgraph_sdk._async.threads, while a change to sdk-py.langgraph_sdk._async.threads can't break sdk-py.langgraph_sdk.schema.
Position
Below the diagonal: sdk-py.langgraph_sdk._async.threads uses a module listed above it, which is the healthy direction.
sdk-py.langgraph_sdk._sync.stream uses sdk-py.langgraph_sdk._sync.http, so a change to sdk-py.langgraph_sdk._sync.http can break sdk-py.langgraph_sdk._sync.stream, while a change to sdk-py.langgraph_sdk._sync.stream can't break sdk-py.langgraph_sdk._sync.http.
Position
Below the diagonal: sdk-py.langgraph_sdk._sync.stream uses a module listed above it, which is the healthy direction.
checkpoint.langgraph.checkpoint uses checkpoint.langgraph.checkpoint.serde.base, so a change to checkpoint.langgraph.checkpoint.serde.base can break checkpoint.langgraph.checkpoint, while a change to checkpoint.langgraph.checkpoint can't break checkpoint.langgraph.checkpoint.serde.base.
Position
Below the diagonal: checkpoint.langgraph.checkpoint uses a module listed above it, which is the healthy direction.
checkpoint.langgraph.checkpoint uses checkpoint.langgraph.checkpoint.base, so a change to checkpoint.langgraph.checkpoint.base can break checkpoint.langgraph.checkpoint, while a change to checkpoint.langgraph.checkpoint can't break checkpoint.langgraph.checkpoint.base.
Position
Below the diagonal: checkpoint.langgraph.checkpoint uses a module listed above it, which is the healthy direction.
cli.langgraph_cli uses cli.langgraph_cli.host_backend, so a change to cli.langgraph_cli.host_backend can break cli.langgraph_cli, while a change to cli.langgraph_cli can't break cli.langgraph_cli.host_backend.
Position
Below the diagonal: cli.langgraph_cli uses a module listed above it, which is the healthy direction.
cli.langgraph_cli uses cli.langgraph_cli.image_reference, so a change to cli.langgraph_cli.image_reference can break cli.langgraph_cli, while a change to cli.langgraph_cli can't break cli.langgraph_cli.image_reference.
Position
Below the diagonal: cli.langgraph_cli uses a module listed above it, which is the healthy direction.
cli.langgraph_cli uses cli.langgraph_cli.schemas, so a change to cli.langgraph_cli.schemas can break cli.langgraph_cli, while a change to cli.langgraph_cli can't break cli.langgraph_cli.schemas.
Position
Below the diagonal: cli.langgraph_cli uses a module listed above it, which is the healthy direction.
cli.langgraph_cli uses cli.langgraph_cli.deploy, so a change to cli.langgraph_cli.deploy can break cli.langgraph_cli, while a change to cli.langgraph_cli can't break cli.langgraph_cli.deploy.
Position
Below the diagonal: cli.langgraph_cli uses a module listed above it, which is the healthy direction.
langgraph.langgraph uses langgraph.langgraph.errors, so a change to langgraph.langgraph.errors can break langgraph.langgraph, while a change to langgraph.langgraph can't break langgraph.langgraph.errors.
Position
Below the diagonal: langgraph.langgraph uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel uses langgraph.langgraph._internal._scratchpad, so a change to langgraph.langgraph._internal._scratchpad can break langgraph.langgraph.pregel, while a change to langgraph.langgraph.pregel can't break langgraph.langgraph._internal._scratchpad.
Position
Below the diagonal: langgraph.langgraph.pregel uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel uses langgraph.langgraph.channels.base, so a change to langgraph.langgraph.channels.base can break langgraph.langgraph.pregel, while a change to langgraph.langgraph.pregel can't break langgraph.langgraph.channels.base.
Position
Below the diagonal: langgraph.langgraph.pregel uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel uses langgraph.langgraph.types, so a change to langgraph.langgraph.types can break langgraph.langgraph.pregel, while a change to langgraph.langgraph.pregel can't break langgraph.langgraph.types.
Position
Below the diagonal: langgraph.langgraph.pregel uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel uses langgraph.langgraph.pregel._read, so a change to langgraph.langgraph.pregel._read can break langgraph.langgraph.pregel, while a change to langgraph.langgraph.pregel can't break langgraph.langgraph.pregel._read.
Position
Below the diagonal: langgraph.langgraph.pregel uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel uses langgraph.langgraph.pregel.protocol, so a change to langgraph.langgraph.pregel.protocol can break langgraph.langgraph.pregel, while a change to langgraph.langgraph.pregel can't break langgraph.langgraph.pregel.protocol.
Position
Below the diagonal: langgraph.langgraph.pregel uses a module listed above it, which is the healthy direction.
langgraph.langgraph.stream.run_stream uses langgraph.langgraph.stream._types, so a change to langgraph.langgraph.stream._types can break langgraph.langgraph.stream.run_stream, while a change to langgraph.langgraph.stream.run_stream can't break langgraph.langgraph.stream._types.
Position
Below the diagonal: langgraph.langgraph.stream.run_stream uses a module listed above it, which is the healthy direction.
langgraph.langgraph.stream.run_stream uses langgraph.langgraph.stream._mux, so a change to langgraph.langgraph.stream._mux can break langgraph.langgraph.stream.run_stream, while a change to langgraph.langgraph.stream.run_stream can't break langgraph.langgraph.stream._mux.
Position
Below the diagonal: langgraph.langgraph.stream.run_stream uses a module listed above it, which is the healthy direction.
sdk-py.langgraph_sdk._sync.threads uses sdk-py.langgraph_sdk._sync.http, so a change to sdk-py.langgraph_sdk._sync.http can break sdk-py.langgraph_sdk._sync.threads, while a change to sdk-py.langgraph_sdk._sync.threads can't break sdk-py.langgraph_sdk._sync.http.
Position
Below the diagonal: sdk-py.langgraph_sdk._sync.threads uses a module listed above it, which is the healthy direction.
sdk-py.langgraph_sdk._sync.threads uses sdk-py.langgraph_sdk.schema, so a change to sdk-py.langgraph_sdk.schema can break sdk-py.langgraph_sdk._sync.threads, while a change to sdk-py.langgraph_sdk._sync.threads can't break sdk-py.langgraph_sdk.schema.
Position
Below the diagonal: sdk-py.langgraph_sdk._sync.threads uses a module listed above it, which is the healthy direction.
sdk-py.langgraph_sdk._sync.threads uses sdk-py.langgraph_sdk._sync.stream, so a change to sdk-py.langgraph_sdk._sync.stream can break sdk-py.langgraph_sdk._sync.threads, while a change to sdk-py.langgraph_sdk._sync.threads can't break sdk-py.langgraph_sdk._sync.stream.
Position
Below the diagonal: sdk-py.langgraph_sdk._sync.threads uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel.main uses langgraph.langgraph.types, so a change to langgraph.langgraph.types can break langgraph.langgraph.pregel.main, while a change to langgraph.langgraph.pregel.main can't break langgraph.langgraph.types.
Position
Below the diagonal: langgraph.langgraph.pregel.main uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel.main uses langgraph.langgraph.pregel._read, so a change to langgraph.langgraph.pregel._read can break langgraph.langgraph.pregel.main, while a change to langgraph.langgraph.pregel.main can't break langgraph.langgraph.pregel._read.
Position
Below the diagonal: langgraph.langgraph.pregel.main uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel.main uses langgraph.langgraph.pregel.protocol, so a change to langgraph.langgraph.pregel.protocol can break langgraph.langgraph.pregel.main, while a change to langgraph.langgraph.pregel.main can't break langgraph.langgraph.pregel.protocol.
Position
Below the diagonal: langgraph.langgraph.pregel.main uses a module listed above it, which is the healthy direction.
langgraph.langgraph.pregel.main uses langgraph.langgraph.stream.run_stream, so a change to langgraph.langgraph.stream.run_stream can break langgraph.langgraph.pregel.main, while a change to langgraph.langgraph.pregel.main can't break langgraph.langgraph.stream.run_stream.
Position
Below the diagonal: langgraph.langgraph.pregel.main uses a module listed above it, which is the healthy direction.
langgraph.langgraph.graph.state uses langgraph.langgraph.graph._branch, so a change to langgraph.langgraph.graph._branch can break langgraph.langgraph.graph.state, while a change to langgraph.langgraph.graph.state can't break langgraph.langgraph.graph._branch.
Position
Below the diagonal: langgraph.langgraph.graph.state uses a module listed above it, which is the healthy direction.
langgraph.langgraph.graph.state uses langgraph.langgraph.pregel.main, so a change to langgraph.langgraph.pregel.main can break langgraph.langgraph.graph.state, while a change to langgraph.langgraph.graph.state can't break langgraph.langgraph.pregel.main.
Position
Below the diagonal: langgraph.langgraph.graph.state uses a module listed above it, which is the healthy direction.
langgraph.bench uses langgraph.langgraph.pregel.main, so a change to langgraph.langgraph.pregel.main can break langgraph.bench, while a change to langgraph.bench can't break langgraph.langgraph.pregel.main.
Position
Below the diagonal: langgraph.bench uses a module listed above it, which is the healthy direction.
langgraph.bench uses langgraph.langgraph.graph.state, so a change to langgraph.langgraph.graph.state can break langgraph.bench, while a change to langgraph.bench can't break langgraph.langgraph.graph.state.
Position
Below the diagonal: langgraph.bench uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 68% · Adequate · gated by D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
28
High / Critical
A03:2025 — Software Supply Chain Failures
19
High / Critical
A02:2025 — Security Misconfiguration
5
Medium
A07:2025 — Authentication Failures
2
High / Critical
Roadmap
First, resolve the missing architecture decision records and the two banned license findings to ensure proper documentation and compliance. Next, integrate a static analysis security check into the continuous integration pipeline to prevent security regressions from being merged. Finally, harden all outbound HTTP calls by adding timeouts, retry logic, and circuit breakers to improve system resilience against failures.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Add a 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.
Pass `timeout=` on every `requests`/`httpx` call (requests has no default and will wait forever), mount an `HTTPAdapter(max_retries=Retry(...))` on shared sessions, and wrap calls to flaky dependencies in `tenacity` retries or a `pybreaker` circuit breaker.
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 — 32
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 — 616
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 — 104
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 19
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 68 of 68 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 68 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 730 of 752 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 2 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 239 test source file(s) (.py) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability not scored — the JavaScript/TypeScript suite (jest via `yarn install --frozen-lockfile --ignore-scripts` in libs/cli/js-examples/ (0 tests)) ran but surfaced no test cases to the runner, so flakiness couldn't be exercised.
D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 22 shipped Python distribution(s) were read, but the outdated signal needs pypi.org, and no declaration here carries an exact pin to ask about — a floor or a range installs the newest release it admits and cannot be behind one, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (REDACTED). compose up failed (exit 18 — an image could not be pulled) — redis Pulling api Pulling postgres Pulling postgres Error Get "https://registry-1.docker.io/v2/": Forbidden redis Error context canceled api Warning context canceled Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the earlier `compose pull` step reported: postgres Pulling redis Pulling postgres Error Get "https://registry-1.docker.io/v2/": Forbidden api Warning Get "https://registry-1.docker.io/v2/": Forbidden redis Error Get "https://registry-1.docker.io/v2/": Forbidden WARNING: Some service image(s) must be built from source by running: docker compose build api Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; runtime evidence skipped.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'aiosqlite' is imported (libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:11), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'aiosqlite' is imported (libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:11), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'aiosqlite' is imported (libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:11), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). 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.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
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.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned 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 REDACTED (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: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
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.
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.
+ 81 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 15 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with config.validate_config (cyclomatic 64), PregelLoop._first (cyclomatic 63), _draw.draw_graph (cyclomatic 54). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 15 together lifts Cyclomatic Complexity from 5.6 to about 6.9/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 179 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 14 bodies over 60 down to 60 or less in Cognitive Complexity — start with _draw.draw_graph (cognitive 131), CompiledStateGraph._migrate_checkpoint (cognitive 108), config.validate_config (cognitive 104). — 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 14 together lifts Cognitive Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.5 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 22 FileTooLong finding(s) in God Classes — start with stream.py (2), base.py (2), runs.py (2). — One of this dimension's main actionable groups (22 warning-level).
Resolve the 4 TooManyMethods finding(s) in God Classes — start with stream.py (2), main.py, remote.py. — One of this dimension's main actionable groups (4 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
221 duplicated block group(s) detected. A further 12 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 9 of the 233 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 109 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 11 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with REDACTED (2), stream.py (2), aio.py. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 10 Duplicated block (14 lines × 2) finding(s) in Code Duplication — start with aio.py (2), base.py (2), stream.py (2). — One of this dimension's main actionable groups (10 warning-level).
Resolve the 10 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with _runnable.py (2), aio.py, REDACTED. — One of this dimension's main actionable groups (10 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling7.3 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
3 production modules (Python), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 1 module(s) off the main sequence.
Off the main sequence: langgraph-sdk
What to do
Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution9.9 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
3052 test methods: 2963 unit, 55 integration, 0 BDD, 34 e2e. The JavaScript/TypeScript suite contributes 2 `it`/`test` case(s) across 2 test file(s) declaring at least one; its tier split is read from package names and paths only. The Python suite contributes 3050 test function(s) across 182 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 2 tests. Measured on the JavaScript/TypeScript suite only — at least 239 test source file(s) (.py) went unread, so its test quality is unmeasured and is not in these counts.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
2 of 54 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 22 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (32 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. 2 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged. This repository publishes itself under MIT, which is its own choice and is not judged here.
Banned license: psycopg · ×2
What to do
Resolve the 2 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (2 issue-level).
Enforce License Compliance in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d14_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: libs/langgraph/langgraph/pregel/_loop.py (15×63=945); libs/langgraph/langgraph/pregel/main.py (13×48=624); REDACTED (14×30=420) Repeated repair below the complexity floor: libs/langgraph/langgraph/pregel/_checkpoint.py (11 of 11 changes were fixes); libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py (3 of 5 changes were fixes); libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py (3 of 4 changes were fixes)
Resolve the 6 Hotspot finding(s) in Churn × Complexity Hotspots — start with _loop.py, main.py, REDACTED. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 5 Repeated repair finding(s) in Churn × Complexity Hotspots — start with REDACTED (2), _checkpoint.py, base.py. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.7 / 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.
20 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is libs/langgraph/langgraph/stream/run_stream.py. Counted over 151 of the 227 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
Further sole-owners (lower concentration)
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) 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.
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.
11 deducted task-comment markers across 71175 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 10 TodoComment finding(s) in Explicit Debt — start with test_algo.py, test_channels.py, test_large_cases.py. — One of this dimension's main actionable groups (10 warning-level).
Resolve the 1 HackComment finding(s) in Explicit Debt — start with agent.py. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: 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.
1 of 1 documentation facets pass in full. 11 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
2 of 9 build units (Make, Python) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
28 finding(s): 0 critical, 20 high, 5 medium, 3 low. 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
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 7 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (7). — One of this dimension's main actionable groups (7 issue-level).
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED. — One of this dimension's main actionable groups (6 issue-level).
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5). — One of this dimension's main actionable groups (5 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 9 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (6), REDACTED (3). — One of this dimension's main actionable groups (9 issue-level).
Resolve the 4 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (4). — One of this dimension's main actionable groups (4 warning-level).
Resolve the 1 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 4 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (4 warning-level).
Resolve the 1 Low IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
33 of 151 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is libs/langgraph/langgraph/callbacks.py. Counted over 151 of the 227 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 33 Orphaned file finding(s) in Knowledge Freshness — start with REDACTED (3), callbacks.py, pydantic_state.py. — One of this dimension's main actionable groups (33 recommendation-level).
Resolve the 1 Orphaned files with no living knowledge finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Change coupling finding(s) in Change Coupling — start with client.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.
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.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 0 platform declaration(s) and 22 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.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 15 of 24 project(s) that lack one — worth up to 1.3 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it all sits under libs/ alongside the root build files, so the conventional src/ boundary between the product and its tooling isn't drawn.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability6.1 / 10Adequate✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 5/7 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `libs/cli`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Consider OpenTelemetry tracing/metrics (opentelemetry-sdk) and a health-check endpoint (a /health route) for operability.
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 98960 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Dependabot is configured but does not watch `pip` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.
Do you agree with this assessment?
P6 · Release Hygiene8.0 / 10Strong✓ 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.
The changelog this check read carries 1 versioned entry, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
What to do
Keep the changelog current — add a versioned entry (Keep-a-Changelog ## [x.y.z]) for each release so the history isn't a stub.
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
`urllib.request.urlopen(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — REDACTED:81
`request.urlopen(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — REDACTED:104
What to do
Pass `timeout=` on every `requests`/`httpx` call (requests has no default and will wait forever), mount an `HTTPAdapter(max_retries=Retry(...))` on shared sessions, and wrap calls to flaky dependencies in `tenacity` retries or a `pybreaker` circuit breaker.
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.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
R1 · Type Safety10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
libs/cli/js-examples/src/agent/graph.ts:64 · libs/cli/js-monorepo-example/apps/agent/src/graph.ts:23 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — libs/cli/js-examples/src/agent/graph.ts:64
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
Do you agree with this assessment?
R3 · Large Files10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
Do you agree with this assessment?
R4 · Test Coverage4.0 / 10Weak✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×3) — libs/cli/js-monorepo-example/apps/agent/src/graph.ts:1, libs/cli/js-monorepo-example/apps/agent/src/state.ts:1, libs/cli/js-monorepo-example/libs/shared/src/index.ts:1
What to do
Add tests that import the unreached modules (directly or through their public entry).
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Declared in libs/cli/js-monorepo-example/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2)
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception. — libs/sdk-py/langgraph_sdk/_async/stream.py:1774
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document4.0 / 10Weak✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`get_field_default` is public, takes a document from its caller (line 79) and hands it to `_is_optional_type`, which calls itself at line 21 (`_is_optional_type`) with a piece of `type_` (and at line 30, line 33, line 36) — and nowhere in `_is_optional_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_is_optional_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — libs/langgraph/langgraph/_internal/_fields.py:21
`get_field_default` is public, takes a document from its caller (line 79) and hands it to `_is_required_type`, which calls itself at line 55 (`_is_required_type`) with a piece of `type_` — and nowhere in `_is_required_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_is_required_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — libs/langgraph/langgraph/_internal/_fields.py:55
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`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. (×19) — libs/sdk-py/langgraph_sdk/errors.py:161, libs/sdk-py/langgraph_sdk/errors.py:170, libs/sdk-py/langgraph_sdk/errors.py:177, …
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. (×14) — libs/sdk-py/langgraph_sdk/_sync/stream.py:609, libs/sdk-py/langgraph_sdk/_sync/stream.py:914, libs/sdk-py/langgraph_sdk/_sync/stream.py:1017, …
An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `__del__()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch. — libs/checkpoint-sqlite/langgraph/cache/sqlite/__init__.py:119
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`error` at line 220 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — libs/sdk-py/langgraph_sdk/errors.py:220
`error` at line 230 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — libs/sdk-py/langgraph_sdk/errors.py:230
`error` at line 165 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. (×2) — libs/sdk-py/langgraph_sdk/_sync/http.py:165, libs/sdk-py/langgraph_sdk/_async/http.py:165
`info` at line 677 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/langgraph/langgraph/pregel/_retry.py:677
`info` at line 826 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/langgraph/langgraph/pregel/_retry.py:826
`info` at line 283 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:283
`info` at line 299 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:299
`warning` at line 540 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:540
`error` at line 573 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:573
`debug` at line 592 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:592
`debug` at line 593 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:593
`info` at line 1174 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1174
`info` at line 1187 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1187
`warning` at line 1395 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1395
`error` at line 1426 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1426
`info` at line 330 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-postgres/langgraph/store/postgres/aio.py:330
`info` at line 346 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-postgres/langgraph/store/postgres/aio.py:346
`warning` at line 636 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-postgres/langgraph/store/postgres/base.py:636
`info` at line 878 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-postgres/langgraph/store/postgres/base.py:878
`info` at line 891 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-postgres/langgraph/store/postgres/base.py:891
`error` at line 1147 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — libs/checkpoint-postgres/langgraph/store/postgres/base.py:1147
`error` at line 705 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:705
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 3 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 4 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: this repository stores data through 'aiosqlite' (libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:11) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and MongoEngine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
C4 Data Retention — Not assessed: this repository stores data through 'aiosqlite' (libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:11) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, SQL schemas). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
C5 Data-Subject Rights — Not assessed: this repository stores data through 'aiosqlite' (libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:11) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 58 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's JavaScript 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; 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; this repository's TypeScript 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
AX6 Interface segregation — no exported interface declares behaviour
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 — compose up failed (exit 18 — an image could not be pulled) — redis Pulling api Pulling postgres Pulling postgres Error Get "https://registry-1.docker.io/v2/": Forbidden redis Error context canceled api Warning context canceled Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the earlier `compose pull` step reported: postgres Pulling redis Pulling postgres Error Get "https://registry-1.docker.io/v2/": Forbidden api Warning Get "https://registry-1.docker.io/v2/": Forbidden redis Error Get "https://registry-1.docker.io/v2/": Forbidden WARNING: Some service image(s) must be built from source by running: docker compose build api Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; 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.
D11 Test Reliability — No tests discovered
D12 Dependency Hygiene — Not scored — 22 shipped Python distribution(s) were read, but the outdated signal needs pypi.org, and no declaration here carries an exact pin to ask about — a floor or a range installs the newest release it admits and cannot be behind one, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
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.
D21 Naming Consistency — Naming consistency is measured on C# only; Python, TypeScript not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Python, TypeScript surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .ts, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.py), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
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.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the jest suite in libs/cli/js-examples/ ran and not one test passed (FAIL tests/graph.int.test.ts), so the coverage would describe the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (105 value object(s))
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF2 Allocation hygiene — Not applicable: Python runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R5 Dependency Freshness — uses a yarn lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
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.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
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
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
Banned license: psycopg — `psycopg` 3.3.6 is published on PyPI under `LGPL-3.0-only`, which this policy bans, and it is in the SHIPPED closure of this repository — so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception.
Banned license: psycopg-pool — `psycopg-pool` 3.3.3 is published on PyPI under `LGPL-3.0-only`, which this policy bans, and it is in the SHIPPED closure of this repository — so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception.
FileTooLong: pregel/main.py libs/langgraph/langgraph/pregel/main.py— FileTooLong — 3002 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2502 over it, 6.00× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 2186 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1686 over it, 4.37× 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: pregel/_loop.py libs/langgraph/langgraph/pregel/_loop.py— FileTooLong — 1529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1029 over it, 3.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: _async/stream.py libs/sdk-py/langgraph_sdk/_async/stream.py— FileTooLong — 1390 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 890 over it, 2.78× 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: langgraph_cli/config.py libs/cli/langgraph_cli/config.py— FileTooLong — 1344 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 844 over it, 2.69× 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: _sync/stream.py libs/sdk-py/langgraph_sdk/_sync/stream.py— FileTooLong — 1235 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 735 over it, 2.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: graph/state.py libs/langgraph/langgraph/graph/state.py— FileTooLong — 1135 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 635 over it, 2.27× 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 — 1124 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 624 over it, 2.25× 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: pregel/remote.py libs/langgraph/langgraph/pregel/remote.py— FileTooLong — 896 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 396 over it, 1.79× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: prebuilt/tool_node.py libs/prebuilt/langgraph/prebuilt/tool_node.py— FileTooLong — 876 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 376 over it, 1.75× 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: langgraph_cli/uv_lock.py libs/cli/langgraph_cli/uv_lock.py— FileTooLong — 823 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 323 over it, 1.65× 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: pregel/_runner.py libs/langgraph/langgraph/pregel/_runner.py— FileTooLong — 753 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 253 over it, 1.51× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: _internal/_runnable.py libs/langgraph/langgraph/_internal/_runnable.py— FileTooLong — 682 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 182 over it, 1.36× 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: sqlite/base.py libs/checkpoint-sqlite/langgraph/store/sqlite/base.py— FileTooLong — 680 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 180 over it, 1.36× 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 — 650 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 150 over it, 1.30× 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: postgres/base.py libs/checkpoint-postgres/langgraph/store/postgres/base.py— FileTooLong — 642 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 142 over it, 1.28× 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: _async/runs.py libs/sdk-py/langgraph_sdk/_async/runs.py— FileTooLong — 642 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 142 over it, 1.28× 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: _sync/runs.py libs/sdk-py/langgraph_sdk/_sync/runs.py— FileTooLong — 632 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 132 over it, 1.26× 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: langgraph_cli/cli.py libs/cli/langgraph_cli/cli.py— 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: stream/transformers.py libs/langgraph/langgraph/stream/transformers.py— FileTooLong — 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 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: prebuilt/chat_agent_executor.py libs/prebuilt/langgraph/prebuilt/chat_agent_executor.py— FileTooLong — 569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 69 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: pregel/_retry.py libs/langgraph/langgraph/pregel/_retry.py— FileTooLong — 565 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 65 over it, 1.13× 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.
Swallowed exception (caught, then discarded) libs/sdk-py/langgraph_sdk/errors.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) libs/sdk-py/langgraph_sdk/errors.py:170— `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) libs/sdk-py/langgraph_sdk/errors.py:177— `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) libs/sdk-py/langgraph_sdk/errors.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) libs/sdk-py/langgraph_sdk/_sync/stream.py:1447— `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) libs/langgraph/langgraph/pregel/_read.py:192— `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) libs/langgraph/langgraph/channels/binop.py:92— `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) libs/langgraph/langgraph/_internal/_serde.py:224— `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) libs/langgraph/langgraph/_internal/_serde.py:235— `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) libs/cli/langgraph_cli/config.py:1325— `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) libs/cli/langgraph_cli/docker.py:96— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:90— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:766— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:792— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:805— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:816— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:827— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:851— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:864— `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 (empty catch) libs/sdk-py/langgraph_sdk/_sync/stream.py:609— 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) libs/sdk-py/langgraph_sdk/_sync/stream.py:914— 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) libs/sdk-py/langgraph_sdk/_sync/stream.py:1017— 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) libs/langgraph/langgraph/stream/_mux.py:340— 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) libs/langgraph/langgraph/stream/_mux.py:443— 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) libs/langgraph/langgraph/stream/run_stream.py:203— 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) libs/langgraph/langgraph/stream/run_stream.py:207— 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) libs/langgraph/langgraph/stream/run_stream.py:557— 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) libs/langgraph/langgraph/stream/run_stream.py:565— 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) libs/langgraph/langgraph/stream/run_stream.py:569— 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) libs/langgraph/langgraph/pregel/_call.py:79— 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) libs/langgraph/langgraph/pregel/_executor.py:85— 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) libs/langgraph/langgraph/graph/_branch.py:115— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:1492— 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) libs/checkpoint-sqlite/langgraph/cache/sqlite/__init__.py:119— An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `__del__()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch.
Duplicated block (7 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:542— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:542-548 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:540-546 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:472— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:472-478 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:654-660 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1387— libs/checkpoint-postgres/langgraph/store/postgres/base.py:1387-1393 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:258-264 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7 lines × 2) libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:544— libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:544-550 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:658-664 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) REDACTED:663— REDACTED:663-672 | REDACTED:692-698 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7 lines × 2) libs/langgraph/langgraph/channels/binop.py:83— libs/langgraph/langgraph/channels/binop.py:83-89 | libs/langgraph/langgraph/channels/delta.py:85-91 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) libs/langgraph/langgraph/stream/run_stream.py:124— libs/langgraph/langgraph/stream/run_stream.py:124-130 | libs/langgraph/langgraph/stream/run_stream.py:424-430 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) libs/sdk-py/langgraph_sdk/_async/http.py:162— libs/sdk-py/langgraph_sdk/_async/http.py:162-168 | libs/sdk-py/langgraph_sdk/_sync/http.py:162-168 — `libs/sdk-py/langgraph_sdk/_async/http.py` and `libs/sdk-py/langgraph_sdk/_sync/http.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 82 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (7 lines × 2) libs/sdk-py/langgraph_sdk/_async/runs.py:591— libs/sdk-py/langgraph_sdk/_async/runs.py:591-597 | libs/sdk-py/langgraph_sdk/_sync/runs.py:586-592 — `libs/sdk-py/langgraph_sdk/_async/runs.py` and `libs/sdk-py/langgraph_sdk/_sync/runs.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 204 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/runs.py:591` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:645— libs/sdk-py/langgraph_sdk/_async/stream.py:645-651 | libs/sdk-py/langgraph_sdk/_sync/stream.py:712-718 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 `handle` to `ScopedStreamHandle` in one and `SyncScopedStreamHandle` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1061— libs/sdk-py/langgraph_sdk/_async/stream.py:1061-1067 | libs/sdk-py/langgraph_sdk/_sync/stream.py:562-568 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/stream.py:1061` 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.
TodoComment libs/langgraph/tests/test_algo.py:44— # TODO: add more 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.
TodoComment libs/langgraph/tests/test_channels.py:394— # TODO(delta-channel-cadence): the previous "snapshot fires even when channel — 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 libs/langgraph/tests/test_large_cases.py:6426— # TODO add here test with invoke(Command()) — 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 libs/langgraph/tests/test_remote_graph.py:1451— # TODO: Fix the namespace matching in the next api release. — 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 libs/langgraph/langgraph/runtime.py:306— # TODO: in an ideal world, we would have a context manager for — 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 libs/langgraph/langgraph/pregel/_loop.py:1241— # TODO: replace with an explicit `exiting: bool = False` parameter. — 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 libs/langgraph/langgraph/graph/_node.py:73— # TODO: we probably don't want to explicitly support the config / store signatures once — 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 libs/checkpoint-postgres/tests/test_store.py:868— # TODO: We don't currently fill in additional results if there are not enough — 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 libs/checkpoint/tests/test_memory.py:155— # TODO: test before and limit params — 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 examples/chatbot-simulation-evaluation/simulation_utils.py:197— # TODO support other stop criteria — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Duplicated block (14 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:204— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:204-217 | libs/checkpoint-postgres/langgraph/store/postgres/base.py:812-825 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/store/postgres/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 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 `libs/checkpoint-postgres/langgraph/store/postgres/aio.py:204` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:729— libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:729-742 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:953-966 — 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 `libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:729` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) libs/langgraph/langgraph/_internal/_runnable.py:789— libs/langgraph/langgraph/_internal/_runnable.py:789-802 | libs/langgraph/langgraph/_internal/_runnable.py:854-867 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `libs/langgraph/langgraph/_internal/_runnable.py:868` calls `AsyncExitStack` and `libs/langgraph/langgraph/_internal/_runnable.py:807` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (14 lines × 2) libs/langgraph/langgraph/pregel/_runner.py:292— libs/langgraph/langgraph/pregel/_runner.py:292-305 | libs/langgraph/langgraph/pregel/_runner.py:491-504 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `None` to `GraphBubbleUp) and self._should_route_to_error_handler(t) and self.schedule_error_handler is not` in one and `GraphBubbleUp) and self._should_route_to_error_handler(t) and self.aschedule_error_handler is not` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (14 lines × 2) libs/langgraph/langgraph/pregel/main.py:3093— libs/langgraph/langgraph/pregel/main.py:3093-3106 | libs/langgraph/langgraph/pregel/main.py:3572-3585 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1979— libs/sdk-py/langgraph_sdk/_async/stream.py:1979-1992 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1644-1657 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (14 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:775— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:775-788 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:290-308 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1338— libs/checkpoint-postgres/langgraph/store/postgres/base.py:1338-1357 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:215-228 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (14 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1418— libs/sdk-py/langgraph_sdk/_async/stream.py:1418-1431 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1289-1302 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (14 lines × 2) libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py:140— libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py:140-153 | libs/sdk-py/langgraph_sdk/stream/transport/ws.py:210-223 — before extracting anything, compare `libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py` and `libs/sdk-py/langgraph_sdk/stream/transport/ws.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `client` to `httpx.Client` in one and `httpx.AsyncClient` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (11 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:56— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:56-66 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:557-567 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) REDACTED:718— REDACTED:718-728 | REDACTED:738-748 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) libs/checkpoint/langgraph/store/base/embed.py:362— libs/checkpoint/langgraph/store/base/embed.py:362-372 | libs/checkpoint/langgraph/store/base/embed.py:379-389 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) libs/langgraph/langgraph/_internal/_runnable.py:677— libs/langgraph/langgraph/_internal/_runnable.py:677-687 | libs/langgraph/langgraph/_internal/_runnable.py:777-787 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) libs/langgraph/langgraph/_internal/_runnable.py:724— libs/langgraph/langgraph/_internal/_runnable.py:724-734 | libs/langgraph/langgraph/_internal/_runnable.py:837-847 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) libs/langgraph/langgraph/channels/named_barrier_value.py:57— libs/langgraph/langgraph/channels/named_barrier_value.py:57-67 | libs/langgraph/langgraph/channels/named_barrier_value.py:135-145 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (11 lines × 2) libs/langgraph/langgraph/pregel/remote.py:792— libs/langgraph/langgraph/pregel/remote.py:792-802 | libs/langgraph/langgraph/pregel/remote.py:942-952 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) libs/langgraph/langgraph/stream/run_stream.py:148— libs/langgraph/langgraph/stream/run_stream.py:148-158 | libs/langgraph/langgraph/stream/run_stream.py:441-451 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) libs/sdk-py/langgraph_sdk/_sync/stream.py:371— libs/sdk-py/langgraph_sdk/_sync/stream.py:371-381 | libs/sdk-py/langgraph_sdk/_sync/stream.py:579-589 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) libs/langgraph/bench/pydantic_state.py:145— libs/langgraph/bench/pydantic_state.py:145-155 | libs/langgraph/bench/pydantic_state.py:157-167 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:456— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:456-464 | libs/checkpoint-postgres/langgraph/store/postgres/base.py:1025-1033 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/store/postgres/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1397— libs/checkpoint-postgres/langgraph/store/postgres/base.py:1397-1405 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:194-202 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `content` to `bytes | orjson.Fragment` in one and `bytes | str | orjson.Fragment` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (9 lines × 2) libs/langgraph/langgraph/pregel/_runner.py:756— libs/langgraph/langgraph/pregel/_runner.py:756-764 | libs/langgraph/langgraph/pregel/_runner.py:903-911 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) libs/langgraph/langgraph/pregel/main.py:4304— libs/langgraph/langgraph/pregel/main.py:4304-4312 | libs/langgraph/langgraph/pregel/main.py:4338-4346 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:710— libs/sdk-py/langgraph_sdk/_async/stream.py:710-718 | libs/sdk-py/langgraph_sdk/_async/stream.py:769-777 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:951— libs/sdk-py/langgraph_sdk/_async/stream.py:951-959 | libs/sdk-py/langgraph_sdk/_sync/stream.py:995-1003 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) libs/sdk-py/langgraph_sdk/_async/threads.py:597— libs/sdk-py/langgraph_sdk/_async/threads.py:597-605 | libs/sdk-py/langgraph_sdk/_sync/threads.py:587-595 — `libs/sdk-py/langgraph_sdk/_async/threads.py` and `libs/sdk-py/langgraph_sdk/_sync/threads.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 216 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/threads.py:597` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) libs/sdk-py/langgraph_sdk/stream/transport/http.py:51— libs/sdk-py/langgraph_sdk/stream/transport/http.py:51-59 | libs/sdk-py/langgraph_sdk/stream/transport/sync_http.py:33-41 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:673— libs/sdk-py/langgraph_sdk/_async/stream.py:673-681 | libs/sdk-py/langgraph_sdk/_sync/stream.py:740-748 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (9 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1334— libs/sdk-py/langgraph_sdk/_async/stream.py:1334-1342 | libs/sdk-py/langgraph_sdk/stream/controller.py:183-191 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `libs/sdk-py/langgraph_sdk/stream/controller.py:176` calls `gather` and `libs/sdk-py/langgraph_sdk/_async/stream.py:1331` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) libs/cli/langgraph_cli/progress.py:29— libs/cli/langgraph_cli/progress.py:29-38 | libs/cli/langgraph_cli/progress.py:60-69 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) libs/langgraph/langgraph/_internal/_runnable.py:879— libs/langgraph/langgraph/_internal/_runnable.py:879-888 | libs/langgraph/langgraph/_internal/_runnable.py:913-922 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) libs/langgraph/langgraph/pregel/remote.py:536— libs/langgraph/langgraph/pregel/remote.py:536-545 | libs/langgraph/langgraph/pregel/remote.py:577-586 — 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 `libs/langgraph/langgraph/pregel/remote.py:536` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) libs/langgraph/langgraph/pregel/remote.py:1052— libs/langgraph/langgraph/pregel/remote.py:1052-1061 | libs/langgraph/langgraph/pregel/remote.py:1104-1113 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:186— libs/sdk-py/langgraph_sdk/_async/stream.py:186-195 | libs/sdk-py/langgraph_sdk/_sync/stream.py:230-239 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (10 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1099— libs/sdk-py/langgraph_sdk/_async/stream.py:1099-1108 | libs/sdk-py/langgraph_sdk/_sync/stream.py:611-620 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (10 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1459— libs/sdk-py/langgraph_sdk/_async/stream.py:1459-1468 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1328-1337 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (10 lines × 2) libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py:38— libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py:38-47 | libs/sdk-py/langgraph_sdk/stream/transport/ws.py:41-50 — before extracting anything, compare `libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py` and `libs/sdk-py/langgraph_sdk/stream/transport/ws.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) libs/langgraph/bench/pydantic_state.py:175— libs/langgraph/bench/pydantic_state.py:175-184 | libs/langgraph/bench/pydantic_state.py:198-207 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:422— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:422-443 | libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:377-398 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `libs/checkpoint-postgres/langgraph/store/postgres/aio.py:422` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (22 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1458— libs/checkpoint-postgres/langgraph/store/postgres/base.py:1458-1479 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1492-1513 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `index_config` to `PostgresIndexConfig` in one and `SqliteIndexConfig` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (22 lines × 2) libs/langgraph/langgraph/graph/state.py:1647— libs/langgraph/langgraph/graph/state.py:1647-1668 | libs/langgraph/langgraph/graph/state.py:1675-1696 — 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 (22 lines × 2) libs/langgraph/langgraph/pregel/_loop.py:1671— libs/langgraph/langgraph/pregel/_loop.py:1671-1692 | libs/langgraph/langgraph/pregel/_loop.py:1927-1948 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22 lines × 2) libs/langgraph/langgraph/pregel/_runner.py:239— libs/langgraph/langgraph/pregel/_runner.py:239-260 | libs/langgraph/langgraph/pregel/_runner.py:430-451 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `None` to `GraphBubbleUp) and self._should_route_to_error_handler(t) and self.schedule_error_handler is not` in one and `GraphBubbleUp) and self._should_route_to_error_handler(t) and self.aschedule_error_handler is not` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (22 lines × 2) libs/langgraph/langgraph/pregel/remote.py:1181— libs/langgraph/langgraph/pregel/remote.py:1181-1202 | libs/langgraph/langgraph/pregel/remote.py:1263-1284 — 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 `libs/langgraph/langgraph/pregel/remote.py:1181` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (22 lines × 2) libs/sdk-py/langgraph_sdk/stream/transport/http.py:159— libs/sdk-py/langgraph_sdk/stream/transport/http.py:159-180 | libs/sdk-py/langgraph_sdk/stream/transport/ws.py:141-162 — before extracting anything, compare `libs/sdk-py/langgraph_sdk/stream/transport/http.py` and `libs/sdk-py/langgraph_sdk/stream/transport/ws.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:319— libs/checkpoint-postgres/langgraph/store/postgres/base.py:319-337 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:347-365 — 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 (19 lines × 2) libs/checkpoint/langgraph/checkpoint/base/__init__.py:660— libs/checkpoint/langgraph/checkpoint/base/__init__.py:660-678 | libs/checkpoint/langgraph/checkpoint/base/__init__.py:701-719 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19 lines × 2) libs/langgraph/langgraph/pregel/main.py:2866— libs/langgraph/langgraph/pregel/main.py:2866-2884 | libs/langgraph/langgraph/pregel/main.py:3277-3295 — 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 (19 lines × 2) libs/langgraph/langgraph/pregel/main.py:2993— libs/langgraph/langgraph/pregel/main.py:2993-3011 | libs/langgraph/langgraph/pregel/main.py:3445-3463 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `loop` to `SyncPregelLoop` in one and `AsyncPregelLoop` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (19 lines × 2) libs/prebuilt/langgraph/prebuilt/tool_node.py:807— libs/prebuilt/langgraph/prebuilt/tool_node.py:807-825 | libs/prebuilt/langgraph/prebuilt/tool_node.py:842-860 — 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 (19 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:120— libs/sdk-py/langgraph_sdk/_async/stream.py:120-138 | libs/sdk-py/langgraph_sdk/stream/sync_controller.py:33-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:790— libs/sdk-py/langgraph_sdk/_async/stream.py:790-808 | libs/sdk-py/langgraph_sdk/_sync/stream.py:863-881 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/stream.py:790` 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.
Hotspot: libs/langgraph/langgraph/pregel/_loop.py libs/langgraph/langgraph/pregel/_loop.py:915— libs/langgraph/langgraph/pregel/_loop.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in PregelLoop._first at line 915. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/langgraph/langgraph/pregel/_loop.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: libs/langgraph/langgraph/pregel/main.py libs/langgraph/langgraph/pregel/main.py:3154— libs/langgraph/langgraph/pregel/main.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in Pregel.astream at line 3154. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/langgraph/langgraph/pregel/main.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:2399— REDACTED changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in deploy._deploy_cmd at line 2399. 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/cli/langgraph_cli/config.py libs/cli/langgraph_cli/config.py:384— libs/cli/langgraph_cli/config.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in config.validate_config at line 384. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/cli/langgraph_cli/config.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/cli/langgraph_cli/uv_lock.py libs/cli/langgraph_cli/uv_lock.py:868— libs/cli/langgraph_cli/uv_lock.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in uv_lock.python_config_to_docker_uv_lock at line 868. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/cli/langgraph_cli/uv_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:152— REDACTED changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in InMemorySaver.get_delta_channel_history at line 152. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Duplicated block (17 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:77— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:77-93 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:578-594 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) libs/prebuilt/langgraph/prebuilt/tool_node.py:1072— libs/prebuilt/langgraph/prebuilt/tool_node.py:1072-1088 | libs/prebuilt/langgraph/prebuilt/tool_node.py:1240-1256 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `libs/prebuilt/langgraph/prebuilt/tool_node.py:1237` calls `_awrap_tool_call`, `cast` and `libs/prebuilt/langgraph/prebuilt/tool_node.py:1071` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:605— libs/sdk-py/langgraph_sdk/_async/stream.py:605-621 | libs/sdk-py/langgraph_sdk/_sync/stream.py:669-685 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (17 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:72— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:72-88 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:214-230 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1313— libs/checkpoint-postgres/langgraph/store/postgres/base.py:1313-1329 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:143-160 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) libs/cli/examples/graph_prerelease_reqs/agent.py:22— libs/cli/examples/graph_prerelease_reqs/agent.py:22-38 | libs/cli/examples/graph_prerelease_reqs_fail/agent.py:23-39 — `libs/cli/examples/graph_prerelease_reqs/agent.py` and `libs/cli/examples/graph_prerelease_reqs_fail/agent.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 17 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (13 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:855— libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:855-867 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/utils.py:95-107 — 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 (13 lines × 2) libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:491— libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:491-503 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1353-1365 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 116 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 `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:491` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) libs/langgraph/langgraph/pregel/_runner.py:347— libs/langgraph/langgraph/pregel/_runner.py:347-359 | libs/langgraph/langgraph/pregel/_runner.py:561-573 — 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 `libs/langgraph/langgraph/pregel/_runner.py:347` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) libs/langgraph/langgraph/pregel/_write.py:76— libs/langgraph/langgraph/pregel/_write.py:76-88 | libs/langgraph/langgraph/pregel/_write.py:91-103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (13 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:658— libs/sdk-py/langgraph_sdk/_async/stream.py:658-670 | libs/sdk-py/langgraph_sdk/_sync/stream.py:725-737 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (13 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1604— libs/sdk-py/langgraph_sdk/_async/stream.py:1604-1616 | libs/sdk-py/langgraph_sdk/stream/controller.py:204-216 — 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.
Repeated repair: libs/langgraph/langgraph/pregel/_checkpoint.py libs/langgraph/langgraph/pregel/_checkpoint.py:268— libs/langgraph/langgraph/pregel/_checkpoint.py changed 11 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is _checkpoint.create_checkpoint at line 268), 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(langgraph): keep a DeltaChannel's value when its field changes to a plain reducer (#9302)”; “fix(langgraph): snapshot a DeltaChannel that an update_state Overwrite resets (#9263)”; “fix(langgraph): keep a fork's DeltaChannel snapshot from starting nodes that never ran (#9264)”; “fix(langgraph): never store exit-mode delta writes under the null task id (#9229)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/langgraph/langgraph/pregel/_checkpoint.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:680— libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is BasePostgresSaver._build_delta_channels_writes_history at line 680), 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: order delta channel replay by task path (#8544)”; “fix(checkpoint-postgres): derive the delta walk cursor once the target loads (#8556)”; “fix(checkpoint-postgres): find plain-value seeds when walking delta history (#8535)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:517— libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is SqliteSaver.get_delta_channel_history at line 517), 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(checkpoint-postgres,checkpoint-sqlite): treat an empty checkpoint_id as the latest in delta history (#9262)”; “fix: order delta channel replay by task path (#8544)”; “fix(checkpoint-sqlite): walk delta ancestors by parent pointer (#8557)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:638— libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is AsyncSqliteSaver.aget_delta_channel_history at line 638), 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(checkpoint-postgres,checkpoint-sqlite): treat an empty checkpoint_id as the latest in delta history (#9262)”; “fix: order delta channel replay by task path (#8544)”; “fix(checkpoint-sqlite): walk delta ancestors by parent pointer (#8557)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: libs/checkpoint/langgraph/store/base/__init__.py libs/checkpoint/langgraph/store/base/__init__.py:1325— libs/checkpoint/langgraph/store/base/__init__.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is base._validate_namespace_labels at line 1325), 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(checkpoint): reject NUL bytes in namespace labels (#9383)”; “fix(checkpoint,checkpoint-postgres,checkpoint-sqlite): validate namespace labels before store dispatch (#9217)”; “fix(checkpoint): widen `Store` `put` value type to `Mapping[str, Any]` (#8617)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 01:02:32 +00:00' --until='2026-10-24 01:02:32 +00:00' --full-history --no-merges -- libs/checkpoint/langgraph/store/base/__init__.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Duplicated block (20 lines × 2) REDACTED:446— REDACTED:446-465 | REDACTED:492-511 — 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:446` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20 lines × 2) libs/langgraph/langgraph/pregel/main.py:1248— libs/langgraph/langgraph/pregel/main.py:1248-1267 | libs/langgraph/langgraph/pregel/main.py:1373-1392 — 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 (20 lines × 2) libs/langgraph/langgraph/pregel/main.py:1774— libs/langgraph/langgraph/pregel/main.py:1774-1793 | libs/langgraph/langgraph/pregel/main.py:2273-2292 — 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 (20 lines × 2) libs/langgraph/langgraph/pregel/main.py:3980— libs/langgraph/langgraph/pregel/main.py:3980-3999 | libs/langgraph/langgraph/pregel/main.py:4157-4176 — 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 (20 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:252— libs/sdk-py/langgraph_sdk/_async/stream.py:252-271 | libs/sdk-py/langgraph_sdk/_sync/stream.py:270-289 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/stream.py:252` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1366— libs/checkpoint-postgres/langgraph/store/postgres/base.py:1366-1383 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:237-254 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (18 lines × 2) libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:643— libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:643-660 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:717-734 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:429— libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:429-446 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:505-522 — 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 `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:429` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) libs/langgraph/langgraph/pregel/_loop.py:1873— libs/langgraph/langgraph/pregel/_loop.py:1873-1890 | libs/langgraph/langgraph/pregel/_loop.py:2131-2148 — 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 `libs/langgraph/langgraph/pregel/_loop.py:1873` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (18 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:729— libs/sdk-py/langgraph_sdk/_async/stream.py:729-746 | libs/sdk-py/langgraph_sdk/_sync/stream.py:798-815 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/stream.py:729` 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.
TooManyMethods: Pregel libs/langgraph/langgraph/pregel/main.py:460— TooManyMethods — 58 methods. The bar is 30 methods; this is 28 over it, 1.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AsyncThreadStream libs/sdk-py/langgraph_sdk/_async/stream.py:1170— TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: RemoteGraph libs/langgraph/langgraph/pregel/remote.py:118— TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: SyncThreadStream libs/sdk-py/langgraph_sdk/_sync/stream.py:1087— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (27 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:96— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:96-122 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:597-623 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:988— libs/checkpoint-postgres/langgraph/store/postgres/base.py:988-1014 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1251-1277 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (27 lines × 2) libs/langgraph/langgraph/pregel/main.py:1270— libs/langgraph/langgraph/pregel/main.py:1270-1296 | libs/langgraph/langgraph/pregel/main.py:1395-1421 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (27 lines × 2) libs/langgraph/langgraph/pregel/main.py:1664— libs/langgraph/langgraph/pregel/main.py:1664-1690 | libs/langgraph/langgraph/pregel/main.py:2165-2191 — 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 (16 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:483— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:483-498 | libs/checkpoint-postgres/langgraph/store/postgres/base.py:1053-1068 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/store/postgres/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 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 `libs/checkpoint-postgres/langgraph/store/postgres/aio.py:483` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) libs/langgraph/langgraph/func/__init__.py:449— libs/langgraph/langgraph/func/__init__.py:449-464 | libs/langgraph/langgraph/graph/state.py:225-240 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:2021— libs/sdk-py/langgraph_sdk/_async/stream.py:2021-2036 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1677-1692 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (16 lines × 2) libs/sdk-py/langgraph_sdk/_sync/stream.py:415— libs/sdk-py/langgraph_sdk/_sync/stream.py:415-430 | libs/sdk-py/langgraph_sdk/_sync/stream.py:786-801 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:486— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:486-500 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:496-510 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 83 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 `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:486` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1040— libs/checkpoint-postgres/langgraph/store/postgres/base.py:1040-1054 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1340-1354 — 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 (15 lines × 2) libs/langgraph/langgraph/pregel/main.py:4225— libs/langgraph/langgraph/pregel/main.py:4225-4239 | libs/langgraph/langgraph/pregel/main.py:4244-4258 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1579— libs/sdk-py/langgraph_sdk/_async/stream.py:1579-1593 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1449-1463 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/stream.py:1579` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) libs/langgraph/langgraph/pregel/_checkpoint.py:488— libs/langgraph/langgraph/pregel/_checkpoint.py:488-499 | libs/langgraph/langgraph/pregel/_checkpoint.py:523-534 — 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 `libs/langgraph/langgraph/pregel/_checkpoint.py:488` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:773— libs/sdk-py/langgraph_sdk/_async/stream.py:773-784 | libs/sdk-py/langgraph_sdk/_sync/stream.py:846-857 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) libs/sdk-py/langgraph_sdk/stream/transport/sync_http.py:46— libs/sdk-py/langgraph_sdk/stream/transport/sync_http.py:46-57 | libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py:53-64 — 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 (12 lines × 2) libs/langgraph/bench/pydantic_state.py:75— libs/langgraph/bench/pydantic_state.py:75-86 | libs/langgraph/bench/pydantic_state.py:92-105 — 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) libs/langgraph/langgraph/pregel/_loop.py:1786— libs/langgraph/langgraph/pregel/_loop.py:1786-1793 | libs/langgraph/langgraph/pregel/_loop.py:2042-2049 — 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 `libs/langgraph/langgraph/pregel/_loop.py:1786` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:154— libs/sdk-py/langgraph_sdk/_async/stream.py:154-161 | libs/sdk-py/langgraph_sdk/_sync/stream.py:198-205 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (8 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1150— libs/sdk-py/langgraph_sdk/_async/stream.py:1150-1157 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1068-1075 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (8 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1550— libs/sdk-py/langgraph_sdk/_async/stream.py:1550-1557 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1419-1426 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) libs/langgraph/langgraph/pregel/main.py:1474— libs/langgraph/langgraph/pregel/main.py:1474-1478 | libs/langgraph/langgraph/pregel/main.py:1499-1503 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) libs/langgraph/langgraph/channels/ephemeral_value.py:42— libs/langgraph/langgraph/channels/ephemeral_value.py:42-46 | libs/langgraph/langgraph/channels/untracked_value.py:42-46 — 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 after the matched lines, `libs/langgraph/langgraph/channels/untracked_value.py:48` calls `checkpoint` and `libs/langgraph/langgraph/channels/ephemeral_value.py:48` 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 (5 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1865— libs/sdk-py/langgraph_sdk/_async/stream.py:1865-1869 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1524-1528 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (5 lines × 2) examples/chatbot-simulation-evaluation/simulation_utils.py:60— examples/chatbot-simulation-evaluation/simulation_utils.py:60-64 | libs/cli/examples/graphs/storm.py:181-185 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (28 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:262— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:262-289 | libs/checkpoint-postgres/langgraph/store/postgres/base.py:1159-1186 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/store/postgres/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `libs/checkpoint-postgres/langgraph/store/postgres/base.py:1157` calls `condition` and `libs/checkpoint-postgres/langgraph/store/postgres/aio.py:261` 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 (28 lines × 2) libs/langgraph/langgraph/pregel/main.py:1850— libs/langgraph/langgraph/pregel/main.py:1850-1877 | libs/langgraph/langgraph/pregel/main.py:2349-2376 — 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 (28 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:875— libs/sdk-py/langgraph_sdk/_async/stream.py:875-902 | libs/sdk-py/langgraph_sdk/_sync/stream.py:919-946 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 (26–27 lines × 2) libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:558— libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:558-584 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:673-698 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 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 (26–27 lines × 2) libs/langgraph/langgraph/pregel/main.py:1759— libs/langgraph/langgraph/pregel/main.py:1759-1784 | libs/langgraph/langgraph/pregel/main.py:1835-1861 — 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 (26–27 lines × 2) libs/langgraph/langgraph/pregel/main.py:2258— libs/langgraph/langgraph/pregel/main.py:2258-2283 | libs/langgraph/langgraph/pregel/main.py:2334-2360 — 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 (26 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:359— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:359-384 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:459-484 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (26 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:910— libs/checkpoint-postgres/langgraph/store/postgres/base.py:910-935 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1206-1231 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (26 lines × 2) libs/langgraph/langgraph/pregel/main.py:1624— libs/langgraph/langgraph/pregel/main.py:1624-1649 | libs/langgraph/langgraph/pregel/main.py:2125-2150 — 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 (25 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:91— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:91-115 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:233-257 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:319— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:319-343 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:797-821 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) libs/langgraph/langgraph/pregel/main.py:1222— libs/langgraph/langgraph/pregel/main.py:1222-1246 | libs/langgraph/langgraph/pregel/main.py:1347-1371 — 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 (23 lines × 2) libs/langgraph/langgraph/pregel/_loop.py:1756— libs/langgraph/langgraph/pregel/_loop.py:1756-1778 | libs/langgraph/langgraph/pregel/_loop.py:2012-2034 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (23 lines × 2) libs/langgraph/langgraph/pregel/_runner.py:730— libs/langgraph/langgraph/pregel/_runner.py:730-752 | libs/langgraph/langgraph/pregel/_runner.py:877-899 — 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 `libs/langgraph/langgraph/pregel/_runner.py:730` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (23 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:721— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:721-743 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:263-285 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) libs/checkpoint/langgraph/checkpoint/base/__init__.py:128— libs/checkpoint/langgraph/checkpoint/base/__init__.py:128-133 | libs/langgraph/langgraph/pregel/_checkpoint.py:538-543 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `libs/checkpoint/langgraph/checkpoint/base/__init__.py:128` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `libs/checkpoint/langgraph/checkpoint/base/__init__.py:135` calls `get` and `libs/langgraph/langgraph/pregel/_checkpoint.py:545` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 2) libs/sdk-py/langgraph_sdk/stream/transport/http.py:107— libs/sdk-py/langgraph_sdk/stream/transport/http.py:107-112 | libs/sdk-py/langgraph_sdk/stream/transport/ws.py:75-80 — before extracting anything, compare `libs/sdk-py/langgraph_sdk/stream/transport/http.py` and `libs/sdk-py/langgraph_sdk/stream/transport/ws.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1693— libs/sdk-py/langgraph_sdk/_async/stream.py:1693-1698 | libs/sdk-py/langgraph_sdk/stream/controller.py:277-282 — 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.
R4 · Test Coverage· No test reaches this file · ×3
No test reaches this file libs/cli/js-monorepo-example/apps/agent/src/graph.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file libs/cli/js-monorepo-example/apps/agent/src/state.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file libs/cli/js-monorepo-example/libs/shared/src/index.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
Near-duplicate member pair (56 shared lines) libs/checkpoint-postgres/langgraph/store/postgres/base.py:319— libs/checkpoint-postgres/langgraph/store/postgres/base.py:319-424 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:347-436 — These two members are variants of one another: 56 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (56 shared lines) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:717— libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:717-786 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:941-1010 — These two members are variants of one another: 56 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (4 members, 50+ identical tokens) libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:827— libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:827-835 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:643-661 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:717-735 | REDACTED:623-631 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) libs/cli/langgraph_cli/config.py:1017— libs/cli/langgraph_cli/config.py:1017-1052 | libs/cli/langgraph_cli/config.py:1058-1095 | libs/cli/langgraph_cli/config.py:1101-1138 | libs/cli/langgraph_cli/config.py:1144-1183 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (42 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:314— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:314-355 | libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:267-308 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (42 lines × 2) libs/sdk-py/langgraph_sdk/_async/runs.py:1011— libs/sdk-py/langgraph_sdk/_async/runs.py:1011-1052 | libs/sdk-py/langgraph_sdk/_sync/runs.py:993-1034 — `libs/sdk-py/langgraph_sdk/_async/runs.py` and `libs/sdk-py/langgraph_sdk/_sync/runs.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 204 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (35 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:608— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:608-642 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:190-224 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (35 lines × 2) libs/sdk-py/langgraph_sdk/_async/threads.py:224— libs/sdk-py/langgraph_sdk/_async/threads.py:224-258 | libs/sdk-py/langgraph_sdk/_sync/threads.py:220-254 — `libs/sdk-py/langgraph_sdk/_async/threads.py` and `libs/sdk-py/langgraph_sdk/_sync/threads.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 216 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (33 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:358— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:358-390 | libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:311-343 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (33 lines × 2) libs/langgraph/langgraph/pregel/main.py:2945— libs/langgraph/langgraph/pregel/main.py:2945-2977 | libs/langgraph/langgraph/pregel/main.py:3386-3418 — 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 (28–29 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:496— libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:496-524 | libs/checkpoint-postgres/langgraph/store/postgres/base.py:952-979 — 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 (28–29 lines × 2) libs/sdk-py/langgraph_sdk/_async/http.py:199— libs/sdk-py/langgraph_sdk/_async/http.py:199-227 | libs/sdk-py/langgraph_sdk/_sync/http.py:202-229 — `libs/sdk-py/langgraph_sdk/_async/http.py` and `libs/sdk-py/langgraph_sdk/_sync/http.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 82 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (27–29 lines × 2) libs/cli/langgraph_cli/config.py:978— libs/cli/langgraph_cli/config.py:978-1006 | libs/cli/langgraph_cli/config.py:1208-1234 — 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 (27–29 lines × 2) libs/sdk-py/langgraph_sdk/_async/http.py:259— libs/sdk-py/langgraph_sdk/_async/http.py:259-287 | libs/sdk-py/langgraph_sdk/_sync/http.py:260-286 — `libs/sdk-py/langgraph_sdk/_async/http.py` and `libs/sdk-py/langgraph_sdk/_sync/http.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 82 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 (24–25 lines × 2) libs/sdk-py/langgraph_sdk/_async/assistants.py:586— libs/sdk-py/langgraph_sdk/_async/assistants.py:586-610 | libs/sdk-py/langgraph_sdk/_sync/assistants.py:586-609 — `libs/sdk-py/langgraph_sdk/_async/assistants.py` and `libs/sdk-py/langgraph_sdk/_sync/assistants.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 146 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/assistants.py:586` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24–25 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1523— libs/sdk-py/langgraph_sdk/_async/stream.py:1523-1546 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1391-1415 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (21 lines × 2) libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:444— libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:444-464 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1313-1333 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (21 lines × 2) libs/sdk-py/langgraph_sdk/_async/runs.py:339— libs/sdk-py/langgraph_sdk/_async/runs.py:339-359 | libs/sdk-py/langgraph_sdk/_sync/runs.py:334-354 — `libs/sdk-py/langgraph_sdk/_async/runs.py` and `libs/sdk-py/langgraph_sdk/_sync/runs.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 204 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/runs.py:339` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20–21 lines × 2) libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:526— libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:526-546 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1382-1401 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 116 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 `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:526` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20–21 lines × 2) libs/langgraph/langgraph/pregel/main.py:2894— libs/langgraph/langgraph/pregel/main.py:2894-2913 | libs/langgraph/langgraph/pregel/main.py:3319-3339 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–16 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:471— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:471-484 | libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:477-492 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14–16 lines × 2) libs/langgraph/langgraph/pregel/main.py:926— libs/langgraph/langgraph/pregel/main.py:926-939 | libs/langgraph/langgraph/pregel/main.py:966-981 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15–16 lines × 2) libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:481— libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:481-496 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:601-615 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 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 `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:601` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15–16 lines × 2) libs/langgraph/langgraph/_internal/_runnable.py:683— libs/langgraph/langgraph/_internal/_runnable.py:683-697 | libs/langgraph/langgraph/_internal/_runnable.py:730-745 — 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 `libs/langgraph/langgraph/_internal/_runnable.py:683` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 3) libs/checkpoint/langgraph/store/base/__init__.py:1013— libs/checkpoint/langgraph/store/base/__init__.py:1013-1024 | libs/checkpoint/langgraph/store/base/__init__.py:1300-1311 | libs/checkpoint/langgraph/store/base/batch.py:180-191 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `libs/checkpoint/langgraph/store/base/batch.py:178` calls `_ensure_task`, `create_future` and `libs/checkpoint/langgraph/store/base/__init__.py:1012` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12 lines × 3) libs/sdk-py/langgraph_sdk/_async/stream.py:505— libs/sdk-py/langgraph_sdk/_async/stream.py:505-516 | libs/sdk-py/langgraph_sdk/_sync/stream.py:142-153 | libs/sdk-py/langgraph_sdk/stream/decoders.py:65-76 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 3) libs/sdk-py/langgraph_sdk/_async/stream.py:479— libs/sdk-py/langgraph_sdk/_async/stream.py:479-489 | libs/sdk-py/langgraph_sdk/_async/stream.py:733-743 | libs/sdk-py/langgraph_sdk/_sync/stream.py:802-812 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 3) libs/sdk-py/langgraph_sdk/stream/transport/sync_http.py:50— libs/sdk-py/langgraph_sdk/stream/transport/sync_http.py:50-60 | libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py:57-67 | libs/sdk-py/langgraph_sdk/stream/transport/ws.py:62-72 — before extracting anything, compare `libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py` and `libs/sdk-py/langgraph_sdk/stream/transport/ws.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 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 `libs/sdk-py/langgraph_sdk/stream/transport/sync_http.py:50` 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.
Outbound HTTP without resilience REDACTED:81— `urllib.request.urlopen(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience REDACTED:104— `request.urlopen(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×2
Recursive walk over a caller-supplied document has no depth cap libs/langgraph/langgraph/_internal/_fields.py:21— `get_field_default` is public, takes a document from its caller (line 79) and hands it to `_is_optional_type`, which calls itself at line 21 (`_is_optional_type`) with a piece of `type_` (and at line 30, line 33, line 36) — and nowhere in `_is_optional_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_is_optional_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap libs/langgraph/langgraph/_internal/_fields.py:55— `get_field_default` is public, takes a document from its caller (line 79) and hands it to `_is_required_type`, which calls itself at line 55 (`_is_required_type`) with a piece of `type_` — and nowhere in `_is_required_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_is_required_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
config.validate_config (cyclomatic 64) libs/cli/langgraph_cli/config.py:384— config.validate_config has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PregelLoop._first (cyclomatic 63) libs/langgraph/langgraph/pregel/_loop.py:915— PregelLoop._first has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_draw.draw_graph (cyclomatic 54) libs/langgraph/langgraph/pregel/_draw.py:42— _draw.draw_graph has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Pregel.astream (cyclomatic 48) libs/langgraph/langgraph/pregel/main.py:3154— Pregel.astream has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PregelRunner.atick (cyclomatic 43) libs/langgraph/langgraph/pregel/_runner.py:361— PregelRunner.atick 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.
Pregel.stream (cyclomatic 42) libs/langgraph/langgraph/pregel/main.py:2748— Pregel.stream 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.
PregelRunner.tick (cyclomatic 41) libs/langgraph/langgraph/pregel/_runner.py:177— PregelRunner.tick 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.
StateGraph.add_node (cyclomatic 40) libs/langgraph/langgraph/graph/state.py:667— StateGraph.add_node has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
StateGraph.compile (cyclomatic 38) libs/langgraph/langgraph/graph/state.py:1177— StateGraph.compile 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.
CompiledStateGraph._migrate_checkpoint (cyclomatic 37) libs/langgraph/langgraph/graph/state.py:1626— CompiledStateGraph._migrate_checkpoint has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chat_agent_executor.create_react_agent (cyclomatic 37) libs/prebuilt/langgraph/prebuilt/chat_agent_executor.py:278— chat_agent_executor.create_react_agent has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
jsonplus._msgpack_default (cyclomatic 34) REDACTED:327— jsonplus._msgpack_default has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
generate_schema.add_descriptions_to_schema (cyclomatic 33) libs/cli/generate_schema.py:37— generate_schema.add_descriptions_to_schema 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.
_algo.apply_writes (cyclomatic 32) REDACTED:233— _algo.apply_writes 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.
_validate.validate_graph (cyclomatic 32) libs/langgraph/langgraph/pregel/_validate.py:13— _validate.validate_graph 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.
deploy._deploy_cmd (cyclomatic 30) REDACTED:2399— deploy._deploy_cmd 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.
_serde._collect_from_type (cyclomatic 29) libs/langgraph/langgraph/_internal/_serde.py:126— _serde._collect_from_type has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PregelLoop._put_checkpoint (cyclomatic 29) libs/langgraph/langgraph/pregel/_loop.py:1231— PregelLoop._put_checkpoint 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.
_config.ensure_config (cyclomatic 28) libs/langgraph/langgraph/_internal/_config.py:334— _config.ensure_config 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.
_retry.arun_with_retry (cyclomatic 28) libs/langgraph/langgraph/pregel/_retry.py:685— _retry.arun_with_retry 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.
SyncHttpClient.stream (cyclomatic 28) libs/sdk-py/langgraph_sdk/_sync/http.py:187— SyncHttpClient.stream 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.
HttpClient.stream (cyclomatic 27) libs/sdk-py/langgraph_sdk/_async/http.py:187— HttpClient.stream 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.
stream._drain_messages_inbox (cyclomatic 27) libs/sdk-py/langgraph_sdk/_sync/stream.py:395— stream._drain_messages_inbox 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.
RemoteGraph.stream (cyclomatic 26) libs/langgraph/langgraph/pregel/remote.py:757— RemoteGraph.stream 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. This shape REPEATS in the file: one other method here (RemoteGraph.astream) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
RemoteGraph.astream (cyclomatic 26) libs/langgraph/langgraph/pregel/remote.py:907— RemoteGraph.astream 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. This shape REPEATS in the file: one other method here (RemoteGraph.stream) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
BaseSqliteStore._get_filter_condition (cyclomatic 25) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:716— BaseSqliteStore._get_filter_condition 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. This shape REPEATS in the file: one other method here (SqliteStore._get_filter_condition) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SqliteStore._get_filter_condition (cyclomatic 25) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:940— SqliteStore._get_filter_condition 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. This shape REPEATS in the file: one other method here (BaseSqliteStore._get_filter_condition) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
config.python_config_to_docker (cyclomatic 25) libs/cli/langgraph_cli/config.py:1396— config.python_config_to_docker 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.
_algo.prepare_single_task (cyclomatic 25) REDACTED:523— _algo.prepare_single_task 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.
GraphRunStream.interleave (cyclomatic 25) libs/langgraph/langgraph/stream/run_stream.py:258— GraphRunStream.interleave 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.
StateGraph.validate (cyclomatic 24) libs/langgraph/langgraph/graph/state.py:1129— StateGraph.validate 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.
ToolNode._inject_tool_args (cyclomatic 24) libs/prebuilt/langgraph/prebuilt/tool_node.py:1349— ToolNode._inject_tool_args 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.
uv_lock.python_config_to_docker_uv_lock (cyclomatic 22) libs/cli/langgraph_cli/uv_lock.py:868— uv_lock.python_config_to_docker_uv_lock 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.
PregelLoop.put_writes (cyclomatic 22) libs/langgraph/langgraph/pregel/_loop.py:461— PregelLoop.put_writes 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.
AsyncSqliteStore._batch_search_ops (cyclomatic 21) libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:506— AsyncSqliteStore._batch_search_ops 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.
BaseSqliteStore._prepare_batch_search_queries (cyclomatic 21) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:438— BaseSqliteStore._prepare_batch_search_queries 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.
SqliteStore._batch_search_ops (cyclomatic 21) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1368— SqliteStore._batch_search_ops 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.
config._assemble_local_deps (cyclomatic 21) libs/cli/langgraph_cli/config.py:796— config._assemble_local_deps 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.
RunnableCallable.ainvoke (cyclomatic 21) libs/langgraph/langgraph/_internal/_runnable.py:452— RunnableCallable.ainvoke 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.
_algo.prepare_push_task_send (cyclomatic 21) REDACTED:937— _algo.prepare_push_task_send 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.
_retry.run_with_retry (cyclomatic 21) libs/langgraph/langgraph/pregel/_retry.py:573— _retry.run_with_retry 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.
AsyncThreadStream._apply_lifecycle_event (cyclomatic 21) libs/sdk-py/langgraph_sdk/_async/stream.py:1978— AsyncThreadStream._apply_lifecycle_event 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.
_SyncHandleSubgraphsProjection._subgraphs_iter (cyclomatic 21) libs/sdk-py/langgraph_sdk/_sync/stream.py:893— _SyncHandleSubgraphsProjection._subgraphs_iter 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.
SyncThreadStream._apply_lifecycle_event (cyclomatic 21) libs/sdk-py/langgraph_sdk/_sync/stream.py:1643— SyncThreadStream._apply_lifecycle_event 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.
RunnableCallable.invoke (cyclomatic 20) libs/langgraph/langgraph/_internal/_runnable.py:374— RunnableCallable.invoke 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.
RunnableSeq.astream (cyclomatic 20) libs/langgraph/langgraph/_internal/_runnable.py:831— RunnableSeq.astream 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.
InMemorySaver.get_delta_channel_history (cyclomatic 19) REDACTED:152— InMemorySaver.get_delta_channel_history 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.
InMemorySaver.list (cyclomatic 19) REDACTED:321— InMemorySaver.list 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.
jsonplus._msgpack_ext_hook_to_json (cyclomatic 19) REDACTED:777— jsonplus._msgpack_ext_hook_to_json has cyclomatic complexity 19 (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.
deploy.deploy_logs (cyclomatic 19) REDACTED:2830— deploy.deploy_logs 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.
_io.map_output_updates (cyclomatic 19) libs/langgraph/langgraph/pregel/_io.py:118— _io.map_output_updates 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.
_HandleToolCallsProjection._tool_calls_iter (cyclomatic 19) libs/sdk-py/langgraph_sdk/_async/stream.py:758— _HandleToolCallsProjection._tool_calls_iter 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.
AsyncThreadStream._run_lifecycle_watcher (cyclomatic 19) libs/sdk-py/langgraph_sdk/_async/stream.py:1877— AsyncThreadStream._run_lifecycle_watcher 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.
_SyncHandleToolCallsProjection._tool_calls_iter (cyclomatic 19) libs/sdk-py/langgraph_sdk/_sync/stream.py:829— _SyncHandleToolCallsProjection._tool_calls_iter has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
embed.tokenize_path (cyclomatic 18) libs/checkpoint/langgraph/store/base/embed.py:336— embed.tokenize_path has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BasePostgresStore._prepare_batch_PUT_queries (cyclomatic 18) libs/checkpoint-postgres/langgraph/store/postgres/base.py:312— BasePostgresStore._prepare_batch_PUT_queries has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BaseSqliteStore._prepare_batch_PUT_queries (cyclomatic 18) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:340— BaseSqliteStore._prepare_batch_PUT_queries has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
deploy._select_source (cyclomatic 18) REDACTED:1909— deploy._select_source has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
uv_lock._discover_uv_lock_workspace_packages (cyclomatic 18) libs/cli/langgraph_cli/uv_lock.py:350— uv_lock._discover_uv_lock_workspace_packages has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Pregel.invoke (cyclomatic 18) libs/langgraph/langgraph/pregel/main.py:3924— Pregel.invoke has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Pregel.ainvoke) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Pregel.ainvoke (cyclomatic 18) libs/langgraph/langgraph/pregel/main.py:4101— Pregel.ainvoke has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Pregel.invoke) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncThreadStream.interleave_projections (cyclomatic 18) libs/sdk-py/langgraph_sdk/_async/stream.py:1433— AsyncThreadStream.interleave_projections has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SyncThreadStream.interleave_projections (cyclomatic 18) libs/sdk-py/langgraph_sdk/_sync/stream.py:1304— SyncThreadStream.interleave_projections has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
exec.subp_exec (cyclomatic 17) libs/cli/langgraph_cli/exec.py:37— exec.subp_exec 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.
uv_lock._validate_uv_lock_source_entry (cyclomatic 17) libs/cli/langgraph_cli/uv_lock.py:132— uv_lock._validate_uv_lock_source_entry 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.
RunnableCallable.__init__ (cyclomatic 17) libs/langgraph/langgraph/_internal/_runnable.py:302— RunnableCallable.__init__ 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.
_branch._get_branch_path_input_schema (cyclomatic 17) libs/langgraph/langgraph/graph/_branch.py:41— _branch._get_branch_path_input_schema 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.
message.add_messages (cyclomatic 17) libs/langgraph/langgraph/graph/message.py:64— message.add_messages 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.
PregelLoop.after_tick (cyclomatic 17) libs/langgraph/langgraph/pregel/_loop.py:737— PregelLoop.after_tick 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.
_runner._panic_or_proceed (cyclomatic 17) libs/langgraph/langgraph/pregel/_runner.py:657— _runner._panic_or_proceed 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.
Pregel._prepare_state_snapshot (cyclomatic 17) libs/langgraph/langgraph/pregel/main.py:1213— Pregel._prepare_state_snapshot 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. This shape REPEATS in the file: one other method here (Pregel._aprepare_state_snapshot) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Pregel._aprepare_state_snapshot (cyclomatic 17) libs/langgraph/langgraph/pregel/main.py:1338— Pregel._aprepare_state_snapshot 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. This shape REPEATS in the file: one other method here (Pregel._prepare_state_snapshot) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
main._output (cyclomatic 17) libs/langgraph/langgraph/pregel/main.py:4374— main._output 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.
_SyncSubgraphsProjection._subgraphs_iter (cyclomatic 17) libs/sdk-py/langgraph_sdk/_sync/stream.py:971— _SyncSubgraphsProjection._subgraphs_iter 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.
validate.validate (cyclomatic 16) libs/checkpoint-conformance/langgraph/checkpoint/conformance/validate.py:45— validate.validate 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.
PostgresStore.setup (cyclomatic 16) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1116— PostgresStore.setup 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.
config._update_graph_paths (cyclomatic 16) libs/cli/langgraph_cli/config.py:914— config._update_graph_paths 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.
_retry._arun_with_timeout (cyclomatic 16) libs/langgraph/langgraph/pregel/_retry.py:422— _retry._arun_with_timeout has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
_MessagesProjection._drain_inbox (cyclomatic 16) libs/sdk-py/langgraph_sdk/_async/stream.py:443— _MessagesProjection._drain_inbox 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.
_HandleMessagesProjection._messages_iter (cyclomatic 16) libs/sdk-py/langgraph_sdk/_async/stream.py:700— _HandleMessagesProjection._messages_iter 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.
_HandleSubgraphsProjection._subgraphs_iter (cyclomatic 16) libs/sdk-py/langgraph_sdk/_async/stream.py:864— _HandleSubgraphsProjection._subgraphs_iter 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.
_SubgraphsProjection._subgraphs_iter (cyclomatic 16) libs/sdk-py/langgraph_sdk/_async/stream.py:927— _SubgraphsProjection._subgraphs_iter 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.
_SyncHandleMessagesProjection._messages_iter (cyclomatic 16) libs/sdk-py/langgraph_sdk/_sync/stream.py:768— _SyncHandleMessagesProjection._messages_iter 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.
SyncThreadStream._run_lifecycle_watcher (cyclomatic 16) libs/sdk-py/langgraph_sdk/_sync/stream.py:1536— SyncThreadStream._run_lifecycle_watcher 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.
ToolCallsDecoder.feed (cyclomatic 16) libs/sdk-py/langgraph_sdk/stream/decoders.py:216— ToolCallsDecoder.feed 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.
SyncStreamController._fanout (cyclomatic 16) libs/sdk-py/langgraph_sdk/stream/sync_controller.py:162— SyncStreamController._fanout 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.
HackComment libs/cli/tests/unit_tests/agent.py:33— # hacky way to reset model to the "first" response — 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.
_draw.draw_graph (cognitive 131) libs/langgraph/langgraph/pregel/_draw.py:42— _draw.draw_graph has cognitive complexity 131 (threshold 15). Drivers by points: if/else 19 (62 pts), loops 20 (52 pts), ternaries 4 (9 pts), boolean chains 8 (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CompiledStateGraph._migrate_checkpoint (cognitive 108) libs/langgraph/langgraph/graph/state.py:1626— CompiledStateGraph._migrate_checkpoint has cognitive complexity 108 (threshold 15). Drivers by points: if/else 23 (71 pts), loops 8 (21 pts), ternaries 3 (11 pts), boolean chains 5 (nesting depth added 69). 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.
config.validate_config (cognitive 104) libs/cli/langgraph_cli/config.py:384— config.validate_config has cognitive complexity 104 (threshold 15). Drivers by points: if/else 46 (79 pts), ternaries 6 (11 pts), boolean chains 7, error handling 2 (4 pts), loops 1 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PregelLoop._first (cognitive 104) libs/langgraph/langgraph/pregel/_loop.py:915— PregelLoop._first has cognitive complexity 104 (threshold 15). Drivers by points: if/else 33 (72 pts), boolean chains 21, loops 4 (9 pts), ternaries 2 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
stream._drain_messages_inbox (cognitive 80) libs/sdk-py/langgraph_sdk/_sync/stream.py:395— stream._drain_messages_inbox has cognitive complexity 80 (threshold 15). Drivers by points: if/else 14 (49 pts), loops 5 (15 pts), ternaries 4 (12 pts), boolean chains 4 (nesting depth added 53). 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.
PregelRunner.atick (cognitive 77) libs/langgraph/langgraph/pregel/_runner.py:361— PregelRunner.atick has cognitive complexity 77 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 6 (13 pts), boolean chains 9, ternaries 4 (5 pts), error handling 3 (4 pts) (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PregelRunner.tick (cognitive 75) libs/langgraph/langgraph/pregel/_runner.py:177— PregelRunner.tick has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 5 (12 pts), boolean chains 9, ternaries 4 (5 pts), error handling 2 (3 pts) (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
GraphRunStream.interleave (cognitive 66) libs/langgraph/langgraph/stream/run_stream.py:258— GraphRunStream.interleave has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (53 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
StateGraph.add_node (cognitive 65) libs/langgraph/langgraph/graph/state.py:667— StateGraph.add_node has cognitive complexity 65 (threshold 15). Drivers by points: if/else 29 (51 pts), boolean chains 8, loops 2 (5 pts), error handling 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_algo.prepare_single_task (cognitive 64) REDACTED:523— _algo.prepare_single_task has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (36 pts), ternaries 5 (20 pts), boolean chains 5, error handling 1 (3 pts) (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
_retry.arun_with_retry (cognitive 64) libs/langgraph/langgraph/pregel/_retry.py:685— _retry.arun_with_retry has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (33 pts), error handling 5 (12 pts), loops 4 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_validate.validate_graph (cognitive 64) libs/langgraph/langgraph/pregel/_validate.py:13— _validate.validate_graph has cognitive complexity 64 (threshold 15). Drivers by points: if/else 24 (48 pts), loops 9 (15 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chat_agent_executor.create_react_agent (cognitive 63) libs/prebuilt/langgraph/prebuilt/chat_agent_executor.py:278— chat_agent_executor.create_react_agent has cognitive complexity 63 (threshold 15). Drivers by points: if/else 39 (53 pts), boolean chains 5, error handling 1 (3 pts), ternaries 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.
Pregel.astream (cognitive 62) libs/langgraph/langgraph/pregel/main.py:3154— Pregel.astream has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (30 pts), ternaries 8 (13 pts), boolean chains 9, loops 5 (9 pts), error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_algo.apply_writes (cognitive 60) REDACTED:233— _algo.apply_writes has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 7 (10 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
AsyncSqliteStore._batch_search_ops (cognitive 58) libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:506— AsyncSqliteStore._batch_search_ops has cognitive complexity 58 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 6 (18 pts), ternaries 5 (15 pts), error handling 1 (5 pts), boolean chains 2 (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.
SqliteStore._batch_search_ops (cognitive 58) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1368— SqliteStore._batch_search_ops has cognitive complexity 58 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 6 (18 pts), ternaries 5 (15 pts), error handling 1 (5 pts), boolean chains 2 (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.
config._assemble_local_deps (cognitive 58) libs/cli/langgraph_cli/config.py:796— config._assemble_local_deps has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 3 (11 pts), error handling 1 (6 pts), boolean chains 2 (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
generate_schema.add_descriptions_to_schema (cognitive 57) libs/cli/generate_schema.py:37— generate_schema.add_descriptions_to_schema has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 5 (12 pts), boolean chains 10 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
_config.ensure_config (cognitive 57) libs/langgraph/langgraph/_internal/_config.py:334— _config.ensure_config has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (33 pts), ternaries 3 (12 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SyncHttpClient.stream (cognitive 56) libs/sdk-py/langgraph_sdk/_sync/http.py:187— SyncHttpClient.stream has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (39 pts), ternaries 4 (8 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pregel.stream (cognitive 54) libs/langgraph/langgraph/pregel/main.py:2748— Pregel.stream has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (28 pts), ternaries 7 (12 pts), boolean chains 8, loops 3 (5 pts), error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HttpClient.stream (cognitive 54) libs/sdk-py/langgraph_sdk/_async/http.py:187— HttpClient.stream has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (37 pts), ternaries 4 (8 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StateGraph.compile (cognitive 51) libs/langgraph/langgraph/graph/state.py:1177— StateGraph.compile has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 9 (14 pts), boolean chains 10, ternaries 6 (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.
RunnableSeq.astream (cognitive 49) libs/langgraph/langgraph/_internal/_runnable.py:831— RunnableSeq.astream has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 5 (12 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_SyncHandleSubgraphsProjection._subgraphs_iter (cognitive 49) libs/sdk-py/langgraph_sdk/_sync/stream.py:893— _SyncHandleSubgraphsProjection._subgraphs_iter has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 3 (7 pts), boolean chains 4, error handling 1 (4 pts), ternaries 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BasePostgresStore._prepare_batch_PUT_queries (cognitive 48) libs/checkpoint-postgres/langgraph/store/postgres/base.py:312— BasePostgresStore._prepare_batch_PUT_queries has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 8 (20 pts), ternaries 1 (6 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BaseSqliteStore._prepare_batch_PUT_queries (cognitive 48) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:340— BaseSqliteStore._prepare_batch_PUT_queries has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 8 (20 pts), ternaries 1 (6 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StateGraph.validate (cognitive 48) libs/langgraph/langgraph/graph/state.py:1129— StateGraph.validate has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 10 (18 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_serde._collect_from_type (cognitive 46) libs/langgraph/langgraph/_internal/_serde.py:126— _serde._collect_from_type has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (23 pts), loops 8 (20 pts), boolean chains 3 (nesting depth added 16). 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.
RemoteGraph.stream (cognitive 46) libs/langgraph/langgraph/pregel/remote.py:757— RemoteGraph.stream has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 6, ternaries 2 (5 pts), loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (RemoteGraph.astream) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
RemoteGraph.astream (cognitive 46) libs/langgraph/langgraph/pregel/remote.py:907— RemoteGraph.astream has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 6, ternaries 2 (5 pts), loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (RemoteGraph.stream) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
PostgresStore.setup (cognitive 45) libs/checkpoint-postgres/langgraph/store/postgres/base.py:1116— PostgresStore.setup has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (29 pts), error handling 2 (7 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
BaseSqliteStore._prepare_batch_search_queries (cognitive 45) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:438— BaseSqliteStore._prepare_batch_search_queries has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3 (9 pts), ternaries 2 (8 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
deploy._deploy_cmd (cognitive 44) REDACTED:2399— deploy._deploy_cmd has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 8, error handling 2 (3 pts), loops 1 (3 pts), ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_retry.run_with_retry (cognitive 44) libs/langgraph/langgraph/pregel/_retry.py:573— _retry.run_with_retry has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (24 pts), error handling 4 (8 pts), loops 3 (8 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncThreadStream._apply_lifecycle_event (cognitive 44) libs/sdk-py/langgraph_sdk/_async/stream.py:1978— AsyncThreadStream._apply_lifecycle_event has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 8 (24 pts), if/else 7 (16 pts), boolean chains 4 (nesting depth added 25). 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.
SyncThreadStream._apply_lifecycle_event (cognitive 44) libs/sdk-py/langgraph_sdk/_sync/stream.py:1643— SyncThreadStream._apply_lifecycle_event has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 8 (24 pts), if/else 7 (16 pts), boolean chains 4 (nesting depth added 25). 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.
ToolNode._inject_tool_args (cognitive 43) libs/prebuilt/langgraph/prebuilt/tool_node.py:1349— ToolNode._inject_tool_args has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 2 (6 pts), boolean chains 3 (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.
Pregel.invoke (cognitive 42) libs/langgraph/langgraph/pregel/main.py:3924— Pregel.invoke has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (29 pts), ternaries 4 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (Pregel.ainvoke) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Pregel.ainvoke (cognitive 42) libs/langgraph/langgraph/pregel/main.py:4101— Pregel.ainvoke has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (29 pts), ternaries 4 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (Pregel.invoke) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
config._update_graph_paths (cognitive 41) libs/cli/langgraph_cli/config.py:914— config._update_graph_paths has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (10 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.
InMemoryStore._batch_search (cognitive 40) libs/checkpoint/langgraph/store/memory/__init__.py:302— InMemoryStore._batch_search has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (11 pts), ternaries 1 (3 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.
AsyncPostgresStore.setup (cognitive 39) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:227— AsyncPostgresStore.setup has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (26 pts), error handling 1 (5 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 27). 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.
RunnableCallable.ainvoke (cognitive 39) libs/langgraph/langgraph/_internal/_runnable.py:452— RunnableCallable.ainvoke has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (27 pts), error handling 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
batch._run (cognitive 38) libs/checkpoint/langgraph/store/base/batch.py:332— batch._run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (11 pts), error handling 2 (6 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.
BasePostgresStore._prepare_batch_search_queries (cognitive 38) libs/checkpoint-postgres/langgraph/store/postgres/base.py:426— BasePostgresStore._prepare_batch_search_queries has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 3 (9 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncSqliteStore._batch_get_ops (cognitive 38) libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:403— AsyncSqliteStore._batch_get_ops has cognitive complexity 38 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (10 pts), error handling 2 (8 pts), ternaries 2 (8 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.
SqliteStore._batch_get_ops (cognitive 38) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1279— SqliteStore._batch_get_ops has cognitive complexity 38 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (10 pts), error handling 2 (8 pts), ternaries 2 (8 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.
main._output (cognitive 38) libs/langgraph/langgraph/pregel/main.py:4374— main._output has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (33 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (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.
_HandleMessagesProjection._messages_iter (cognitive 38) libs/sdk-py/langgraph_sdk/_async/stream.py:700— _HandleMessagesProjection._messages_iter has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (23 pts), ternaries 3 (8 pts), loops 2 (5 pts), boolean chains 2 (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.
_SyncHandleMessagesProjection._messages_iter (cognitive 38) libs/sdk-py/langgraph_sdk/_sync/stream.py:768— _SyncHandleMessagesProjection._messages_iter has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (23 pts), ternaries 3 (8 pts), loops 2 (5 pts), boolean chains 2 (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.
InMemorySaver.list (cognitive 37) REDACTED:321— InMemorySaver.list has cognitive complexity 37 (threshold 15). Drivers by points: if/else 5 (19 pts), ternaries 4 (7 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MessagesProjection._drain_inbox (cognitive 37) libs/sdk-py/langgraph_sdk/_async/stream.py:443— _MessagesProjection._drain_inbox has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 3 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InMemoryStore._extract_texts (cognitive 36) libs/checkpoint/langgraph/store/memory/__init__.py:418— InMemoryStore._extract_texts has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (13 pts), boolean chains 2 (nesting depth added 24). 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.
_algo.prepare_push_task_send (cognitive 36) REDACTED:937— _algo.prepare_push_task_send has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 5 (11 pts), boolean chains 5 (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.
PregelLoop.put_writes (cognitive 36) libs/langgraph/langgraph/pregel/_loop.py:461— PregelLoop.put_writes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 5, ternaries 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_HandleSubgraphsProjection._subgraphs_iter (cognitive 36) libs/sdk-py/langgraph_sdk/_async/stream.py:864— _HandleSubgraphsProjection._subgraphs_iter has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (7 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InMemorySaver.get_delta_channel_history (cognitive 35) REDACTED:152— InMemorySaver.get_delta_channel_history has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (10 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PregelLoop._put_checkpoint (cognitive 35) libs/langgraph/langgraph/pregel/_loop.py:1231— PregelLoop._put_checkpoint has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 9, ternaries 6 (8 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RunnableCallable.invoke (cognitive 34) libs/langgraph/langgraph/_internal/_runnable.py:374— RunnableCallable.invoke has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_HandleToolCallsProjection._tool_calls_iter (cognitive 34) libs/sdk-py/langgraph_sdk/_async/stream.py:758— _HandleToolCallsProjection._tool_calls_iter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncThreadStream._fanout (cognitive 34) libs/sdk-py/langgraph_sdk/_async/stream.py:1622— AsyncThreadStream._fanout has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (7 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncThreadStream._run_lifecycle_watcher (cognitive 34) libs/sdk-py/langgraph_sdk/_async/stream.py:1877— AsyncThreadStream._run_lifecycle_watcher has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 6, error handling 2 (4 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_SyncHandleToolCallsProjection._tool_calls_iter (cognitive 34) libs/sdk-py/langgraph_sdk/_sync/stream.py:829— _SyncHandleToolCallsProjection._tool_calls_iter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SyncStreamController._fanout (cognitive 34) libs/sdk-py/langgraph_sdk/stream/sync_controller.py:162— SyncStreamController._fanout has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (7 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
validate.validate (cognitive 33) libs/checkpoint-conformance/langgraph/checkpoint/conformance/validate.py:45— validate.validate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PregelLoop.output_writes (cognitive 32) libs/langgraph/langgraph/pregel/_loop.py:1593— PregelLoop.output_writes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
embed.tokenize_path (cognitive 31) libs/checkpoint/langgraph/store/base/embed.py:336— embed.tokenize_path has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (7 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.
_io.map_output_updates (cognitive 31) libs/langgraph/langgraph/pregel/_io.py:118— _io.map_output_updates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3, 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.
StreamMessagesHandler.on_chain_start (cognitive 31) libs/langgraph/langgraph/pregel/_messages.py:200— StreamMessagesHandler.on_chain_start has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
StateGraph._add_schema (cognitive 30) libs/langgraph/langgraph/graph/state.py:343— StateGraph._add_schema has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
debug.tasks_w_writes (cognitive 30) libs/langgraph/langgraph/pregel/debug.py:212— debug.tasks_w_writes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 5 (12 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SyncThreadStream._run_lifecycle_watcher (cognitive 30) libs/sdk-py/langgraph_sdk/_sync/stream.py:1536— SyncThreadStream._run_lifecycle_watcher has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
config.python_config_to_docker (cognitive 29) libs/cli/langgraph_cli/config.py:1396— config.python_config_to_docker has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 7 (8 pts), boolean chains 5, 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.
_checkpoint.create_checkpoint (cognitive 29) libs/langgraph/langgraph/pregel/_checkpoint.py:268— _checkpoint.create_checkpoint has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_runner._panic_or_proceed (cognitive 29) libs/langgraph/langgraph/pregel/_runner.py:657— _runner._panic_or_proceed has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (7 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.
ToolNode._combine_tool_outputs (cognitive 29) libs/prebuilt/langgraph/prebuilt/tool_node.py:870— ToolNode._combine_tool_outputs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BaseSqliteStore._get_batch_list_namespaces_queries (cognitive 28) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:610— BaseSqliteStore._get_batch_list_namespaces_queries has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StreamController._fanout (cognitive 28) libs/sdk-py/langgraph_sdk/stream/controller.py:229— StreamController._fanout has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (7 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
config.validate_config_file (cognitive 27) libs/cli/langgraph_cli/config.py:695— config.validate_config_file has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), error handling 2 (8 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
uv_lock._discover_uv_lock_workspace_packages (cognitive 27) libs/cli/langgraph_cli/uv_lock.py:350— uv_lock._discover_uv_lock_workspace_packages has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (6 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_config.merge_configs (cognitive 27) libs/langgraph/langgraph/_internal/_config.py:159— _config.merge_configs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncThreadStream.interleave_projections (cognitive 27) libs/sdk-py/langgraph_sdk/_async/stream.py:1433— AsyncThreadStream.interleave_projections has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (9 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.
SyncThreadStream.interleave_projections (cognitive 27) libs/sdk-py/langgraph_sdk/_sync/stream.py:1304— SyncThreadStream.interleave_projections has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (9 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.
BaseSqliteStore._get_filter_condition (cognitive 26) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:716— BaseSqliteStore._get_filter_condition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SqliteStore._get_filter_condition) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SqliteStore._get_filter_condition (cognitive 26) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:940— SqliteStore._get_filter_condition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BaseSqliteStore._get_filter_condition) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
_fields.get_enhanced_type_hints (cognitive 26) libs/langgraph/langgraph/_internal/_fields.py:125— _fields.get_enhanced_type_hints has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RunnableCallable.__init__ (cognitive 26) libs/langgraph/langgraph/_internal/_runnable.py:302— RunnableCallable.__init__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
message.add_messages (cognitive 26) libs/langgraph/langgraph/graph/message.py:64— message.add_messages has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PregelRunner.commit (cognitive 26) libs/langgraph/langgraph/pregel/_runner.py:575— PregelRunner.commit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 3 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
subscription.filter_covers (cognitive 26) libs/sdk-py/langgraph_sdk/stream/subscription.py:161— subscription.filter_covers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ignore._build_dockerignore_negation_hints (cognitive 25) libs/cli/langgraph_cli/_ignore.py:65— _ignore._build_dockerignore_negation_hints has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (5 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.
config._update_http_app_path (cognitive 25) libs/cli/langgraph_cli/config.py:1186— config._update_http_app_path has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uv_lock._validate_uv_lock_source_entry (cognitive 25) libs/cli/langgraph_cli/uv_lock.py:132— uv_lock._validate_uv_lock_source_entry has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PregelLoop.after_tick (cognitive 25) libs/langgraph/langgraph/pregel/_loop.py:737— PregelLoop.after_tick has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StreamMessagesHandlerV2._find_and_emit_messages (cognitive 25) libs/langgraph/langgraph/pregel/_messages.py:316— StreamMessagesHandlerV2._find_and_emit_messages has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pregel._prepare_state_snapshot (cognitive 25) libs/langgraph/langgraph/pregel/main.py:1213— Pregel._prepare_state_snapshot has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Pregel._aprepare_state_snapshot) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Pregel._aprepare_state_snapshot (cognitive 25) libs/langgraph/langgraph/pregel/main.py:1338— Pregel._aprepare_state_snapshot has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Pregel._prepare_state_snapshot) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
deploy._select_source (cognitive 24) REDACTED:1909— deploy._select_source has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4 (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.
exec.subp_exec (cognitive 24) libs/cli/langgraph_cli/exec.py:37— exec.subp_exec has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10, ternaries 6 (10 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_algo._proc_input (cognitive 24) REDACTED:1347— _algo._proc_input has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 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.
_runner._acall_impl (cognitive 24) libs/langgraph/langgraph/pregel/_runner.py:851— _runner._acall_impl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 1 (4 pts), boolean chains 1, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pregel.get_subgraphs (cognitive 24) libs/langgraph/langgraph/pregel/main.py:1144— Pregel.get_subgraphs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MessagesDecoder.feed (cognitive 24) libs/sdk-py/langgraph_sdk/stream/decoders.py:162— MessagesDecoder.feed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BaseCheckpointSaver.get_delta_channel_history (cognitive 23) libs/checkpoint/langgraph/checkpoint/base/__init__.py:607— BaseCheckpointSaver.get_delta_channel_history has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), boolean chains 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BaseCheckpointSaver.aget_delta_channel_history) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
BaseCheckpointSaver.aget_delta_channel_history (cognitive 23) libs/checkpoint/langgraph/checkpoint/base/__init__.py:680— BaseCheckpointSaver.aget_delta_channel_history has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), boolean chains 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BaseCheckpointSaver.get_delta_channel_history) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
deploy.deploy_logs (cognitive 23) REDACTED:2830— deploy.deploy_logs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2, error handling 1, 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.
uv_lock.python_config_to_docker_uv_lock (cognitive 23) libs/cli/langgraph_cli/uv_lock.py:868— uv_lock.python_config_to_docker_uv_lock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, loops 4 (5 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.
BranchSpec._finish (cognitive 23) libs/langgraph/langgraph/graph/_branch.py:192— BranchSpec._finish has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tool_node._get_all_injected_args (cognitive 23) libs/prebuilt/langgraph/prebuilt/tool_node.py:2001— tool_node._get_all_injected_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
state._is_field_channel (cognitive 22) libs/langgraph/langgraph/graph/state.py:1876— state._is_field_channel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), ternaries 1 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PregelLoop._suppress_interrupt (cognitive 22) libs/langgraph/langgraph/pregel/_loop.py:1494— PregelLoop._suppress_interrupt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (8 pts), boolean chains 5 (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.
_runner._call (cognitive 22) libs/langgraph/langgraph/pregel/_runner.py:707— _runner._call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). 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.
_SyncSubgraphsProjection._subgraphs_iter (cognitive 22) libs/sdk-py/langgraph_sdk/_sync/stream.py:971— _SyncSubgraphsProjection._subgraphs_iter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jsonplus._msgpack_ext_hook_to_json (cognitive 21) REDACTED:777— jsonplus._msgpack_ext_hook_to_json has cognitive complexity 21 (threshold 15). Drivers by points: error handling 7 (14 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BasePostgresSaver._try_advance_walks (cognitive 21) libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:617— BasePostgresSaver._try_advance_walks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dependency_tracking._find_version_for (cognitive 21) libs/cli/langgraph_cli/dependency_tracking.py:59— dependency_tracking._find_version_for has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_algo.local_read (cognitive 21) REDACTED:189— _algo.local_read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_algo._scratchpad (cognitive 21) REDACTED:1279— _algo._scratchpad has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StreamMessagesHandler._find_and_emit_messages (cognitive 21) libs/langgraph/langgraph/pregel/_messages.py:115— StreamMessagesHandler._find_and_emit_messages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (8 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.
_retry._arun_with_timeout (cognitive 21) libs/langgraph/langgraph/pregel/_retry.py:422— _retry._arun_with_timeout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 5 (8 pts), error handling 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SyncThreadStream._finalize_interleave_decoders (cognitive 21) libs/sdk-py/langgraph_sdk/_sync/stream.py:1428— SyncThreadStream._finalize_interleave_decoders has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 4 (6 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PostgresSaver.get_delta_channel_history (cognitive 20) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:516— PostgresSaver.get_delta_channel_history has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4 (7 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.
AsyncPostgresSaver.aget_delta_channel_history (cognitive 20) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:459— AsyncPostgresSaver.aget_delta_channel_history has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4 (7 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.
BasePostgresStore._get_batch_list_namespaces_queries (cognitive 20) libs/checkpoint-postgres/langgraph/store/postgres/base.py:591— BasePostgresStore._get_batch_list_namespaces_queries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 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.
deploy._poll_revision_status (cognitive 20) REDACTED:942— deploy._poll_revision_status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, 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.
RunnableSeq.ainvoke (cognitive 20) libs/langgraph/langgraph/_internal/_runnable.py:718— RunnableSeq.ainvoke has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), boolean chains 1, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
entrypoint.__call__ (cognitive 20) libs/langgraph/langgraph/func/__init__.py:516— entrypoint.__call__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BranchSpec.from_path (cognitive 20) libs/langgraph/langgraph/graph/_branch.py:89— BranchSpec.from_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 9). 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.
_algo.prepare_push_task_functional (cognitive 20) REDACTED:799— _algo.prepare_push_task_functional has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 6 (7 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_checkpoint._mark_bumps_seen (cognitive 20) libs/langgraph/langgraph/pregel/_checkpoint.py:344— _checkpoint._mark_bumps_seen has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_utils.get_function_nonlocals (cognitive 20) libs/langgraph/langgraph/pregel/_utils.py:161— _utils.get_function_nonlocals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), error handling 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.
ToolNode._validate_tool_command_list (cognitive 20) libs/prebuilt/langgraph/prebuilt/tool_node.py:1489— ToolNode._validate_tool_command_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_HandleSubgraphsProjection._route_sibling_inboxes_to_grandchildren (cognitive 20) libs/sdk-py/langgraph_sdk/_async/stream.py:820— _HandleSubgraphsProjection._route_sibling_inboxes_to_grandchildren has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (8 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.
_SubgraphsProjection._subgraphs_iter (cognitive 20) libs/sdk-py/langgraph_sdk/_async/stream.py:927— _SubgraphsProjection._subgraphs_iter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 3 (4 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory._does_match (cognitive 19) libs/checkpoint/langgraph/store/memory/__init__.py:525— memory._does_match has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (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.
BasePostgresSaver._build_delta_channels_writes_history (cognitive 19) libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:680— BasePostgresSaver._build_delta_channels_writes_history has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
config.config_to_compose (cognitive 19) libs/cli/langgraph_cli/config.py:1798— config.config_to_compose has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dependency_tracking.find_tracked_packages (cognitive 19) libs/cli/langgraph_cli/dependency_tracking.py:98— dependency_tracking.find_tracked_packages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2, 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.
_config._merge_callbacks (cognitive 19) libs/langgraph/langgraph/_internal/_config.py:131— _config._merge_callbacks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (6 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CompiledStateGraph.attach_node (cognitive 19) libs/langgraph/langgraph/graph/state.py:1444— CompiledStateGraph.attach_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PregelLoop._put_exit_delta_writes (cognitive 19) libs/langgraph/langgraph/pregel/_loop.py:1380— PregelLoop._put_exit_delta_writes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, loops 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.
AsyncThreadStream._finalize_interleave_decoders (cognitive 19) libs/sdk-py/langgraph_sdk/_async/stream.py:1559— AsyncThreadStream._finalize_interleave_decoders has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (6 pts), if/else 3 (5 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_SyncToolCallsProjection._tool_calls_iter (cognitive 19) libs/sdk-py/langgraph_sdk/_sync/stream.py:561— _SyncToolCallsProjection._tool_calls_iter has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3 (4 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
state._control_branch (cognitive 18) libs/langgraph/langgraph/graph/state.py:1749— state._control_branch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ui.ui_message_reducer (cognitive 18) libs/langgraph/langgraph/graph/ui.py:165— ui.ui_message_reducer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_algo.prepare_next_tasks (cognitive 18) REDACTED:391— _algo.prepare_next_tasks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 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.
PregelLoop._emit (cognitive 18) libs/langgraph/langgraph/pregel/_loop.py:1557— PregelLoop._emit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 4 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RemoteGraph._sanitize_config (cognitive 18) libs/langgraph/langgraph/pregel/remote.py:407— RemoteGraph._sanitize_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ToolNode._execute_tool_sync (cognitive 18) libs/prebuilt/langgraph/prebuilt/tool_node.py:930— ToolNode._execute_tool_sync has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ToolNode._execute_tool_async) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ToolNode._execute_tool_async (cognitive 18) libs/prebuilt/langgraph/prebuilt/tool_node.py:1090— ToolNode._execute_tool_async has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ToolNode._execute_tool_sync) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
tool_node._filter_validation_errors (cognitive 18) libs/prebuilt/langgraph/prebuilt/tool_node.py:518— tool_node._filter_validation_errors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ToolCallsDecoder.feed (cognitive 18) libs/sdk-py/langgraph_sdk/stream/decoders.py:216— ToolCallsDecoder.feed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PostgresSaver.list (cognitive 17) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:117— PostgresSaver.list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 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.
AsyncPostgresSaver.alist (cognitive 17) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:124— AsyncPostgresSaver.alist has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 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.
StateGraph.add_edge (cognitive 17) libs/langgraph/langgraph/graph/state.py:928— StateGraph.add_edge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PregelLoop._resume_error_handlers_if_applicable (cognitive 17) libs/langgraph/langgraph/pregel/_loop.py:840— PregelLoop._resume_error_handlers_if_applicable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StreamMessagesHandlerV2.on_llm_end (cognitive 17) libs/langgraph/langgraph/pregel/_messages.py:345— StreamMessagesHandlerV2.on_llm_end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1 (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.
_utils.find_subgraph_pregel (cognitive 17) libs/langgraph/langgraph/pregel/_utils.py:45— _utils.find_subgraph_pregel has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (8 pts), if/else 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_write._assemble_writes (cognitive 17) libs/langgraph/langgraph/pregel/_write.py:172— _write._assemble_writes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ToolNode._validate_tool_command (cognitive 17) libs/prebuilt/langgraph/prebuilt/tool_node.py:1537— ToolNode._validate_tool_command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tool_node._infer_handled_types (cognitive 17) libs/prebuilt/langgraph/prebuilt/tool_node.py:452— tool_node._infer_handled_types has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1 (nesting depth added 9). 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.
errors._extract_error_message (cognitive 17) libs/sdk-py/langgraph_sdk/errors.py:140— errors._extract_error_message has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InMemoryStore._filter_items (cognitive 16) libs/checkpoint/langgraph/store/memory/__init__.py:238— InMemoryStore._filter_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
base._keep_latest (cognitive 16) libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:310— base._keep_latest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 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.
archive._add_directory (cognitive 16) libs/cli/langgraph_cli/archive.py:28— archive._add_directory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (5 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
config.node_config_to_docker (cognitive 16) libs/cli/langgraph_cli/config.py:1618— config.node_config_to_docker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_Emitter.result (cognitive 16) REDACTED:374— _Emitter.result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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.
deploy._create_host_backend_client (cognitive 16) REDACTED:1972— deploy._create_host_backend_client has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
deploy._call_host_backend_with_optional_tenant (cognitive 16) REDACTED:2016— deploy._call_host_backend_with_optional_tenant has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), boolean chains 2, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_fields.get_field_default (cognitive 16) libs/langgraph/langgraph/_internal/_fields.py:79— _fields.get_field_default has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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.
RunnableSeq.stream (cognitive 16) libs/langgraph/langgraph/_internal/_runnable.py:771— RunnableSeq.stream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), boolean chains 1, 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.
_branch._get_branch_path_input_schema (cognitive 16) libs/langgraph/langgraph/graph/_branch.py:41— _branch._get_branch_path_input_schema has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncBackgroundExecutor.__aexit__ (cognitive 16) libs/langgraph/langgraph/pregel/_executor.py:186— AsyncBackgroundExecutor.__aexit__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PregelLoop.__init__ (cognitive 16) libs/langgraph/langgraph/pregel/_loop.py:313— PregelLoop.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
_messages._messages_delta_reducer (cognitive 16) libs/langgraph/langgraph/pregel/_messages.py:423— _messages._messages_delta_reducer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChannelWrite.do_write (cognitive 16) libs/langgraph/langgraph/pregel/_write.py:106— ChannelWrite.do_write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
debug.map_debug_tasks (cognitive 16) libs/langgraph/langgraph/pregel/debug.py:44— debug.map_debug_tasks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pregel._defaults (cognitive 16) libs/langgraph/langgraph/pregel/main.py:2645— Pregel._defaults has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 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.
StreamMux.aclose (cognitive 16) libs/langgraph/langgraph/stream/_mux.py:380— StreamMux.aclose has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (2 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SubgraphTransformer._complete_open_handles (cognitive 16) libs/langgraph/langgraph/stream/transformers.py:848— SubgraphTransformer._complete_open_handles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SubgraphTransformer._acomplete_open_handles) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SubgraphTransformer._acomplete_open_handles (cognitive 16) libs/langgraph/langgraph/stream/transformers.py:866— SubgraphTransformer._acomplete_open_handles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SubgraphTransformer._complete_open_handles) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SyncScopedStreamHandle._register_descendant (cognitive 16) libs/sdk-py/langgraph_sdk/_sync/stream.py:691— SyncScopedStreamHandle._register_descendant has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (5 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.
Change-coupling hub: REDACTED → base.py, last_value.py, constants.py, base.py, _write.py, protocol.py, types.py libs/langgraph/langgraph/pregel/__init__.py— `libs/langgraph/langgraph/pregel/__init__.py` changes together with 7 other files — `libs/langgraph/langgraph/channels/base.py`, `libs/langgraph/langgraph/channels/last_value.py`, `libs/langgraph/langgraph/constants.py`, `libs/langgraph/langgraph/managed/base.py`, `libs/langgraph/langgraph/pregel/_write.py`, `libs/langgraph/langgraph/pregel/protocol.py`, `libs/langgraph/langgraph/pregel/types.py` — none of which declares a dependency on it: one file is the hub of 7 separate couplings, not 7 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 7.
Change coupling: client.py ↔ sse.py libs/sdk-py/langgraph_sdk/client.py:1— `libs/sdk-py/langgraph_sdk/client.py` and `libs/sdk-py/langgraph_sdk/sse.py` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `ed07d4a5` chore(sdk-py): Add more type checking. (#6479); `6f45f139` fix: Handle SSE stream reconnection in Python SDK (#6159); `99184881` feat(sdk-py): client qparams (#5918) — run `git show` on any of them.
Near-duplicate member pair (416 shared lines) libs/langgraph/langgraph/pregel/main.py:1624— libs/langgraph/langgraph/pregel/main.py:1624-2118 | libs/langgraph/langgraph/pregel/main.py:2125-2615 — These two members are variants of one another: 416 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (201 shared lines) libs/langgraph/langgraph/pregel/main.py:2766— libs/langgraph/langgraph/pregel/main.py:2766-3112 | libs/langgraph/langgraph/pregel/main.py:3172-3591 — These two members are variants of one another: 201 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (111 shared lines) libs/langgraph/langgraph/pregel/main.py:1222— libs/langgraph/langgraph/pregel/main.py:1222-1336 | libs/langgraph/langgraph/pregel/main.py:1347-1462 — These two members are variants of one another: 111 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (71 shared lines) libs/sdk-py/langgraph_sdk/_async/http.py:197— libs/sdk-py/langgraph_sdk/_async/http.py:197-287 | libs/sdk-py/langgraph_sdk/_sync/http.py:197-286 — These two members are variants of one another: 71 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (49 shared lines) libs/langgraph/langgraph/pregel/_runner.py:190— libs/langgraph/langgraph/pregel/_runner.py:190-359 | libs/langgraph/langgraph/pregel/_runner.py:374-573 — These two members are variants of one another: 49 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (30 corresponding lines) · ×1
Edited copy of a member (30 corresponding lines) libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:488— libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:488-526 | libs/checkpoint-postgres/langgraph/store/postgres/base.py:944-981 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (22 corresponding lines) · ×1
Edited copy of a member (22 corresponding lines) libs/prebuilt/langgraph/prebuilt/tool_node.py:807— libs/prebuilt/langgraph/prebuilt/tool_node.py:807-834 | libs/prebuilt/langgraph/prebuilt/tool_node.py:842-868 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) libs/sdk-py/langgraph_sdk/_async/assistants.py:328— libs/sdk-py/langgraph_sdk/_async/assistants.py:328-383 | libs/sdk-py/langgraph_sdk/_async/assistants.py:543-621 | libs/sdk-py/langgraph_sdk/_async/threads.py:313-376 | libs/sdk-py/langgraph_sdk/_sync/assistants.py:332-387 | libs/sdk-py/langgraph_sdk/_sync/assistants.py:545-620 | libs/sdk-py/langgraph_sdk/_sync/threads.py:308-367 — These 6 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 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Duplicated block (86–88 lines × 2) libs/sdk-py/langgraph_sdk/_async/cron.py:87— libs/sdk-py/langgraph_sdk/_async/cron.py:87-172 | libs/sdk-py/langgraph_sdk/_async/cron.py:204-291 — 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 `libs/sdk-py/langgraph_sdk/_async/cron.py:87` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (82 lines × 2) libs/sdk-py/langgraph_sdk/_async/runs.py:227— libs/sdk-py/langgraph_sdk/_async/runs.py:227-313 | libs/sdk-py/langgraph_sdk/_sync/runs.py:227-308 — `libs/sdk-py/langgraph_sdk/_async/runs.py` and `libs/sdk-py/langgraph_sdk/_sync/runs.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 204 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/runs.py:227` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (74–76 lines × 2) libs/langgraph/langgraph/pregel/main.py:1692— libs/langgraph/langgraph/pregel/main.py:1692-1767 | libs/langgraph/langgraph/pregel/main.py:2193-2266 — 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 (75 lines × 2) libs/langgraph/langgraph/pregel/main.py:1948— libs/langgraph/langgraph/pregel/main.py:1948-2022 | libs/langgraph/langgraph/pregel/main.py:2446-2520 — 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 (74 lines × 2) libs/langgraph/langgraph/pregel/main.py:2766— libs/langgraph/langgraph/pregel/main.py:2766-2839 | libs/langgraph/langgraph/pregel/main.py:3172-3245 — 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 (69–71 lines × 2) libs/sdk-py/langgraph_sdk/_async/cron.py:436— libs/sdk-py/langgraph_sdk/_async/cron.py:436-506 | libs/sdk-py/langgraph_sdk/_sync/cron.py:425-493 — `libs/sdk-py/langgraph_sdk/_async/cron.py` and `libs/sdk-py/langgraph_sdk/_sync/cron.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 71 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 (67–68 lines × 2) libs/langgraph/langgraph/pregel/remote.py:804— libs/langgraph/langgraph/pregel/remote.py:804-871 | libs/langgraph/langgraph/pregel/remote.py:955-1021 — 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 `libs/langgraph/langgraph/pregel/remote.py:955` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (64–65 lines × 2) libs/langgraph/langgraph/pregel/main.py:1881— libs/langgraph/langgraph/pregel/main.py:1881-1945 | libs/langgraph/langgraph/pregel/main.py:2380-2443 — 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 (63 lines × 2) libs/prebuilt/langgraph/prebuilt/tool_node.py:967— libs/prebuilt/langgraph/prebuilt/tool_node.py:967-1029 | libs/prebuilt/langgraph/prebuilt/tool_node.py:1127-1189 — 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 (60 lines × 2) libs/sdk-py/langgraph_sdk/_async/threads.py:113— libs/sdk-py/langgraph_sdk/_async/threads.py:113-172 | libs/sdk-py/langgraph_sdk/_sync/threads.py:111-170 — `libs/sdk-py/langgraph_sdk/_async/threads.py` and `libs/sdk-py/langgraph_sdk/_sync/threads.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 216 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_sync/threads.py:111` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `http` to `HttpClient` in one and `SyncHttpClient` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (53–58 lines × 4) libs/sdk-py/langgraph_sdk/_async/assistants.py:328— libs/sdk-py/langgraph_sdk/_async/assistants.py:328-380 | libs/sdk-py/langgraph_sdk/_async/threads.py:313-370 | libs/sdk-py/langgraph_sdk/_sync/assistants.py:332-384 | libs/sdk-py/langgraph_sdk/_sync/threads.py:308-364 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. 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 (54 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:854— libs/checkpoint-postgres/langgraph/store/postgres/base.py:854-907 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1150-1203 — 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 (40–54 lines × 2) libs/sdk-py/langgraph_sdk/_async/threads.py:632— libs/sdk-py/langgraph_sdk/_async/threads.py:632-685 | libs/sdk-py/langgraph_sdk/_async/threads.py:698-737 — 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 (52 lines × 2) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:287— libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:287-338 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:887-938 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (41–51 lines × 2) libs/sdk-py/langgraph_sdk/_sync/threads.py:622— libs/sdk-py/langgraph_sdk/_sync/threads.py:622-672 | libs/sdk-py/langgraph_sdk/_sync/threads.py:685-725 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (40–50 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:275— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:275-324 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:244-283 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:275` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (50 lines × 2) libs/checkpoint/langgraph/store/base/__init__.py:975— libs/checkpoint/langgraph/store/base/__init__.py:975-1024 | libs/checkpoint/langgraph/store/base/__init__.py:1262-1311 — 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 (49 lines × 2) libs/langgraph/langgraph/pregel/main.py:1795— libs/langgraph/langgraph/pregel/main.py:1795-1843 | libs/langgraph/langgraph/pregel/main.py:2294-2342 — 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 (45–47 lines × 2) libs/sdk-py/langgraph_sdk/_async/assistants.py:398— libs/sdk-py/langgraph_sdk/_async/assistants.py:398-444 | libs/sdk-py/langgraph_sdk/_sync/assistants.py:402-446 — `libs/sdk-py/langgraph_sdk/_async/assistants.py` and `libs/sdk-py/langgraph_sdk/_sync/assistants.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 146 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (41–45 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:575— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:575-619 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:503-543 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 (44 lines × 2) libs/langgraph/langgraph/pregel/main.py:4002— libs/langgraph/langgraph/pregel/main.py:4002-4045 | libs/langgraph/langgraph/pregel/main.py:4179-4222 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22–43 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:198— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:198-240 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:187-208 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (43 lines × 2) libs/langgraph/langgraph/pregel/main.py:2056— libs/langgraph/langgraph/pregel/main.py:2056-2098 | libs/langgraph/langgraph/pregel/main.py:2554-2596 — 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 (41 lines × 2) libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:572— libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:572-612 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1424-1464 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (38–40 lines × 2) libs/langgraph/langgraph/_internal/_runnable.py:382— libs/langgraph/langgraph/_internal/_runnable.py:382-421 | libs/langgraph/langgraph/_internal/_runnable.py:457-494 — 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 `libs/langgraph/langgraph/_internal/_runnable.py:382` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (39–40 lines × 2) libs/langgraph/langgraph/pregel/main.py:1298— libs/langgraph/langgraph/pregel/main.py:1298-1336 | libs/langgraph/langgraph/pregel/main.py:1423-1462 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (28–36 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:389— libs/checkpoint-postgres/langgraph/store/postgres/base.py:389-424 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:409-436 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `libs/checkpoint-postgres/langgraph/store/postgres/base.py:389` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (36 lines × 2) libs/langgraph/langgraph/pregel/_loop.py:1835— libs/langgraph/langgraph/pregel/_loop.py:1835-1870 | libs/langgraph/langgraph/pregel/_loop.py:2091-2126 — 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 (33–35 lines × 4) libs/cli/langgraph_cli/config.py:1020— libs/cli/langgraph_cli/config.py:1020-1052 | libs/cli/langgraph_cli/config.py:1061-1095 | libs/cli/langgraph_cli/config.py:1104-1138 | libs/cli/langgraph_cli/config.py:1149-1183 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (32–33 lines × 2) libs/langgraph/langgraph/pregel/_retry.py:642— libs/langgraph/langgraph/pregel/_retry.py:642-673 | libs/langgraph/langgraph/pregel/_retry.py:790-822 — 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 (29–30 lines × 2) libs/langgraph/langgraph/pregel/_retry.py:584— libs/langgraph/langgraph/pregel/_retry.py:584-612 | libs/langgraph/langgraph/pregel/_retry.py:695-724 — 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 `libs/langgraph/langgraph/pregel/_retry.py:695` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (30 lines × 2) libs/prebuilt/langgraph/prebuilt/tool_node.py:936— libs/prebuilt/langgraph/prebuilt/tool_node.py:936-965 | libs/prebuilt/langgraph/prebuilt/tool_node.py:1096-1125 — 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 (22–24 lines × 2) libs/langgraph/langgraph/pregel/main.py:2843— libs/langgraph/langgraph/pregel/main.py:2843-2864 | libs/langgraph/langgraph/pregel/main.py:3252-3275 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22–23 lines × 3) libs/sdk-py/langgraph_sdk/_async/assistants.py:632— libs/sdk-py/langgraph_sdk/_async/assistants.py:632-654 | libs/sdk-py/langgraph_sdk/_async/cron.py:520-542 | libs/sdk-py/langgraph_sdk/_async/threads.py:387-408 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (22 lines × 3) libs/sdk-py/langgraph_sdk/_sync/assistants.py:631— libs/sdk-py/langgraph_sdk/_sync/assistants.py:631-653 | libs/sdk-py/langgraph_sdk/_sync/cron.py:507-529 | libs/sdk-py/langgraph_sdk/_sync/threads.py:378-399 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13–22 lines × 2) libs/langgraph/langgraph/pregel/_checkpoint.py:465— libs/langgraph/langgraph/pregel/_checkpoint.py:465-486 | libs/langgraph/langgraph/pregel/_checkpoint.py:509-521 — 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 (19–21 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1994— libs/sdk-py/langgraph_sdk/_async/stream.py:1994-2014 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1658-1676 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (19–20 lines × 4) libs/langgraph/langgraph/pregel/main.py:1747— libs/langgraph/langgraph/pregel/main.py:1747-1766 | libs/langgraph/langgraph/pregel/main.py:2072-2090 | libs/langgraph/langgraph/pregel/main.py:2246-2265 | libs/langgraph/langgraph/pregel/main.py:2570-2588 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (18–20 lines × 2) libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:551— libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:551-570 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1406-1423 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py` and `libs/checkpoint-sqlite/langgraph/store/sqlite/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 3) libs/langgraph/langgraph/pregel/_loop.py:886— libs/langgraph/langgraph/pregel/_loop.py:886-903 | libs/langgraph/langgraph/pregel/_loop.py:1756-1773 | libs/langgraph/langgraph/pregel/_loop.py:2012-2029 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (13–18 lines × 2) libs/cli/langgraph_cli/cli.py:215— libs/cli/langgraph_cli/cli.py:215-227 | REDACTED:2148-2165 — 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 `REDACTED:2148` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17–18 lines × 2) REDACTED:1029— REDACTED:1029-1045 | REDACTED:1177-1194 — 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:1029` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16–17 lines × 2) libs/sdk-py/langgraph_sdk/_async/http.py:240— libs/sdk-py/langgraph_sdk/_async/http.py:240-256 | libs/sdk-py/langgraph_sdk/_sync/http.py:242-257 — `libs/sdk-py/langgraph_sdk/_async/http.py` and `libs/sdk-py/langgraph_sdk/_sync/http.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 82 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (15–16 lines × 6) libs/sdk-py/langgraph_sdk/_async/assistants.py:364— libs/sdk-py/langgraph_sdk/_async/assistants.py:364-378 | libs/sdk-py/langgraph_sdk/_async/assistants.py:587-602 | libs/sdk-py/langgraph_sdk/_async/threads.py:351-366 | libs/sdk-py/langgraph_sdk/_sync/assistants.py:368-382 | libs/sdk-py/langgraph_sdk/_sync/assistants.py:586-601 | libs/sdk-py/langgraph_sdk/_sync/threads.py:345-360 — there are 6 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (16 lines × 4) libs/langgraph/langgraph/pregel/main.py:1757— libs/langgraph/langgraph/pregel/main.py:1757-1772 | libs/langgraph/langgraph/pregel/main.py:1833-1848 | libs/langgraph/langgraph/pregel/main.py:2256-2271 | libs/langgraph/langgraph/pregel/main.py:2332-2347 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15 lines × 4) REDACTED:557— REDACTED:557-571 | REDACTED:580-594 | libs/langgraph/langgraph/pregel/_loop.py:1678-1692 | libs/langgraph/langgraph/pregel/_loop.py:1934-1948 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:557` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 3) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:429— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:429-443 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:835-849 | libs/checkpoint-postgres/langgraph/store/postgres/aio.py:560-574 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 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 `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:429` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `libs/checkpoint-postgres/langgraph/store/postgres/aio.py:554` calls `isinstance`, `Lock` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:832` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13–14 lines × 2) libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:281— libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:281-294 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:419-431 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 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 `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:281` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11–13 lines × 4) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:722— libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:722-734 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:774-784 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:946-958 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:998-1008 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12–13 lines × 2) libs/sdk-py/langgraph_sdk/_async/stream.py:1821— libs/sdk-py/langgraph_sdk/_async/stream.py:1821-1833 | libs/sdk-py/langgraph_sdk/_sync/stream.py:1494-1505 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `libs/sdk-py/langgraph_sdk/_async/stream.py:1821` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11–12 lines × 2) libs/sdk-py/langgraph_sdk/stream/transport/http.py:72— libs/sdk-py/langgraph_sdk/stream/transport/http.py:72-83 | libs/sdk-py/langgraph_sdk/stream/transport/ws.py:58-68 — before extracting anything, compare `libs/sdk-py/langgraph_sdk/stream/transport/http.py` and `libs/sdk-py/langgraph_sdk/stream/transport/ws.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (11 lines × 4) libs/sdk-py/langgraph_sdk/_async/stream.py:461— libs/sdk-py/langgraph_sdk/_async/stream.py:461-471 | libs/sdk-py/langgraph_sdk/_async/stream.py:716-726 | libs/sdk-py/langgraph_sdk/_sync/stream.py:414-424 | libs/sdk-py/langgraph_sdk/_sync/stream.py:785-795 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9–11 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/aio.py:511— libs/checkpoint-postgres/langgraph/store/postgres/aio.py:511-519 | libs/checkpoint-postgres/langgraph/store/postgres/base.py:1081-1091 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/store/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/store/postgres/base.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 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 `libs/checkpoint-postgres/langgraph/store/postgres/aio.py:511` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) libs/langgraph/langgraph/callbacks.py:166— libs/langgraph/langgraph/callbacks.py:166-175 | libs/langgraph/langgraph/callbacks.py:177-186 | libs/langgraph/langgraph/callbacks.py:207-216 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8–10 lines × 2) libs/langgraph/langgraph/pregel/_messages.py:324— libs/langgraph/langgraph/pregel/_messages.py:324-331 | libs/langgraph/langgraph/pregel/_messages.py:334-343 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 4) libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:827— libs/checkpoint-postgres/langgraph/checkpoint/postgres/base.py:827-835 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py:653-661 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:727-735 | REDACTED:623-631 — before extracting anything, compare `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/__init__.py` and `libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 3) REDACTED:605— REDACTED:605-613 | REDACTED:640-648 | REDACTED:672-680 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7–9 lines × 2) libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:546— libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:546-554 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:476-482 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 (8–9 lines × 2) libs/checkpoint-postgres/langgraph/store/postgres/base.py:339— libs/checkpoint-postgres/langgraph/store/postgres/base.py:339-346 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:367-375 — 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 × 8) libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:733— libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:733-742 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:744-751 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:753-760 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:762-769 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:957-966 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:968-975 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:977-984 | libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:986-993 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:733` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 3) libs/langgraph/langgraph/graph/state.py:1657— libs/langgraph/langgraph/graph/state.py:1657-1663 | libs/langgraph/langgraph/graph/state.py:1685-1691 | libs/langgraph/langgraph/graph/state.py:1715-1721 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (26 lines × 3) libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:645— libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:645-672 | libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py:895-920 | libs/checkpoint-sqlite/langgraph/checkpoint/sqlite/aio.py:153-180 — before extracting anything, compare `libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py` and `libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 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 (46 lines × 2) libs/sdk-py/langgraph_sdk/_async/runs.py:1108— libs/sdk-py/langgraph_sdk/_async/runs.py:1108-1154 | libs/sdk-py/langgraph_sdk/_sync/runs.py:1090-1135 — `libs/sdk-py/langgraph_sdk/_async/runs.py` and `libs/sdk-py/langgraph_sdk/_sync/runs.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 204 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 × 3) libs/sdk-py/langgraph_sdk/_async/stream.py:530— libs/sdk-py/langgraph_sdk/_async/stream.py:530-535 | libs/sdk-py/langgraph_sdk/_sync/stream.py:114-119 | libs/sdk-py/langgraph_sdk/stream/decoders.py:90-95 — `libs/sdk-py/langgraph_sdk/_async/stream.py` and `libs/sdk-py/langgraph_sdk/_sync/stream.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 29 separate duplicated blocks between them, totalling at least 376 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 (37 lines × 2) libs/sdk-py/langgraph_sdk/_async/threads.py:794— libs/sdk-py/langgraph_sdk/_async/threads.py:794-830 | libs/sdk-py/langgraph_sdk/_sync/threads.py:771-808 — `libs/sdk-py/langgraph_sdk/_async/threads.py` and `libs/sdk-py/langgraph_sdk/_sync/threads.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 216 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (21–22 lines × 2) libs/langgraph/bench/fanout_to_subgraph.py:38— libs/langgraph/bench/fanout_to_subgraph.py:38-58 | libs/langgraph/bench/fanout_to_subgraph.py:87-108 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10–12 lines × 4) libs/langgraph/bench/pydantic_state.py:17— libs/langgraph/bench/pydantic_state.py:17-26 | libs/langgraph/bench/pydantic_state.py:32-43 | libs/langgraph/bench/pydantic_state.py:119-130 | libs/langgraph/bench/pydantic_state.py:136-145 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 6) libs/langgraph/bench/pydantic_state.py:20— libs/langgraph/bench/pydantic_state.py:20-27 | libs/langgraph/bench/pydantic_state.py:35-44 | libs/langgraph/bench/pydantic_state.py:86-95 | libs/langgraph/bench/pydantic_state.py:105-112 | libs/langgraph/bench/pydantic_state.py:122-131 | libs/langgraph/bench/pydantic_state.py:139-146 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (20 lines × 3) libs/cli/examples/graphs/agent.py:31— libs/cli/examples/graphs/agent.py:31-50 | libs/cli/examples/graphs_reqs_a/graphs_submod/agent.py:35-54 | libs/cli/examples/graphs_reqs_b/graphs_submod/agent.py:35-54 — before extracting anything, compare `libs/cli/examples/graphs/agent.py` and `libs/cli/examples/graphs_reqs_a/graphs_submod/agent.py` as WHOLE FILES: 98% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Off the main sequence: langgraph-sdk — langgraph-sdk: abstractness 0.06, instability 0.00, distance 0.94 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Low cohesion: BaseStore (LCOM4 5) libs/checkpoint/langgraph/store/base/__init__.py:708— BaseStore'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.
Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the jest suite in libs/cli/js-examples/ ran and not one test passed (FAIL tests/graph.int.test.ts), so the coverage would describe the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
Duplicated block (18 lines × 2 locations) libs/cli/js-examples/src/agent/graph.ts:64— libs/cli/js-examples/src/agent/graph.ts:64 · libs/cli/js-monorepo-example/apps/agent/src/graph.ts:23 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Unused dependency '@eslint/eslintrc' — Declared in libs/cli/js-monorepo-example/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency '@eslint/js' — Declared in libs/cli/js-monorepo-example/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
X1 · Async correctness· Task from `asyncio.create_task` is not kept · ×1
Task from `asyncio.create_task` is not kept libs/sdk-py/langgraph_sdk/_async/stream.py:1774— The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception.
Orphaned file libs/langgraph/langgraph/callbacks.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 libs/langgraph/bench/pydantic_state.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 libs/langgraph/langgraph/pregel/_draw.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 libs/sdk-py/langgraph_sdk/_sync/store.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 libs/langgraph/langgraph/pregel/_executor.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 libs/langgraph/langgraph/graph/_branch.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 libs/langgraph/langgraph/pregel/_write.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 libs/langgraph/langgraph/_internal/_serde.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 libs/langgraph/langgraph/_internal/_future.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 libs/checkpoint-conformance/langgraph/checkpoint/conformance/report.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 libs/langgraph/langgraph/config.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 libs/checkpoint/langgraph/cache/redis/__init__.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 libs/langgraph/langgraph/channels/named_barrier_value.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 libs/cli/langgraph_cli/archive.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 libs/checkpoint-sqlite/langgraph/cache/sqlite/__init__.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 libs/langgraph/langgraph/pregel/_validate.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 libs/langgraph/langgraph/_internal/_queue.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 libs/langgraph/langgraph/channels/last_value.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 libs/sdk-py/langgraph_sdk/_sync/client.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 libs/cli/langgraph_cli/_ignore.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 libs/langgraph/bench/fanout_to_subgraph.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 libs/prebuilt/langgraph/prebuilt/interrupt.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 libs/checkpoint/langgraph/checkpoint/base/id.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 libs/langgraph/langgraph/_internal/_replay.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 libs/checkpoint/langgraph/checkpoint/serde/encrypted.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.
Duplicated predicate libs/cli/langgraph_cli/cli.py:436— `build_command and langgraph_cli.config.has_disallowed_build_command_content( build_command )` appears character-identically in 2 files — libs/cli/langgraph_cli/cli.py, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate libs/sdk-py/langgraph_sdk/stream/transport/http.py:54— `commands_path or f"/threads/{_quote_path_param(thread_id)}/commands"` appears character-identically in 4 files — libs/sdk-py/langgraph_sdk/stream/transport/http.py, libs/sdk-py/langgraph_sdk/stream/transport/sync_http.py, libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py, libs/sdk-py/langgraph_sdk/stream/transport/ws.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 libs/cli/langgraph_cli/config.py:1540— `config.get("ui") or config.get("node_version")` appears character-identically in 2 files — libs/cli/langgraph_cli/config.py, libs/cli/langgraph_cli/uv_lock.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 libs/sdk-py/langgraph_sdk/_async/stream.py:500— `data.get("id") or data.get("message_id")` appears character-identically in 3 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.py, libs/sdk-py/langgraph_sdk/stream/decoders.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 libs/sdk-py/langgraph_sdk/_async/stream.py:1906— `frame_error or RuntimeError( "lifecycle stream ended before terminal event" )` appears character-identically in 2 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.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 libs/sdk-py/langgraph_sdk/_async/stream.py:1933— `frame_error or RuntimeError(f"Lifecycle transport failed: {exc}")` appears character-identically in 2 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.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 libs/sdk-py/langgraph_sdk/_async/stream.py:796— `handle is not None and isinstance(delta, str)` appears character-identically in 2 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/stream/decoders.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:353— `hasattr(obj, "dict") and callable(obj.dict)` appears character-identically in 2 files — REDACTED, libs/sdk-py/langgraph_sdk/_shared/utilities.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:330— `hasattr(obj, "model_dump") and callable(obj.model_dump)` appears character-identically in 2 files — REDACTED, libs/sdk-py/langgraph_sdk/_shared/utilities.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 libs/checkpoint-postgres/langgraph/store/postgres/base.py:939— `hasattr(self, "_ttl_stop_event") and hasattr(self, "_ttl_sweeper_thread")` appears character-identically in 2 files — libs/checkpoint-postgres/langgraph/store/postgres/base.py, libs/checkpoint-sqlite/langgraph/store/sqlite/base.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 libs/checkpoint-postgres/langgraph/store/postgres/aio.py:402— `hasattr(self, "_ttl_sweeper_task") and self._ttl_sweeper_task is not None` appears character-identically in 2 files — libs/checkpoint-postgres/langgraph/store/postgres/aio.py, libs/checkpoint-sqlite/langgraph/store/sqlite/aio.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 libs/cli/langgraph_cli/cli.py:430— `install_command and langgraph_cli.config.has_disallowed_build_command_content( install_command )` appears character-identically in 2 files — libs/cli/langgraph_cli/cli.py, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate libs/sdk-py/langgraph_sdk/_async/stream.py:1914— `is_non_retryable_stream_error(err) or reconnect_attempts > self._lifecycle_max_reconnect_attempts` appears character-identically in 2 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.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 libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py:57— `isinstance(conn, AsyncConnectionPool) and pipe is not None` appears character-identically in 3 files — libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.py, libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.py, libs/checkpoint-postgres/langgraph/store/postgres/aio.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 libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:57— `isinstance(conn, ConnectionPool) and pipe is not None` appears character-identically in 2 files — libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py, libs/checkpoint-postgres/langgraph/checkpoint/postgres/shallow.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 libs/langgraph/langgraph/graph/_branch.py:75— `isinstance(input_hint, type) and get_type_hints(input_hint)` appears character-identically in 2 files — libs/langgraph/langgraph/graph/_branch.py, libs/langgraph/langgraph/graph/state.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 libs/sdk-py/langgraph_sdk/_async/stream.py:970— `isinstance(result, _RunTerminal) and result.status == "errored"` appears character-identically in 2 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.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 libs/sdk-py/langgraph_sdk/_async/stream.py:539— `len(namespace) == len(scope) + 1 and tuple(namespace[: len(scope)]) == scope` appears character-identically in 3 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.py, libs/sdk-py/langgraph_sdk/stream/decoders.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 libs/sdk-py/langgraph_sdk/_async/stream.py:624— `len(ns_tuple) >= desc_len and ns_tuple[:desc_len] == desc_path` appears character-identically in 2 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.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 libs/sdk-py/langgraph_sdk/_async/stream.py:650— `len(ns_tuple) >= desc_len and ns_tuple[:desc_len] == handle.path` appears character-identically in 2 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.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 libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py:600— `len(seeded) == len(channels) or len(page) < _DELTA_PAGE_SIZE` appears character-identically in 2 files — libs/checkpoint-postgres/langgraph/checkpoint/postgres/__init__.py, libs/checkpoint-postgres/langgraph/checkpoint/postgres/aio.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 libs/sdk-py/langgraph_sdk/stream/transport/http.py:92— `not isinstance(payload, dict) or "id" not in payload` appears character-identically in 4 files — libs/sdk-py/langgraph_sdk/stream/transport/http.py, libs/sdk-py/langgraph_sdk/stream/transport/sync_http.py, libs/sdk-py/langgraph_sdk/stream/transport/sync_ws.py, libs/sdk-py/langgraph_sdk/stream/transport/ws.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 libs/sdk-py/langgraph_sdk/_async/stream.py:1971— `not self._run_seen and not self._explicit_thread_id` appears character-identically in 2 files — libs/sdk-py/langgraph_sdk/_async/stream.py, libs/sdk-py/langgraph_sdk/_sync/stream.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 libs/checkpoint-postgres/langgraph/store/postgres/base.py:920— `not self._ttl_sweeper_thread or not self._ttl_sweeper_thread.is_alive()` appears character-identically in 2 files — libs/checkpoint-postgres/langgraph/store/postgres/base.py, libs/checkpoint-sqlite/langgraph/store/sqlite/base.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 libs/langgraph/langgraph/pregel/_messages.py:154— `not self.subgraphs and len(ns) > 0 and ns != self.parent_ns` appears character-identically in 2 files — libs/langgraph/langgraph/pregel/_messages.py, libs/langgraph/langgraph/pregel/_tools.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.
Interpolated log message defeats structured logging libs/sdk-py/langgraph_sdk/errors.py:220— `error` at line 220 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/sdk-py/langgraph_sdk/errors.py:230— `error` at line 230 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/sdk-py/langgraph_sdk/_sync/http.py:165— `error` at line 165 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/sdk-py/langgraph_sdk/_async/http.py:165— `error` at line 165 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/langgraph/langgraph/pregel/_retry.py:677— `info` at line 677 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/langgraph/langgraph/pregel/_retry.py:826— `info` at line 826 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:283— `info` at line 283 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:299— `info` at line 299 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:540— `warning` at line 540 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/aio.py:573— `error` at line 573 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:592— `debug` at line 592 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:593— `debug` at line 593 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1174— `info` at line 1174 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1187— `info` at line 1187 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1395— `warning` at line 1395 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-sqlite/langgraph/store/sqlite/base.py:1426— `error` at line 1426 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-postgres/langgraph/store/postgres/aio.py:330— `info` at line 330 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-postgres/langgraph/store/postgres/aio.py:346— `info` at line 346 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-postgres/langgraph/store/postgres/base.py:636— `warning` at line 636 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-postgres/langgraph/store/postgres/base.py:878— `info` at line 878 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-postgres/langgraph/store/postgres/base.py:891— `info` at line 891 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging libs/checkpoint-postgres/langgraph/store/postgres/base.py:1147— `error` at line 1147 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging REDACTED:705— `error` at line 705 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Silent fallback default in catch libs/checkpoint/langgraph/cache/redis/__init__.py:63— `get` 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 libs/langgraph/langgraph/_internal/_serde.py:224— `_safe_get_type_hints` 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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 12 significant file(s) lose their only recent owner: libs/langgraph/langgraph/stream/run_stream.py, libs/langgraph/langgraph/stream/_mux.py, libs/sdk-py/langgraph_sdk/stream/controller.py, libs/langgraph/langgraph/pregel/_remote_run_stream.py, libs/langgraph/langgraph/stream/_types.py, libs/langgraph/langgraph/stream/stream_channel.py, libs/sdk-py/langgraph_sdk/stream/transport/ws.py, libs/sdk-py/langgraph_sdk/stream/transport/http.py (+4 more). Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 5 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (20 single-owned of 151 analysed files in total, 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; 151 of the 227 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (2 file(s)), anonymized user #4 (2 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: libs/sdk-py/langgraph_sdk/encryption/__init__.py, libs/sdk-py/langgraph_sdk/encryption/types.py, libs/checkpoint-sqlite/langgraph/cache/sqlite/__init__.py, libs/checkpoint/langgraph/cache/memory/__init__.py, libs/sdk-py/langgraph_sdk/_async/http.py, libs/sdk-py/langgraph_sdk/_sync/http.py, libs/cli/langgraph_cli/dependency_tracking.py, REDACTED.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 2 of 9 project(s) overshoot their size bounds, lowering Project Cohesion to 5.6/10. The most over is `libs/langgraph` (26510 LoC, 230 module-visible types across 9 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 33 of 151 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; 151 of the 227 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: libs/langgraph/langgraph/callbacks.py, libs/langgraph/bench/pydantic_state.py, libs/langgraph/langgraph/pregel/_draw.py, libs/sdk-py/langgraph_sdk/_sync/store.py, libs/langgraph/langgraph/pregel/_executor.py, libs/langgraph/langgraph/graph/_branch.py, libs/langgraph/langgraph/pregel/_write.py, libs/langgraph/langgraph/_internal/_serde.py (and 25 more). 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.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
No src/ separation — Production code isn't grouped under a src/ folder — it all sits under libs/ alongside the root build files, so the conventional src/ boundary between the product and its tooling isn't drawn.
Logging is not universal — Only 5/7 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `libs/cli`.
No SAST — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 98960 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.
Changelog looks stale/thin — The changelog this check read carries 1 versioned entry, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
Silent fallback default on parse failure libs/checkpoint/langgraph/store/base/embed.py:283— `_extract_from_obj` (in `get_text_at_path`) returns `[]` when `(ValueError, IndexError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
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.
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.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a17251-5b03-723d-a335-c98b52e9fa40 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 32 · Warnings: 616 · Recommendations: 104 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 25-10-2026 @ 09:08 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.