Public report of PrefectHQ/fastmcp, published 16 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 16 November 2026, 09:57 UTC · Survey ID cd_eb303d4a84704862ac2c5e11be6b0346
PrefectHQ/fastmcp
Measured 16 November 2026, 09:56 UTC, at code version ffc65c7
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Up 3 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: 94,146 lines of product code in 4 projects, tests not counted · Estimated rebuild effort: about 1.9 person-years · Weakest lens: Code Health, 54
Findings by how serious they are
17 critical586 serious97 minor
14 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
16 November 2026, 09:56 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
61of 61 dimensions measured by tools.
686of 700 findings point to an exact file and line, so you can open each one in the code. The other 14 concern the repository as a whole, such as missing documentation.
61dimensions across 7 lenses, read from 94,146 lines of product code in 4 projects.
PrefectHQ/fastmcp falls short of our standard for production, held back most by its Code Health lens, the quality of the code itself. It scores 63 out of 100 and is rated Adequate, and all 17 of its critical findings are security problems.
Code Health, at 54, is the weakest lens and counts most in the score. The best first step is removing the blocking calls, worth about 5 points. Writing log messages as searchable templates would lift Code Health itself, also worth about 5. Raising Code Health to 70 would lift the score to about 68.
Three known security holes in the packages the code depends on can be used by attackers. Three pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with, and three secrets can leak from the build pipeline. Updating the vulnerable packages, pinning each tool to an exact version and limiting each secret to its own step would close these risks. Passing outside input through environment variables would fix the two pipeline steps that put outside input straight into a shell command, and the two pipeline steps that run downloads without checking them need each download checked against a known checksum first.
The product code is 94,146 lines, about €280,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.
If Code Health rose from 54 to 70, the lowest score rated Strong, the score would rise from 63 to about 68.
Code composition: what the lines of code are
Product code 38%Tests 62%
New since the last survey: 127 findings
These 127 critical or serious findings weren't in the previous survey, on 4 November 2026. The first 100 are listed here, and the findings file in the download package lists them all.
God Classes · FileTooLong: openapi/director.py fastmcp_slim/fastmcp/utilities/openapi/director.py
God Classes · FileTooLong: utilities/json_schema.py fastmcp_slim/fastmcp/utilities/json_schema.py
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) fastmcp_slim/fastmcp/client/mixins/prompts.py
Code Duplication · Edited copy of a member (148 corresponding lines) fastmcp_slim/fastmcp/utilities/inspect.py
Code Duplication · Edited copy of a member (110 corresponding lines) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py
Code Duplication · Edited copy of a member (44 corresponding lines) fastmcp_slim/fastmcp/prompts/function_prompt.py
Code Duplication · Edited copies of one member (3 members, 42+ corresponding lines) fastmcp_slim/fastmcp/server/server.py
Code Duplication · Edited copies of one member (3 members, 50+ corresponding lines) fastmcp_slim/fastmcp/server/middleware/authorization.py
Code Duplication · Edited copy of a member (45 corresponding lines) fastmcp_slim/fastmcp/server/auth/providers/in_memory.py
Code Duplication · Edited copy of a member (42 corresponding lines) fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py
Code Duplication · Edited copy of a member (111 corresponding lines) fastmcp_slim/fastmcp/server/auth/providers/clerk.py
Code Duplication · Edited copy of a member (36 corresponding lines) fastmcp_slim/fastmcp/utilities/json_schema_type.py
Code Duplication · Edited copy of a member (42 corresponding lines) fastmcp_slim/fastmcp/server/mixins/mcp_operations.py
Code Duplication · Edited copies of one member (3 members, 75+ corresponding lines) fastmcp_slim/fastmcp/server/auth/providers/discord.py
Code Duplication · Edited copy of a member (33 corresponding lines) fastmcp_slim/fastmcp/server/middleware/caching.py
Code Duplication · Edited copy of a member (71 corresponding lines) REDACTED
Code Duplication · Edited copies of one member (5 members, 40+ corresponding lines) fastmcp_slim/fastmcp/client/mixins/prompts.py
Code Duplication · Edited copy of a member (43 corresponding lines) REDACTED
Code Duplication · Edited copies of one member (4 members, 26+ corresponding lines) fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py
Code Duplication · Edited copy of a member (16 corresponding lines) .github/agentic/flows/agentic_artifacts.py
Code Duplication · Edited copy of a member (14 corresponding lines) fastmcp_slim/fastmcp/resources/base.py
Code Duplication · Edited copies of one member (4 members, 23+ corresponding lines) fastmcp_slim/fastmcp/server/providers/proxy.py
Code Duplication · Edited copies of one member (3 members, 23+ corresponding lines) fastmcp_slim/fastmcp/client/transports/stdio.py
Code Duplication · Edited copies of one member (3 members, 24+ corresponding lines) fastmcp_slim/fastmcp/server/middleware/caching.py
Code Duplication · Edited copy of a member (25 corresponding lines) fastmcp_slim/fastmcp/experimental/transforms/jev_search.py
Code Duplication · Edited copies of one member (3 members, 31+ corresponding lines) fastmcp_slim/fastmcp/server/server.py
Code Duplication · Edited copy of a member (19 corresponding lines) fastmcp_slim/fastmcp/cli/apps_dev.py
Code Duplication · Edited copy of a member (18 corresponding lines) fastmcp_slim/fastmcp/experimental/transforms/jev_search.py
Code Duplication · Edited copies of one member (3 members, 32+ corresponding lines) fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py
Code Duplication · Edited copies of one member (4 members, 27+ corresponding lines) REDACTED
Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) fastmcp_slim/fastmcp/server/mixins/mcp_operations.py
Code Duplication · Edited copy of a member (14 corresponding lines) fastmcp_slim/fastmcp/cli/discovery.py
Code Duplication · Edited copy of a member (35 corresponding lines) fastmcp_slim/fastmcp/client/mixins/skills.py
Code Duplication · Edited copy of a member (48 corresponding lines) REDACTED
Code Duplication · Edited copies of one member (4 members, 21+ corresponding lines) fastmcp_slim/fastmcp/server/middleware/authorization.py
Code Duplication · Edited copies of one member (4 members, 11+ corresponding lines) fastmcp_slim/fastmcp/server/providers/proxy.py
Code Duplication · Edited copy of a member (17 corresponding lines) fastmcp_slim/fastmcp/server/transforms/visibility.py
Code Duplication · Edited copies of one member (6 members, 27+ corresponding lines) fastmcp_slim/fastmcp/cli/install/claude_code.py
Code Duplication · Edited copy of a member (11 corresponding lines) fastmcp_tasks/fastmcp_tasks/input_store.py
Code Duplication · Edited copies of one member (3 members, 24+ corresponding lines) fastmcp_slim/fastmcp/server/providers/base.py
Code Duplication · Edited copy of a member (24 corresponding lines) fastmcp_slim/fastmcp/client/auth/client_credentials.py
Code Duplication · Edited copy of a member (11 corresponding lines) fastmcp_slim/fastmcp/tools/tool_transform.py
Code Duplication · Edited copy of a member (22 corresponding lines) fastmcp_slim/fastmcp/server/middleware/logging.py
Code Duplication · Edited copy of a member (27 corresponding lines) fastmcp_slim/fastmcp/server/server.py
Code Duplication · Edited copy of a member (23 corresponding lines) fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py
Code Duplication · Edited copy of a member (16 corresponding lines) fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py
Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) fastmcp_slim/fastmcp/server/providers/proxy.py
Code Duplication · Edited copy of a member (6 corresponding lines) fastmcp_slim/fastmcp/server/auth/cimd.py
Code Duplication · Edited copies of one member (3 members, 14+ corresponding lines) fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py
Code Duplication · Edited copy of a member (18 corresponding lines) fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py
Code Duplication · Edited copies of one member (4 members, 16+ corresponding lines) fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py
Code Duplication · Edited copy of a member (10 corresponding lines) fastmcp_slim/fastmcp/utilities/types.py
Code Duplication · Edited copy of a member (19 corresponding lines) fastmcp_slim/fastmcp/server/providers/base.py
Code Duplication · Edited copy of a member (12 corresponding lines) fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py
Code Duplication · Edited copy of a member (15 corresponding lines) REDACTED
Code Duplication · Edited copy of a member (6 corresponding lines) fastmcp_slim/fastmcp/server/auth/cimd.py
Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) fastmcp_slim/fastmcp/resources/base.py
Code Duplication · Edited copy of a member (8 corresponding lines) fastmcp_slim/fastmcp/server/providers/proxy.py
Code Duplication · Edited copy of a member (7 corresponding lines) REDACTED
Code Duplication · Edited copy of a member (7 corresponding lines) fastmcp_slim/fastmcp/apps/config.py
Code Duplication · Edited copy of a member (9 corresponding lines) fastmcp_slim/fastmcp/server/dependencies.py
Code Duplication · Edited copy of a member (1 corresponding lines) fastmcp_slim/fastmcp/resources/base.py
Code Duplication · Edited copy of a member (5 corresponding lines) fastmcp_slim/fastmcp/server/providers/openapi/provider.py
We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 82 findings
These 82 critical or serious findings were in the previous survey, on 4 November 2026, and are gone from this one.
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_duplicates.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_duplicates.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_duplicates.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_duplicates.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_duplicates.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_duplicates.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_duplicates.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_needs_mre.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_needs_mre.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_needs_mre.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_needs_mre.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_needs_mre.py
Outbound HTTP resilience · Outbound HTTP without resilience scripts/auto_close_needs_mre.py
A11y enforcement · Accessibility enforcement below the top rung
Rebuild cost: about €280,000 · Estimate
Cost to rebuild
€93,000 to €470,000, for 1,558 to 4,944 hours of work, about 1.9 person-years for 1 to 4 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.9 at a score of 63. 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: 94,146 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Python: await the async equivalent (asyncio.sleep, an async HTTP client such as httpx.AsyncClient or aiohttp, asyncio.create_subprocess_exec), or move the blocking call off the loop with `await asyncio.to_thread(...)`; never call asyncio.run inside a coroutine — await the coroutine.
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 €280,000 to build again, about 1.9 person-years of work. Its weakest lens is Code Health, at 54 (Adequate). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Python: await the async equivalent (asyncio.sleep, an async HTTP client such as httpx.AsyncClient or aiohttp, asyncio.create_subprocess_exec), or move the blocking call off the loop with `await asyncio.to_thread(...)`; never call asyncio.run inside a coroutine — await the coroutine. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.3 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 4% to 10% on every change. The history of the code shows how much it changes: about 157,417 lines over the last 90 days, which is about 638,413 lines a year. At that pace, the extra work comes to an estimated 69.3 to 415.8 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles 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.
253 modules, with 333 dependencies between them. 6 loops run through 28 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 213 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.
fastmcp_slim.fastmcp.server.auth.oauth_proxy.proxy uses fastmcp_slim.fastmcp.server.auth.auth, so a change to fastmcp_slim.fastmcp.server.auth.auth can break fastmcp_slim.fastmcp.server.auth.oauth_proxy.proxy, while a change to fastmcp_slim.fastmcp.server.auth.oauth_proxy.proxy can't break fastmcp_slim.fastmcp.server.auth.auth.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.auth.oauth_proxy.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.auth.providers.jwt uses fastmcp_slim.fastmcp.server.auth.auth, so a change to fastmcp_slim.fastmcp.server.auth.auth can break fastmcp_slim.fastmcp.server.auth.providers.jwt, while a change to fastmcp_slim.fastmcp.server.auth.providers.jwt can't break fastmcp_slim.fastmcp.server.auth.auth.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.auth.providers.jwt uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.skills.skill uses fastmcp_slim.fastmcp.skills.models, so a change to fastmcp_slim.fastmcp.skills.models can break fastmcp_slim.fastmcp.skills.skill, while a change to fastmcp_slim.fastmcp.skills.skill can't break fastmcp_slim.fastmcp.skills.models.
Position
Below the diagonal: fastmcp_slim.fastmcp.skills.skill uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.utilities.components uses fastmcp_slim.fastmcp.utilities.types, so a change to fastmcp_slim.fastmcp.utilities.types can break fastmcp_slim.fastmcp.utilities.components, while a change to fastmcp_slim.fastmcp.utilities.components can't break fastmcp_slim.fastmcp.utilities.types.
Position
Below the diagonal: fastmcp_slim.fastmcp.utilities.components uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.utilities.openapi.models uses fastmcp_slim.fastmcp.utilities.types, so a change to fastmcp_slim.fastmcp.utilities.types can break fastmcp_slim.fastmcp.utilities.openapi.models, while a change to fastmcp_slim.fastmcp.utilities.openapi.models can't break fastmcp_slim.fastmcp.utilities.types.
Position
Below the diagonal: fastmcp_slim.fastmcp.utilities.openapi.models uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.client.mixins.skills uses fastmcp_slim.fastmcp.skills.models, so a change to fastmcp_slim.fastmcp.skills.models can break fastmcp_slim.fastmcp.client.mixins.skills, while a change to fastmcp_slim.fastmcp.client.mixins.skills can't break fastmcp_slim.fastmcp.skills.models.
Position
Below the diagonal: fastmcp_slim.fastmcp.client.mixins.skills uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.client.mixins.skills uses fastmcp_slim.fastmcp.skills.skill, so a change to fastmcp_slim.fastmcp.skills.skill can break fastmcp_slim.fastmcp.client.mixins.skills, while a change to fastmcp_slim.fastmcp.client.mixins.skills can't break fastmcp_slim.fastmcp.skills.skill.
Position
Below the diagonal: fastmcp_slim.fastmcp.client.mixins.skills uses a module listed above it, which is the healthy direction.
13→19 fastmcp_slim.fastmcp.client.mixins.skills uses fastmcp_slim.fastmcp.client.clientpart of a loop✕
Connections
1 pair of types, where a type in fastmcp_slim.fastmcp.client.mixins.skills uses a type in fastmcp_slim.fastmcp.client.client.
fastmcp_slim.fastmcp.client.mixins.skills uses fastmcp_slim.fastmcp.client.client, so a change to fastmcp_slim.fastmcp.client.client can break fastmcp_slim.fastmcp.client.mixins.skills, while a change to fastmcp_slim.fastmcp.client.mixins.skills can't break fastmcp_slim.fastmcp.client.client.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
fastmcp_slim.fastmcp.prompts.base uses fastmcp_slim.fastmcp.utilities.types, so a change to fastmcp_slim.fastmcp.utilities.types can break fastmcp_slim.fastmcp.prompts.base, while a change to fastmcp_slim.fastmcp.prompts.base can't break fastmcp_slim.fastmcp.utilities.types.
Position
Below the diagonal: fastmcp_slim.fastmcp.prompts.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.prompts.base uses fastmcp_slim.fastmcp.utilities.components, so a change to fastmcp_slim.fastmcp.utilities.components can break fastmcp_slim.fastmcp.prompts.base, while a change to fastmcp_slim.fastmcp.prompts.base can't break fastmcp_slim.fastmcp.utilities.components.
Position
Below the diagonal: fastmcp_slim.fastmcp.prompts.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.resources.base uses fastmcp_slim.fastmcp.utilities.components, so a change to fastmcp_slim.fastmcp.utilities.components can break fastmcp_slim.fastmcp.resources.base, while a change to fastmcp_slim.fastmcp.resources.base can't break fastmcp_slim.fastmcp.utilities.components.
Position
Below the diagonal: fastmcp_slim.fastmcp.resources.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.auth.oidc_proxy uses fastmcp_slim.fastmcp.server.auth.auth, so a change to fastmcp_slim.fastmcp.server.auth.auth can break fastmcp_slim.fastmcp.server.auth.oidc_proxy, while a change to fastmcp_slim.fastmcp.server.auth.oidc_proxy can't break fastmcp_slim.fastmcp.server.auth.auth.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.auth.oidc_proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.auth.oidc_proxy uses fastmcp_slim.fastmcp.server.auth.oauth_proxy.proxy, so a change to fastmcp_slim.fastmcp.server.auth.oauth_proxy.proxy can break fastmcp_slim.fastmcp.server.auth.oidc_proxy, while a change to fastmcp_slim.fastmcp.server.auth.oidc_proxy can't break fastmcp_slim.fastmcp.server.auth.oauth_proxy.proxy.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.auth.oidc_proxy uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in fastmcp_slim.fastmcp.server.providers.local_provider.local_provider uses a type in fastmcp_slim.fastmcp.utilities.components.
fastmcp_slim.fastmcp.server.providers.local_provider.local_provider uses fastmcp_slim.fastmcp.utilities.components, so a change to fastmcp_slim.fastmcp.utilities.components can break fastmcp_slim.fastmcp.server.providers.local_provider.local_provider, while a change to fastmcp_slim.fastmcp.server.providers.local_provider.local_provider can't break fastmcp_slim.fastmcp.utilities.components.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.local_provider.local_provider uses a module listed above it, which is the healthy direction.
17→33 fastmcp_slim.fastmcp.server.providers.local_provider.local_provider uses fastmcp_slim.fastmcp.server.providers.basepart of a loop✕
Connections
1 pair of types, where a type in fastmcp_slim.fastmcp.server.providers.local_provider.local_provider uses a type in fastmcp_slim.fastmcp.server.providers.base.
fastmcp_slim.fastmcp.server.providers.local_provider.local_provider uses fastmcp_slim.fastmcp.server.providers.base, so a change to fastmcp_slim.fastmcp.server.providers.base can break fastmcp_slim.fastmcp.server.providers.local_provider.local_provider, while a change to fastmcp_slim.fastmcp.server.providers.local_provider.local_provider can't break fastmcp_slim.fastmcp.server.providers.base.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
fastmcp_slim.fastmcp.tools.base uses fastmcp_slim.fastmcp.utilities.components, so a change to fastmcp_slim.fastmcp.utilities.components can break fastmcp_slim.fastmcp.tools.base, while a change to fastmcp_slim.fastmcp.tools.base can't break fastmcp_slim.fastmcp.utilities.components.
Position
Below the diagonal: fastmcp_slim.fastmcp.tools.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.client.client uses fastmcp_slim.fastmcp.client.mixins.skills, so a change to fastmcp_slim.fastmcp.client.mixins.skills can break fastmcp_slim.fastmcp.client.client, while a change to fastmcp_slim.fastmcp.client.client can't break fastmcp_slim.fastmcp.client.mixins.skills.
Position
Below the diagonal: fastmcp_slim.fastmcp.client.client uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.resources.template uses fastmcp_slim.fastmcp.utilities.components, so a change to fastmcp_slim.fastmcp.utilities.components can break fastmcp_slim.fastmcp.resources.template, while a change to fastmcp_slim.fastmcp.resources.template can't break fastmcp_slim.fastmcp.utilities.components.
Position
Below the diagonal: fastmcp_slim.fastmcp.resources.template uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.resources.template uses fastmcp_slim.fastmcp.resources.base, so a change to fastmcp_slim.fastmcp.resources.base can break fastmcp_slim.fastmcp.resources.template, while a change to fastmcp_slim.fastmcp.resources.template can't break fastmcp_slim.fastmcp.resources.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.resources.template uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.middleware uses fastmcp_slim.fastmcp.prompts.base, so a change to fastmcp_slim.fastmcp.prompts.base can break fastmcp_slim.fastmcp.server.middleware.middleware, while a change to fastmcp_slim.fastmcp.server.middleware.middleware can't break fastmcp_slim.fastmcp.prompts.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.middleware uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.middleware uses fastmcp_slim.fastmcp.resources.base, so a change to fastmcp_slim.fastmcp.resources.base can break fastmcp_slim.fastmcp.server.middleware.middleware, while a change to fastmcp_slim.fastmcp.server.middleware.middleware can't break fastmcp_slim.fastmcp.resources.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.middleware uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.middleware uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.middleware.middleware, while a change to fastmcp_slim.fastmcp.server.middleware.middleware can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.middleware uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.cli uses fastmcp_slim.fastmcp.client.transports.base, so a change to fastmcp_slim.fastmcp.client.transports.base can break fastmcp_slim.fastmcp.cli, while a change to fastmcp_slim.fastmcp.cli can't break fastmcp_slim.fastmcp.client.transports.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.cli uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.cli uses fastmcp_slim.fastmcp.client.client, so a change to fastmcp_slim.fastmcp.client.client can break fastmcp_slim.fastmcp.cli, while a change to fastmcp_slim.fastmcp.cli can't break fastmcp_slim.fastmcp.client.client.
Position
Below the diagonal: fastmcp_slim.fastmcp.cli uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.client.group uses fastmcp_slim.fastmcp.skills.models, so a change to fastmcp_slim.fastmcp.skills.models can break fastmcp_slim.fastmcp.client.group, while a change to fastmcp_slim.fastmcp.client.group can't break fastmcp_slim.fastmcp.skills.models.
Position
Below the diagonal: fastmcp_slim.fastmcp.client.group uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.client.group uses fastmcp_slim.fastmcp.skills.skill, so a change to fastmcp_slim.fastmcp.skills.skill can break fastmcp_slim.fastmcp.client.group, while a change to fastmcp_slim.fastmcp.client.group can't break fastmcp_slim.fastmcp.skills.skill.
Position
Below the diagonal: fastmcp_slim.fastmcp.client.group uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.client.group uses fastmcp_slim.fastmcp.client.client, so a change to fastmcp_slim.fastmcp.client.client can break fastmcp_slim.fastmcp.client.group, while a change to fastmcp_slim.fastmcp.client.group can't break fastmcp_slim.fastmcp.client.client.
Position
Below the diagonal: fastmcp_slim.fastmcp.client.group uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.authorization uses fastmcp_slim.fastmcp.prompts.base, so a change to fastmcp_slim.fastmcp.prompts.base can break fastmcp_slim.fastmcp.server.middleware.authorization, while a change to fastmcp_slim.fastmcp.server.middleware.authorization can't break fastmcp_slim.fastmcp.prompts.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.authorization uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.authorization uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.middleware.authorization, while a change to fastmcp_slim.fastmcp.server.middleware.authorization can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.authorization uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in fastmcp_slim.fastmcp.server.middleware.authorization uses a type in fastmcp_slim.fastmcp.server.middleware.middleware.
fastmcp_slim.fastmcp.server.middleware.authorization uses fastmcp_slim.fastmcp.server.middleware.middleware, so a change to fastmcp_slim.fastmcp.server.middleware.middleware can break fastmcp_slim.fastmcp.server.middleware.authorization, while a change to fastmcp_slim.fastmcp.server.middleware.authorization can't break fastmcp_slim.fastmcp.server.middleware.middleware.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.authorization uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.caching uses fastmcp_slim.fastmcp.utilities.types, so a change to fastmcp_slim.fastmcp.utilities.types can break fastmcp_slim.fastmcp.server.middleware.caching, while a change to fastmcp_slim.fastmcp.server.middleware.caching can't break fastmcp_slim.fastmcp.utilities.types.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.caching uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.caching uses fastmcp_slim.fastmcp.prompts.base, so a change to fastmcp_slim.fastmcp.prompts.base can break fastmcp_slim.fastmcp.server.middleware.caching, while a change to fastmcp_slim.fastmcp.server.middleware.caching can't break fastmcp_slim.fastmcp.prompts.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.caching uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.caching uses fastmcp_slim.fastmcp.resources.base, so a change to fastmcp_slim.fastmcp.resources.base can break fastmcp_slim.fastmcp.server.middleware.caching, while a change to fastmcp_slim.fastmcp.server.middleware.caching can't break fastmcp_slim.fastmcp.resources.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.caching uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.caching uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.middleware.caching, while a change to fastmcp_slim.fastmcp.server.middleware.caching can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.caching uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.middleware.caching uses fastmcp_slim.fastmcp.server.middleware.middleware, so a change to fastmcp_slim.fastmcp.server.middleware.middleware can break fastmcp_slim.fastmcp.server.middleware.caching, while a change to fastmcp_slim.fastmcp.server.middleware.caching can't break fastmcp_slim.fastmcp.server.middleware.middleware.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.middleware.caching uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in fastmcp_slim.fastmcp.server.providers.openapi.components uses a type in fastmcp_slim.fastmcp.utilities.openapi.models.
fastmcp_slim.fastmcp.server.providers.openapi.components uses fastmcp_slim.fastmcp.utilities.openapi.models, so a change to fastmcp_slim.fastmcp.utilities.openapi.models can break fastmcp_slim.fastmcp.server.providers.openapi.components, while a change to fastmcp_slim.fastmcp.server.providers.openapi.components can't break fastmcp_slim.fastmcp.utilities.openapi.models.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.openapi.components uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.openapi.components uses fastmcp_slim.fastmcp.resources.base, so a change to fastmcp_slim.fastmcp.resources.base can break fastmcp_slim.fastmcp.server.providers.openapi.components, while a change to fastmcp_slim.fastmcp.server.providers.openapi.components can't break fastmcp_slim.fastmcp.resources.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.openapi.components uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.openapi.components uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.providers.openapi.components, while a change to fastmcp_slim.fastmcp.server.providers.openapi.components can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.openapi.components uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.openapi.components uses fastmcp_slim.fastmcp.resources.template, so a change to fastmcp_slim.fastmcp.resources.template can break fastmcp_slim.fastmcp.server.providers.openapi.components, while a change to fastmcp_slim.fastmcp.server.providers.openapi.components can't break fastmcp_slim.fastmcp.resources.template.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.openapi.components uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.utilities.types, so a change to fastmcp_slim.fastmcp.utilities.types can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.utilities.types.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.prompts.base, so a change to fastmcp_slim.fastmcp.prompts.base can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.prompts.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.resources.base, so a change to fastmcp_slim.fastmcp.resources.base can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.resources.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.server uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in fastmcp_slim.fastmcp.server.server uses a type in fastmcp_slim.fastmcp.server.providers.local_provider.local_provider.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.server.providers.local_provider.local_provider, so a change to fastmcp_slim.fastmcp.server.providers.local_provider.local_provider can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.server.providers.local_provider.local_provider.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.resources.template, so a change to fastmcp_slim.fastmcp.resources.template can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.resources.template.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.server.middleware.middleware, so a change to fastmcp_slim.fastmcp.server.middleware.middleware can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.server.middleware.middleware.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.server uses a module listed above it, which is the healthy direction.
27→32 fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.server.transformspart of a loop✕
Connections
2 pairs of types, where a type in fastmcp_slim.fastmcp.server.server uses a type in fastmcp_slim.fastmcp.server.transforms.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.server.transforms, so a change to fastmcp_slim.fastmcp.server.transforms can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.server.transforms.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
27→33 fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.server.providers.basepart of a loop✕
Connections
1 pair of types, where a type in fastmcp_slim.fastmcp.server.server uses a type in fastmcp_slim.fastmcp.server.providers.base.
fastmcp_slim.fastmcp.server.server uses fastmcp_slim.fastmcp.server.providers.base, so a change to fastmcp_slim.fastmcp.server.providers.base can break fastmcp_slim.fastmcp.server.server, while a change to fastmcp_slim.fastmcp.server.server can't break fastmcp_slim.fastmcp.server.providers.base.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
fastmcp_slim.fastmcp.client.transports uses fastmcp_slim.fastmcp.client.transports.base, so a change to fastmcp_slim.fastmcp.client.transports.base can break fastmcp_slim.fastmcp.client.transports, while a change to fastmcp_slim.fastmcp.client.transports can't break fastmcp_slim.fastmcp.client.transports.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.client.transports uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.client.transports uses fastmcp_slim.fastmcp.server.server, so a change to fastmcp_slim.fastmcp.server.server can break fastmcp_slim.fastmcp.client.transports, while a change to fastmcp_slim.fastmcp.client.transports can't break fastmcp_slim.fastmcp.server.server.
Position
Below the diagonal: fastmcp_slim.fastmcp.client.transports uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.context uses fastmcp_slim.fastmcp.resources.base, so a change to fastmcp_slim.fastmcp.resources.base can break fastmcp_slim.fastmcp.server.context, while a change to fastmcp_slim.fastmcp.server.context can't break fastmcp_slim.fastmcp.resources.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.context uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.context uses fastmcp_slim.fastmcp.server.server, so a change to fastmcp_slim.fastmcp.server.server can break fastmcp_slim.fastmcp.server.context, while a change to fastmcp_slim.fastmcp.server.context can't break fastmcp_slim.fastmcp.server.server.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.context uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.utilities uses fastmcp_slim.fastmcp.utilities.components, so a change to fastmcp_slim.fastmcp.utilities.components can break fastmcp_slim.fastmcp.utilities, while a change to fastmcp_slim.fastmcp.utilities can't break fastmcp_slim.fastmcp.utilities.components.
Position
Below the diagonal: fastmcp_slim.fastmcp.utilities uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.utilities uses fastmcp_slim.fastmcp.client.client, so a change to fastmcp_slim.fastmcp.client.client can break fastmcp_slim.fastmcp.utilities, while a change to fastmcp_slim.fastmcp.utilities can't break fastmcp_slim.fastmcp.client.client.
Position
Below the diagonal: fastmcp_slim.fastmcp.utilities uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.utilities uses fastmcp_slim.fastmcp.server.server, so a change to fastmcp_slim.fastmcp.server.server can break fastmcp_slim.fastmcp.utilities, while a change to fastmcp_slim.fastmcp.utilities can't break fastmcp_slim.fastmcp.server.server.
Position
Below the diagonal: fastmcp_slim.fastmcp.utilities uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.extensions uses fastmcp_slim.fastmcp.server.server, so a change to fastmcp_slim.fastmcp.server.server can break fastmcp_slim.fastmcp.server.extensions, while a change to fastmcp_slim.fastmcp.server.extensions can't break fastmcp_slim.fastmcp.server.server.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.extensions uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.extensions uses fastmcp_slim.fastmcp.server.context, so a change to fastmcp_slim.fastmcp.server.context can break fastmcp_slim.fastmcp.server.extensions, while a change to fastmcp_slim.fastmcp.server.extensions can't break fastmcp_slim.fastmcp.server.context.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.extensions uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.transforms uses fastmcp_slim.fastmcp.utilities.components, so a change to fastmcp_slim.fastmcp.utilities.components can break fastmcp_slim.fastmcp.server.transforms, while a change to fastmcp_slim.fastmcp.server.transforms can't break fastmcp_slim.fastmcp.utilities.components.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.transforms uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.transforms uses fastmcp_slim.fastmcp.server.context, so a change to fastmcp_slim.fastmcp.server.context can break fastmcp_slim.fastmcp.server.transforms, while a change to fastmcp_slim.fastmcp.server.transforms can't break fastmcp_slim.fastmcp.server.context.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.transforms uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.base uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.providers.base, while a change to fastmcp_slim.fastmcp.server.providers.base can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.base uses fastmcp_slim.fastmcp.server.transforms, so a change to fastmcp_slim.fastmcp.server.transforms can break fastmcp_slim.fastmcp.server.providers.base, while a change to fastmcp_slim.fastmcp.server.providers.base can't break fastmcp_slim.fastmcp.server.transforms.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.transforms.search.base uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.transforms.search.base, while a change to fastmcp_slim.fastmcp.server.transforms.search.base can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.transforms.search.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.transforms.search.base uses fastmcp_slim.fastmcp.server.context, so a change to fastmcp_slim.fastmcp.server.context can break fastmcp_slim.fastmcp.server.transforms.search.base, while a change to fastmcp_slim.fastmcp.server.transforms.search.base can't break fastmcp_slim.fastmcp.server.context.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.transforms.search.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.transforms.search.base uses fastmcp_slim.fastmcp.server.transforms, so a change to fastmcp_slim.fastmcp.server.transforms can break fastmcp_slim.fastmcp.server.transforms.search.base, while a change to fastmcp_slim.fastmcp.server.transforms.search.base can't break fastmcp_slim.fastmcp.server.transforms.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.transforms.search.base uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.apps.app uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.apps.app, while a change to fastmcp_slim.fastmcp.apps.app can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.apps.app uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.apps.app uses fastmcp_slim.fastmcp.server.providers.base, so a change to fastmcp_slim.fastmcp.server.providers.base can break fastmcp_slim.fastmcp.apps.app, while a change to fastmcp_slim.fastmcp.apps.app can't break fastmcp_slim.fastmcp.server.providers.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.apps.app uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers uses fastmcp_slim.fastmcp.client.transports.base, so a change to fastmcp_slim.fastmcp.client.transports.base can break fastmcp_slim.fastmcp.server.providers, while a change to fastmcp_slim.fastmcp.server.providers can't break fastmcp_slim.fastmcp.client.transports.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.providers, while a change to fastmcp_slim.fastmcp.server.providers can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers uses fastmcp_slim.fastmcp.client.client, so a change to fastmcp_slim.fastmcp.client.client can break fastmcp_slim.fastmcp.server.providers, while a change to fastmcp_slim.fastmcp.server.providers can't break fastmcp_slim.fastmcp.client.client.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers uses fastmcp_slim.fastmcp.server.server, so a change to fastmcp_slim.fastmcp.server.server can break fastmcp_slim.fastmcp.server.providers, while a change to fastmcp_slim.fastmcp.server.providers can't break fastmcp_slim.fastmcp.server.server.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers uses fastmcp_slim.fastmcp.server.context, so a change to fastmcp_slim.fastmcp.server.context can break fastmcp_slim.fastmcp.server.providers, while a change to fastmcp_slim.fastmcp.server.providers can't break fastmcp_slim.fastmcp.server.context.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers uses fastmcp_slim.fastmcp.server.providers.base, so a change to fastmcp_slim.fastmcp.server.providers.base can break fastmcp_slim.fastmcp.server.providers, while a change to fastmcp_slim.fastmcp.server.providers can't break fastmcp_slim.fastmcp.server.providers.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses fastmcp_slim.fastmcp.prompts.base, so a change to fastmcp_slim.fastmcp.prompts.base can break fastmcp_slim.fastmcp.server.providers.fastmcp_provider, while a change to fastmcp_slim.fastmcp.server.providers.fastmcp_provider can't break fastmcp_slim.fastmcp.prompts.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses fastmcp_slim.fastmcp.resources.base, so a change to fastmcp_slim.fastmcp.resources.base can break fastmcp_slim.fastmcp.server.providers.fastmcp_provider, while a change to fastmcp_slim.fastmcp.server.providers.fastmcp_provider can't break fastmcp_slim.fastmcp.resources.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.providers.fastmcp_provider, while a change to fastmcp_slim.fastmcp.server.providers.fastmcp_provider can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses fastmcp_slim.fastmcp.resources.template, so a change to fastmcp_slim.fastmcp.resources.template can break fastmcp_slim.fastmcp.server.providers.fastmcp_provider, while a change to fastmcp_slim.fastmcp.server.providers.fastmcp_provider can't break fastmcp_slim.fastmcp.resources.template.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses fastmcp_slim.fastmcp.server.providers.base, so a change to fastmcp_slim.fastmcp.server.providers.base can break fastmcp_slim.fastmcp.server.providers.fastmcp_provider, while a change to fastmcp_slim.fastmcp.server.providers.fastmcp_provider can't break fastmcp_slim.fastmcp.server.providers.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.fastmcp_provider uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.proxy uses fastmcp_slim.fastmcp.prompts.base, so a change to fastmcp_slim.fastmcp.prompts.base can break fastmcp_slim.fastmcp.server.providers.proxy, while a change to fastmcp_slim.fastmcp.server.providers.proxy can't break fastmcp_slim.fastmcp.prompts.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.proxy uses fastmcp_slim.fastmcp.resources.base, so a change to fastmcp_slim.fastmcp.resources.base can break fastmcp_slim.fastmcp.server.providers.proxy, while a change to fastmcp_slim.fastmcp.server.providers.proxy can't break fastmcp_slim.fastmcp.resources.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.proxy uses fastmcp_slim.fastmcp.tools.base, so a change to fastmcp_slim.fastmcp.tools.base can break fastmcp_slim.fastmcp.server.providers.proxy, while a change to fastmcp_slim.fastmcp.server.providers.proxy can't break fastmcp_slim.fastmcp.tools.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.proxy uses fastmcp_slim.fastmcp.client.client, so a change to fastmcp_slim.fastmcp.client.client can break fastmcp_slim.fastmcp.server.providers.proxy, while a change to fastmcp_slim.fastmcp.server.providers.proxy can't break fastmcp_slim.fastmcp.client.client.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.proxy uses fastmcp_slim.fastmcp.resources.template, so a change to fastmcp_slim.fastmcp.resources.template can break fastmcp_slim.fastmcp.server.providers.proxy, while a change to fastmcp_slim.fastmcp.server.providers.proxy can't break fastmcp_slim.fastmcp.resources.template.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.proxy uses fastmcp_slim.fastmcp.server.middleware.middleware, so a change to fastmcp_slim.fastmcp.server.middleware.middleware can break fastmcp_slim.fastmcp.server.providers.proxy, while a change to fastmcp_slim.fastmcp.server.providers.proxy can't break fastmcp_slim.fastmcp.server.middleware.middleware.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.proxy uses fastmcp_slim.fastmcp.server.server, so a change to fastmcp_slim.fastmcp.server.server can break fastmcp_slim.fastmcp.server.providers.proxy, while a change to fastmcp_slim.fastmcp.server.providers.proxy can't break fastmcp_slim.fastmcp.server.server.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server.providers.proxy uses fastmcp_slim.fastmcp.server.providers.base, so a change to fastmcp_slim.fastmcp.server.providers.base can break fastmcp_slim.fastmcp.server.providers.proxy, while a change to fastmcp_slim.fastmcp.server.providers.proxy can't break fastmcp_slim.fastmcp.server.providers.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.server.providers.proxy uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.skills uses fastmcp_slim.fastmcp.skills.models, so a change to fastmcp_slim.fastmcp.skills.models can break fastmcp_slim.fastmcp.skills, while a change to fastmcp_slim.fastmcp.skills can't break fastmcp_slim.fastmcp.skills.models.
Position
Below the diagonal: fastmcp_slim.fastmcp.skills uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.skills uses fastmcp_slim.fastmcp.skills.skill, so a change to fastmcp_slim.fastmcp.skills.skill can break fastmcp_slim.fastmcp.skills, while a change to fastmcp_slim.fastmcp.skills can't break fastmcp_slim.fastmcp.skills.skill.
Position
Below the diagonal: fastmcp_slim.fastmcp.skills uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.skills uses fastmcp_slim.fastmcp.server.server, so a change to fastmcp_slim.fastmcp.server.server can break fastmcp_slim.fastmcp.skills, while a change to fastmcp_slim.fastmcp.skills can't break fastmcp_slim.fastmcp.server.server.
Position
Below the diagonal: fastmcp_slim.fastmcp.skills uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.skills uses fastmcp_slim.fastmcp.server.providers.base, so a change to fastmcp_slim.fastmcp.server.providers.base can break fastmcp_slim.fastmcp.skills, while a change to fastmcp_slim.fastmcp.skills can't break fastmcp_slim.fastmcp.server.providers.base.
Position
Below the diagonal: fastmcp_slim.fastmcp.skills uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server uses fastmcp_slim.fastmcp.server.auth.auth, so a change to fastmcp_slim.fastmcp.server.auth.auth can break fastmcp_slim.fastmcp.server, while a change to fastmcp_slim.fastmcp.server can't break fastmcp_slim.fastmcp.server.auth.auth.
Position
Below the diagonal: fastmcp_slim.fastmcp.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server uses fastmcp_slim.fastmcp.server.server, so a change to fastmcp_slim.fastmcp.server.server can break fastmcp_slim.fastmcp.server, while a change to fastmcp_slim.fastmcp.server can't break fastmcp_slim.fastmcp.server.server.
Position
Below the diagonal: fastmcp_slim.fastmcp.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server uses fastmcp_slim.fastmcp.server.context, so a change to fastmcp_slim.fastmcp.server.context can break fastmcp_slim.fastmcp.server, while a change to fastmcp_slim.fastmcp.server can't break fastmcp_slim.fastmcp.server.context.
Position
Below the diagonal: fastmcp_slim.fastmcp.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server uses fastmcp_slim.fastmcp.server.extensions, so a change to fastmcp_slim.fastmcp.server.extensions can break fastmcp_slim.fastmcp.server, while a change to fastmcp_slim.fastmcp.server can't break fastmcp_slim.fastmcp.server.extensions.
Position
Below the diagonal: fastmcp_slim.fastmcp.server uses a module listed above it, which is the healthy direction.
fastmcp_slim.fastmcp.server uses fastmcp_slim.fastmcp.server.providers.proxy, so a change to fastmcp_slim.fastmcp.server.providers.proxy can break fastmcp_slim.fastmcp.server, while a change to fastmcp_slim.fastmcp.server can't break fastmcp_slim.fastmcp.server.providers.proxy.
Position
Below the diagonal: fastmcp_slim.fastmcp.server uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 54% · Adequate · gated by D2, X4 ·
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
54
High / Critical
A03:2025 — Software Supply Chain Failures
15
High / Critical
A07:2025 — Authentication Failures
3
High / Critical
Roadmap
Top priorities: Python: await the async equivalent (asyncio.sleep, an async HTTP client such as httpx.AsyncClient or aiohttp, asyncio.create_subprocess_exec), or move the blocking call off the loop with `await asyncio.to_thread(...)`; never call asyncio.run inside a coroutine — await the coroutine; Interpolated log message defeats structured logging; Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Python: await the async equivalent (asyncio.sleep, an async HTTP client such as httpx.AsyncClient or aiohttp, asyncio.create_subprocess_exec), or move the blocking call off the loop with `await asyncio.to_thread(...)`; never call asyncio.run inside a coroutine — await the coroutine.
Bring the 12 bodies over 60 down to 60 or less in Cognitive Complexity — start with formatters.format_description_with_responses (cognitive 150), schemas._combine_schemas_and_map_params (cognitive 150), cli.run (cognitive 125).
Bring the 12 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with schemas._combine_schemas_and_map_params (cyclomatic 62), cli.run (cyclomatic 61), ParsedFunction.from_function (cyclomatic 49).
Code Duplication: Edited copy of a member (33 corresponding lines)
How the grades work
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 17
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 — 586
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 — 97
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 14
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 61 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 61 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, 686 of 700 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 or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.py) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo.
D11 Test Reliability — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 1 of 4 Python distribution(s) were not re-run: its dependency install could not be served by 172.31.7.1 (pip: No matching distribution found for fastmcp-slim==4.2.1.dev2+ffc65c7a), so its suite was not run against dependencies it does not declare. The 3 that were re-run are measured above and their result stands; nothing here is a statement about the suite of the ones not re-run.
D12 Dependency Hygiene — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. This repository's 3 shipped Python distribution(s) across 4 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (REDACTED), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published package.json's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `fastmcp_slim/fastmcp/cli/apps_dev.py` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: 2 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'redis.credentials' is imported (fastmcp_tasks/fastmcp_tasks/extension.py:70), 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'redis.credentials' is imported (fastmcp_tasks/fastmcp_tasks/extension.py:70), 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'redis.credentials' is imported (fastmcp_tasks/fastmcp_tasks/extension.py:70), 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala and Rust source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, Kotlin source, and Rust source only, and no C# was loaded, no TypeScript was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
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.
D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
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 checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
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.
+ 100 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 12 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with schemas._combine_schemas_and_map_params (cyclomatic 62), cli.run (cyclomatic 61), ParsedFunction.from_function (cyclomatic 49). — 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 12 together lifts Cyclomatic Complexity from 5.7 to about 6.9/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
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.
+ 164 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 12 bodies over 60 down to 60 or less in Cognitive Complexity — start with formatters.format_description_with_responses (cognitive 150), schemas._combine_schemas_and_map_params (cognitive 150), cli.run (cognitive 125). — 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 12 together lifts Cognitive Complexity from 2.1 to about 4.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.8 / 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 20 FileTooLong finding(s) in God Classes — start with REDACTED (2), client.py (2), server.py. — One of this dimension's main actionable groups (20 warning-level).
Resolve the 3 TooManyMethods finding(s) in God Classes — start with server.py, client.py, base.py. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 FunctionTooLong finding(s) in God Classes — start with operations.js, app.js. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
95 duplicated block group(s) detected. 6.6 % of the production lines (6,185 of 94,146) are in a reported copy. A further 69 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 34 of the 164 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.
+ 113 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with client.py (2), REDACTED, formatters.py. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 5 Duplicated block (17 lines × 2) finding(s) in Code Duplication — start with claude_code.py, REDACTED, in_memory.py. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 5 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with client.py, claude_code.py, run.py. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.0 / 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.
4 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: fastmcp-slim
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).
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 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with server.py, caching.py. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the code respects its intended layering / architecture rules.
Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.
No mechanizable ADR was identified, so enforcement is not measured. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).
Detailed fixes: d7_recommendation.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
0 flaky across 1 measured tier(s). Python (4 distributions): measured (0 flaky). 1 of 4 Python distribution(s) were not re-run: its dependency install could not be served by 172.31.7.1 (pip: No matching distribution found for fastmcp-slim==4.2.1.dev2+ffc65c7a), so its suite was not run against dependencies it does not declare. The 3 that were re-run are measured above and their result stands; nothing here is a statement about the suite of the ones not re-run.
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.
1 secret(s) detected. 2 detection(s) were excluded as holding no minted credential in material that runs: a name, reference or comparison rather than a value, a readable phrase or pattern, a value that declares itself fake, or development, test, example, mock or demo material.
REDACTED
What to do
Resolve the 1 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
0 of 7 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 3 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (4 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version. This repository publishes itself under Apache-2.0, which is its own choice and is not judged here.
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: fastmcp_slim/fastmcp/utilities/openapi/schemas.py (13×62=806); fastmcp_slim/fastmcp/utilities/json_schema_type.py (25×31=775); fastmcp_slim/fastmcp/server/server.py (26×23=598) Repeated repair below the complexity floor: fastmcp_slim/fastmcp/utilities/json_schema.py (5 of 8 changes were fixes); fastmcp_slim/fastmcp/client/transports/base.py (5 of 5 changes were fixes); fastmcp_slim/fastmcp/client/transports/http.py (4 of 7 changes were fixes)
Resolve the 31 Hotspot finding(s) in Churn × Complexity Hotspots — start with cli.py (2), schemas.py, json_schema_type.py. — One of this dimension's main actionable groups (31 warning-level).
Resolve the 7 Repeated repair finding(s) in Churn × Complexity Hotspots — start with json_schema.py, base.py, http.py. — One of this dimension's main actionable groups (7 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.5 / 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.
35 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is scripts/rank_issues.py. Counted over 235 of the 306 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
2 deducted task-comment markers across 94146 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 2 TodoComment finding(s) in Explicit Debt — start with _compat.py, stdio.py. — One of this dimension's main actionable groups (2 warning-level).
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. 617 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 Quality6.0 / 10Adequate✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
1 of 1 evaluated ADRs have a defect readable from the log itself (a missing or empty section, no title, a single option, consequences with no cost, no status, a missing enforcement field, a status the log contradicts, a dangling link, an unlinked second decision on one question, a date that is no calendar day). How well each record argues its case is not measured.
ADR has no Consequences sectiondev-docs/v3-notes/auth-provider-env-vars.md:2detected by adr-integrity
What to do
Resolve the 1 ADR has no Consequences section finding(s) in ADR Quality — start with auth-provider-env-vars.md. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
2 of 4 build units (Python) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion · ×2fastmcp_slim/REDACTED:1
What to do
Resolve the 2 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with REDACTED (2). — One of this dimension's main actionable groups (2 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
99 % of calls cross a namespace and 0 % go through an interface, but 97 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.
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).
54 finding(s): 0 critical, 12 high, 38 medium, 4 low. 2 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 2 file(s) — `.github/agentic/scripts/agentic_stack.sh` (line 120), `fastmcp_slim/fastmcp/cli/apps_dev.py` — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 7 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
+ 6 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 REDACTED finding(s) charged to Static Analysis (SAST) — the other 2 are reported here at file:line but scored by D36 (supply-chain provenance), which charges them once. — One of this dimension's main actionable groups (3 issue-level, 1 of them charged here).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Resolve the 3 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 4 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (4). — One of this dimension's main actionable groups (4 warning-level).
Resolve the 1 Medium CVE 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.
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.
3 of 235 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is fastmcp_slim/fastmcp/server/auth/providers/propelauth.py. Counted over 235 of the 306 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 6 Change coupling finding(s) in Change Coupling — start with anthropic.py (2), claude_code.py, azure.py. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 2 Change-coupling hub finding(s) in Change Coupling — start with claude_desktop.py, REDACTED. — One of this dimension's main actionable groups (2 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.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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 2 platform declaration(s) and 3 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
`.version-badge` moves (`transition: box-shadow 0.2s, transform 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/css/version-badge.css:8
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
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.
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.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.
Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
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.
1 ADR-shaped document(s) detected by content — `dev-docs/v3-notes/auth-provider-env-vars.md`. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live — so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here.
What to do
Move ADRs under docs/adr/ (or docs/adrs/) and name them NNNN-title.md so they're easy to find.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
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's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Only 2/3 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `fastmcp_remote`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
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 26 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. — .github/workflows/agentic-checks.yml:4
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.
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.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`inspector` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs. — fastmcp_slim/fastmcp/cli/cli.py:134
`run` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs. — fastmcp_slim/fastmcp/cli/cli.py:395
`inspect` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs. — fastmcp_slim/fastmcp/cli/cli.py:780
`prepare` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs. — fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:109
What to do
Python: await the async equivalent (asyncio.sleep, an async HTTP client such as httpx.AsyncClient or aiohttp, asyncio.create_subprocess_exec), or move the blocking call off the loop with `await asyncio.to_thread(...)`; never call asyncio.run inside a coroutine — await the coroutine.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
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?
X17 · Uncapped recursion over a caller-supplied document2.5 / 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.
`dereference_refs` is public, takes a document from its caller (line 343) and hands it to `_strip_remote_refs`, which calls itself at line 231 (`_strip_remote_refs`) with a piece of `obj` (and at line 232, line 234) — and nowhere in `_strip_remote_refs` 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 `_strip_remote_refs` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/utilities/json_schema.py:231
`dereference_refs` is public, takes a document from its caller (line 343) and hands it to `_merge_ref_siblings`, which calls itself at line 499 (`_merge_ref_siblings`) with a piece of `original` (and at line 508) — and nowhere in `_merge_ref_siblings` 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 `_merge_ref_siblings` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/utilities/json_schema.py:499
`is_object_schema` is public and takes `schema: dict[str, Any]` from its caller, and it calls itself at line 1040 (`is_object_schema`) with a piece of `schema` — and nowhere in `is_object_schema` 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_object_schema` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/utilities/json_schema.py:1040
`is_class_member_of_type` is public and takes `cls: Any` from its caller, and it calls itself at line 153 (`is_class_member_of_type`) with a piece of `cls` (and at line 158) — and nowhere in `is_class_member_of_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_class_member_of_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/utilities/types.py:153
`convert_openapi_schema_to_json_schema` is public, takes a document from its caller (line 48) and hands it to `_scope_schemas`, which calls itself at line 373 (`_scope_schemas`) with a piece of `schema` (and at line 377) — and nowhere in `_scope_schemas` 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 `_scope_schemas` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py:373
`extract_output_schema_from_responses` is public, takes a document from its caller (line 892) and hands it to `_replace_ref_with_defs`, which calls itself at line 156 (`_replace_ref_with_defs`) with a piece of `info` (and at line 161, line 170, line 175) — and nowhere in `_replace_ref_with_defs` 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 `_replace_ref_with_defs` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/utilities/openapi/schemas.py:156
`annotate_payload_identities` is public, takes a document from its caller (line 91) and hands it to `_walk_tool_calls`, which calls itself at line 53 (`_walk_tool_calls`) with a piece of `node` (and at line 56) — and nowhere in `_walk_tool_calls` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_walk_tool_calls` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/server/providers/prefab_payload.py:53
`coerce_value` is public, takes a document from its caller (line 394) and hands it to `_schema_allows_null`, which calls itself at line 367 (`_schema_allows_null`) with a piece of `schema` — and nowhere in `_schema_allows_null` 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 `_schema_allows_null` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/cli/client.py:367
`coerce_value` is public, takes a document from its caller (line 394) and hands it to `_schema_may_be_string`, which calls itself at line 384 (`_schema_may_be_string`) with a piece of `schema` — and nowhere in `_schema_may_be_string` 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 `_schema_may_be_string` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — fastmcp_slim/fastmcp/cli/client.py:384
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 async functions that make a cancellable request accept or pass on an AbortSignal (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. 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 question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
`refreshTriage` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — status-site/app.js:480
`refreshBacklog` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — status-site/app.js:594
`refresh` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — status-site/operations.js:399
What to do
Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
`debug` at line 190 is called with an argument built by `"…".join(dependencies)` (line 190), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:190
`debug` at line 236 is called with an argument built by `"…".join(editable_paths)` (line 236), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:236
`debug` at line 195 is called with an argument built by `list(metadata.keys())` (line 197), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — fastmcp_slim/fastmcp/server/auth/providers/scalekit.py:195
`debug` at line 2406 is called with an argument built by `sorted(missing_scopes)` (line 2408), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — REDACTED:2406
`debug` at line 2911 is called with an argument built by `list(self._extra_token_params.keys())` (line 2914), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — REDACTED:2911
`debug` at line 630 is called with an argument built by `list(final_server_args)` (line 639), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — fastmcp_slim/fastmcp/cli/cli.py:630
`debug` at line 739 is called with an argument built by `"…".join(cmd)` (line 739), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — fastmcp_slim/fastmcp/cli/cli.py:739
`debug` at line 314 is called with an argument built by `"…".join(cmd)` (line 314), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — fastmcp_slim/fastmcp/cli/run.py:314
What to do
In Python, put the construction behind the logger's own check (`if logger.isEnabledFor(logging.DEBUG):`), or pass the collection itself with a `%s` placeholder (`logger.debug("Items %s", items)`) so the logging module renders it only when the record is emitted. The placeholder alone is not the fix when the argument is still built first: it defers the formatting, not a `json.dumps`, a `join` or a comprehension in the argument, and an f-string defers nothing at all.
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.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×5) — status-site/app.js:650, status-site/app.js:657, status-site/operations.js:25, …
`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. (×3) — fastmcp_slim/fastmcp/utilities/inspect.py:271, fastmcp_slim/fastmcp/tools/function_tool.py:124, fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:159
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`warning` at line 244 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. — fastmcp_slim/fastmcp/utilities/authorization.py:244
`warning` at line 47 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. — fastmcp_slim/fastmcp/utilities/openapi/formatters.py:47
`warning` at line 86 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. — fastmcp_slim/fastmcp/utilities/openapi/formatters.py:86
`warning` at line 490 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. — fastmcp_slim/fastmcp/tools/function_tool.py:490
`log` at line 1398 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.log(logging.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. — fastmcp_slim/fastmcp/server/context.py:1398
`log` at line 1611 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.log(logging.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. — fastmcp_slim/fastmcp/server/server.py:1611
`error` at line 1647 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. — fastmcp_slim/fastmcp/server/server.py:1647
`log` at line 1753 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.log(logging.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. — fastmcp_slim/fastmcp/server/server.py:1753
`exception` at line 1760 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog. — fastmcp_slim/fastmcp/server/server.py:1760
`exception` at line 1763 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog. — fastmcp_slim/fastmcp/server/server.py:1763
`log` at line 1820 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.log(logging.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. — fastmcp_slim/fastmcp/server/server.py:1820
`exception` at line 1825 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog. — fastmcp_slim/fastmcp/server/server.py:1825
`exception` at line 1828 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog. — fastmcp_slim/fastmcp/server/server.py:1828
`log` at line 1919 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.log(logging.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. — fastmcp_slim/fastmcp/server/server.py:1919
`exception` at line 1924 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog. — fastmcp_slim/fastmcp/server/server.py:1924
`exception` at line 1927 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog. — fastmcp_slim/fastmcp/server/server.py:1927
`warning` at line 2509 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. — fastmcp_slim/fastmcp/server/server.py:2509
`warning` at line 216 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. — fastmcp_slim/fastmcp/server/providers/aggregate.py:216
`warning` at line 226 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. — fastmcp_slim/fastmcp/server/providers/aggregate.py:226
`warning` at line 250 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. — fastmcp_slim/fastmcp/server/providers/aggregate.py:250
`debug` at line 279 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. — fastmcp_slim/fastmcp/server/providers/openapi/components.py:279
`warning` at line 256 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. — fastmcp_slim/fastmcp/server/middleware/authorization.py:256
`warning` at line 349 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. — fastmcp_slim/fastmcp/server/middleware/authorization.py:349
`warning` at line 478 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. — fastmcp_slim/fastmcp/server/middleware/authorization.py:478
`error` at line 80 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. — fastmcp_slim/fastmcp/server/middleware/error_handling.py:80
`error` at line 89 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. — fastmcp_slim/fastmcp/server/middleware/error_handling.py:89
`warning` at line 224 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. — fastmcp_slim/fastmcp/server/middleware/error_handling.py:224
`warning` at line 42 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. — fastmcp_slim/fastmcp/server/middleware/logging.py:42
`log` at line 47 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.log(logging.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. — fastmcp_slim/fastmcp/server/middleware/timing.py:47
`log` at line 53 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.log(logging.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. — fastmcp_slim/fastmcp/server/middleware/timing.py:53
`log` at line 99 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.log(logging.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. — fastmcp_slim/fastmcp/server/middleware/timing.py:99
`log` at line 105 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.log(logging.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. — fastmcp_slim/fastmcp/server/middleware/timing.py:105
`debug` at line 1126 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. — fastmcp_slim/fastmcp/cli/apps_dev.py:1126
`debug` at line 1152 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. — fastmcp_slim/fastmcp/cli/apps_dev.py:1152
`error` at line 1747 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. — fastmcp_slim/fastmcp/cli/apps_dev.py:1747
`info` at line 1753 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. — fastmcp_slim/fastmcp/cli/apps_dev.py:1753
Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 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 — 26 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 6 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 'redis.credentials' (fastmcp_tasks/fastmcp_tasks/extension.py:70) 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 'redis.credentials' (fastmcp_tasks/fastmcp_tasks/extension.py:70) 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 'redis.credentials' (fastmcp_tasks/fastmcp_tasks/extension.py:70) 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 — 50 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AX1 Captive dependencies — Not 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.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~153255 lines of test source are present (.py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D12 Dependency Hygiene — Dependency currency not established — no declaration carries an exact pin to grade
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 — D21 withholds its case and prefix conventions rows: 1 candidate(s) found and not reported.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .py source were not judged.
D25 ADR Conformance — None of 0 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
D32 Data Compliance (PII/GDPR) — 1 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
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.
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (134 value object(s))
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala and Rust, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — no outbound HTTP usage detected — no HTTP client call or construction in the JavaScript/TypeScript, Python source (service entry point: fastmcp_slim/fastmcp/utilities/asgi_transport.py:44 (from starlette))
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X16 Unfloored truncation loop — X16 reached only 2% of this repository's production lines — python (94,146 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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.
Hotspot: fastmcp_slim/fastmcp/utilities/openapi/schemas.py fastmcp_slim/fastmcp/utilities/openapi/schemas.py:528— fastmcp_slim/fastmcp/utilities/openapi/schemas.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in schemas._combine_schemas_and_map_params at line 528. 5 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/openapi/schemas.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: fastmcp_slim/fastmcp/utilities/json_schema_type.py fastmcp_slim/fastmcp/utilities/json_schema_type.py:1067— fastmcp_slim/fastmcp/utilities/json_schema_type.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in json_schema_type._convert_schema at line 1067. 12 of those changes were fix/bug commits, and the other 13 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/json_schema_type.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: fastmcp_slim/fastmcp/server/server.py fastmcp_slim/fastmcp/server/server.py:442— fastmcp_slim/fastmcp/server/server.py changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in FastMCP.__init__ at line 442. 8 of those changes were fix/bug commits, and the other 18 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/server/server.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:2223— REDACTED changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in OAuthProxy.load_access_token at line 2223. 9 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-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06: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: fastmcp_slim/fastmcp/utilities/openapi/director.py fastmcp_slim/fastmcp/utilities/openapi/director.py:286— fastmcp_slim/fastmcp/utilities/openapi/director.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in RequestDirector.build at line 286. 9 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-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/openapi/director.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: fastmcp_slim/fastmcp/cli/cli.py fastmcp_slim/fastmcp/cli/cli.py:395— fastmcp_slim/fastmcp/cli/cli.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in cli.run at line 395. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/cli/cli.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: fastmcp_slim/fastmcp/resources/template.py fastmcp_slim/fastmcp/resources/template.py:713— fastmcp_slim/fastmcp/resources/template.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in FunctionResourceTemplate.from_function at line 713. 7 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/resources/template.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: .github/agentic/flows/agentic_stack_controller.py .github/agentic/flows/agentic_stack_controller.py:58— .github/agentic/flows/agentic_stack_controller.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in agentic_stack_controller.run_batch at line 58. 3 of those changes were fix/bug commits, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- .github/agentic/flows/agentic_stack_controller.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: fastmcp_slim/fastmcp/client/client.py fastmcp_slim/fastmcp/client/client.py:424— fastmcp_slim/fastmcp/client/client.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Client.__init__ at line 424. 7 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-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/client/client.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: fastmcp_slim/fastmcp/tools/tool_transform.py fastmcp_slim/fastmcp/tools/tool_transform.py:532— fastmcp_slim/fastmcp/tools/tool_transform.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in TransformedTool.from_tool at line 532. 6 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-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/tools/tool_transform.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: fastmcp_slim/fastmcp/client/transports/stdio.py fastmcp_slim/fastmcp/client/transports/stdio.py:103— fastmcp_slim/fastmcp/client/transports/stdio.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in StdioTransport.connect at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/client/transports/stdio.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: .github/agentic/flows/agentic_triage.py .github/agentic/flows/agentic_triage.py:232— .github/agentic/flows/agentic_triage.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in agentic_triage.finish at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- .github/agentic/flows/agentic_triage.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: fastmcp_slim/fastmcp/prompts/function_prompt.py fastmcp_slim/fastmcp/prompts/function_prompt.py:76— fastmcp_slim/fastmcp/prompts/function_prompt.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in FunctionPrompt.from_function at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/prompts/function_prompt.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: fastmcp_slim/fastmcp/tools/function_parsing.py fastmcp_slim/fastmcp/tools/function_parsing.py:229— fastmcp_slim/fastmcp/tools/function_parsing.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ParsedFunction.from_function at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/tools/function_parsing.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: fastmcp_slim/fastmcp/server/mixins/mcp_operations.py fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:284— fastmcp_slim/fastmcp/server/mixins/mcp_operations.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MCPOperationsMixin._on_call_tool at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/server/mixins/mcp_operations.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: fastmcp_slim/fastmcp/client/mixins/tools.py fastmcp_slim/fastmcp/client/mixins/tools.py:396— fastmcp_slim/fastmcp/client/mixins/tools.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in tools._parse_call_tool_result at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/client/mixins/tools.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:713— REDACTED changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MultiAuth.__init__ at line 713. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06: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: fastmcp_slim/fastmcp/server/auth/oidc_proxy.py fastmcp_slim/fastmcp/server/auth/oidc_proxy.py:263— fastmcp_slim/fastmcp/server/auth/oidc_proxy.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OIDCProxy.__init__ at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/oidc_proxy.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: fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py:48— fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in json_schema_converter.convert_openapi_schema_to_json_schema at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: fastmcp_slim/fastmcp/cli/run.py fastmcp_slim/fastmcp/cli/run.py:141— fastmcp_slim/fastmcp/cli/run.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in run.run_command at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/cli/run.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: .github/agentic/flows/agentic_review_publication.py .github/agentic/flows/agentic_review_publication.py:97— .github/agentic/flows/agentic_review_publication.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in agentic_review_publication.post_review at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- .github/agentic/flows/agentic_review_publication.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: fastmcp_slim/fastmcp/utilities/cli.py fastmcp_slim/fastmcp/utilities/cli.py:33— fastmcp_slim/fastmcp/utilities/cli.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in cli.load_and_merge_config at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/cli.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:122— REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in GitHubTokenVerifier.verify_token at line 122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06: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: fastmcp_slim/fastmcp/server/auth/cimd.py fastmcp_slim/fastmcp/server/auth/cimd.py:536— fastmcp_slim/fastmcp/server/auth/cimd.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CIMDAssertionValidator.validate_assertion at line 536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/cimd.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: fastmcp_slim/fastmcp/server/auth/providers/google.py fastmcp_slim/fastmcp/server/auth/providers/google.py:117— fastmcp_slim/fastmcp/server/auth/providers/google.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in GoogleTokenVerifier.verify_token at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/providers/google.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
FileTooLong: REDACTED REDACTED— FileTooLong — 1573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1073 over it, 3.15× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: server/server.py fastmcp_slim/fastmcp/server/server.py— FileTooLong — 1415 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 915 over it, 2.83× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: cli/apps_dev.py fastmcp_slim/fastmcp/cli/apps_dev.py— FileTooLong — 1294 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 794 over it, 2.59× 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: providers/proxy.py fastmcp_slim/fastmcp/server/providers/proxy.py— FileTooLong — 1238 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 738 over it, 2.48× 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: utilities/json_schema_type.py fastmcp_slim/fastmcp/utilities/json_schema_type.py— FileTooLong — 1018 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 518 over it, 2.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: client/client.py fastmcp_slim/fastmcp/client/client.py— FileTooLong — 875 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 375 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: cli/client.py fastmcp_slim/fastmcp/cli/client.py— FileTooLong — 794 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 294 over it, 1.59× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: cli/cli.py fastmcp_slim/fastmcp/cli/cli.py— FileTooLong — 782 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 282 over it, 1.56× 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: server/dependencies.py fastmcp_slim/fastmcp/server/dependencies.py— FileTooLong — 705 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 205 over it, 1.41× 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: tools/tool_transform.py fastmcp_slim/fastmcp/tools/tool_transform.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: server/context.py fastmcp_slim/fastmcp/server/context.py— FileTooLong — 661 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 161 over it, 1.32× 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 — 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.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: openapi/schemas.py fastmcp_slim/fastmcp/utilities/openapi/schemas.py— FileTooLong — 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.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: cli/generate.py fastmcp_slim/fastmcp/cli/generate.py— FileTooLong — 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.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: openapi/parser.py fastmcp_slim/fastmcp/utilities/openapi/parser.py— FileTooLong — 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24× 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: status-site/app.js status-site/app.js— FileTooLong — 578 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 78 over it, 1.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: resources/template.py fastmcp_slim/fastmcp/resources/template.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: openapi/director.py fastmcp_slim/fastmcp/utilities/openapi/director.py— FileTooLong — 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: utilities/json_schema.py fastmcp_slim/fastmcp/utilities/json_schema.py— FileTooLong — 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: server/http.py fastmcp_slim/fastmcp/server/http.py— FileTooLong — 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 over it, 1.01× 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.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×9
Recursive walk over a caller-supplied document has no depth cap fastmcp_slim/fastmcp/utilities/json_schema.py:231— `dereference_refs` is public, takes a document from its caller (line 343) and hands it to `_strip_remote_refs`, which calls itself at line 231 (`_strip_remote_refs`) with a piece of `obj` (and at line 232, line 234) — and nowhere in `_strip_remote_refs` 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 `_strip_remote_refs` 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 fastmcp_slim/fastmcp/utilities/json_schema.py:499— `dereference_refs` is public, takes a document from its caller (line 343) and hands it to `_merge_ref_siblings`, which calls itself at line 499 (`_merge_ref_siblings`) with a piece of `original` (and at line 508) — and nowhere in `_merge_ref_siblings` 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 `_merge_ref_siblings` 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 fastmcp_slim/fastmcp/utilities/json_schema.py:1040— `is_object_schema` is public and takes `schema: dict[str, Any]` from its caller, and it calls itself at line 1040 (`is_object_schema`) with a piece of `schema` — and nowhere in `is_object_schema` 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_object_schema` 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 fastmcp_slim/fastmcp/utilities/types.py:153— `is_class_member_of_type` is public and takes `cls: Any` from its caller, and it calls itself at line 153 (`is_class_member_of_type`) with a piece of `cls` (and at line 158) — and nowhere in `is_class_member_of_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_class_member_of_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 fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py:373— `convert_openapi_schema_to_json_schema` is public, takes a document from its caller (line 48) and hands it to `_scope_schemas`, which calls itself at line 373 (`_scope_schemas`) with a piece of `schema` (and at line 377) — and nowhere in `_scope_schemas` 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 `_scope_schemas` 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 fastmcp_slim/fastmcp/utilities/openapi/schemas.py:156— `extract_output_schema_from_responses` is public, takes a document from its caller (line 892) and hands it to `_replace_ref_with_defs`, which calls itself at line 156 (`_replace_ref_with_defs`) with a piece of `info` (and at line 161, line 170, line 175) — and nowhere in `_replace_ref_with_defs` 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 `_replace_ref_with_defs` 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 fastmcp_slim/fastmcp/server/providers/prefab_payload.py:53— `annotate_payload_identities` is public, takes a document from its caller (line 91) and hands it to `_walk_tool_calls`, which calls itself at line 53 (`_walk_tool_calls`) with a piece of `node` (and at line 56) — and nowhere in `_walk_tool_calls` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_walk_tool_calls` 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 fastmcp_slim/fastmcp/cli/client.py:367— `coerce_value` is public, takes a document from its caller (line 394) and hands it to `_schema_allows_null`, which calls itself at line 367 (`_schema_allows_null`) with a piece of `schema` — and nowhere in `_schema_allows_null` 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 `_schema_allows_null` 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 fastmcp_slim/fastmcp/cli/client.py:384— `coerce_value` is public, takes a document from its caller (line 394) and hands it to `_schema_may_be_string`, which calls itself at line 384 (`_schema_may_be_string`) with a piece of `schema` — and nowhere in `_schema_may_be_string` 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 `_schema_may_be_string` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Repeated repair: fastmcp_slim/fastmcp/utilities/json_schema.py fastmcp_slim/fastmcp/utilities/json_schema.py:993— fastmcp_slim/fastmcp/utilities/json_schema.py changed 8 times in last 90 days and 5 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 json_schema.is_object_schema at line 993), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Revert 12 contributions merged without enough review (#6434)”; “fix: preserve referenced schema definitions (#5588)”; “fix(proxy): relay non-object tool results across MCP versions (#5763)”; “fix(json-schema): decode RFC 6901 escapes when extracting $defs names (#6180)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/json_schema.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: fastmcp_slim/fastmcp/client/transports/base.py fastmcp_slim/fastmcp/client/transports/base.py:89— fastmcp_slim/fastmcp/client/transports/base.py changed 5 times in last 90 days and 5 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 VersionAwareClientSession._absorb_tool_listing at line 89), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(client): stop validating version-pinned call_tool results against the highest version's schema (#5725)”; “fix(client): preserve a caller-provided OAuth httpx client factory when verify is set (#5849)”; “Fix static checks broken by ty 0.0.89 and pydantic 2.14 (#6001)”; “fix: support modern protocol in multi-server clients (#4893)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/client/transports/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: fastmcp_slim/fastmcp/client/transports/http.py fastmcp_slim/fastmcp/client/transports/http.py:113— fastmcp_slim/fastmcp/client/transports/http.py changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is StreamableHttpTransport._set_auth at line 113), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(client): preserve a caller-provided OAuth httpx client factory when verify is set (#5849)”; “fix(client): forward max_sse_event_size through StreamableHttpTransport (#6016)”; “Fix static checks broken by ty 0.0.89 and pydantic 2.14 (#6001)”; “Fix proxy forwarding of MCP transport headers (#4853)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/client/transports/http.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: fastmcp_slim/fastmcp/server/telemetry.py fastmcp_slim/fastmcp/server/telemetry.py:255— fastmcp_slim/fastmcp/server/telemetry.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 10 (its worst body is telemetry.server_span at line 255), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix #5563: OTel: prefer `AccessToken.subject` over `client_id` for `enduser.id` (#5565)”; “fix(telemetry): record exceptions once per span (#5861)”; “fix(telemetry): record mounted and nested server spans as INTERNAL (#6252)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/server/telemetry.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: fastmcp_slim/fastmcp/server/low_level.py fastmcp_slim/fastmcp/server/low_level.py:179— fastmcp_slim/fastmcp/server/low_level.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 8 (its worst body is FastMCPServerMiddleware.__call__ at line 179), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Revert 12 contributions merged without enough review (#6434)”; “fix(server): serve Mcp-Param validation from a wire-schema cache (#5666)”; “Fix static checks broken by ty 0.0.89 and pydantic 2.14 (#6001)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/server/low_level.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: fastmcp_tasks/fastmcp_tasks/handlers.py fastmcp_tasks/fastmcp_tasks/handlers.py:250— fastmcp_tasks/fastmcp_tasks/handlers.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 handlers.tasks_get at line 250), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Revert 12 contributions merged without enough review (#6434)”; “fix(tasks): retain results after tool removal (#5507)”; “fix(tasks): keep stored arguments alive with the other per-task keys (#5144)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_tasks/fastmcp_tasks/handlers.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: fastmcp_slim/fastmcp/server/transforms/search/bm25.py fastmcp_slim/fastmcp/server/transforms/search/bm25.py:57— fastmcp_slim/fastmcp/server/transforms/search/bm25.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is _BM25Index.query at line 57), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(search): rebuild the BM25 index when the tool name set changes (#6282)”; “fix: return current tool schemas from cached BM25 searches (#5153)”; “fix: support Unicode tokens in BM25 search (#4889)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-17 02:14:03 -06:00' --until='2026-11-15 02:14:03 -06:00' --full-history --no-merges -- fastmcp_slim/fastmcp/server/transforms/search/bm25.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.
Change coupling: claude_code.py ↔ cursor.py fastmcp_slim/fastmcp/cli/install/claude_code.py:1— `fastmcp_slim/fastmcp/cli/install/claude_code.py` and `fastmcp_slim/fastmcp/cli/install/cursor.py` change together 64% of the time (7 of the 11 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 `ea47d232` Refactor Environment to support multiple runtime types (#1673) (at that commit the files were still `src/fastmcp/cli/install/claude_code.py` and `src/fastmcp/cli/install/cursor.py`); `465e4033` Improve fastmcp.json environment configuration and project-based depl… (at that commit the files were still `src/fastmcp/cli/install/claude_code.py` and `src/fastmcp/cli/install/cursor.py`); `afedabea` Fix and centralize CLI path resolution (#1590) (at that commit the files were still `src/fastmcp/cli/install/claude_code.py` and `src/fastmcp/cli/install/cursor.py`) — run `git show` on any of them.
Change coupling: anthropic.py ↔ openai.py fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:1— `fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py` and `fastmcp_slim/fastmcp/client/sampling/handlers/openai.py` change together 55% of the time (6 of the 11 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 6 shared commits counted here, the most recent 3 are `99df3146` Preserve or explicitly reject images in sampling tool results (#5554); `1b1bcf7f` Report the stop reason from sampling handlers when no tools are offer…; `200d79e7` Enable PERF and T20 ruff rules (#3845) (at that commit the files were still `src/fastmcp/client/sampling/handlers/anthropic.py` and `src/fastmcp/client/sampling/handlers/openai.py`) — run `git show` on any of them.
Change coupling: anthropic.py ↔ google_genai.py fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:1— `fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py` and `fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py` change together 55% of the time (6 of the 11 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 6 shared commits counted here, the most recent 3 are `99df3146` Preserve or explicitly reject images in sampling tool results (#5554); `1b1bcf7f` Report the stop reason from sampling handlers when no tools are offer…; `18aa6a09` Document sampling handlers on both protocol routes; qualify log-level… — run `git show` on any of them.
Change coupling: azure.py ↔ google.py fastmcp_slim/fastmcp/server/auth/providers/azure.py:1— `fastmcp_slim/fastmcp/server/auth/providers/azure.py` and `fastmcp_slim/fastmcp/server/auth/providers/google.py` change together 52% of the time (11 of the 21 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 11 shared commits counted here, the most recent 3 are `7c98326d` Forward enable_cimd to OAuthProxy in all provider subclasses (#3608) (at that commit the files were still `src/fastmcp/server/auth/providers/azure.py` and `src/fastmcp/server/auth/providers/google.py`); `ea529f6a` feat: make upstream_client_secret optional in OAuthProxy (#3486) (at that commit the files were still `src/fastmcp/server/auth/providers/azure.py` and `src/fastmcp/server/auth/providers/google.py`); `9a076cd5` Update docstrings (at that commit the files were still `src/fastmcp/server/auth/providers/azure.py` and `src/fastmcp/server/auth/providers/google.py`) — run `git show` on any of them.
Change coupling: cli.py ↔ cursor.py fastmcp_slim/fastmcp/cli/cli.py:1— `fastmcp_slim/fastmcp/cli/cli.py` and `fastmcp_slim/fastmcp/cli/install/cursor.py` change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `5f8461b7` Remove shell=True from Windows subprocess calls (#2091) (at that commit the files were still `src/fastmcp/cli/cli.py` and `src/fastmcp/cli/install/cursor.py`); `ea47d232` Refactor Environment to support multiple runtime types (#1673) (at that commit the files were still `src/fastmcp/cli/cli.py` and `src/fastmcp/cli/install/cursor.py`); `465e4033` Improve fastmcp.json environment configuration and project-based depl… (at that commit the files were still `src/fastmcp/cli/cli.py` and `src/fastmcp/cli/install/cursor.py`) — run `git show` on any of them.
Change coupling: __init__.py ↔ __init__.py fastmcp_slim/fastmcp/prompts/__init__.py:1— `fastmcp_slim/fastmcp/prompts/__init__.py` and `fastmcp_slim/fastmcp/resources/__init__.py` change together 50% of the time (5 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 — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `ea7fb8cb` Remove 3.x-era compatibility shims (#4661); `daa2dace` Add standalone decorators and eliminate fastmcp.fs module (#2832) (at that commit the files were still `src/fastmcp/prompts/__init__.py` and `src/fastmcp/resources/__init__.py`); `3ea0685a` Expand support for various method interactions (at that commit the files were still `src/fastmcp/prompts/__init__.py` and `src/fastmcp/resources/__init__.py`) — run `git show` on any of them.
Duplicated block (8 lines × 2) fastmcp_slim/fastmcp/cli/client.py:217— fastmcp_slim/fastmcp/cli/client.py:217-224 | fastmcp_slim/fastmcp/cli/client.py:231-238 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) fastmcp_slim/fastmcp/server/providers/proxy.py:1086— fastmcp_slim/fastmcp/server/providers/proxy.py:1086-1093 | fastmcp_slim/fastmcp/server/providers/proxy.py:1251-1258 — 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 `fastmcp_slim/fastmcp/server/providers/proxy.py:1086` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) fastmcp_slim/fastmcp/utilities/openapi/formatters.py:221— fastmcp_slim/fastmcp/utilities/openapi/formatters.py:221-228 | fastmcp_slim/fastmcp/utilities/openapi/formatters.py:231-238 — 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) examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:185— examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:185-192 | examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:209-217 — 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) examples/persistent_state/client.py:31— examples/persistent_state/client.py:31-38 | examples/persistent_state/client_stdio.py:36-43 — before extracting anything, compare `examples/persistent_state/client.py` and `examples/persistent_state/client_stdio.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 (8 lines × 2) scripts/auto_close_duplicates.py:67— scripts/auto_close_duplicates.py:67-74 | scripts/auto_close_needs_mre.py:63-70 — 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 (17 lines × 2) fastmcp_slim/fastmcp/cli/install/claude_code.py:105— fastmcp_slim/fastmcp/cli/install/claude_code.py:105-121 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:102-118 — before extracting anything, compare `fastmcp_slim/fastmcp/cli/install/claude_code.py` and `fastmcp_slim/fastmcp/cli/install/gemini_cli.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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 `fastmcp_slim/fastmcp/cli/install/claude_code.py:105` 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 (17 lines × 2) REDACTED:108— REDACTED:108-124 | REDACTED:128-144 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17 lines × 2) fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:182— fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:182-198 | fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:254-270 — 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 `fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:182` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) fastmcp_slim/fastmcp/server/mixins/transport.py:433— fastmcp_slim/fastmcp/server/mixins/transport.py:433-449 | fastmcp_slim/fastmcp/server/mixins/transport.py:462-478 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:191— fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:191-207 | fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:214-231 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) fastmcp_slim/fastmcp/cli/client.py:648— fastmcp_slim/fastmcp/cli/client.py:648-659 | fastmcp_slim/fastmcp/cli/client.py:740-751 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) fastmcp_slim/fastmcp/cli/install/claude_code.py:141— fastmcp_slim/fastmcp/cli/install/claude_code.py:141-152 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:138-149 — before extracting anything, compare `fastmcp_slim/fastmcp/cli/install/claude_code.py` and `fastmcp_slim/fastmcp/cli/install/gemini_cli.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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 (12 lines × 2) fastmcp_slim/fastmcp/cli/run.py:201— fastmcp_slim/fastmcp/cli/run.py:201-215 | fastmcp_slim/fastmcp/cli/run.py:224-235 — 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 `fastmcp_slim/fastmcp/cli/run.py:201` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:23— examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:23-34 | examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:61-72 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) examples/fastmcp_config_demo/server.py:21— examples/fastmcp_config_demo/server.py:21-34 | examples/screenshot.py:23-34 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) fastmcp_slim/fastmcp/cli/cli.py:614— fastmcp_slim/fastmcp/cli/cli.py:614-622 | fastmcp_slim/fastmcp/cli/run.py:190-198 — 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) fastmcp_slim/fastmcp/cli/discovery.py:151— fastmcp_slim/fastmcp/cli/discovery.py:151-159 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:33-41 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) fastmcp_slim/fastmcp/utilities/types.py:335— fastmcp_slim/fastmcp/utilities/types.py:335-343 | fastmcp_slim/fastmcp/utilities/types.py:402-410 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) fastmcp_slim/fastmcp/resources/base.py:455— fastmcp_slim/fastmcp/resources/base.py:455-463 | fastmcp_slim/fastmcp/resources/template.py:595-603 — 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 `fastmcp_slim/fastmcp/resources/base.py:455` 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) fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:594— fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:594-608 | fastmcp_slim/fastmcp/server/providers/wrapped_provider.py:118-126 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Swallowed exception (empty catch) status-site/app.js:650— 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) status-site/app.js:657— 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) status-site/operations.js:25— 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) status-site/operations.js:429— 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) status-site/operations.js:436— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×4
Duplicated block (15 lines × 2) fastmcp_slim/fastmcp/resources/function_resource.py:254— fastmcp_slim/fastmcp/resources/function_resource.py:254-268 | fastmcp_slim/fastmcp/tools/function_tool.py:653-667 — 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 `fastmcp_slim/fastmcp/resources/function_resource.py:254` 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 × 2) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:56— fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:56-70 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:89-103 — 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 `fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:56` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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) examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:44— examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:44-58 | examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:78-92 — 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) scripts/auto_close_duplicates.py:343— scripts/auto_close_duplicates.py:343-357 | scripts/auto_close_needs_mre.py:332-346 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) fastmcp_slim/fastmcp/server/auth/identity_assertion.py:510— fastmcp_slim/fastmcp/server/auth/identity_assertion.py:510-519 | REDACTED:181-190 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `claims` to `dict` in one and `dict[str, Any]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (10 lines × 2) fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:365— fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:365-374 | fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:381-390 — 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) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:65— fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:65-74 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:81-90 — 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) fastmcp_slim/fastmcp/server/transforms/prompts_as_tools.py:62— fastmcp_slim/fastmcp/server/transforms/prompts_as_tools.py:62-71 | fastmcp_slim/fastmcp/server/transforms/resources_as_tools.py:65-74 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: `FastMCP` names `fastmcp` in one and `fastmcp.server.server` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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) fastmcp_slim/fastmcp/utilities/types.py:295— fastmcp_slim/fastmcp/utilities/types.py:295-301 | fastmcp_slim/fastmcp/utilities/types.py:375-381 — 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) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:46— fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:46-52 | fastmcp_slim/fastmcp/tools/function_parsing.py:48-54 — 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) examples/persistent_state/client.py:75— examples/persistent_state/client.py:75-81 | examples/persistent_state/client_stdio.py:78-84 — before extracting anything, compare `examples/persistent_state/client.py` and `examples/persistent_state/client_stdio.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 (7 lines × 2) scripts/auto_close_duplicates.py:189— scripts/auto_close_duplicates.py:189-195 | scripts/auto_close_needs_mre.py:245-252 — 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 `scripts/auto_close_needs_mre.py:245` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Sync-over-async blocking fastmcp_slim/fastmcp/cli/cli.py:134— `inspector` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs.
Sync-over-async blocking fastmcp_slim/fastmcp/cli/cli.py:395— `run` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs.
Sync-over-async blocking fastmcp_slim/fastmcp/cli/cli.py:780— `inspect` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs.
Sync-over-async blocking fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:109— `prepare` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs.
TooManyMethods: FastMCP fastmcp_slim/fastmcp/server/server.py:434— TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× 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: Client fastmcp_slim/fastmcp/client/client.py:270— 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: Provider fastmcp_slim/fastmcp/server/providers/base.py:75— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× 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 (5 lines × 2) fastmcp_slim/fastmcp/server/auth/cimd.py:57— fastmcp_slim/fastmcp/server/auth/cimd.py:57-61 | REDACTED:54-58 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `key_data` to `dict[str, Any]` in one and `JWKKeyData` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (5 lines × 2) fastmcp_slim/fastmcp/client/client.py:1641— fastmcp_slim/fastmcp/client/client.py:1641-1645 | fastmcp_slim/fastmcp/server/server.py:2641-2646 — 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 (5 lines × 2) examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:199— examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:199-203 | examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:211-217 — 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.
X2 · Cancellation propagation· Async function without AbortSignal · ×3
Async function without AbortSignal: refreshTriage status-site/app.js:480— `refreshTriage` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: refreshBacklog status-site/app.js:594— `refreshBacklog` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: refresh status-site/operations.js:399— `refresh` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Swallowed exception (caught, then discarded) fastmcp_slim/fastmcp/utilities/inspect.py:271— `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) fastmcp_slim/fastmcp/tools/function_tool.py:124— `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) fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:159— `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.
TodoComment fastmcp_slim/fastmcp/_compat.py:27— # TODO(sdk-v2-migration): remove once user code has migrated off camelCase reads. — 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 fastmcp_slim/fastmcp/client/transports/stdio.py:186— # TODO(ty): remove when ty supports Unpack[TypedDict] inference — 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.
FunctionTooLong: operations.render status-site/operations.js:269— FunctionTooLong — render runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: app.backlog status-site/app.js:145— FunctionTooLong — backlog runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Change-coupling hub: claude_desktop.py → cli.py, claude_code.py, cursor.py, run.py fastmcp_slim/fastmcp/cli/install/claude_desktop.py— `fastmcp_slim/fastmcp/cli/install/claude_desktop.py` changes together with 4 other files — `fastmcp_slim/fastmcp/cli/cli.py`, `fastmcp_slim/fastmcp/cli/install/claude_code.py`, `fastmcp_slim/fastmcp/cli/install/cursor.py`, `fastmcp_slim/fastmcp/cli/run.py` — none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 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 4.
Change-coupling hub: REDACTED → azure.py, google.py, REDACTED REDACTED— `REDACTED` changes together with 3 other files — `fastmcp_slim/fastmcp/server/auth/providers/azure.py`, `fastmcp_slim/fastmcp/server/auth/providers/google.py`, `REDACTED` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 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 3.
D4 · Code Duplication· Edited copy of a member (42 corresponding lines) · ×2
Edited copy of a member (42 corresponding lines) fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:134— fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:134-181 | fastmcp_slim/fastmcp/client/sampling/handlers/openai.py:136-177 — These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (42 corresponding lines) fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:395— fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:395-440 | fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:447-488 — These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×2
Edited copy of a member (16 corresponding lines) .github/agentic/flows/agentic_artifacts.py:55— .github/agentic/flows/agentic_artifacts.py:55-79 | REDACTED:209-224 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:379— fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:379-394 | fastmcp_slim/fastmcp/client/sampling/handlers/openai.py:427-445 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×2
Edited copy of a member (14 corresponding lines) fastmcp_slim/fastmcp/resources/base.py:450— fastmcp_slim/fastmcp/resources/base.py:450-463 | fastmcp_slim/fastmcp/resources/template.py:590-603 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) fastmcp_slim/fastmcp/cli/discovery.py:150— fastmcp_slim/fastmcp/cli/discovery.py:150-163 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:21-46 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 24+ corresponding lines) · ×2
Edited copies of one member (3 members, 24+ corresponding lines) fastmcp_slim/fastmcp/server/middleware/caching.py:377— fastmcp_slim/fastmcp/server/middleware/caching.py:377-402 | fastmcp_slim/fastmcp/server/middleware/caching.py:410-435 | fastmcp_slim/fastmcp/server/middleware/caching.py:443-466 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 24+ corresponding lines) fastmcp_slim/fastmcp/server/providers/base.py:349— fastmcp_slim/fastmcp/server/providers/base.py:349-374 | fastmcp_slim/fastmcp/server/providers/base.py:389-417 | fastmcp_slim/fastmcp/server/providers/base.py:432-455 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×2
Edited copy of a member (19 corresponding lines) fastmcp_slim/fastmcp/cli/apps_dev.py:1109— fastmcp_slim/fastmcp/cli/apps_dev.py:1109-1127 | fastmcp_slim/fastmcp/cli/apps_dev.py:1131-1153 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) fastmcp_slim/fastmcp/server/providers/base.py:472— fastmcp_slim/fastmcp/server/providers/base.py:472-491 | fastmcp_slim/fastmcp/server/providers/base.py:566-584 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×2
Edited copy of a member (18 corresponding lines) fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:319— fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:319-336 | fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:341-365 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:187— fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:187-204 | fastmcp_slim/fastmcp/client/sampling/handlers/openai.py:183-202 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×2
Edited copy of a member (11 corresponding lines) fastmcp_tasks/fastmcp_tasks/input_store.py:285— fastmcp_tasks/fastmcp_tasks/input_store.py:285-302 | fastmcp_tasks/fastmcp_tasks/input_store.py:308-318 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) fastmcp_slim/fastmcp/tools/tool_transform.py:1009— fastmcp_slim/fastmcp/tools/tool_transform.py:1009-1019 | fastmcp_slim/fastmcp/tools/tool_transform.py:1025-1035 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 15+ corresponding lines) · ×2
Edited copies of one member (3 members, 15+ corresponding lines) fastmcp_slim/fastmcp/server/providers/proxy.py:399— fastmcp_slim/fastmcp/server/providers/proxy.py:399-413 | fastmcp_slim/fastmcp/server/providers/proxy.py:572-587 | fastmcp_slim/fastmcp/server/providers/proxy.py:690-706 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 15+ corresponding lines) fastmcp_slim/fastmcp/resources/base.py:364— fastmcp_slim/fastmcp/resources/base.py:364-381 | fastmcp_slim/fastmcp/resources/template.py:492-506 | fastmcp_slim/fastmcp/tools/base.py:418-436 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×2
Edited copy of a member (6 corresponding lines) fastmcp_slim/fastmcp/server/auth/cimd.py:56— fastmcp_slim/fastmcp/server/auth/cimd.py:56-61 | REDACTED:51-58 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) fastmcp_slim/fastmcp/server/auth/cimd.py:521— fastmcp_slim/fastmcp/server/auth/cimd.py:521-527 | fastmcp_slim/fastmcp/server/auth/identity_assertion.py:245-250 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×2
Edited copy of a member (7 corresponding lines) REDACTED:234— REDACTED:234-250 | .github/agentic/flows/agentic_triage.py:90-96 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) fastmcp_slim/fastmcp/apps/config.py:180— fastmcp_slim/fastmcp/apps/config.py:180-187 | fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py:64-70 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (26 lines × 2) fastmcp_slim/fastmcp/cli/install/claude_desktop.py:88— fastmcp_slim/fastmcp/cli/install/claude_desktop.py:88-113 | fastmcp_slim/fastmcp/cli/install/cursor.py:102-127 — 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 (26 lines × 2) fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:366— fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:366-391 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:66-91 — 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 `fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:366` 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–26 lines × 2) fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:670— fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:670-695 | fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:716-735 — 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 `fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:716` 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–26 lines × 2) REDACTED:123— REDACTED:123-142 | fastmcp_slim/fastmcp/server/auth/providers/google.py:118-143 — 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 (18 lines × 2) fastmcp_slim/fastmcp/cli/apps_dev.py:1037— fastmcp_slim/fastmcp/cli/apps_dev.py:1037-1054 | fastmcp_slim/fastmcp/cli/apps_dev.py:1061-1078 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `fastmcp_slim/fastmcp/cli/apps_dev.py:1036` calls `Pages` and `fastmcp_slim/fastmcp/cli/apps_dev.py:1060` 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 (18 lines × 2) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:168— fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:168-185 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:284-301 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15 lines × 3) fastmcp_slim/fastmcp/utilities/inspect.py:128— fastmcp_slim/fastmcp/utilities/inspect.py:128-142 | fastmcp_slim/fastmcp/utilities/inspect.py:151-165 | fastmcp_slim/fastmcp/utilities/inspect.py:176-190 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `fastmcp_slim/fastmcp/utilities/inspect.py:128` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 3) fastmcp_slim/fastmcp/utilities/inspect.py:285— fastmcp_slim/fastmcp/utilities/inspect.py:285-299 | fastmcp_slim/fastmcp/utilities/inspect.py:311-325 | fastmcp_slim/fastmcp/utilities/inspect.py:334-348 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `fastmcp_slim/fastmcp/utilities/inspect.py:285` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196— fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196-209 | fastmcp_slim/fastmcp/tools/function_tool.py:652-665 — 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 `fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196` 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) fastmcp_slim/fastmcp/server/server.py:1308— fastmcp_slim/fastmcp/server/server.py:1308-1321 | fastmcp_slim/fastmcp/server/server.py:1430-1443 — 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.
D4 · Code Duplication· Edited copy of a member (32 corresponding lines) · ×2
Edited copy of a member (32 corresponding lines) examples/apps/contacts/contacts_server.py:104— examples/apps/contacts/contacts_server.py:104-142 | examples/apps/patterns_server.py:313-344 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (32 corresponding lines) scripts/auto_close_duplicates.py:187— scripts/auto_close_duplicates.py:187-218 | scripts/auto_close_needs_mre.py:223-258 — These two members are one piece of code written twice and then edited apart: 32 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.
Duplicated block (19 lines × 2) examples/persistent_state/client.py:53— examples/persistent_state/client.py:53-71 | examples/persistent_state/client_stdio.py:57-75 — before extracting anything, compare `examples/persistent_state/client.py` and `examples/persistent_state/client_stdio.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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) scripts/auto_close_needs_mre.py:117— scripts/auto_close_needs_mre.py:117-135 | scripts/auto_close_needs_mre.py:155-173 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) examples/apps/contacts/contacts_server.py:104— examples/apps/contacts/contacts_server.py:104-116 | examples/apps/patterns_server.py:313-325 — 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) scripts/auto_close_duplicates.py:103— scripts/auto_close_duplicates.py:103-115 | scripts/auto_close_needs_mre.py:96-108 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/auto_close_duplicates.py:103` 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, `scripts/auto_close_needs_mre.py:109` calls `get` and `scripts/auto_close_duplicates.py:116` 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.
Low cohesion: FastMCP (LCOM4 8) fastmcp_slim/fastmcp/server/server.py:434— FastMCP's methods fall into 8 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 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ResponseCachingMiddleware (LCOM4 6) fastmcp_slim/fastmcp/server/middleware/caching.py:262— ResponseCachingMiddleware's methods fall into 6 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 6 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.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×1
Animation without a prefers-reduced-motion guard docs/css/version-badge.css:8— `.version-badge` moves (`transition: box-shadow 0.2s, transform 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
schemas._combine_schemas_and_map_params (cyclomatic 62) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:528— schemas._combine_schemas_and_map_params has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli.run (cyclomatic 61) fastmcp_slim/fastmcp/cli/cli.py:395— cli.run has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ParsedFunction.from_function (cyclomatic 49) fastmcp_slim/fastmcp/tools/function_parsing.py:229— ParsedFunction.from_function has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
formatters.format_description_with_responses (cyclomatic 48) fastmcp_slim/fastmcp/utilities/openapi/formatters.py:192— formatters.format_description_with_responses 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.
OAuthProxy.load_access_token (cyclomatic 37) REDACTED:2223— OAuthProxy.load_access_token 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.
RequestDirector.build (cyclomatic 37) fastmcp_slim/fastmcp/utilities/openapi/director.py:286— RequestDirector.build 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.
FunctionResourceTemplate.from_function (cyclomatic 35) fastmcp_slim/fastmcp/resources/template.py:713— FunctionResourceTemplate.from_function has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
schemas.extract_output_schema_from_responses (cyclomatic 34) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:892— schemas.extract_output_schema_from_responses has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
agentic_triage.finish (cyclomatic 33) .github/agentic/flows/agentic_triage.py:232— agentic_triage.finish 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.
client.list_command (cyclomatic 33) fastmcp_slim/fastmcp/cli/client.py:788— client.list_command 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.
IdentityAssertionValidator.validate (cyclomatic 33) fastmcp_slim/fastmcp/server/auth/identity_assertion.py:327— IdentityAssertionValidator.validate has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
json_schema_type._convert_schema (cyclomatic 31) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1067— json_schema_type._convert_schema has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
formatters.generate_example_from_schema (cyclomatic 30) fastmcp_slim/fastmcp/utilities/openapi/formatters.py:100— formatters.generate_example_from_schema 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.
agentic_pr_verification.verify (cyclomatic 29) REDACTED:288— agentic_pr_verification.verify 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.
elicitation.validate_elicitation_json_schema (cyclomatic 29) fastmcp_slim/fastmcp/server/elicitation.py:433— elicitation.validate_elicitation_json_schema 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.
operations.render (cyclomatic 29) status-site/operations.js:269— operations.render 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.
OpenAISamplingHandler._convert_to_openai_messages (cyclomatic 28) fastmcp_slim/fastmcp/client/sampling/handlers/openai.py:205— OpenAISamplingHandler._convert_to_openai_messages 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.
FunctionPrompt.from_function (cyclomatic 28) fastmcp_slim/fastmcp/prompts/function_prompt.py:76— FunctionPrompt.from_function 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.
OIDCProxy.__init__ (cyclomatic 27) fastmcp_slim/fastmcp/server/auth/oidc_proxy.py:263— OIDCProxy.__init__ has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TransformedTool._merge_schema_with_precedence (cyclomatic 27) fastmcp_slim/fastmcp/tools/tool_transform.py:1038— TransformedTool._merge_schema_with_precedence 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.
json_schema_converter.convert_openapi_schema_to_json_schema (cyclomatic 27) fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py:48— json_schema_converter.convert_openapi_schema_to_json_schema 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.
json_schema_converter._needs_recursive_processing (cyclomatic 27) fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py:259— json_schema_converter._needs_recursive_processing 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.
OpenAPIParser.parse (cyclomatic 27) fastmcp_slim/fastmcp/utilities/openapi/parser.py:740— OpenAPIParser.parse 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.
agentic_intake.route_intake (cyclomatic 26) .github/agentic/flows/agentic_intake.py:136— agentic_intake.route_intake has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
agentic_stack_controller.run_batch (cyclomatic 26) .github/agentic/flows/agentic_stack_controller.py:58— agentic_stack_controller.run_batch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
OAuthProxy.exchange_authorization_code (cyclomatic 26) REDACTED:1350— OAuthProxy.exchange_authorization_code has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
app.refreshTriage (cyclomatic 26) status-site/app.js:480— app.refreshTriage 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.
run.run_command (cyclomatic 25) fastmcp_slim/fastmcp/cli/run.py:141— run.run_command 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.
OAuthProxy.__init__ (cyclomatic 25) REDACTED:314— OAuthProxy.__init__ 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.
dependencies.transform_context_annotations (cyclomatic 25) fastmcp_slim/fastmcp/server/dependencies.py:342— dependencies.transform_context_annotations 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.
TransformedTool.from_tool (cyclomatic 25) fastmcp_slim/fastmcp/tools/tool_transform.py:532— TransformedTool.from_tool 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.
agentic_review_delivery.deliver_reviews (cyclomatic 24) .github/agentic/flows/agentic_review_delivery.py:38— agentic_review_delivery.deliver_reviews 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.
agentic_review_publication.post_review (cyclomatic 24) .github/agentic/flows/agentic_review_publication.py:97— agentic_review_publication.post_review has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
cli.inspect (cyclomatic 24) fastmcp_slim/fastmcp/cli/cli.py:780— cli.inspect 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.
ClerkTokenVerifier.verify_token (cyclomatic 24) fastmcp_slim/fastmcp/server/auth/providers/clerk.py:104— ClerkTokenVerifier.verify_token has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
FunctionTool.from_function (cyclomatic 24) fastmcp_slim/fastmcp/tools/function_tool.py:274— FunctionTool.from_function has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
inspect.inspect_fastmcp_v2 (cyclomatic 24) fastmcp_slim/fastmcp/utilities/inspect.py:100— inspect.inspect_fastmcp_v2 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.
agentic_claims.drain_predecessor (cyclomatic 23) .github/agentic/flows/agentic_claims.py:91— agentic_claims.drain_predecessor has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
apps_dev._model_from_schema (cyclomatic 23) fastmcp_slim/fastmcp/cli/apps_dev.py:834— apps_dev._model_from_schema has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MultiAuth.__init__ (cyclomatic 23) REDACTED:713— MultiAuth.__init__ has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ConsentMixin._submit_consent (cyclomatic 23) fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:582— ConsentMixin._submit_consent has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
OAuthProxy.exchange_refresh_token (cyclomatic 23) REDACTED:1833— OAuthProxy.exchange_refresh_token has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
IntrospectionTokenVerifier.verify_token (cyclomatic 23) REDACTED:191— IntrospectionTokenVerifier.verify_token has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FastMCP.__init__ (cyclomatic 23) fastmcp_slim/fastmcp/server/server.py:442— FastMCP.__init__ has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cli.load_and_merge_config (cyclomatic 23) fastmcp_slim/fastmcp/utilities/cli.py:33— cli.load_and_merge_config has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
RequestDirector._unflatten_arguments (cyclomatic 23) fastmcp_slim/fastmcp/utilities/openapi/director.py:481— RequestDirector._unflatten_arguments has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
agentic_pr_verification.pytest_result (cyclomatic 22) REDACTED:133— agentic_pr_verification.pytest_result 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.
TransformedTool.run (cyclomatic 22) fastmcp_slim/fastmcp/tools/tool_transform.py:429— TransformedTool.run 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.
agentic_stack_runtime.judge (cyclomatic 21) REDACTED:291— agentic_stack_runtime.judge 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.
Client.__init__ (cyclomatic 21) fastmcp_slim/fastmcp/client/client.py:424— Client.__init__ 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.
tools._parse_call_tool_result (cyclomatic 21) fastmcp_slim/fastmcp/client/mixins/tools.py:396— tools._parse_call_tool_result has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CIMDFetcher.fetch (cyclomatic 21) fastmcp_slim/fastmcp/server/auth/cimd.py:324— CIMDFetcher.fetch 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.
CIMDAssertionValidator.validate_assertion (cyclomatic 21) fastmcp_slim/fastmcp/server/auth/cimd.py:536— CIMDAssertionValidator.validate_assertion 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.
OAuthProxy.get_routes (cyclomatic 21) REDACTED:2535— OAuthProxy.get_routes 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.
OAuthProxy._handle_idp_callback (cyclomatic 21) REDACTED:2747— OAuthProxy._handle_idp_callback 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.
GitHubTokenVerifier.verify_token (cyclomatic 21) REDACTED:122— GitHubTokenVerifier.verify_token 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.
filesystem_discovery.import_module_from_file (cyclomatic 21) fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:142— filesystem_discovery.import_module_from_file 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.
FastMCP.read_resource (cyclomatic 21) fastmcp_slim/fastmcp/server/server.py:1679— FastMCP.read_resource 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.
tool_transform._structural_kind (cyclomatic 21) fastmcp_slim/fastmcp/tools/tool_transform.py:65— tool_transform._structural_kind 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.
inspect.inspect_fastmcp_v1 (cyclomatic 21) fastmcp_slim/fastmcp/utilities/inspect.py:251— inspect.inspect_fastmcp_v1 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.
json_schema_type._resolve_recursive_types (cyclomatic 21) fastmcp_slim/fastmcp/utilities/json_schema_type.py:426— json_schema_type._resolve_recursive_types 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.
schemas._replace_ref_with_defs (cyclomatic 21) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:107— schemas._replace_ref_with_defs 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.
operations.ranking (cyclomatic 21) status-site/operations.js:188— operations.ranking has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
shared.process_common_args (cyclomatic 20) fastmcp_slim/fastmcp/cli/install/shared.py:182— shared.process_common_args 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.
GoogleTokenVerifier.verify_token (cyclomatic 20) fastmcp_slim/fastmcp/server/auth/providers/google.py:117— GoogleTokenVerifier.verify_token has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
json_schema_type._merge_defaults (cyclomatic 20) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1559— json_schema_type._merge_defaults 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.
OpenAPIParser._extract_responses (cyclomatic 20) fastmcp_slim/fastmcp/utilities/openapi/parser.py:481— OpenAPIParser._extract_responses 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.
schemas._make_optional_parameter_nullable (cyclomatic 20) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:185— schemas._make_optional_parameter_nullable 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.
AnthropicSamplingHandler._convert_to_anthropic_messages (cyclomatic 19) fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:207— AnthropicSamplingHandler._convert_to_anthropic_messages 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.
StdioTransport.connect (cyclomatic 19) fastmcp_slim/fastmcp/client/transports/stdio.py:103— StdioTransport.connect 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.
ProxyDCRClient.validate_redirect_uri (cyclomatic 19) fastmcp_slim/fastmcp/server/auth/oauth_proxy/models.py:256— ProxyDCRClient.validate_redirect_uri 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.
schemas._flatten_discriminator_subtypes (cyclomatic 19) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:432— schemas._flatten_discriminator_subtypes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.backlog (cyclomatic 19) status-site/app.js:145— app.backlog has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body's own statements and 5 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
agentic_native_triage.run_native_stage (cyclomatic 18) .github/agentic/flows/agentic_native_triage.py:27— agentic_native_triage.run_native_stage has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
agentic_stack_usage.usage_report (cyclomatic 18) .github/agentic/flows/agentic_stack_usage.py:18— agentic_stack_usage.usage_report has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PrivateKeyJWTClientAuthenticator.authenticate_request (cyclomatic 18) REDACTED:257— PrivateKeyJWTClientAuthenticator.authenticate_request 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.
ssrf._ssrf_safe_fetch_response (cyclomatic 18) fastmcp_slim/fastmcp/server/auth/ssrf.py:450— ssrf._ssrf_safe_fetch_response 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.
RequestDirector._serialize_query_params (cyclomatic 18) fastmcp_slim/fastmcp/utilities/openapi/director.py:595— RequestDirector._serialize_query_params 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.
OpenAPIParser._resolve_ref (cyclomatic 18) fastmcp_slim/fastmcp/utilities/openapi/parser.py:161— OpenAPIParser._resolve_ref 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.
OpenAPIParser._extract_parameters (cyclomatic 18) fastmcp_slim/fastmcp/utilities/openapi/parser.py:248— OpenAPIParser._extract_parameters 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.
client.coerce_value (cyclomatic 17) fastmcp_slim/fastmcp/cli/client.py:394— client.coerce_value 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.
generate._resolve_tool_param_flags (cyclomatic 17) fastmcp_slim/fastmcp/cli/generate.py:211— generate._resolve_tool_param_flags 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.
ConsentMixin._show_consent_page (cyclomatic 17) fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:419— ConsentMixin._show_consent_page 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.
OAuthProxy.register_client (cyclomatic 17) REDACTED:1036— OAuthProxy.register_client 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.
OAuthProxy.exchange_identity_assertion (cyclomatic 17) REDACTED:1582— OAuthProxy.exchange_identity_assertion 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.
JWTVerifier._refresh_jwks_key (cyclomatic 17) REDACTED:394— JWTVerifier._refresh_jwks_key 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.
JWTVerifier.load_access_token (cyclomatic 17) REDACTED:534— JWTVerifier.load_access_token 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.
ExtensionsMixin._install_extension (cyclomatic 17) fastmcp_slim/fastmcp/server/mixins/extensions.py:79— ExtensionsMixin._install_extension 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.
prefab_synthesis._build_resource_for_tool (cyclomatic 17) fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py:73— prefab_synthesis._build_resource_for_tool 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.
FastMCP.call_tool (cyclomatic 17) fastmcp_slim/fastmcp/server/server.py:1488— FastMCP.call_tool 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.
SkillFrontmatter.validate_agent_skills_fields (cyclomatic 17) fastmcp_slim/fastmcp/skills/models.py:45— SkillFrontmatter.validate_agent_skills_fields has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Tool.convert_result (cyclomatic 17) fastmcp_slim/fastmcp/tools/base.py:456— Tool.convert_result 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.
TransformedTool._create_forwarding_transform (cyclomatic 17) fastmcp_slim/fastmcp/tools/tool_transform.py:777— TransformedTool._create_forwarding_transform 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.
agentic_backlog.inventory (cyclomatic 16) .github/agentic/flows/agentic_backlog.py:50— agentic_backlog.inventory 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.
agentic_triage.admit (cyclomatic 16) .github/agentic/flows/agentic_triage.py:110— agentic_triage.admit 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.
agentic_triage_nodes.triage_finalize (cyclomatic 16) .github/agentic/flows/agentic_triage_nodes.py:56— agentic_triage_nodes.triage_finalize 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.
fastmcp.__getattr__ (cyclomatic 16) fastmcp_slim/fastmcp/__init__.py:50— fastmcp.__getattr__ 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.
google_genai._response_to_result_with_tools (cyclomatic 16) fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py:410— google_genai._response_to_result_with_tools 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.
OAuthProxy.revoke_token (cyclomatic 16) REDACTED:2438— OAuthProxy.revoke_token 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.
JWTVerifier.__init__ (cyclomatic 16) REDACTED:227— JWTVerifier.__init__ has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MCPOperationsMixin._on_call_tool (cyclomatic 16) fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:284— MCPOperationsMixin._on_call_tool 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.
TransportMixin.run_http_async (cyclomatic 16) fastmcp_slim/fastmcp/server/mixins/transport.py:253— TransportMixin.run_http_async has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Visibility._matches (cyclomatic 16) fastmcp_slim/fastmcp/server/transforms/visibility.py:125— Visibility._matches 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.
json_schema_type._build_dataclass (cyclomatic 16) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1466— json_schema_type._build_dataclass 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.
OpenAPIParser._extract_request_body (cyclomatic 16) fastmcp_slim/fastmcp/utilities/openapi/parser.py:353— OpenAPIParser._extract_request_body 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.
formatters.format_description_with_responses (cognitive 150) fastmcp_slim/fastmcp/utilities/openapi/formatters.py:192— formatters.format_description_with_responses has cognitive complexity 150 (threshold 15). Drivers by points: if/else 22 (84 pts), loops 6 (28 pts), ternaries 7 (27 pts), boolean chains 11 (nesting depth added 104). 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.
schemas._combine_schemas_and_map_params (cognitive 150) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:528— schemas._combine_schemas_and_map_params has cognitive complexity 150 (threshold 15). Drivers by points: if/else 43 (105 pts), loops 9 (25 pts), boolean chains 13, ternaries 3 (7 pts) (nesting depth added 82). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
cli.run (cognitive 125) fastmcp_slim/fastmcp/cli/cli.py:395— cli.run has cognitive complexity 125 (threshold 15). Drivers by points: if/else 42 (101 pts), ternaries 10 (12 pts), boolean chains 7, error handling 3 (5 pts) (nesting depth added 63). 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.
ParsedFunction.from_function (cognitive 76) fastmcp_slim/fastmcp/tools/function_parsing.py:229— ParsedFunction.from_function has cognitive complexity 76 (threshold 15). Drivers by points: if/else 26 (48 pts), boolean chains 12, loops 5 (7 pts), ternaries 4 (5 pts), error handling 2 (4 pts) (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.
elicitation.validate_elicitation_json_schema (cognitive 68) fastmcp_slim/fastmcp/server/elicitation.py:433— elicitation.validate_elicitation_json_schema has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (60 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_triage.finish (cognitive 66) .github/agentic/flows/agentic_triage.py:232— agentic_triage.finish has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (39 pts), ternaries 9 (19 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
OpenAISamplingHandler._convert_to_openai_messages (cognitive 64) fastmcp_slim/fastmcp/client/sampling/handlers/openai.py:205— OpenAISamplingHandler._convert_to_openai_messages has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (58 pts), loops 2 (4 pts), boolean chains 2 (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.
OAuthProxy.load_access_token (cognitive 64) REDACTED:2223— OAuthProxy.load_access_token has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (35 pts), error handling 6 (12 pts), ternaries 5 (10 pts), boolean chains 7 (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.
RequestDirector.build (cognitive 64) fastmcp_slim/fastmcp/utilities/openapi/director.py:286— RequestDirector.build has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 10 (24 pts), boolean chains 11, loops 1 (3 pts) (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.
OpenAPIParser.parse (cognitive 64) fastmcp_slim/fastmcp/utilities/openapi/parser.py:740— OpenAPIParser.parse has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (32 pts), error handling 4 (16 pts), loops 4 (8 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
json_schema_converter._needs_recursive_processing (cognitive 63) fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py:259— json_schema_converter._needs_recursive_processing has cognitive complexity 63 (threshold 15). Drivers by points: if/else 9 (39 pts), boolean chains 14, loops 3 (10 pts) (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
client.list_command (cognitive 62) fastmcp_slim/fastmcp/cli/client.py:788— client.list_command has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (43 pts), loops 5 (12 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_stack_controller.run_batch (cognitive 60) .github/agentic/flows/agentic_stack_controller.py:58— agentic_stack_controller.run_batch has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (37 pts), error handling 4 (14 pts), loops 3 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schemas._make_optional_parameter_nullable (cognitive 60) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:185— schemas._make_optional_parameter_nullable has cognitive complexity 60 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 4 (19 pts), boolean chains 4 (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.
TransformedTool._merge_schema_with_precedence (cognitive 56) fastmcp_slim/fastmcp/tools/tool_transform.py:1038— TransformedTool._merge_schema_with_precedence has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 5 (8 pts), boolean chains 6 (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.
FunctionResourceTemplate.from_function (cognitive 53) fastmcp_slim/fastmcp/resources/template.py:713— FunctionResourceTemplate.from_function has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 6, loops 4 (6 pts), error handling 1 (2 pts), ternaries 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RequestDirector._serialize_query_params (cognitive 53) fastmcp_slim/fastmcp/utilities/openapi/director.py:595— RequestDirector._serialize_query_params has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 3 (11 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
TransformedTool.run (cognitive 50) fastmcp_slim/fastmcp/tools/tool_transform.py:429— TransformedTool.run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (5 pts), ternaries 1 (5 pts), boolean chains 3, error handling 1 (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.
OpenAPIParser._extract_responses (cognitive 49) fastmcp_slim/fastmcp/utilities/openapi/parser.py:481— OpenAPIParser._extract_responses has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (34 pts), error handling 4 (10 pts), boolean chains 3, loops 1 (2 pts) (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.
FunctionPrompt.from_function (cognitive 48) fastmcp_slim/fastmcp/prompts/function_prompt.py:76— FunctionPrompt.from_function has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 7, error handling 1 (5 pts), loops 3 (5 pts), ternaries 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TransformedTool.from_tool (cognitive 48) fastmcp_slim/fastmcp/tools/tool_transform.py:532— TransformedTool.from_tool has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (36 pts), ternaries 5, loops 2 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
json_schema_type._convert_schema (cognitive 48) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1067— json_schema_type._convert_schema has cognitive complexity 48 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
run.run_command (cognitive 47) fastmcp_slim/fastmcp/cli/run.py:141— run.run_command has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 11 (29 pts), if/else 13 (17 pts), error handling 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
apps_dev._model_from_schema (cognitive 45) fastmcp_slim/fastmcp/cli/apps_dev.py:834— apps_dev._model_from_schema has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (8 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schemas.extract_output_schema_from_responses (cognitive 44) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:892— schemas.extract_output_schema_from_responses has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 10, loops 4 (7 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formatters.generate_example_from_schema (cognitive 43) fastmcp_slim/fastmcp/utilities/openapi/formatters.py:100— formatters.generate_example_from_schema has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 2 (6 pts), ternaries 2 (5 pts), boolean chains 4 (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.
ProxyDCRClient.validate_redirect_uri (cognitive 41) fastmcp_slim/fastmcp/server/auth/oauth_proxy/models.py:256— ProxyDCRClient.validate_redirect_uri has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (35 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 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.
filesystem_discovery.import_module_from_file (cognitive 41) fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:142— filesystem_discovery.import_module_from_file has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (28 pts), error handling 4 (10 pts), boolean chains 3 (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.
refreshTriage (cognitive 41) status-site/app.js:480— refreshTriage has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 8 (13 pts), loops 5 (7 pts), boolean chains 3, error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AnthropicSamplingHandler._convert_to_anthropic_messages (cognitive 40) fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:207— AnthropicSamplingHandler._convert_to_anthropic_messages has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (28 pts), ternaries 2 (8 pts), loops 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
json_schema_converter.convert_openapi_schema_to_json_schema (cognitive 40) fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py:48— json_schema_converter.convert_openapi_schema_to_json_schema has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 11, ternaries 3 (11 pts), loops 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
IdentityAssertionValidator.validate (cognitive 39) fastmcp_slim/fastmcp/server/auth/identity_assertion.py:327— IdentityAssertionValidator.validate has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 7, error handling 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
cli.load_and_merge_config (cognitive 39) fastmcp_slim/fastmcp/utilities/cli.py:33— cli.load_and_merge_config has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (31 pts), error handling 2 (7 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.
ssrf._ssrf_safe_fetch_response (cognitive 37) fastmcp_slim/fastmcp/server/auth/ssrf.py:450— ssrf._ssrf_safe_fetch_response has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (23 pts), error handling 3 (7 pts), loops 3 (6 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.
agentic_claims.drain_predecessor (cognitive 36) .github/agentic/flows/agentic_claims.py:91— agentic_claims.drain_predecessor has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 7, loops 4 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_review_delivery.deliver_reviews (cognitive 36) .github/agentic/flows/agentic_review_delivery.py:38— agentic_review_delivery.deliver_reviews has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_stack_usage.usage_report (cognitive 36) .github/agentic/flows/agentic_stack_usage.py:18— agentic_stack_usage.usage_report has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (10 pts), ternaries 3 (4 pts), boolean chains 3 (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.
dependencies.transform_context_annotations (cognitive 36) fastmcp_slim/fastmcp/server/dependencies.py:342— dependencies.transform_context_annotations has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (30 pts), error handling 3, loops 2, 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.
tool_transform._structural_kind (cognitive 36) fastmcp_slim/fastmcp/tools/tool_transform.py:65— tool_transform._structural_kind has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 4 (8 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
inspect.inspect_fastmcp_v2 (cognitive 36) fastmcp_slim/fastmcp/utilities/inspect.py:100— inspect.inspect_fastmcp_v2 has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 16 (29 pts), loops 4, 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.
RequestDirector._unflatten_arguments (cognitive 36) fastmcp_slim/fastmcp/utilities/openapi/director.py:481— RequestDirector._unflatten_arguments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 4, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_triage_nodes.triage_finalize (cognitive 35) .github/agentic/flows/agentic_triage_nodes.py:56— agentic_triage_nodes.triage_finalize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
agentic_pr_verification.verify (cognitive 34) REDACTED:288— agentic_pr_verification.verify has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 5 (6 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
shared.process_common_args (cognitive 34) fastmcp_slim/fastmcp/cli/install/shared.py:182— shared.process_common_args has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (20 pts), error handling 3 (7 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FastMCP.read_resource (cognitive 34) fastmcp_slim/fastmcp/server/server.py:1679— FastMCP.read_resource has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (25 pts), error handling 6 (9 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
json_schema_type._resolve_recursive_types (cognitive 34) fastmcp_slim/fastmcp/utilities/json_schema_type.py:426— json_schema_type._resolve_recursive_types has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (9 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schemas._flatten_discriminator_subtypes (cognitive 34) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:432— schemas._flatten_discriminator_subtypes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (6 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
render (cognitive 34) status-site/operations.js:269— render has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (15 pts), if/else 8, loops 6, boolean chains 5 (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.
agentic_stack_runtime.judge (cognitive 32) REDACTED:291— agentic_stack_runtime.judge has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli.inspect (cognitive 32) fastmcp_slim/fastmcp/cli/cli.py:780— cli.inspect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 5, error handling 3 (4 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate._resolve_tool_param_flags (cognitive 32) fastmcp_slim/fastmcp/cli/generate.py:211— generate._resolve_tool_param_flags has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 6 (11 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate._tool_function_source (cognitive 32) fastmcp_slim/fastmcp/cli/generate.py:282— generate._tool_function_source has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (5 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tools._parse_call_tool_result (cognitive 32) fastmcp_slim/fastmcp/client/mixins/tools.py:396— tools._parse_call_tool_result has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 10, error handling 1 (2 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.
OIDCProxy.__init__ (cognitive 32) fastmcp_slim/fastmcp/server/auth/oidc_proxy.py:263— OIDCProxy.__init__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (23 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
agentic_freshness.revalidate (cognitive 31) .github/agentic/flows/agentic_freshness.py:22— agentic_freshness.revalidate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Client._connect (cognitive 31) fastmcp_slim/fastmcp/client/client.py:1054— Client._connect has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 4 (13 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CIMDFetcher.fetch (cognitive 31) fastmcp_slim/fastmcp/server/auth/cimd.py:324— CIMDFetcher.fetch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), error handling 5 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ConsentMixin._submit_consent (cognitive 31) fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:582— ConsentMixin._submit_consent has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 8, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TransformedTool._create_forwarding_transform (cognitive 31) fastmcp_slim/fastmcp/tools/tool_transform.py:777— TransformedTool._create_forwarding_transform has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OpenAPIParser._extract_request_body (cognitive 31) fastmcp_slim/fastmcp/utilities/openapi/parser.py:353— OpenAPIParser._extract_request_body has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 4 (10 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schemas._replace_ref_with_defs (cognitive 31) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:107— schemas._replace_ref_with_defs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 2 (5 pts), loops 3, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template.match_uri_template (cognitive 30) fastmcp_slim/fastmcp/resources/template.py:235— template.match_uri_template has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 1 (6 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
types.get_cached_typeadapter (cognitive 30) fastmcp_slim/fastmcp/utilities/types.py:54— types.get_cached_typeadapter has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (3 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
agentic_intake.route_intake (cognitive 29) .github/agentic/flows/agentic_intake.py:136— agentic_intake.route_intake has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 10 (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.
Client.__init__ (cognitive 29) fastmcp_slim/fastmcp/client/client.py:424— Client.__init__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 3 (5 pts), boolean chains 4 (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.
AuthorizationHandler.handle (cognitive 29) fastmcp_slim/fastmcp/server/auth/handlers/authorize.py:207— AuthorizationHandler.handle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
OAuthProxy.revoke_token (cognitive 29) REDACTED:2438— OAuthProxy.revoke_token has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
json_schema_type._merge_defaults (cognitive 29) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1559— json_schema_type._merge_defaults has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OpenAPIParser._extract_parameters (cognitive 29) fastmcp_slim/fastmcp/utilities/openapi/parser.py:248— OpenAPIParser._extract_parameters has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 6, error handling 1 (2 pts), ternaries 1 (2 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.
operations.ranking (cognitive 29) status-site/operations.js:188— operations.ranking has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (15 pts), loops 4 (6 pts), boolean chains 5, if/else 3 (nesting depth added 10). Of this number, 24 points are the body's own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_baseline.review_existing (cognitive 28) .github/agentic/flows/agentic_baseline.py:67— agentic_baseline.review_existing has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_triage.admit (cognitive 28) .github/agentic/flows/agentic_triage.py:110— agentic_triage.admit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FunctionPrompt._convert_string_arguments (cognitive 28) fastmcp_slim/fastmcp/prompts/function_prompt.py:271— FunctionPrompt._convert_string_arguments has cognitive complexity 28 (threshold 15). Drivers by points: error handling 4 (14 pts), if/else 6 (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.
ConsentMixin._show_consent_page (cognitive 28) fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:419— ConsentMixin._show_consent_page has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_review_publication.post_review (cognitive 27) .github/agentic/flows/agentic_review_publication.py:97— agentic_review_publication.post_review has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (10 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
PrivateKeyJWTClientAuthenticator.authenticate_request (cognitive 27) REDACTED:257— PrivateKeyJWTClientAuthenticator.authenticate_request has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OAuthProxy.exchange_authorization_code (cognitive 27) REDACTED:1350— OAuthProxy.exchange_authorization_code has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8, ternaries 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
OAuthProxy._handle_idp_callback (cognitive 27) REDACTED:2747— OAuthProxy._handle_idp_callback has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, error handling 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IntrospectionTokenVerifier.verify_token (cognitive 27) REDACTED:191— IntrospectionTokenVerifier.verify_token has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (8 pts), boolean chains 3, error handling 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.
JWTVerifier._refresh_jwks_key (cognitive 27) REDACTED:394— JWTVerifier._refresh_jwks_key has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 5 (6 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FunctionTool.from_function (cognitive 27) fastmcp_slim/fastmcp/tools/function_tool.py:274— FunctionTool.from_function has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 9, ternaries 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
json_schema_type._build_dataclass (cognitive 27) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1466— json_schema_type._build_dataclass has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backlog (cognitive 27) status-site/app.js:145— backlog has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 4 (7 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 9). Of this number, 20 points are the body's own statements and 7 belong to 13 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
run.run_with_reload (cognitive 26) fastmcp_slim/fastmcp/cli/run.py:412— run.run_with_reload has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (6 pts), boolean chains 2, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CIMDAssertionValidator.validate_assertion (cognitive 26) fastmcp_slim/fastmcp/server/auth/cimd.py:536— CIMDAssertionValidator.validate_assertion has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OAuthProxy.__init__ (cognitive 26) REDACTED:314— OAuthProxy.__init__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 6 (7 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
GitHubTokenVerifier.verify_token (cognitive 26) REDACTED:122— GitHubTokenVerifier.verify_token has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 5, ternaries 2 (5 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.
FastMCP.__init__ (cognitive 26) fastmcp_slim/fastmcp/server/server.py:442— FastMCP.__init__ has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), loops 3 (4 pts), ternaries 4 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
inspect.inspect_fastmcp_v1 (cognitive 26) fastmcp_slim/fastmcp/utilities/inspect.py:251— inspect.inspect_fastmcp_v1 has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (12 pts), boolean chains 7, loops 4, if/else 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OpenAPIParser._resolve_ref (cognitive 26) fastmcp_slim/fastmcp/utilities/openapi/parser.py:161— OpenAPIParser._resolve_ref has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_pr_verification.pytest_result (cognitive 25) REDACTED:133— agentic_pr_verification.pytest_result has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, loops 2 (3 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OAuthProxy.exchange_refresh_token (cognitive 25) REDACTED:1833— OAuthProxy.exchange_refresh_token has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, ternaries 4, error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
OAuthProxy.get_routes (cognitive 25) REDACTED:2535— OAuthProxy.get_routes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 11, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ClerkTokenVerifier.verify_token (cognitive 25) fastmcp_slim/fastmcp/server/auth/providers/clerk.py:104— ClerkTokenVerifier.verify_token has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, error handling 3, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
agentic_backlog.inventory (cognitive 24) .github/agentic/flows/agentic_backlog.py:50— agentic_backlog.inventory has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 2 (3 pts), ternaries 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.
agentic_backlog.settle (cognitive 24) .github/agentic/flows/agentic_backlog.py:124— agentic_backlog.settle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_native_cache.find_native_result (cognitive 24) .github/agentic/flows/agentic_native_cache.py:80— agentic_native_cache.find_native_result has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
client.coerce_value (cognitive 24) fastmcp_slim/fastmcp/cli/client.py:394— client.coerce_value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 4 (9 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
google_genai._response_to_result_with_tools (cognitive 24) fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py:410— google_genai._response_to_result_with_tools has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (7 pts), boolean chains 4, 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.
MultiAuth.__init__ (cognitive 24) REDACTED:713— MultiAuth.__init__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, boolean chains 7, ternaries 5 (6 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TransportMixin.http_app (cognitive 24) fastmcp_slim/fastmcp/server/mixins/transport.py:367— TransportMixin.http_app has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (22 pts), if/else 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.
auth.parse_scopes (cognitive 24) fastmcp_slim/fastmcp/utilities/auth.py:70— auth.parse_scopes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
discovery._scan_claude_code (cognitive 23) fastmcp_slim/fastmcp/cli/discovery.py:166— discovery._scan_claude_code has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
google_genai._convert_messages_to_google_genai_content (cognitive 23) fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py:311— google_genai._convert_messages_to_google_genai_content has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ResourceSecurity.validate (cognitive 23) fastmcp_slim/fastmcp/resources/security.py:127— ResourceSecurity.validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FunctionResourceTemplate.read (cognitive 23) fastmcp_slim/fastmcp/resources/template.py:668— FunctionResourceTemplate.read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
JWTVerifier.load_access_token (cognitive 23) REDACTED:534— JWTVerifier.load_access_token has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, error handling 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
filesystem_discovery.extract_components (cognitive 23) fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:290— filesystem_discovery.extract_components has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 1 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FastMCP.call_tool (cognitive 23) fastmcp_slim/fastmcp/server/server.py:1488— FastMCP.call_tool has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 4, 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.
fastmcp.__getattr__ (cognitive 22) fastmcp_slim/fastmcp/__init__.py:50— fastmcp.__getattr__ has cognitive complexity 22 (threshold 15). Drivers by points: error handling 7 (14 pts), if/else 8 (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.
StdioTransport.connect (cognitive 22) fastmcp_slim/fastmcp/client/transports/stdio.py:103— StdioTransport.connect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8 (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.
GoogleTokenVerifier.verify_token (cognitive 22) fastmcp_slim/fastmcp/server/auth/providers/google.py:117— GoogleTokenVerifier.verify_token has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3 (4 pts), boolean chains 3, error handling 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
ToolDecoratorMixin.add_tool (cognitive 22) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:111— ToolDecoratorMixin.add_tool has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (7 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.
json_schema._merge_ref_siblings (cognitive 22) fastmcp_slim/fastmcp/utilities/json_schema.py:444— json_schema._merge_ref_siblings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UvStdioTransport.__init__ (cognitive 21) fastmcp_slim/fastmcp/client/transports/stdio.py:557— UvStdioTransport.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OAuthProxy.exchange_identity_assertion (cognitive 21) REDACTED:1582— OAuthProxy.exchange_identity_assertion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, error handling 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
routing._determine_route_type (cognitive 21) fastmcp_slim/fastmcp/server/providers/openapi/routing.py:86— routing._determine_route_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 2, loops 1 (nesting depth added 12). 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.
prefab_synthesis._build_resource_for_tool (cognitive 21) fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py:73— prefab_synthesis._build_resource_for_tool has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 3 (4 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
json_schema._strip_discriminator (cognitive 21) fastmcp_slim/fastmcp/utilities/json_schema.py:238— json_schema._strip_discriminator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, ternaries 1 (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.
client.resolve_server_spec (cognitive 20) fastmcp_slim/fastmcp/cli/client.py:59— client.resolve_server_spec has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
client._terminal_elicitation_handler (cognitive 20) fastmcp_slim/fastmcp/cli/client.py:199— client._terminal_elicitation_handler has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
claude_desktop.install_claude_desktop (cognitive 20) fastmcp_slim/fastmcp/cli/install/claude_desktop.py:49— claude_desktop.install_claude_desktop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
google_genai._sampling_content_to_google_genai_part (cognitive 20) fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py:233— google_genai._sampling_content_to_google_genai_part has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OAuthProxy.register_client (cognitive 20) REDACTED:1036— OAuthProxy.register_client has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (4 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.
InMemoryOAuthProvider._revoke_internal (cognitive 20) fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:318— InMemoryOAuthProvider._revoke_internal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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.
MCPOperationsMixin._on_call_tool (cognitive 20) fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:284— MCPOperationsMixin._on_call_tool has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, ternaries 2 (5 pts), error handling 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.
OpenAPITool.run (cognitive 20) fastmcp_slim/fastmcp/server/providers/openapi/components.py:234— OpenAPITool.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, error handling 2, loops 1 (2 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SkillsDirectoryProvider._discover_skills (cognitive 20) fastmcp_slim/fastmcp/server/providers/skills/directory_provider.py:111— SkillsDirectoryProvider._discover_skills has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (6 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
json_schema.resolve_root_ref (cognitive 20) fastmcp_slim/fastmcp/utilities/json_schema.py:515— json_schema.resolve_root_ref has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UVEnvironment.prepare (cognitive 20) fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:109— UVEnvironment.prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 6 (9 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
agentic_native_triage.run_native_stage (cognitive 19) .github/agentic/flows/agentic_native_triage.py:27— agentic_native_triage.run_native_stage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
ClientSkillsMixin._skill_manifest (cognitive 19) fastmcp_slim/fastmcp/client/mixins/skills.py:353— ClientSkillsMixin._skill_manifest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MultiAuth.verify_token (cognitive 19) REDACTED:880— MultiAuth.verify_token has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (4 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
docstring_parsing.parse_docstring (cognitive 19) fastmcp_slim/fastmcp/utilities/docstring_parsing.py:60— docstring_parsing.parse_docstring has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 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.
agentic_review_publication.before_delivery (cognitive 18) .github/agentic/flows/agentic_review_publication.py:28— agentic_review_publication.before_delivery has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, 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.
apps_dev._build_picker_html (cognitive 18) fastmcp_slim/fastmcp/cli/apps_dev.py:926— apps_dev._build_picker_html has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 3, 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.
cli.inspector (cognitive 18) fastmcp_slim/fastmcp/cli/cli.py:134— cli.inspector has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 3, loops 1 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
generate._tool_skill_section (cognitive 18) fastmcp_slim/fastmcp/cli/generate.py:680— generate._tool_skill_section has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (5 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
huggingface._extract_scopes (cognitive 18) fastmcp_slim/fastmcp/server/auth/providers/huggingface.py:31— huggingface._extract_scopes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExtensionsMixin._install_extension (cognitive 18) fastmcp_slim/fastmcp/server/mixins/extensions.py:79— ExtensionsMixin._install_extension has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 3, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
MCPOperationsMixin._on_list_tools (cognitive 18) fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:143— MCPOperationsMixin._on_list_tools has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Visibility._matches (cognitive 18) fastmcp_slim/fastmcp/server/transforms/visibility.py:125— Visibility._matches has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Tool.convert_result (cognitive 18) fastmcp_slim/fastmcp/tools/base.py:456— Tool.convert_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, ternaries 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
agentic_existing_review.verify_existing (cognitive 17) .github/agentic/flows/agentic_existing_review.py:181— agentic_existing_review.verify_existing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate.serialize_transport (cognitive 17) fastmcp_slim/fastmcp/cli/generate.py:145— generate.serialize_transport has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
code_mode._legible_call_error (cognitive 17) fastmcp_slim/fastmcp/experimental/transforms/code_mode.py:65— code_mode._legible_call_error has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (5 pts), ternaries 2 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OAuthProxy.get_client (cognitive 17) REDACTED:978— OAuthProxy.get_client has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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.
JWTVerifier.__init__ (cognitive 17) REDACTED:227— JWTVerifier.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
BaseLoggingMiddleware._create_before_message (cognitive 17) fastmcp_slim/fastmcp/server/middleware/logging.py:56— BaseLoggingMiddleware._create_before_message has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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.
base._object_fields (cognitive 17) fastmcp_slim/fastmcp/server/transforms/search/base.py:130— base._object_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Skill.to_directory (cognitive 17) fastmcp_slim/fastmcp/skills/skill.py:319— Skill.to_directory has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TransformedTool._apply_single_transform (cognitive 17) fastmcp_slim/fastmcp/tools/tool_transform.py:929— TransformedTool._apply_single_transform has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
json_schema._resolve_local_ref (cognitive 17) fastmcp_slim/fastmcp/utilities/json_schema.py:64— json_schema._resolve_local_ref has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
File.to_resource_content (cognitive 17) fastmcp_slim/fastmcp/utilities/types.py:439— File.to_resource_content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_native_triage.run_native_triage (cognitive 16) .github/agentic/flows/agentic_native_triage.py:130— agentic_native_triage.run_native_triage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agentic_verification_inputs.manifest (cognitive 16) .github/agentic/flows/agentic_verification_inputs.py:10— agentic_verification_inputs.manifest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authentication.poll_device_authorization (cognitive 16) fastmcp_slim/fastmcp/cli/deploy/authentication.py:32— authentication.poll_device_authorization has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
discovery._scan_goose (cognitive 16) fastmcp_slim/fastmcp/cli/discovery.py:290— discovery._scan_goose has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, error handling 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OAuthProxy.authorize (cognitive 16) REDACTED:1168— OAuthProxy.authorize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OAuthProxy._try_transparent_refresh (cognitive 16) REDACTED:2129— OAuthProxy._try_transparent_refresh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, ternaries 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
Context.session_id (cognitive 16) fastmcp_slim/fastmcp/server/context.py:727— Context.session_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
ExtensionsMixin._register_bundled_extensions (cognitive 16) fastmcp_slim/fastmcp/server/mixins/extensions.py:175— ExtensionsMixin._register_bundled_extensions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TransportMixin.run_http_async (cognitive 16) fastmcp_slim/fastmcp/server/mixins/transport.py:253— TransportMixin.run_http_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 5, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
components._extract_mime_type_from_route (cognitive 16) fastmcp_slim/fastmcp/server/providers/openapi/components.py:129— components._extract_mime_type_from_route has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FastMCP.render_prompt (cognitive 16) fastmcp_slim/fastmcp/server/server.py:1843— FastMCP.render_prompt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 1 (4 pts), error handling 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SkillFrontmatter.validate_agent_skills_fields (cognitive 16) fastmcp_slim/fastmcp/skills/models.py:45— SkillFrontmatter.validate_agent_skills_fields has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
MCPSkill.validate_entry (cognitive 16) fastmcp_slim/fastmcp/skills/models.py:158— MCPSkill.validate_entry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
handlers.tasks_get (cognitive 16) fastmcp_tasks/fastmcp_tasks/handlers.py:250— handlers.tasks_get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
operations.chart (cognitive 16) status-site/operations.js:47— operations.chart has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (9 pts), boolean chains 5, if/else 2 (nesting depth added 3). Of this number, 13 points are the body's own statements and 3 belong to 3 function literals inside it that branch. 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.
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (7 members, 50+ identical tokens) fastmcp_slim/fastmcp/cli/install/claude_code.py:85— fastmcp_slim/fastmcp/cli/install/claude_code.py:85-152 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:62-136 | fastmcp_slim/fastmcp/cli/install/cursor.py:72-140 | fastmcp_slim/fastmcp/cli/install/cursor.py:156-225 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:81-149 | fastmcp_slim/fastmcp/cli/install/mcp_json.py:34-97 | fastmcp_slim/fastmcp/cli/install/stdio.py:32-75 — These 7 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 7 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 7 times.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) fastmcp_slim/fastmcp/client/mixins/prompts.py:34— fastmcp_slim/fastmcp/client/mixins/prompts.py:34-70 | fastmcp_slim/fastmcp/client/mixins/resources.py:35-71 | fastmcp_slim/fastmcp/client/mixins/resources.py:126-165 | fastmcp_slim/fastmcp/client/mixins/tools.py:41-89 — 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.
D4 · Code Duplication· Edited copy of a member (148 corresponding lines) · ×1
Edited copy of a member (148 corresponding lines) fastmcp_slim/fastmcp/utilities/inspect.py:101— fastmcp_slim/fastmcp/utilities/inspect.py:101-248 | fastmcp_slim/fastmcp/utilities/inspect.py:252-410 — These two members are one piece of code written twice and then edited apart: 148 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 (110 corresponding lines) · ×1
Edited copy of a member (110 corresponding lines) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:122— fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:122-231 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:233-362 — These two members are one piece of code written twice and then edited apart: 110 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 (44 corresponding lines) · ×1
Edited copy of a member (44 corresponding lines) fastmcp_slim/fastmcp/prompts/function_prompt.py:424— fastmcp_slim/fastmcp/prompts/function_prompt.py:424-467 | fastmcp_slim/fastmcp/tools/function_tool.py:626-687 — These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 42+ corresponding lines) · ×1
Edited copies of one member (3 members, 42+ corresponding lines) fastmcp_slim/fastmcp/server/server.py:1096— fastmcp_slim/fastmcp/server/server.py:1096-1150 | fastmcp_slim/fastmcp/server/server.py:1239-1290 | fastmcp_slim/fastmcp/server/server.py:1371-1412 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 50+ corresponding lines) · ×1
Edited copies of one member (3 members, 50+ corresponding lines) fastmcp_slim/fastmcp/server/middleware/authorization.py:243— fastmcp_slim/fastmcp/server/middleware/authorization.py:243-306 | fastmcp_slim/fastmcp/server/middleware/authorization.py:338-404 | fastmcp_slim/fastmcp/server/middleware/authorization.py:467-516 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 50 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (45 corresponding lines) · ×1
Edited copy of a member (45 corresponding lines) fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:174— fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:174-218 | fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:242-290 — These two members are one piece of code written twice and then edited apart: 45 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 (111 corresponding lines) · ×1
Edited copy of a member (111 corresponding lines) fastmcp_slim/fastmcp/server/auth/providers/clerk.py:311— fastmcp_slim/fastmcp/server/auth/providers/clerk.py:311-421 | fastmcp_slim/fastmcp/server/auth/providers/google.py:305-441 — These two members are one piece of code written twice and then edited apart: 111 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 (36 corresponding lines) · ×1
Edited copy of a member (36 corresponding lines) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1327— fastmcp_slim/fastmcp/utilities/json_schema_type.py:1327-1362 | fastmcp_slim/fastmcp/utilities/json_schema_type.py:1428-1463 — These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 75+ corresponding lines) · ×1
Edited copies of one member (3 members, 75+ corresponding lines) fastmcp_slim/fastmcp/server/auth/providers/discord.py:220— fastmcp_slim/fastmcp/server/auth/providers/discord.py:220-313 | REDACTED:344-434 | fastmcp_slim/fastmcp/server/auth/providers/huggingface.py:206-280 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 75 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (33 corresponding lines) · ×1
Edited copy of a member (33 corresponding lines) fastmcp_slim/fastmcp/server/middleware/caching.py:543— fastmcp_slim/fastmcp/server/middleware/caching.py:543-584 | fastmcp_slim/fastmcp/server/middleware/caching.py:592-624 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (71 corresponding lines) · ×1
Edited copy of a member (71 corresponding lines) REDACTED:111— REDACTED:111-193 | fastmcp_slim/fastmcp/server/auth/providers/oci.py:148-218 — These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 40+ corresponding lines) · ×1
Edited copies of one member (5 members, 40+ corresponding lines) fastmcp_slim/fastmcp/client/mixins/prompts.py:76— fastmcp_slim/fastmcp/client/mixins/prompts.py:76-117 | fastmcp_slim/fastmcp/client/mixins/resources.py:77-118 | fastmcp_slim/fastmcp/client/mixins/resources.py:171-214 | fastmcp_slim/fastmcp/client/mixins/skills.py:126-165 | fastmcp_slim/fastmcp/client/mixins/tools.py:97-143 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 40 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (43 corresponding lines) · ×1
Edited copy of a member (43 corresponding lines) REDACTED:247— REDACTED:247-289 | REDACTED:372-424 — These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 26+ corresponding lines) · ×1
Edited copies of one member (4 members, 26+ corresponding lines) fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:219— fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:219-244 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:247-272 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:275-302 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:305-330 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 23+ corresponding lines) · ×1
Edited copies of one member (4 members, 23+ corresponding lines) fastmcp_slim/fastmcp/server/providers/proxy.py:1056— fastmcp_slim/fastmcp/server/providers/proxy.py:1056-1078 | fastmcp_slim/fastmcp/server/providers/proxy.py:1133-1155 | fastmcp_slim/fastmcp/server/providers/proxy.py:1177-1199 | fastmcp_slim/fastmcp/server/providers/proxy.py:1221-1243 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 23+ corresponding lines) · ×1
Edited copies of one member (3 members, 23+ corresponding lines) fastmcp_slim/fastmcp/client/transports/stdio.py:416— fastmcp_slim/fastmcp/client/transports/stdio.py:416-458 | fastmcp_slim/fastmcp/client/transports/stdio.py:476-498 | fastmcp_slim/fastmcp/client/transports/stdio.py:514-551 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×1
Edited copy of a member (25 corresponding lines) fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:288— fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:288-314 | fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:374-398 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 31+ corresponding lines) · ×1
Edited copies of one member (3 members, 31+ corresponding lines) fastmcp_slim/fastmcp/server/server.py:1204— fastmcp_slim/fastmcp/server/server.py:1204-1234 | fastmcp_slim/fastmcp/server/server.py:1326-1368 | fastmcp_slim/fastmcp/server/server.py:1448-1486 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 32+ corresponding lines) · ×1
Edited copies of one member (3 members, 32+ corresponding lines) fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:50— fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:50-81 | fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:91-127 | fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:136-167 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 27+ corresponding lines) · ×1
Edited copies of one member (4 members, 27+ corresponding lines) REDACTED:312— REDACTED:312-338 | fastmcp_slim/fastmcp/server/auth/providers/propelauth.py:145-183 | fastmcp_slim/fastmcp/server/auth/providers/supabase.py:141-181 | REDACTED:452-492 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 13+ corresponding lines) · ×1
Edited copies of one member (3 members, 13+ corresponding lines) fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:222— fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:222-239 | fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:246-263 | fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:270-282 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (35 corresponding lines) · ×1
Edited copy of a member (35 corresponding lines) fastmcp_slim/fastmcp/client/mixins/skills.py:84— fastmcp_slim/fastmcp/client/mixins/skills.py:84-118 | fastmcp_slim/fastmcp/client/mixins/skills.py:173-209 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (48 corresponding lines) · ×1
Edited copy of a member (48 corresponding lines) REDACTED:115— REDACTED:115-173 | REDACTED:183-230 — These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 21+ corresponding lines) · ×1
Edited copies of one member (4 members, 21+ corresponding lines) fastmcp_slim/fastmcp/server/middleware/authorization.py:215— fastmcp_slim/fastmcp/server/middleware/authorization.py:215-236 | fastmcp_slim/fastmcp/server/middleware/authorization.py:313-333 | fastmcp_slim/fastmcp/server/middleware/authorization.py:413-433 | fastmcp_slim/fastmcp/server/middleware/authorization.py:440-460 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 11+ corresponding lines) · ×1
Edited copies of one member (4 members, 11+ corresponding lines) fastmcp_slim/fastmcp/server/providers/proxy.py:1083— fastmcp_slim/fastmcp/server/providers/proxy.py:1083-1093 | fastmcp_slim/fastmcp/server/providers/proxy.py:1160-1170 | fastmcp_slim/fastmcp/server/providers/proxy.py:1204-1214 | fastmcp_slim/fastmcp/server/providers/proxy.py:1248-1258 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×1
Edited copy of a member (17 corresponding lines) fastmcp_slim/fastmcp/server/transforms/visibility.py:188— fastmcp_slim/fastmcp/server/transforms/visibility.py:188-204 | fastmcp_slim/fastmcp/tools/tool_transform.py:1181-1200 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 27+ corresponding lines) · ×1
Edited copies of one member (6 members, 27+ corresponding lines) fastmcp_slim/fastmcp/cli/install/claude_code.py:214— fastmcp_slim/fastmcp/cli/install/claude_code.py:214-242 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:205-232 | fastmcp_slim/fastmcp/cli/install/cursor.py:294-321 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:211-239 | fastmcp_slim/fastmcp/cli/install/mcp_json.py:166-193 | fastmcp_slim/fastmcp/cli/install/stdio.py:130-156 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (24 corresponding lines) · ×1
Edited copy of a member (24 corresponding lines) fastmcp_slim/fastmcp/client/auth/client_credentials.py:241— fastmcp_slim/fastmcp/client/auth/client_credentials.py:241-265 | fastmcp_slim/fastmcp/client/auth/client_credentials.py:381-404 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×1
Edited copy of a member (22 corresponding lines) fastmcp_slim/fastmcp/server/middleware/logging.py:179— fastmcp_slim/fastmcp/server/middleware/logging.py:179-200 | fastmcp_slim/fastmcp/server/middleware/logging.py:230-252 — 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· Edited copy of a member (27 corresponding lines) · ×1
Edited copy of a member (27 corresponding lines) fastmcp_slim/fastmcp/server/server.py:1295— fastmcp_slim/fastmcp/server/server.py:1295-1321 | fastmcp_slim/fastmcp/server/server.py:1417-1443 — These two members are one piece of code written twice and then edited apart: 27 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 (23 corresponding lines) · ×1
Edited copy of a member (23 corresponding lines) fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:201— fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:201-223 | fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:278-300 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 14+ corresponding lines) · ×1
Edited copies of one member (3 members, 14+ corresponding lines) fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:61— fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:61-77 | fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:152-167 | fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:214-227 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 16+ corresponding lines) · ×1
Edited copies of one member (4 members, 16+ corresponding lines) fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:343— fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:343-358 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:367-382 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:391-408 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:417-432 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×1
Edited copy of a member (10 corresponding lines) fastmcp_slim/fastmcp/utilities/types.py:257— fastmcp_slim/fastmcp/utilities/types.py:257-266 | fastmcp_slim/fastmcp/utilities/types.py:402-412 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×1
Edited copy of a member (12 corresponding lines) fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:463— fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:463-474 | fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:477-492 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (15 corresponding lines) · ×1
Edited copy of a member (15 corresponding lines) REDACTED:292— REDACTED:292-306 | REDACTED:427-446 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (8 corresponding lines) · ×1
Edited copy of a member (8 corresponding lines) fastmcp_slim/fastmcp/server/providers/proxy.py:1412— fastmcp_slim/fastmcp/server/providers/proxy.py:1412-1419 | fastmcp_slim/fastmcp/server/providers/proxy.py:1429-1436 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×1
Edited copy of a member (9 corresponding lines) fastmcp_slim/fastmcp/server/dependencies.py:143— fastmcp_slim/fastmcp/server/dependencies.py:143-151 | fastmcp_slim/fastmcp/tools/base.py:678-687 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (1 corresponding lines) · ×1
Edited copy of a member (1 corresponding lines) fastmcp_slim/fastmcp/resources/base.py:466— fastmcp_slim/fastmcp/resources/base.py:466-466 | fastmcp_slim/fastmcp/resources/template.py:474-474 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (5 corresponding lines) · ×1
Edited copy of a member (5 corresponding lines) fastmcp_slim/fastmcp/server/providers/openapi/provider.py:54— fastmcp_slim/fastmcp/server/providers/openapi/provider.py:54-58 | fastmcp_slim/fastmcp/utilities/exceptions.py:12-16 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (56–68 lines × 2) REDACTED:111— REDACTED:111-178 | fastmcp_slim/fastmcp/server/auth/providers/oci.py:148-203 — 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:111` 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 (33–34 lines × 2) fastmcp_slim/fastmcp/server/auth/providers/discord.py:280— fastmcp_slim/fastmcp/server/auth/providers/discord.py:280-313 | REDACTED:402-434 — 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 `fastmcp_slim/fastmcp/server/auth/providers/discord.py:280` 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 (29 lines × 2) fastmcp_slim/fastmcp/prompts/function_prompt.py:439— fastmcp_slim/fastmcp/prompts/function_prompt.py:439-467 | fastmcp_slim/fastmcp/tools/function_tool.py:659-687 — 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 `fastmcp_slim/fastmcp/prompts/function_prompt.py:439` 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 (28–29 lines × 2) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1327— fastmcp_slim/fastmcp/utilities/json_schema_type.py:1327-1354 | fastmcp_slim/fastmcp/utilities/json_schema_type.py:1428-1456 — 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 (28 lines × 4) fastmcp_slim/fastmcp/client/mixins/prompts.py:34— fastmcp_slim/fastmcp/client/mixins/prompts.py:34-61 | fastmcp_slim/fastmcp/client/mixins/resources.py:35-62 | fastmcp_slim/fastmcp/client/mixins/resources.py:126-153 | fastmcp_slim/fastmcp/client/mixins/tools.py:41-70 — there are 4 copies across 3 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.
Duplicated block (28 lines × 2) fastmcp_slim/fastmcp/client/transports/stdio.py:416— fastmcp_slim/fastmcp/client/transports/stdio.py:416-443 | fastmcp_slim/fastmcp/client/transports/stdio.py:514-541 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (26–28 lines × 2) fastmcp_slim/fastmcp/server/providers/proxy.py:609— fastmcp_slim/fastmcp/server/providers/proxy.py:609-634 | fastmcp_slim/fastmcp/server/providers/proxy.py:742-769 — 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 `fastmcp_slim/fastmcp/server/providers/proxy.py:742` 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 (27 lines × 2) fastmcp_slim/fastmcp/cli/install/mcp_json.py:34— fastmcp_slim/fastmcp/cli/install/mcp_json.py:34-62 | fastmcp_slim/fastmcp/cli/install/stdio.py:32-58 — 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 (24–26 lines × 2) fastmcp_slim/fastmcp/server/middleware/authorization.py:243— fastmcp_slim/fastmcp/server/middleware/authorization.py:243-268 | fastmcp_slim/fastmcp/server/middleware/authorization.py:467-490 — 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 `call_next` to `CallNext[mt.CallToolRequestParams, ToolResult]` in one and `CallNext[mt.GetPromptRequestParams, PromptResult]` 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 (20–24 lines × 2) fastmcp_slim/fastmcp/server/server.py:1757— fastmcp_slim/fastmcp/server/server.py:1757-1780 | fastmcp_slim/fastmcp/server/server.py:1822-1841 — 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 `fastmcp_slim/fastmcp/server/server.py:1757` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (21–23 lines × 2) REDACTED:1973— REDACTED:1973-1995 | REDACTED:2187-2207 — 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:1973` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1998` calls `max` and `REDACTED:2208` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (21–22 lines × 2) fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:288— fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:288-309 | fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:374-394 — 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 `names` to `Sequence[str]` in one and `list[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (18–21 lines × 2) fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:190— fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:190-207 | fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:236-256 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (20 lines × 5) REDACTED:174— REDACTED:174-193 | fastmcp_slim/fastmcp/server/auth/providers/aws.py:224-243 | fastmcp_slim/fastmcp/server/auth/providers/google.py:422-441 | fastmcp_slim/fastmcp/server/auth/providers/oci.py:199-218 | REDACTED:285-304 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:174` 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 (19 lines × 3) fastmcp_slim/fastmcp/client/mixins/prompts.py:99— fastmcp_slim/fastmcp/client/mixins/prompts.py:99-117 | fastmcp_slim/fastmcp/client/mixins/resources.py:100-118 | fastmcp_slim/fastmcp/client/mixins/tools.py:125-143 — 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 (16–19 lines × 2) fastmcp_slim/fastmcp/cli/cli.py:655— fastmcp_slim/fastmcp/cli/cli.py:655-670 | fastmcp_slim/fastmcp/cli/cli.py:703-721 — 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–18 lines × 2) fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:219— fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:219-236 | fastmcp_slim/fastmcp/server/transforms/search/bm25.py:117-132 — 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–18 lines × 2) REDACTED:2017— REDACTED:2017-2033 | REDACTED:2042-2059 — 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:2017` 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 lines × 3) fastmcp_slim/fastmcp/server/server.py:1063— fastmcp_slim/fastmcp/server/server.py:1063-1080 | fastmcp_slim/fastmcp/server/server.py:1343-1362 | fastmcp_slim/fastmcp/server/server.py:1465-1481 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `fastmcp_slim/fastmcp/server/server.py:1343` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (15–16 lines × 7) fastmcp_slim/fastmcp/cli/install/claude_code.py:110— fastmcp_slim/fastmcp/cli/install/claude_code.py:110-125 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:90-104 | fastmcp_slim/fastmcp/cli/install/cursor.py:104-118 | fastmcp_slim/fastmcp/cli/install/cursor.py:174-188 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:107-122 | fastmcp_slim/fastmcp/cli/install/mcp_json.py:52-66 | fastmcp_slim/fastmcp/cli/install/stdio.py:48-62 — before extracting anything, compare `fastmcp_slim/fastmcp/cli/install/claude_code.py` and `fastmcp_slim/fastmcp/cli/install/gemini_cli.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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 (16 lines × 7) fastmcp_slim/fastmcp/server/auth/providers/azure.py:283— fastmcp_slim/fastmcp/server/auth/providers/azure.py:283-298 | fastmcp_slim/fastmcp/server/auth/providers/clerk.py:395-410 | fastmcp_slim/fastmcp/server/auth/providers/discord.py:289-304 | REDACTED:410-425 | fastmcp_slim/fastmcp/server/auth/providers/google.py:415-430 | fastmcp_slim/fastmcp/server/auth/providers/huggingface.py:247-262 | REDACTED:278-293 — 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 7 call sites, so a change lands once.
Duplicated block (16 lines × 2) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196— fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196-211 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:307-322 — 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 `fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196` 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) fastmcp_slim/fastmcp/server/providers/openapi/components.py:255— fastmcp_slim/fastmcp/server/providers/openapi/components.py:255-270 | fastmcp_slim/fastmcp/server/providers/openapi/components.py:354-368 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–14 lines × 2) fastmcp_slim/fastmcp/cli/apps_dev.py:1222— fastmcp_slim/fastmcp/cli/apps_dev.py:1222-1233 | fastmcp_slim/fastmcp/cli/apps_dev.py:1236-1249 — 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–12 lines × 4) fastmcp_slim/fastmcp/utilities/inspect.py:127— fastmcp_slim/fastmcp/utilities/inspect.py:127-137 | fastmcp_slim/fastmcp/utilities/inspect.py:149-160 | fastmcp_slim/fastmcp/utilities/inspect.py:174-185 | fastmcp_slim/fastmcp/utilities/inspect.py:200-211 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `fastmcp_slim/fastmcp/utilities/inspect.py:127` 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) fastmcp_slim/fastmcp/prompts/function_prompt.py:437— fastmcp_slim/fastmcp/prompts/function_prompt.py:437-448 | fastmcp_slim/fastmcp/resources/function_resource.py:258-269 | fastmcp_slim/fastmcp/tools/function_tool.py:657-668 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `fastmcp_slim/fastmcp/prompts/function_prompt.py:437` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 3) fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:168— fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:168-178 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:174-184 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:284-294 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:168` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–11 lines × 2) fastmcp_slim/fastmcp/server/providers/openapi/provider.py:303— fastmcp_slim/fastmcp/server/providers/openapi/provider.py:303-311 | fastmcp_slim/fastmcp/server/providers/openapi/provider.py:336-346 — 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 `fastmcp_slim/fastmcp/server/providers/openapi/provider.py:303` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `fastmcp_slim/fastmcp/server/providers/openapi/provider.py:335` calls `_extract_mime_type_from_route` and `fastmcp_slim/fastmcp/server/providers/openapi/provider.py:302` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 2) fastmcp_slim/fastmcp/utilities/json_schema_type.py:1379— fastmcp_slim/fastmcp/utilities/json_schema_type.py:1379-1388 | fastmcp_slim/fastmcp/utilities/json_schema_type.py:1503-1513 — 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) fastmcp_slim/fastmcp/utilities/openapi/schemas.py:210— fastmcp_slim/fastmcp/utilities/openapi/schemas.py:210-220 | fastmcp_slim/fastmcp/utilities/openapi/schemas.py:224-234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 2) fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:72— fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:72-77 | fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:158-163 — 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 `fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:72` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 5) fastmcp_slim/fastmcp/server/providers/skills/claude_provider.py:37— fastmcp_slim/fastmcp/server/providers/skills/claude_provider.py:37-44 | fastmcp_slim/fastmcp/server/providers/skills/vendor_providers.py:19-26 | fastmcp_slim/fastmcp/server/providers/skills/vendor_providers.py:37-44 | fastmcp_slim/fastmcp/server/providers/skills/vendor_providers.py:81-88 | fastmcp_slim/fastmcp/server/providers/skills/vendor_providers.py:117-124 — there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart.
Near-duplicate member pair (34 shared lines) examples/persistent_state/client.py:22— examples/persistent_state/client.py:22-81 | examples/persistent_state/client_stdio.py:28-84 — These two members are variants of one another: 34 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 (13 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (13 members, 50+ identical tokens) examples/auth/aws_oauth/client.py:17— examples/auth/aws_oauth/client.py:17-37 | examples/auth/azure_oauth/client.py:17-27 | examples/auth/clerk_oauth/client.py:18-28 | examples/auth/discord_oauth/client.py:17-27 | examples/auth/github_oauth/client.py:17-27 | examples/auth/google_oauth/client.py:17-27 | examples/auth/huggingface_oauth/client.py:17-27 | examples/auth/keycloak_oauth/client.py:15-28 | examples/auth/mounted/client.py:19-44 | examples/auth/oci_oauth/client.py:17-27 | examples/auth/propelauth_oauth/client.py:17-38 | examples/auth/scalekit_oauth/client.py:17-36 | examples/auth/workos_oauth/client.py:17-27 — These 13 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 13 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 13 times.
D4 · Code Duplication· Edited copy of a member (34 corresponding lines) · ×1
Edited copy of a member (34 corresponding lines) examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:15— examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:15-48 | examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:52-88 — These two members are one piece of code written twice and then edited apart: 34 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 (31 corresponding lines) · ×1
Edited copy of a member (31 corresponding lines) examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:44— examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:44-74 | examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:78-108 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (40 corresponding lines) · ×1
Edited copy of a member (40 corresponding lines) scripts/auto_close_duplicates.py:77— scripts/auto_close_duplicates.py:77-121 | scripts/auto_close_needs_mre.py:75-114 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Duplicated block (15–25 lines × 4) examples/tags_example.py:52— examples/tags_example.py:52-66 | examples/tags_example.py:69-86 | examples/tags_example.py:89-113 | examples/tags_example.py:116-136 — 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 (23–25 lines × 2) examples/search/client_bm25.py:82— examples/search/client_bm25.py:82-104 | examples/search/client_regex.py:81-105 — before extracting anything, compare `examples/search/client_bm25.py` and `examples/search/client_regex.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 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 `examples/search/client_bm25.py:82` 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 (18–20 lines × 2) examples/auth/propelauth_oauth/client.py:19— examples/auth/propelauth_oauth/client.py:19-38 | examples/auth/scalekit_oauth/client.py:19-36 — 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–19 lines × 3) examples/code_mode/client.py:80— examples/code_mode/client.py:80-94 | examples/search/client_bm25.py:77-95 | examples/search/client_regex.py:76-94 — before extracting anything, compare `examples/code_mode/client.py` and `examples/search/client_bm25.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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 `examples/code_mode/client.py:80` 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 lines × 3) examples/code_mode/client.py:53— examples/code_mode/client.py:53-68 | examples/search/client_bm25.py:50-65 | examples/search/client_regex.py:50-65 — before extracting anything, compare `examples/code_mode/client.py` and `examples/search/client_bm25.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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 `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–15 lines × 2) examples/search/client_bm25.py:106— examples/search/client_bm25.py:106-120 | examples/search/client_regex.py:107-119 — before extracting anything, compare `examples/search/client_bm25.py` and `examples/search/client_regex.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 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 `examples/search/client_bm25.py:106` 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–11 lines × 3) examples/persistent_state/client.py:23— examples/persistent_state/client.py:23-32 | examples/persistent_state/client.py:44-54 | examples/persistent_state/client.py:66-76 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) examples/code_mode/client.py:38— examples/code_mode/client.py:38-47 | examples/search/client_bm25.py:35-44 | examples/search/client_regex.py:35-44 — before extracting anything, compare `examples/code_mode/client.py` and `examples/search/client_bm25.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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 (9 lines × 10) examples/auth/azure_oauth/client.py:19— examples/auth/azure_oauth/client.py:19-27 | examples/auth/clerk_oauth/client.py:20-28 | examples/auth/discord_oauth/client.py:19-27 | examples/auth/github_oauth/client.py:19-27 | examples/auth/google_oauth/client.py:19-27 | examples/auth/huggingface_oauth/client.py:19-27 | examples/auth/mounted/client.py:22-30 | examples/auth/mounted/client.py:36-44 | examples/auth/oci_oauth/client.py:19-27 | examples/auth/workos_oauth/client.py:19-27 — `examples/auth/azure_oauth/client.py` and `examples/auth/clerk_oauth/client.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 2 separate duplicated blocks between them, totalling at least 16 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 × 3) examples/persistent_state/client_stdio.py:29— examples/persistent_state/client_stdio.py:29-37 | examples/persistent_state/client_stdio.py:49-58 | examples/persistent_state/client_stdio.py:70-79 — 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 lines × 11) examples/auth/aws_oauth/client.py:18— examples/auth/aws_oauth/client.py:18-24 | examples/auth/azure_oauth/client.py:18-24 | examples/auth/clerk_oauth/client.py:19-25 | examples/auth/discord_oauth/client.py:18-24 | examples/auth/google_oauth/client.py:18-24 | examples/auth/huggingface_oauth/client.py:18-24 | examples/auth/keycloak_oauth/client.py:15-21 | examples/auth/oci_oauth/client.py:18-24 | examples/auth/propelauth_oauth/client.py:18-24 | examples/auth/scalekit_oauth/client.py:18-24 | examples/auth/workos_oauth/client.py:18-24 — `examples/auth/aws_oauth/client.py` and `examples/auth/azure_oauth/client.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 7 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. Note first that the copies are not typed on the same thing: `Client` names `fastmcp` in one and `fastmcp.client` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (37 lines × 3) examples/code_mode/server.py:23— examples/code_mode/server.py:23-74 | examples/search/server_bm25.py:25-74 | examples/search/server_regex.py:29-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
Duplicated block (7 lines × 3) examples/code_mode/client.py:28— examples/code_mode/client.py:28-34 | examples/search/client_bm25.py:25-31 | examples/search/client_regex.py:25-31 — before extracting anything, compare `examples/code_mode/client.py` and `examples/search/client_bm25.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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.
Off the main sequence: fastmcp-slim — fastmcp-slim: abstractness 0.03, instability 0.00, distance 0.97 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Interpolated log message defeats structured logging fastmcp_slim/fastmcp/utilities/authorization.py:244— `warning` at line 244 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 fastmcp_slim/fastmcp/utilities/openapi/formatters.py:47— `warning` at line 47 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 fastmcp_slim/fastmcp/utilities/openapi/formatters.py:86— `warning` at line 86 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 fastmcp_slim/fastmcp/tools/function_tool.py:490— `warning` at line 490 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 fastmcp_slim/fastmcp/server/context.py:1398— `log` at line 1398 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.log(logging.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 fastmcp_slim/fastmcp/server/server.py:1611— `log` at line 1611 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.log(logging.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 fastmcp_slim/fastmcp/server/server.py:1647— `error` at line 1647 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 fastmcp_slim/fastmcp/server/server.py:1753— `log` at line 1753 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.log(logging.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 fastmcp_slim/fastmcp/server/server.py:1760— `exception` at line 1760 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging fastmcp_slim/fastmcp/server/server.py:1763— `exception` at line 1763 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging fastmcp_slim/fastmcp/server/server.py:1820— `log` at line 1820 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.log(logging.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 fastmcp_slim/fastmcp/server/server.py:1825— `exception` at line 1825 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging fastmcp_slim/fastmcp/server/server.py:1828— `exception` at line 1828 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging fastmcp_slim/fastmcp/server/server.py:1919— `log` at line 1919 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.log(logging.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 fastmcp_slim/fastmcp/server/server.py:1924— `exception` at line 1924 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging fastmcp_slim/fastmcp/server/server.py:1927— `exception` at line 1927 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.exception("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.exception("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging fastmcp_slim/fastmcp/server/server.py:2509— `warning` at line 2509 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 fastmcp_slim/fastmcp/server/providers/aggregate.py:216— `warning` at line 216 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 fastmcp_slim/fastmcp/server/providers/aggregate.py:226— `warning` at line 226 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 fastmcp_slim/fastmcp/server/providers/aggregate.py:250— `warning` at line 250 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 fastmcp_slim/fastmcp/server/providers/openapi/components.py:279— `debug` at line 279 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 fastmcp_slim/fastmcp/server/middleware/authorization.py:256— `warning` at line 256 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 fastmcp_slim/fastmcp/server/middleware/authorization.py:349— `warning` at line 349 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 fastmcp_slim/fastmcp/server/middleware/authorization.py:478— `warning` at line 478 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 fastmcp_slim/fastmcp/server/middleware/error_handling.py:80— `error` at line 80 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.
Duplicated predicate fastmcp_slim/fastmcp/server/http.py:189— `":" in host and not host.startswith("[")` appears character-identically in 2 files — fastmcp_slim/fastmcp/server/http.py, fastmcp_slim/fastmcp/server/mixins/transport.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 .github/agentic/flows/agentic_stack_controller.py:42— `context is None or context.flow_run is None` appears character-identically in 3 files — .github/agentic/flows/agentic_stack_controller.py, .github/agentic/flows/agentic_triage.py, .github/agentic/flows/agentic_triage_records.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 .github/agentic/flows/agentic_existing_review.py:142— `deployment.version != runtime.source_sha or deployment.work_pool_name != "managed"` appears character-identically in 2 files — .github/agentic/flows/agentic_existing_review.py, .github/agentic/flows/agentic_native_triage.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 .github/agentic/flows/agentic_intake.py:137— `evidence.get("complete") is not True or evidence.get("schema_version") != 2` appears character-identically in 2 files — .github/agentic/flows/agentic_intake.py, .github/agentic/flows/agentic_stack_policy.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 fastmcp_slim/fastmcp/client/auth/oauth.py:39— `host.startswith("[") and host.endswith("]")` appears character-identically in 2 files — fastmcp_slim/fastmcp/client/auth/oauth.py, fastmcp_slim/fastmcp/server/auth/redirect_validation.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 fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:373— `isinstance(fastmcp_meta, dict) and fastmcp_meta.get("wrap_result") is True` appears character-identically in 2 files — fastmcp_slim/fastmcp/server/mixins/mcp_operations.py, fastmcp_slim/fastmcp/tools/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 fastmcp_slim/fastmcp/server/low_level.py:357— `isinstance(result_type, str) and result_type not in mcp_types.CORE_RESULT_TYPES` appears character-identically in 2 files — fastmcp_slim/fastmcp/server/low_level.py, fastmcp_slim/fastmcp/server/providers/proxy.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 fastmcp_slim/fastmcp/server/transforms/search/base.py:122— `isinstance(schema, dict) and isinstance(schema.get("$ref"), str)` appears character-identically in 2 files — fastmcp_slim/fastmcp/server/transforms/search/base.py, fastmcp_slim/fastmcp/utilities/openapi/director.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 fastmcp_slim/fastmcp/skills/models.py:116— `isinstance(value, float) and not math.isfinite(value)` appears character-identically in 2 files — fastmcp_slim/fastmcp/skills/models.py, fastmcp_slim/fastmcp/tools/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 fastmcp_slim/fastmcp/server/providers/openapi/components.py:379— `media_type == "application/json" or media_type.endswith("+json")` appears character-identically in 2 files — fastmcp_slim/fastmcp/server/providers/openapi/components.py, fastmcp_slim/fastmcp/utilities/openapi/director.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 fastmcp_slim/fastmcp/prompts/function_prompt.py:111— `metadata is not None and individual_params_provided` appears character-identically in 3 files — fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/resources/function_resource.py, fastmcp_slim/fastmcp/tools/function_tool.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 fastmcp_slim/fastmcp/prompts/function_prompt.py:131— `metadata.name or getattr(fn, "__name__", None) or fn.__class__.__name__` appears character-identically in 2 files — fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/resources/function_resource.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 fastmcp_slim/fastmcp/prompts/function_prompt.py:158— `not inspect.isroutine(fn) and not isinstance(fn, functools.partial)` appears character-identically in 4 files — fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/resources/function_resource.py, fastmcp_slim/fastmcp/resources/template.py, fastmcp_slim/fastmcp/tools/function_parsing.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:287— `not isinstance(client_id, str) or not client_id` appears character-identically in 2 files — REDACTED, fastmcp_slim/fastmcp/server/auth/oauth_proxy/revocation.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 fastmcp_slim/fastmcp/utilities/openapi/formatters.py:105— `not schema or not isinstance(schema, dict)` appears character-identically in 2 files — fastmcp_slim/fastmcp/utilities/openapi/formatters.py, fastmcp_slim/fastmcp/utilities/openapi/schemas.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 fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:50— `origin is Union or origin is types.UnionType or origin is Annotated` appears character-identically in 2 files — fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py, fastmcp_slim/fastmcp/tools/function_parsing.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 fastmcp_slim/fastmcp/prompts/function_prompt.py:173— `outer_docstring.description or inner_docstring.description` appears character-identically in 2 files — fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/tools/function_parsing.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 fastmcp_slim/fastmcp/prompts/function_prompt.py:203— `param_name in properties and "description" not in properties[param_name]` appears character-identically in 2 files — fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/tools/function_parsing.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 .github/agentic/flows/agentic_native_cache.py:95— `raw is None or digest(raw) != ref.binding` appears character-identically in 2 files — .github/agentic/flows/agentic_native_cache.py, .github/agentic/flows/agentic_triage_records.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 fastmcp_slim/fastmcp/server/providers/openapi/components.py:155— `response_info is None or not response_info.content_schema` appears character-identically in 2 files — fastmcp_slim/fastmcp/server/providers/openapi/components.py, fastmcp_slim/fastmcp/utilities/openapi/schemas.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 fastmcp_slim/fastmcp/utilities/openapi/director.py:360— `route.request_body and route.request_body.content_schema` appears character-identically in 2 files — fastmcp_slim/fastmcp/utilities/openapi/director.py, fastmcp_slim/fastmcp/utilities/openapi/schemas.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 .github/agentic/flows/agentic_existing_review.py:217— `run.state is not None and run.state.is_final()` appears character-identically in 2 files — .github/agentic/flows/agentic_existing_review.py, .github/agentic/flows/agentic_native_triage.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:295— `self._auto_bind_audience and self._resource_url is not None and isinstance(self.token_verifier, JWTVerifier)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:1107— `self.client_registration_options or ClientRegistrationOptions()` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:1108— `self.revocation_options or RevocationOptions()` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
+ 1 more in this group — see findings.md.
X23 · Unguarded diagnostic materialisation· Diagnostic log message is built whether or not it is wanted · ×8
Diagnostic log message is built whether or not it is wanted fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:190— `debug` at line 190 is called with an argument built by `"…".join(dependencies)` (line 190), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:236— `debug` at line 236 is called with an argument built by `"…".join(editable_paths)` (line 236), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted fastmcp_slim/fastmcp/server/auth/providers/scalekit.py:195— `debug` at line 195 is called with an argument built by `list(metadata.keys())` (line 197), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted REDACTED:2406— `debug` at line 2406 is called with an argument built by `sorted(missing_scopes)` (line 2408), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted REDACTED:2911— `debug` at line 2911 is called with an argument built by `list(self._extra_token_params.keys())` (line 2914), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted fastmcp_slim/fastmcp/cli/cli.py:630— `debug` at line 630 is called with an argument built by `list(final_server_args)` (line 639), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted fastmcp_slim/fastmcp/cli/cli.py:739— `debug` at line 739 is called with an argument built by `"…".join(cmd)` (line 739), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted fastmcp_slim/fastmcp/cli/run.py:314— `debug` at line 314 is called with an argument built by `"…".join(cmd)` (line 314), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Silent fallback default on parse failure fastmcp_slim/fastmcp/cli/apps_dev.py:946— `_build_picker_html` returns `"<html><body><p>prefab-ui not installed. Run: pip install 'fastmcp[apps]'</p></body></html>"` when `ImportError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure fastmcp_slim/fastmcp/server/http.py:172— `_origin_host` returns `''` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure fastmcp_slim/fastmcp/tools/function_tool.py:244— `_resolve_param_hints` returns `{}` when `TypeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure fastmcp_tasks/fastmcp_tasks/context.py:133— `get_task_leg_number` returns `1` when `LookupError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure fastmcp_tasks/fastmcp_tasks/keys.py:75— `leg_number_from_key` returns `1` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure fastmcp_tasks/fastmcp_tasks/worker_cli.py:66— `redact_backend_url` returns `'***'` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Orphaned file fastmcp_slim/fastmcp/server/auth/providers/propelauth.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 fastmcp_tasks/fastmcp_tasks/encryption.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 fastmcp_slim/fastmcp/server/auth/providers/keycloak.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.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×2
Projects may be oversized for their cohesion fastmcp_slim/REDACTED:1— `fastmcp_slim` (75517 LoC, 641 module-visible types across 38 directories) overshoots its size bounds. 2 of 4 build unit(s) (Python) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
Projects may be oversized for their cohesion REDACTED:1— `(repository root)` (13991 LoC, 208 module-visible types across 47 directories) overshoots its size bounds. 2 of 4 build unit(s) (Python) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 35 significant file(s) lose their only recent owner: scripts/rank_issues.py, fastmcp_slim/fastmcp/server/providers/base.py, fastmcp_slim/fastmcp/server/auth/identity_assertion.py, scripts/maintenance_status.py, fastmcp_slim/fastmcp/client/auth/client_credentials.py, fastmcp_slim/fastmcp/experimental/transforms/jev_search.py, fastmcp_slim/fastmcp/apps/app.py, fastmcp_slim/fastmcp/server/transforms/search/base.py (+27 more). Pair on, review, or document these before any departure.
D20 · ADR Quality· ADR has no Consequences section · ×1
ADR has no Consequences section dev-docs/v3-notes/auth-provider-env-vars.md:2— dev-docs/v3-notes/auth-provider-env-vars.md has no Consequences section (a heading such as `## Consequences`, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
REDACTED
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 3 of 235 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; 235 of the 306 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: fastmcp_slim/fastmcp/server/auth/providers/propelauth.py, fastmcp_tasks/fastmcp_tasks/encryption.py, fastmcp_slim/fastmcp/server/auth/providers/keycloak.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
M2 · Architecture documentation· ADRs not easily discoverable · ×1
ADRs not easily discoverable — 1 ADR-shaped document(s) detected by content — `dev-docs/v3-notes/auth-provider-env-vars.md`. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live — so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here.
Logging is not universal — Only 2/3 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `fastmcp_remote`.
No SAST .github/workflows/agentic-checks.yml:4— 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 26 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.
X2 · Cancellation propagation· Not all async functions that make a request accept an AbortSignal · ×1
Not all async functions that make a request accept an AbortSignal — Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 3 shipped distribution(s) across 4 manifest(s) (2 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, REDACTED, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
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. semgrep could not parse 1 file(s) — `fastmcp_slim/fastmcp/cli/apps_dev.py` — so the PII/GDPR sweep did not cover them at all.
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 01a1e3c9-7ecf-73a2-86b8-0d9324c9c3a2 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 17 · Warnings: 586 · Recommendations: 96 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 16-11-2026 @ 09:56 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.