Public report of mem0ai/mem0, published 26 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 26 October 2026, 13:10 UTC · Survey ID cd_0ea3b188accf4999b47f71f84a82ff48
mem0ai/mem0
Measured 26 October 2026, 13:07 UTC, at code version 2c81af3
No regression since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAt riskDown 2 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 122,325 lines of product code in 19 projects, tests not counted · Estimated rebuild effort: about 1.2 person-years · Weakest lens: Production Readiness, 30
Findings by how serious they are
253 critical1271 serious288 minor
12 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
26 October 2026, 13:07 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
88of 88 dimensions measured by tools.
1779of 1812 findings point to an exact file and line, so you can open each one in the code. The other 33 concern the repository as a whole, such as missing documentation.
88dimensions across 7 lenses, read from 122,325 lines of product code in 19 projects.
mem0ai/mem0 is rated At risk because critical security findings are open, most of them in the build pipeline. It scores 39 out of 100, which the At risk rating leaves unchanged.
Production Readiness, at 30, is the weakest lens and counts most in the score. The best first step is replacing the two exposed passwords or keys and switching the old ones off, worth about 7 points. Replacing the two packages under a banned licence comes next, worth about 5 points. Raising Production Readiness to 70 would lift the score to about 46.
136 pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Fifty known security holes in the packages the code depends on can be used by attackers, and sixteen weaknesses in the code could be used by an attacker. Pinning each tool to an exact version, updating the vulnerable packages and fixing the weaknesses the scanner points to would close these risks. Limiting each secret to its own step would fix the 14 secrets exposed to more of the pipeline than needed, and setting a waiting period for automatic updates would deal with the eight automatic dependency updates that take new releases at once. The five buttons or links with no name need a name, even when they only show an icon.
The product code is 122,325 lines, about €170,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 Production Readiness rose from 30 to 70, the lowest score rated Strong, the score would rise from 39 to about 46.
Code composition: what the lines of code are
Product code 61%Tests 39%
New since the last survey: 120 findings
These 120 critical or serious findings weren't in the previous survey, on 12 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED
Visual & motion safety · Focus outline removed in CSS without a :focus replacement examples/yt-assistant-chrome/styles/options.css
Visual & motion safety · Animation without a prefers-reduced-motion guard server/dashboard/src/styles/animations.css
Visual & motion safety · Animation without a prefers-reduced-motion guard server/dashboard/src/styles/animations.css
Visual & motion safety · Animation without a prefers-reduced-motion guard server/dashboard/src/styles/animations.css
Visual & motion safety · Animation without a prefers-reduced-motion guard server/dashboard/src/styles/animations.css
Visual & motion safety · Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/content.css
Visual & motion safety · Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/options.css
Visual & motion safety · Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/options.css
Visual & motion safety · Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/options.css
Visual & motion safety · Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/options.css
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 336 findings
These 336 critical or serious findings were in the previous survey, on 12 October 2026, and are gone from this one. The first 100 are listed here.
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED
Code Duplication · Duplicated block with local edits (13 matched lines × 2 locations) mem0-ts/src/oss/src/vector_stores/azure_mysql.ts
Rebuild cost: about €170,000 · Estimate
Cost to rebuild
€56,000 to €280,000, for 939 to 2,979 hours of work, about 1.2 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 39. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 122,325 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: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 2 Leaked secret finding(s) in Secret Scanning — start with REDACTED (2).
Raises the score by about 7 points · Low effort · Secret Scanning
2
Resolve the 2 Banned license finding(s) in License Compliance.
Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability.
Raises the score by about 2 points · Low effort · Test Reliability
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €170,000 to build again, about 1.2 person-years of work. Its weakest lens is Production Readiness, at 30 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 2 Leaked secret finding(s) in Secret Scanning. Of all the actions in this report, it raises the score most for the work it takes: about 7 points for low effort, because it clears the 2 Secret Scanning findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.6 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 6% to 14% on every change. The history of the code shows how much it changes: about 101,510 lines over the last 90 days, which is about 411,679 lines a year. At that pace, the extra work comes to an estimated 62.1 to 372.7 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
395 modules, with 344 dependencies between them. Every module uses only modules listed above it, so there are no loops.
The table shows the 40 modules with the most connections; 355 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.
integrations.agent-plugin-core.typescript.src uses cli.node.src.config, so a change to cli.node.src.config can break integrations.agent-plugin-core.typescript.src, while a change to integrations.agent-plugin-core.typescript.src can't break cli.node.src.config.
Position
Below the diagonal: integrations.agent-plugin-core.typescript.src uses a module listed above it, which is the healthy direction.
integrations.agent-plugin-core.typescript.src uses integrations.agent-plugin-core.typescript.src.scoping, so a change to integrations.agent-plugin-core.typescript.src.scoping can break integrations.agent-plugin-core.typescript.src, while a change to integrations.agent-plugin-core.typescript.src can't break integrations.agent-plugin-core.typescript.src.scoping.
Position
Below the diagonal: integrations.agent-plugin-core.typescript.src uses a module listed above it, which is the healthy direction.
integrations.openclaw.types uses cli.node.src.backend.base, so a change to cli.node.src.backend.base can break integrations.openclaw.types, while a change to integrations.openclaw.types can't break cli.node.src.backend.base.
Position
Below the diagonal: integrations.openclaw.types uses a module listed above it, which is the healthy direction.
integrations.pi-agent-plugin.src.memory uses cli.node.src.config, so a change to cli.node.src.config can break integrations.pi-agent-plugin.src.memory, while a change to integrations.pi-agent-plugin.src.memory can't break cli.node.src.config.
Position
Below the diagonal: integrations.pi-agent-plugin.src.memory uses a module listed above it, which is the healthy direction.
integrations.pi-agent-plugin.src.memory uses integrations.agent-plugin-core.typescript.src.scoping, so a change to integrations.agent-plugin-core.typescript.src.scoping can break integrations.pi-agent-plugin.src.memory, while a change to integrations.pi-agent-plugin.src.memory can't break integrations.agent-plugin-core.typescript.src.scoping.
Position
Below the diagonal: integrations.pi-agent-plugin.src.memory uses a module listed above it, which is the healthy direction.
integrations.pi-agent-plugin.src.memory uses mem0-ts.src.client.mem0, so a change to mem0-ts.src.client.mem0 can break integrations.pi-agent-plugin.src.memory, while a change to integrations.pi-agent-plugin.src.memory can't break mem0-ts.src.client.mem0.
Position
Below the diagonal: integrations.pi-agent-plugin.src.memory uses a module listed above it, which is the healthy direction.
integrations.vercel-ai-sdk.src.mem0-provider uses cli.node.src.config, so a change to cli.node.src.config can break integrations.vercel-ai-sdk.src.mem0-provider, while a change to integrations.vercel-ai-sdk.src.mem0-provider can't break cli.node.src.config.
Position
Below the diagonal: integrations.vercel-ai-sdk.src.mem0-provider uses a module listed above it, which is the healthy direction.
integrations.vercel-ai-sdk.src.mem0-provider uses integrations.vercel-ai-sdk.src.mem0-types, so a change to integrations.vercel-ai-sdk.src.mem0-types can break integrations.vercel-ai-sdk.src.mem0-provider, while a change to integrations.vercel-ai-sdk.src.mem0-provider can't break integrations.vercel-ai-sdk.src.mem0-types.
Position
Below the diagonal: integrations.vercel-ai-sdk.src.mem0-provider uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.embeddings.openai uses mem0-ts.src.oss.src.embeddings.base, so a change to mem0-ts.src.oss.src.embeddings.base can break mem0-ts.src.oss.src.embeddings.openai, while a change to mem0-ts.src.oss.src.embeddings.openai can't break mem0-ts.src.oss.src.embeddings.base.
Position
Below the diagonal: mem0-ts.src.oss.src.embeddings.openai uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.embeddings.openai uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.embeddings.openai, while a change to mem0-ts.src.oss.src.embeddings.openai can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.embeddings.openai uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.embeddings.vertexai uses mem0-ts.src.client.mem0, so a change to mem0-ts.src.client.mem0 can break mem0-ts.src.oss.src.embeddings.vertexai, while a change to mem0-ts.src.oss.src.embeddings.vertexai can't break mem0-ts.src.client.mem0.
Position
Below the diagonal: mem0-ts.src.oss.src.embeddings.vertexai uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.embeddings.vertexai uses mem0-ts.src.oss.src.embeddings.base, so a change to mem0-ts.src.oss.src.embeddings.base can break mem0-ts.src.oss.src.embeddings.vertexai, while a change to mem0-ts.src.oss.src.embeddings.vertexai can't break mem0-ts.src.oss.src.embeddings.base.
Position
Below the diagonal: mem0-ts.src.oss.src.embeddings.vertexai uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.embeddings.vertexai uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.embeddings.vertexai, while a change to mem0-ts.src.oss.src.embeddings.vertexai can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.embeddings.vertexai uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.openai uses mem0-ts.src.oss.src.llms.base, so a change to mem0-ts.src.oss.src.llms.base can break mem0-ts.src.oss.src.llms.openai, while a change to mem0-ts.src.oss.src.llms.openai can't break mem0-ts.src.oss.src.llms.base.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.openai uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.openai uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.llms.openai, while a change to mem0-ts.src.oss.src.llms.openai can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.openai uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.vector_stores.base uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.vector_stores.base, while a change to mem0-ts.src.oss.src.vector_stores.base can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.vector_stores.base uses a module listed above it, which is the healthy direction.
integrations.openclaw.cli uses cli.node.src.backend.base, so a change to cli.node.src.backend.base can break integrations.openclaw.cli, while a change to integrations.openclaw.cli can't break cli.node.src.backend.base.
Position
Below the diagonal: integrations.openclaw.cli uses a module listed above it, which is the healthy direction.
integrations.openclaw.cli uses cli.node.src.config, so a change to cli.node.src.config can break integrations.openclaw.cli, while a change to integrations.openclaw.cli can't break cli.node.src.config.
Position
Below the diagonal: integrations.openclaw.cli uses a module listed above it, which is the healthy direction.
integrations.openclaw.cli uses integrations.openclaw.types, so a change to integrations.openclaw.types can break integrations.openclaw.cli, while a change to integrations.openclaw.cli can't break integrations.openclaw.types.
Position
Below the diagonal: integrations.openclaw.cli uses a module listed above it, which is the healthy direction.
integrations.openclaw.tools uses cli.node.src.backend.base, so a change to cli.node.src.backend.base can break integrations.openclaw.tools, while a change to integrations.openclaw.tools can't break cli.node.src.backend.base.
Position
Below the diagonal: integrations.openclaw.tools uses a module listed above it, which is the healthy direction.
integrations.openclaw.tools uses cli.node.src.config, so a change to cli.node.src.config can break integrations.openclaw.tools, while a change to integrations.openclaw.tools can't break cli.node.src.config.
Position
Below the diagonal: integrations.openclaw.tools uses a module listed above it, which is the healthy direction.
integrations.openclaw.tools uses integrations.openclaw.types, so a change to integrations.openclaw.types can break integrations.openclaw.tools, while a change to integrations.openclaw.tools can't break integrations.openclaw.types.
Position
Below the diagonal: integrations.openclaw.tools uses a module listed above it, which is the healthy direction.
integrations.vercel-ai-sdk.src uses integrations.vercel-ai-sdk.src.mem0-types, so a change to integrations.vercel-ai-sdk.src.mem0-types can break integrations.vercel-ai-sdk.src, while a change to integrations.vercel-ai-sdk.src can't break integrations.vercel-ai-sdk.src.mem0-types.
Position
Below the diagonal: integrations.vercel-ai-sdk.src uses a module listed above it, which is the healthy direction.
integrations.vercel-ai-sdk.src uses integrations.openclaw.types, so a change to integrations.openclaw.types can break integrations.vercel-ai-sdk.src, while a change to integrations.vercel-ai-sdk.src can't break integrations.openclaw.types.
Position
Below the diagonal: integrations.vercel-ai-sdk.src uses a module listed above it, which is the healthy direction.
integrations.vercel-ai-sdk.src uses integrations.vercel-ai-sdk.src.mem0-provider, so a change to integrations.vercel-ai-sdk.src.mem0-provider can break integrations.vercel-ai-sdk.src, while a change to integrations.vercel-ai-sdk.src can't break integrations.vercel-ai-sdk.src.mem0-provider.
Position
Below the diagonal: integrations.vercel-ai-sdk.src uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.deepseek uses mem0-ts.src.oss.src.llms.base, so a change to mem0-ts.src.oss.src.llms.base can break mem0-ts.src.oss.src.llms.deepseek, while a change to mem0-ts.src.oss.src.llms.deepseek can't break mem0-ts.src.oss.src.llms.base.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.deepseek uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.deepseek uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.llms.deepseek, while a change to mem0-ts.src.oss.src.llms.deepseek can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.deepseek uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.deepseek uses mem0-ts.src.oss.src.llms.openai, so a change to mem0-ts.src.oss.src.llms.openai can break mem0-ts.src.oss.src.llms.deepseek, while a change to mem0-ts.src.oss.src.llms.deepseek can't break mem0-ts.src.oss.src.llms.openai.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.deepseek uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.litellm uses mem0-ts.src.oss.src.llms.base, so a change to mem0-ts.src.oss.src.llms.base can break mem0-ts.src.oss.src.llms.litellm, while a change to mem0-ts.src.oss.src.llms.litellm can't break mem0-ts.src.oss.src.llms.base.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.litellm uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.litellm uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.llms.litellm, while a change to mem0-ts.src.oss.src.llms.litellm can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.litellm uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.litellm uses mem0-ts.src.oss.src.llms.openai, so a change to mem0-ts.src.oss.src.llms.openai can break mem0-ts.src.oss.src.llms.litellm, while a change to mem0-ts.src.oss.src.llms.litellm can't break mem0-ts.src.oss.src.llms.openai.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.litellm uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.lmstudio uses mem0-ts.src.oss.src.llms.base, so a change to mem0-ts.src.oss.src.llms.base can break mem0-ts.src.oss.src.llms.lmstudio, while a change to mem0-ts.src.oss.src.llms.lmstudio can't break mem0-ts.src.oss.src.llms.base.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.lmstudio uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.lmstudio uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.llms.lmstudio, while a change to mem0-ts.src.oss.src.llms.lmstudio can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.lmstudio uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.lmstudio uses mem0-ts.src.oss.src.llms.openai, so a change to mem0-ts.src.oss.src.llms.openai can break mem0-ts.src.oss.src.llms.lmstudio, while a change to mem0-ts.src.oss.src.llms.lmstudio can't break mem0-ts.src.oss.src.llms.openai.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.lmstudio uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.minimax uses mem0-ts.src.oss.src.llms.base, so a change to mem0-ts.src.oss.src.llms.base can break mem0-ts.src.oss.src.llms.minimax, while a change to mem0-ts.src.oss.src.llms.minimax can't break mem0-ts.src.oss.src.llms.base.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.minimax uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.minimax uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.llms.minimax, while a change to mem0-ts.src.oss.src.llms.minimax can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.minimax uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.minimax uses mem0-ts.src.oss.src.llms.openai, so a change to mem0-ts.src.oss.src.llms.openai can break mem0-ts.src.oss.src.llms.minimax, while a change to mem0-ts.src.oss.src.llms.minimax can't break mem0-ts.src.oss.src.llms.openai.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.minimax uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.sarvam uses mem0-ts.src.oss.src.llms.base, so a change to mem0-ts.src.oss.src.llms.base can break mem0-ts.src.oss.src.llms.sarvam, while a change to mem0-ts.src.oss.src.llms.sarvam can't break mem0-ts.src.oss.src.llms.base.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.sarvam uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.sarvam uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.llms.sarvam, while a change to mem0-ts.src.oss.src.llms.sarvam can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.sarvam uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.llms.sarvam uses mem0-ts.src.oss.src.llms.openai, so a change to mem0-ts.src.oss.src.llms.openai can break mem0-ts.src.oss.src.llms.sarvam, while a change to mem0-ts.src.oss.src.llms.sarvam can't break mem0-ts.src.oss.src.llms.openai.
Position
Below the diagonal: mem0-ts.src.oss.src.llms.sarvam uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.memory uses mem0-ts.src.oss.src.embeddings.base, so a change to mem0-ts.src.oss.src.embeddings.base can break mem0-ts.src.oss.src.memory, while a change to mem0-ts.src.oss.src.memory can't break mem0-ts.src.oss.src.embeddings.base.
Position
Below the diagonal: mem0-ts.src.oss.src.memory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.memory uses mem0-ts.src.oss.src.llms.base, so a change to mem0-ts.src.oss.src.llms.base can break mem0-ts.src.oss.src.memory, while a change to mem0-ts.src.oss.src.memory can't break mem0-ts.src.oss.src.llms.base.
Position
Below the diagonal: mem0-ts.src.oss.src.memory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.memory uses mem0-ts.src.oss.src.storage.base, so a change to mem0-ts.src.oss.src.storage.base can break mem0-ts.src.oss.src.memory, while a change to mem0-ts.src.oss.src.memory can't break mem0-ts.src.oss.src.storage.base.
Position
Below the diagonal: mem0-ts.src.oss.src.memory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.memory uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.memory, while a change to mem0-ts.src.oss.src.memory can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.memory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.memory uses mem0-ts.src.oss.src.vector_stores.base, so a change to mem0-ts.src.oss.src.vector_stores.base can break mem0-ts.src.oss.src.memory, while a change to mem0-ts.src.oss.src.memory can't break mem0-ts.src.oss.src.vector_stores.base.
Position
Below the diagonal: mem0-ts.src.oss.src.memory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.utils.factory uses mem0-ts.src.oss.src.embeddings.base, so a change to mem0-ts.src.oss.src.embeddings.base can break mem0-ts.src.oss.src.utils.factory, while a change to mem0-ts.src.oss.src.utils.factory can't break mem0-ts.src.oss.src.embeddings.base.
Position
Below the diagonal: mem0-ts.src.oss.src.utils.factory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.utils.factory uses mem0-ts.src.oss.src.llms.base, so a change to mem0-ts.src.oss.src.llms.base can break mem0-ts.src.oss.src.utils.factory, while a change to mem0-ts.src.oss.src.utils.factory can't break mem0-ts.src.oss.src.llms.base.
Position
Below the diagonal: mem0-ts.src.oss.src.utils.factory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.utils.factory uses mem0-ts.src.oss.src.rerankers.base, so a change to mem0-ts.src.oss.src.rerankers.base can break mem0-ts.src.oss.src.utils.factory, while a change to mem0-ts.src.oss.src.utils.factory can't break mem0-ts.src.oss.src.rerankers.base.
Position
Below the diagonal: mem0-ts.src.oss.src.utils.factory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.utils.factory uses mem0-ts.src.oss.src.storage.base, so a change to mem0-ts.src.oss.src.storage.base can break mem0-ts.src.oss.src.utils.factory, while a change to mem0-ts.src.oss.src.utils.factory can't break mem0-ts.src.oss.src.storage.base.
Position
Below the diagonal: mem0-ts.src.oss.src.utils.factory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.utils.factory uses mem0-ts.src.oss.src.types, so a change to mem0-ts.src.oss.src.types can break mem0-ts.src.oss.src.utils.factory, while a change to mem0-ts.src.oss.src.utils.factory can't break mem0-ts.src.oss.src.types.
Position
Below the diagonal: mem0-ts.src.oss.src.utils.factory uses a module listed above it, which is the healthy direction.
mem0-ts.src.oss.src.utils.factory uses mem0-ts.src.oss.src.vector_stores.base, so a change to mem0-ts.src.oss.src.vector_stores.base can break mem0-ts.src.oss.src.utils.factory, while a change to mem0-ts.src.oss.src.utils.factory can't break mem0-ts.src.oss.src.vector_stores.base.
Position
Below the diagonal: mem0-ts.src.oss.src.utils.factory uses a module listed above it, which is the healthy direction.
integrations.openclaw uses cli.node.src.backend.base, so a change to cli.node.src.backend.base can break integrations.openclaw, while a change to integrations.openclaw can't break cli.node.src.backend.base.
Position
Below the diagonal: integrations.openclaw uses a module listed above it, which is the healthy direction.
integrations.openclaw uses cli.node.src.config, so a change to cli.node.src.config can break integrations.openclaw, while a change to integrations.openclaw can't break cli.node.src.config.
Position
Below the diagonal: integrations.openclaw uses a module listed above it, which is the healthy direction.
integrations.openclaw uses integrations.openclaw.types, so a change to integrations.openclaw.types can break integrations.openclaw, while a change to integrations.openclaw can't break integrations.openclaw.types.
Position
Below the diagonal: integrations.openclaw uses a module listed above it, which is the healthy direction.
integrations.openclaw uses integrations.openclaw.tools, so a change to integrations.openclaw.tools can break integrations.openclaw, while a change to integrations.openclaw can't break integrations.openclaw.tools.
Position
Below the diagonal: integrations.openclaw uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 55% · Adequate · gated by D1, 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
247
High / Critical
A03:2025 — Software Supply Chain Failures
92
High / Critical
A02:2025 — Security Misconfiguration
11
High / Critical
A07:2025 — Authentication Failures
5
High / Critical
Roadmap
Immediately resolve the two leaked secrets in REDACTED and the two banned license findings to secure compliance and safety. Enhance accessibility by making custom controls keyboard-operable, ensuring visible focus styles, guarding animations for reduced motion, and correcting low-contrast colors. Finally, link this repository to the operations platform to document production backup and disaster recovery controls, clarifying that development volumes are not the primary protection target.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 2 Leaked secret finding(s) in Secret Scanning — start with REDACTED (2).
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.
Point at where production persistence is operated — a link from this repo to the ops/platform repo that holds its backup, geo-recovery and RTO/RPO controls — so the DR posture is reviewable from here; the dev-stack volume is not the thing to protect.
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 — 253
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 — 1271
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 — 288
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 12
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 88 of 88 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 88 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, 1779 of 1812 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: this repository's production source spans .ts, .tsx, .py, and our analyzer cannot run the .py test suite(s) — so no coverage was collected for the repository as a whole. The JavaScript/TypeScript half did build and run, and its own line coverage came back at 63.4% — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero. In the meantime, produce a coverage report in a standard format (lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`, or `coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures and real coverage will be read. You can widen what we reach: optional: produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then both halves are read on the next scan.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 2,388 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 141 test source file(s) (.py) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares REDACTED, but the licence verdict published here was taken over its Python distribution dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `server/dashboard/tailwind.config.ts` 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.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (REDACTED). compose up failed (exit 15 — the compose project is invalid) — time="2026-10-26T13:08:18Z" level=warning msg="The \"JWT_SECRET\" variable is not set. Defaulting to a blank string." error while interpolating services.postgres.environment.[]: required variable POSTGRES_PASSWORD is missing a value: Set POSTGRES_PASSWORD in .env; runtime evidence skipped.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and 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 — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P2 Observability — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 107 further occurrence(s) are not listed individually; the score already reflects all 147.
R10 Code Duplication — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 193 further occurrence(s) are not listed individually; the score already reflects all 233.
R7 Dead Code — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 7 further occurrence(s) are not listed individually; the score already reflects all 47.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X3 Exception handling — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 174 further occurrence(s) are not listed individually; the score already reflects all 214.
X4 Structured logging — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 312 further occurrence(s) are not listed individually; the score already reflects all 352.
X7 Silent fallback defaults — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 19 further occurrence(s) are not listed individually; the score already reflects all 59.
Repo exclusion declarations: 31 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned REDACTED, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
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.
AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
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.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
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.
C4 Data Retention: This control is scored from in-repo evidence only — its real-world effectiveness, exercised only at runtime, is outside a static scan.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
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.
192 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was commands.registerCliCommands at 218. A further 4 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being VectorStoreFactory.create at 29 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: mem0-ts/src/oss/src/utils/factory.ts (VectorStoreFactory.create at 29). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 122 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 120 down to 120 or less in Cyclomatic Complexity — start with commands.registerCliCommands (cyclomatic 218). — Refactoring it lifts Cyclomatic Complexity from 2.8 to about 3.9/10.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 171 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 14 bodies over 60 down to 60 or less in Cognitive Complexity — start with commands.registerCliCommands (cognitive 339), Memory.addToVectorStore (cognitive 162), index.registerHooks (cognitive 155). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 14 together lifts Cognitive Complexity from 2.0 to about 4.3/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.9 / 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 35 FileTooLong finding(s) in God Classes — start with REDACTED (7), REDACTED (7), index.ts (4). — One of this dimension's main actionable groups (35 warning-level).
Resolve the 16 FunctionTooLong finding(s) in God Classes — start with page.tsx (6), commands.ts, opencode-mem0.ts. — One of this dimension's main actionable groups (16 warning-level).
Resolve the 9 TooManyMethods finding(s) in God Classes — start with REDACTED (4), neptune_analytics.ts, databricks.ts. — One of this dimension's main actionable groups (9 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
238 duplicated block group(s) detected. A further 92 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 2 of the 330 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. Measured on part of this repository only: .ts (36% of production source) was not exposed to THIS dimension's token comparison and is not in this count; duplication there is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream.
Members sharing a duplicated core (7 members, 50+ identical tokens) · ×74integrations/agent-plugin-core/python/mcp_server.py:78
Duplicated block (8 lines × 7) · ×9REDACTED:471
Members sharing a duplicated core (6 members, 50+ identical tokens) · ×8integrations/agent-plugin-core/python/flush_worker.py:26
+ 139 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 74 Members sharing a duplicated core (7 members, 50+ identical tokens) finding(s) in Code Duplication — start with REDACTED (51), REDACTED (16), mcp_server.py (5). — One of this dimension's main actionable groups (74 warning-level).
Resolve the 9 Duplicated block (8 lines × 7) finding(s) in Code Duplication — start with REDACTED (8), REDACTED. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 8 Members sharing a duplicated core (6 members, 50+ identical tokens) finding(s) in Code Duplication — start with hook_runner.py (5), flush_worker.py, anthropic.py. — One of this dimension's main actionable groups (8 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ 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.
15 production modules (npm+Python), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence.
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 9 Low cohesion finding(s) in Cohesion (LCOM4) — start with REDACTED (7), baidu.py, aws_bedrock.py. — One of this dimension's main actionable groups (9 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
4870 test methods: 3992 unit, 867 integration, 0 BDD, 11 e2e. The JavaScript/TypeScript suite contributes 2388 `it`/`test` case(s) across 174 test file(s) declaring at least one; its tier split is read from package names and paths only. The Python suite contributes 2482 test function(s) across 132 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Stronggated by 10 serious findings✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
1 skipped (1 with a documented reason), 6 zero-assertion, 4 synchronised by a fixed sleep, no mocking-framework packages referenced (hand-written doubles or no mocking) across 2388 tests. Measured on the JavaScript/TypeScript suite only — at least 141 test source file(s) (.py) went unread, so its test quality is unmeasured and is not in these counts.
No assertions: initialize() is idempotent · ×6mem0-ts/src/oss/tests/dimension-autodetect.test.ts:219
Fixed-sleep synchronisation: all public methods wait for initialization · ×4mem0-ts/src/oss/tests/dimension-autodetect.test.ts:375
Mock-dominated test: add flow works with lmstudio LLM for fact extraction · ×15mem0-ts/src/oss/tests/config-manager.test.ts:886
Resolve the 15 Mock-dominated test finding(s) in Test Quality — start with cli-commands.test.ts (8), mongodb.test.ts (3), config-manager.test.ts. — One of this dimension's main actionable groups (15 recommendation-level).
Resolve the 6 No assertions finding(s) in Test Quality — start with vector-stores-compat.test.ts (4), dimension-autodetect.test.ts, text-properties.test.ts. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 4 Fixed-sleep synchronisation finding(s) in Test Quality — start with telemetry.test.ts (3), dimension-autodetect.test.ts. — One of this dimension's main actionable groups (4 warning-level).
Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Adequategated by 1 critical finding✓ 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 2 measured tier(s). JavaScript/TypeScript (vitest via `pnpm install --frozen-lockfile --ignore-scripts` in cli/node/ (150 tests); node:test via `pnpm install --frozen-lockfile --ignore-scripts` in integrations/agent-plugin-core/typescript/ (6 tests); vitest via `pnpm install --frozen-lockfile --ignore-scripts` in integrations/deepseek-plugin/ (47 tests); jest via `pnpm install --frozen-lockfile --ignore-scripts` in integrations/n8n-nodes-mem0/ (17 tests); vitest via `pnpm install --frozen-lockfile --ignore-scripts` in integrations/openclaw/ (435 tests); bun:test via `npm install --ignore-scripts` (no lockfile) in integrations/opencode-plugin/ (35 tests); vitest via `pnpm install --frozen-lockfile --ignore-scripts` in integrations/pi-agent-plugin/ (96 tests); jest via `pnpm install --frozen-lockfile --ignore-scripts` in integrations/vercel-ai-sdk/ (85 tests); jest via `pnpm install --frozen-lockfile --ignore-scripts` in integrations/zapier-mem0/ (14 tests); jest via `pnpm install --frozen-lockfile --ignore-scripts` in mem0-ts/ (1606 tests); jest via `pnpm install --frozen-lockfile --ignore-scripts` in mem0-ts/src/community/ (0 tests); jest via `pnpm install --frozen-lockfile --ignore-scripts` in mem0-ts/src/oss/ (0 tests)): measured (0 flaky); Python (4 distributions): measured (0 flaky).
Test suite declares a test script but contains no test files: mem0-ts/src/community/
What to do
Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d11_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
4 outdated, 0 yanked pinned Python distributions. 4 of 25 shipped distributions were graded against pypi.org (0 not published there, 21 declared without an exact pin, which installs the newest release the declaration admits and so cannot be behind one). Only EXACT pins are graded for currency: a floor or a range already installs the newest release it admits, so reporting one would report this repository for being current. Whether a deliberate upper cap has itself gone stale is a different and weaker question, and is not asked. Whether any distribution is UNMAINTAINED is not graded — PyPI publishes no maintenance status, and release age does not stand in for one. Lockfiles are not read (REDACTED, uv.lock, Pipfile.lock, pdm.lock), so a lock-resolved install is outside this verdict. Known CVEs in this dependency graph are D30's question.
Outdated: bcrypt · ×4
What to do
Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
Resolve the 2 Leaked secret finding(s) in Secret Scanning — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Enforce Secret Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
2 of 107 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 25 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (82 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. 3 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged. This repository publishes itself under Apache-2.0 / Apache-2.0 AND MIT, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's Python distribution dependencies and nothing else. The repository also declares REDACTED, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
Banned license: psycopg · ×2
What to do
Resolve the 2 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (2 issue-level).
Enforce License Compliance in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d14_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 17 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED (7), index.ts (2), commands.ts. — One of this dimension's main actionable groups (17 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with mem0.ts. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.9 / 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.
34 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is REDACTED. Counted over 318 of the 558 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 · ×2
Further sole-owners (lower concentration)
What to do
Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
11 deducted task-comment markers across 122325 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 11 TodoComment finding(s) in Explicit Debt — start with REDACTED (3), redis.py (2), mem0.types.ts. — One of this dimension's main actionable groups (11 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 279 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
3 of 19 build units (Python, npm) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
2 finding(s): 0 critical, 2 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 2 High secret finding(s) in Secrets (history) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 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).
247 finding(s): 0 critical, 182 high, 27 medium, 38 low. 136 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 3 file(s) — `examples/mem0-demo/components/mem0/markdown.tsx` (line 208), `examples/mem0-demo/tailwind.config.ts` (line 62), `server/dashboard/tailwind.config.ts` (line 346) — 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 3 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
+ 12 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 12 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (12). — One of this dimension's main actionable groups (12 issue-level).
Resolve the 8 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (8 issue-level).
No action in Static Analysis (SAST) — all 136 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (136 issue-level, 0 of them charged here).
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.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 40 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (18), REDACTED (14), REDACTED (7). — One of this dimension's main actionable groups (40 issue-level).
Resolve the 6 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (5), REDACTED. — One of this dimension's main actionable groups (6 issue-level).
Resolve the 2 Critical vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 3 High IaC finding(s) in IaC & Container Security — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 5 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (3), REDACTED, REDACTED. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 3 Low IaC finding(s) in IaC & Container Security — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 recommendation-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
53 of 318 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts. Counted over 318 of the 558 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 53 Orphaned file finding(s) in Knowledge Freshness — start with page.tsx (4), azure_ai_search.ts, vertex_ai_vector_search.ts. — One of this dimension's main actionable groups (53 recommendation-level).
Resolve the 1 Orphaned files with no living knowledge finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 3 Change coupling finding(s) in Change Coupling — start with factory.ts, manager.ts, azure_openai.py. — One of this dimension's main actionable groups (3 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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 11 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 3 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — 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. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 25 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 & labels4.5 / 10Weak✓ Tool-verified
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.
A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label. — server/dashboard/src/app/(root)/dashboard/components/nav-wrapper.tsx:159
This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed. (×2) — server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:129, server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:180
A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). (×4) — server/dashboard/src/app/(root)/dashboard/settings/page.tsx:195, server/dashboard/src/app/(root)/dashboard/settings/page.tsx:201, server/dashboard/src/app/(root)/dashboard/settings/page.tsx:207, …
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
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.
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×3) — server/dashboard/src/app/(auth)/layout.tsx:19, server/dashboard/src/app/(root)/dashboard-client-layout.tsx:28, server/dashboard/src/app/setup/layout.tsx:18
A page with no <title> gives no name in the tab, history or screen-reader page list. Declare it the way this router does — Next App Router `export const metadata = { title }`, React Router/Remix `export function meta`, TanStack Start `head`, or a Helmet/Head component. — server/dashboard/src/app/(root)/dashboard-client-layout.tsx:28
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".
A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler. — server/dashboard/src/components/shared/data-table.tsx:160
This <div> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}="0" so the element can receive that focus. (×2) — server/dashboard/src/components/ui/categories-display.tsx:68, server/dashboard/src/components/ui/categories-display.tsx:114
What to do
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
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.
<div> moves — its `animate-spin` utility runs with no motion-safe:/motion-reduce: variant — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — server/dashboard/src/components/misc/spinner.tsx:6
<textarea> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2). — server/dashboard/src/components/ui/textarea.tsx:29
`button` sets color: white on background-color: #3d84f7 — 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×2) — examples/yt-assistant-chrome/styles/options.css:201, examples/yt-assistant-chrome/styles/popup.css:104
`.slider` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — examples/yt-assistant-chrome/styles/options.css:309
`.fade-in` moves (`animation: fadeIn 0.3s ease-in-out`) 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. — server/dashboard/src/styles/animations.css:35
`.slide-in-right` moves (`animation: slideInRight 0.3s ease-in-out`) 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. — server/dashboard/src/styles/animations.css:39
`.slide-in-left` moves (`animation: slideInLeft 0.3s ease-in-out`) 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. — server/dashboard/src/styles/animations.css:43
`.animate-fadeIn` moves (`animation: fadeIn 0.2s ease-in-out forwards`) 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. — server/dashboard/src/styles/animations.css:47
`.ai-chat-message` moves (`animation: message-fade-in 0.3s ease`) 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. — examples/yt-assistant-chrome/styles/content.css:154
`.status` moves (`animation: fade-in 0.3s ease`) 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. (×2) — examples/yt-assistant-chrome/styles/options.css:241, examples/yt-assistant-chrome/styles/popup.css:72
`.loading-spinner` moves (`animation: spin 1s linear infinite`) 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. — examples/yt-assistant-chrome/styles/options.css:396
`.memories-sidebar` moves (`transition: transform 0.3s ease`) 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. — examples/yt-assistant-chrome/styles/options.css:415
`.main-content` moves (`transition: margin-right 0.3s ease`) 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. — examples/yt-assistant-chrome/styles/options.css:577
`.ball` moves (`animation: bounce 0.6s infinite alternate`) 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. (×2) — examples/vercel-ai-sdk-chat-app/src/index.css:79, examples/multimodal-demo/src/index.css:79
`.highlight-text.animate::before` moves (`animation: highlightSweep 0.5s ease-out forwards`) 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. — examples/mem0-demo/components/mem0/markdown.css:79
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.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 74 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with jest-axe in tests, then gate axe/pa11y/Lighthouse in CI.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.
Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.
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.
Do you agree with this assessment?
C2 · Access Controls7.0 / 10Strong✓ Tool-verified
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.
Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
What to do
Name the access rules — DRF permission classes, django-guardian or django-rules permissions, a casbin or oso policy, or roles and permissions declared once — and consult them where access is checked (permission_classes, @permission_required, Depends), so the rule set is reviewable and testable on its own.
Do you agree with this assessment?
C4 · Data Retention5.0 / 10Adequate✓ Tool-verified
Other · Security — Whether data has a defined lifetime — retention periods, TTLs, cleanup jobs (storage limitation).
Method: Roslyn scan: retention/TTL configuration presence in schema; CascadeDelete detected but not scored as retention control. Deterministic, gated by PII presence.
A retention mechanism is present, but the data-lifecycle is not yet complete — missing: an expiry limit — a declared maximum age / TTL after which the data is no longer kept, a scheduled purge / cleanup job (a Celery beat task, APScheduler job or management command that deletes rows past their retention — Session.objects.filter(created__lt=cutoff).delete(), purge_expired… / delete_old…).
What to do
Complete the data-lifecycle story: an expiry limit (a declared maximum age for the stored data — a retention-age setting, or a store-level TTL where your storage offers one), a scheduled purge/cleanup job that enforces it, and a documented retention period covering the personal data.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 7 of 21 project(s) that lack one — worth up to 0.7 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 6/9 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `cli/node`, `cli/python`, `server/dashboard`.
`integrations/openclaw/config.ts` reports through `console.*` at line 190 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — integrations/openclaw/config.ts:190
`integrations/openclaw/providers.ts` reports through `console.*` at line 384 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — integrations/openclaw/providers.ts:384
`integrations/openclaw/providers.ts` reports through `console.*` at line 517 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — integrations/openclaw/providers.ts:517
`integrations/openclaw/providers.ts` reports through `console.*` at line 606 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — integrations/openclaw/providers.ts:606
`integrations/openclaw/public-artifacts.ts` reports through `console.*` at line 51 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — integrations/openclaw/public-artifacts.ts:51
`integrations/openclaw/recall.ts` reports through `console.*` at line 273 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — integrations/openclaw/recall.ts:273
`mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 151 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:151
`mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 283 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:283
`mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 382 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:382
`mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 465 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:465
`mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 667 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:667
`mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 698 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:698
`mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 708 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:708
`mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 717 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:717
`mem0-ts/src/oss/src/vector_stores/baidu.ts` reports through `console.*` at line 387 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/baidu.ts:387
`mem0-ts/src/oss/src/vector_stores/elasticsearch.ts` reports through `console.*` at line 129 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:129
`mem0-ts/src/oss/src/vector_stores/elasticsearch.ts` reports through `console.*` at line 332 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:332
`mem0-ts/src/oss/src/vector_stores/elasticsearch.ts` reports through `console.*` at line 357 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:357
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 50 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:50
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 94 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:94
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 121 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:121
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 142 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:142
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 159 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:159
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 175 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:175
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 182 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:182
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 188 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:188
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 202 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:202
`mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 212 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/langchain.ts:212
`mem0-ts/src/oss/src/vector_stores/memory.ts` reports through `console.*` at line 47 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/memory.ts:47
`mem0-ts/src/oss/src/vector_stores/memory.ts` reports through `console.*` at line 347 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/memory.ts:347
`mem0-ts/src/oss/src/vector_stores/milvus.ts` reports through `console.*` at line 105 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/milvus.ts:105
`mem0-ts/src/oss/src/vector_stores/milvus.ts` reports through `console.*` at line 144 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/milvus.ts:144
`mem0-ts/src/oss/src/vector_stores/mongodb.ts` reports through `console.*` at line 146 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/mongodb.ts:146
`mem0-ts/src/oss/src/vector_stores/mongodb.ts` reports through `console.*` at line 174 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/mongodb.ts:174
`mem0-ts/src/oss/src/vector_stores/mongodb.ts` reports through `console.*` at line 180 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/mongodb.ts:180
`mem0-ts/src/oss/src/vector_stores/mongodb.ts` reports through `console.*` at line 223 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/mongodb.ts:223
`mem0-ts/src/oss/src/vector_stores/mongodb.ts` reports through `console.*` at line 252 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/mongodb.ts:252
`mem0-ts/src/oss/src/vector_stores/mongodb.ts` reports through `console.*` at line 292 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/mongodb.ts:292
`mem0-ts/src/oss/src/vector_stores/mongodb.ts` reports through `console.*` at line 353 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — mem0-ts/src/oss/src/vector_stores/mongodb.ts:353
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Route service-code `console.*` output through the module's structured logger (with named fields), so delivery outcomes and failures reach the log pipeline with a level.
Add OpenTelemetry tracing/metrics (opentelemetry-sdk) so requests are traceable across the system, not just health-probable.
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.
What to do
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Do you agree with this assessment?
P5 · DR & Backup0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
The only persistence guard found is a data volume in a stack this repo names a DEVELOPER stack, and no backup, geo-recovery or RTO/RPO controls were evidenced anywhere. A dev volume holds no production data, so there may be nothing here to recover — if this system's data lives in a platform or ops repo we can't see, that is where the DR evidence belongs, and this row is about what this repository can show rather than about that volume.
What to do
Point at where production persistence is operated — a link from this repo to the ops/platform repo that holds its backup, geo-recovery and RTO/RPO controls — so the DR posture is reviewable from here; the dev-stack volume is not the thing to protect.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
`requests.get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — REDACTED:1359
`httpx.Client(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×2) — mem0/utils/http.py:10, mem0/utils/http.py:13
What to do
Pass `timeout=` on every `requests`/`httpx` call (requests has no default and will wait forever), mount an `HTTPAdapter(max_retries=Retry(...))` on shared sessions, and wrap calls to flaky dependencies in `tenacity` retries or a `pybreaker` circuit breaker.
Readiness · Readiness — Whether database schema changes go through versioned migrations rather than being auto-created from the model at startup.
Method: Roslyn scan: EF Core DbContext for a versioned migrations directory versus bare EnsureCreated usage; off .NET, a file scan of dependency manifests, migration histories (Flyway, Liquibase, Alembic, Django, Rails, Prisma, TypeORM, Knex/Sequelize, golang-migrate, goose, Laravel, Doctrine, Diesel/sqlx) and schema auto-create in production source or config. 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 the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`fs.existsSync` in `maybeIdentify` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — cli/node/src/commands/init.ts:83
`fs.existsSync` in `runInit` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — cli/node/src/commands/init.ts:357, cli/node/src/commands/init.ts:435
`fs.readFileSync` in `cmdAdd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — cli/node/src/commands/memory.ts:78, cli/node/src/commands/memory.ts:98
`fs.readFileSync` in `cmdImport` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — cli/node/src/commands/utils.ts:92
`existsSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — integrations/opencode-plugin/opencode-mem0.ts:123
`readFileSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — integrations/opencode-plugin/opencode-mem0.ts:124
`mkdirSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — integrations/opencode-plugin/opencode-mem0.ts:137, integrations/opencode-plugin/opencode-mem0.ts:145
`writeFileSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — integrations/opencode-plugin/opencode-mem0.ts:138, integrations/opencode-plugin/opencode-mem0.ts:146
`readdirSync` in `registerCommands` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — integrations/opencode-plugin/opencode-mem0.ts:297
`existsSync` in `registerCommands` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — integrations/opencode-plugin/opencode-mem0.ts:300
`readFileSync` in `registerCommands` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — integrations/opencode-plugin/opencode-mem0.ts:304
`fs.existsSync` in `ensureClient` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — mem0-ts/src/oss/src/vector_stores/qdrant.ts:115
`fs.statSync` in `ensureClient` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — mem0-ts/src/oss/src/vector_stores/qdrant.ts:116
`fs.rmSync` in `ensureClient` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — mem0-ts/src/oss/src/vector_stores/qdrant.ts:118
What to do
TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
Do you agree with this assessment?
R1 · Type Safety9.9 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
What to do
Migrate the remaining .js/.jsx files to TypeScript.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
14 duplicated blocks under the repository root have copies in at least two of the sibling directories cli, integrations, mem0-ts — 8 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 14 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 14 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 14 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — cli/node/src/backend/platform.ts:37
9 duplicated blocks under server/dashboard/src/app/ have copies in at least two of the sibling directories (auth), (root), setup — 6 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:165
8 duplicated blocks under mem0-ts/src/oss/src/ have copies in at least two of the sibling directories embeddings, llms, memory, utils, vector_stores — 7 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — mem0-ts/src/oss/src/llms/aws_bedrock.ts:116
6 duplicated blocks under server/dashboard/src/app/(root)/dashboard/ have copies in at least two of the sibling directories analytics, api-keys, configuration, entities, export, memories (+2 more sibling(s) not listed) — 4 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:35
mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:44 · mem0-ts/src/oss/src/vector_stores/opensearch.ts:64 — the two spans are one implementation copied and then locally edited — 739 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:44
cli/node/src/backend/platform.ts:37 · integrations/openclaw/backend/platform.ts:32 — the two spans are one implementation copied and then locally edited — 923 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — cli/node/src/backend/platform.ts:37
cli/node/src/backend/platform.ts:284 · integrations/openclaw/backend/platform.ts:219 — the two spans are one implementation copied and then locally edited — 877 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — cli/node/src/backend/platform.ts:284
cli/node/src/backend/base.ts:37 · integrations/openclaw/backend/base.ts:26 — the two spans are one implementation copied and then locally edited — 427 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — cli/node/src/backend/base.ts:37
integrations/deepseek-plugin/src/telemetry.ts:14 · integrations/pi-agent-plugin/src/telemetry.ts:8 — the two spans are one implementation copied and then locally edited — 383 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — integrations/deepseek-plugin/src/telemetry.ts:14
server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:35 · server/dashboard/src/app/(root)/dashboard/entities/page.tsx:21 — the two spans are one implementation copied and then locally edited — 346 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:35
mem0-ts/src/oss/src/vector_stores/redis.ts:353 · mem0-ts/src/oss/src/vector_stores/redis.ts:582 — the two spans are one implementation copied and then locally edited — 377 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — mem0-ts/src/oss/src/vector_stores/redis.ts:353
integrations/vercel-ai-sdk/src/mem0-utils.ts:86 · integrations/vercel-ai-sdk/src/mem0-utils.ts:162 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — integrations/vercel-ai-sdk/src/mem0-utils.ts:86
server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:98 · server/dashboard/src/app/(root)/dashboard/settings/page.tsx:78 — the two spans are one implementation copied and then locally edited — 244 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:98
mem0-ts/src/oss/src/prompts/index.ts:918 · mem0-ts/src/oss/src/prompts/index.ts:981 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — mem0-ts/src/oss/src/prompts/index.ts:918
integrations/openclaw/skill-loader.ts:390 · integrations/openclaw/skill-loader.ts:554 — the two spans are one implementation copied and then locally edited — 207 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — integrations/openclaw/skill-loader.ts:390
integrations/openclaw/providers.ts:163 · integrations/openclaw/providers.ts:459 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — integrations/openclaw/providers.ts:163
mem0-ts/src/oss/src/embeddings/azure.ts:20 · mem0-ts/src/oss/src/embeddings/openai.ts:13 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — mem0-ts/src/oss/src/embeddings/azure.ts:20
mem0-ts/src/oss/src/rerankers/cohere.ts:12 · mem0-ts/src/oss/src/rerankers/zeroentropy.ts:10 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — mem0-ts/src/oss/src/rerankers/cohere.ts:12
cli/node/src/commands/entities.ts:92 · cli/node/src/commands/memory.ts:593 — the two spans are one implementation copied and then locally edited — 230 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — cli/node/src/commands/entities.ts:92
mem0-ts/src/oss/src/llms/azure.ts:24 · mem0-ts/src/oss/src/llms/openai.ts:18 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — mem0-ts/src/oss/src/llms/azure.ts:24
mem0-ts/src/oss/src/llms/deepseek.ts:5 · mem0-ts/src/oss/src/llms/minimax.ts:5 · mem0-ts/src/oss/src/llms/sarvam.ts:14 · mem0-ts/src/oss/src/llms/together.ts:5 · +1 more site(s) not listed — the 5 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — mem0-ts/src/oss/src/llms/deepseek.ts:5
server/dashboard/src/components/ui/alert-dialog.tsx:43 · server/dashboard/src/components/ui/dialog.tsx:55 · server/dashboard/src/components/ui/sheet.tsx:73 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — server/dashboard/src/components/ui/alert-dialog.tsx:43
cli/node/src/backend/platform.ts:245 · integrations/openclaw/backend/platform.ts:180 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — cli/node/src/backend/platform.ts:245
mem0-ts/src/oss/src/utils/notices.ts:450 · mem0-ts/src/oss/src/utils/notices.ts:529 · mem0-ts/src/oss/src/utils/notices.ts:591 — 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. — mem0-ts/src/oss/src/utils/notices.ts:450
server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx:76 · server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx:210 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx:76
mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:82 · mem0-ts/src/oss/src/vector_stores/supabase.ts:93 — the two spans are one implementation copied and then locally edited — 170 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:82
server/dashboard/src/components/ui/dialog.tsx:82 · server/dashboard/src/components/ui/drawer.tsx:74 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — server/dashboard/src/components/ui/dialog.tsx:82
mem0-ts/src/client/telemetry.ts:26 · mem0-ts/src/oss/src/utils/telemetry.ts:46 — the two spans are one implementation copied and then locally edited — 151 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — mem0-ts/src/client/telemetry.ts:26
mem0-ts/src/oss/src/vector_stores/cassandra.ts:513 · mem0-ts/src/oss/src/vector_stores/databricks.ts:1554 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — mem0-ts/src/oss/src/vector_stores/cassandra.ts:513
server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:165 · server/dashboard/src/app/setup/page.tsx:553 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:165
integrations/openclaw/tools/memory-event-list.ts:13 · integrations/openclaw/tools/memory-event-status.ts:16 — the two spans are one implementation copied and then locally edited — 263 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — integrations/openclaw/tools/memory-event-list.ts:13
mem0-ts/src/oss/src/utils/notices.ts:1247 · mem0-ts/src/oss/src/utils/notices.ts:1303 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — mem0-ts/src/oss/src/utils/notices.ts:1247
server/dashboard/src/components/ui/pagination.tsx:70 · server/dashboard/src/components/ui/pagination.tsx:98 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — server/dashboard/src/components/ui/pagination.tsx:70
cli/node/src/commands/init.ts:475 · cli/node/src/commands/init.ts:558 — 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. — cli/node/src/commands/init.ts:475
mem0-ts/src/oss/src/llms/aws_bedrock.ts:116 · mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:1033 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — mem0-ts/src/oss/src/llms/aws_bedrock.ts:116
mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:289 · mem0-ts/src/oss/src/vector_stores/milvus.ts:425 — the two spans are one implementation copied and then locally edited — 171 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:289
server/dashboard/src/app/(auth)/layout.tsx:10 · server/dashboard/src/app/setup/layout.tsx:9 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — server/dashboard/src/app/(auth)/layout.tsx:10
integrations/openclaw/cli/commands.ts:1369 · integrations/openclaw/cli/commands.ts:1402 — 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. — integrations/openclaw/cli/commands.ts:1369
integrations/vercel-ai-sdk/src/mem0-utils.ts:283 · integrations/vercel-ai-sdk/src/mem0-utils.ts:341 — 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. — integrations/vercel-ai-sdk/src/mem0-utils.ts:283
server/dashboard/src/components/ui/dropdown-menu.tsx:78 · server/dashboard/src/components/ui/dropdown-menu.tsx:142 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — server/dashboard/src/components/ui/dropdown-menu.tsx:78
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).
Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.
integrations/deepseek-plugin/src/formatting.ts:1 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead. — integrations/deepseek-plugin/src/formatting.ts:1
integrations/deepseek-plugin/src/formatting.ts:7 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead. — integrations/deepseek-plugin/src/formatting.ts:7
integrations/deepseek-plugin/src/index.ts:23 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead. — integrations/deepseek-plugin/src/index.ts:23
integrations/deepseek-plugin/src/index.ts:24 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/prompts.ts) — import the package by name instead. — integrations/deepseek-plugin/src/index.ts:24
integrations/deepseek-plugin/src/output.ts:1 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead. — integrations/deepseek-plugin/src/output.ts:1
integrations/deepseek-plugin/src/scoping.ts:1 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/identity.ts) — import the package by name instead. — integrations/deepseek-plugin/src/scoping.ts:1
integrations/deepseek-plugin/src/scoping.ts:5 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/identity.ts) — import the package by name instead. — integrations/deepseek-plugin/src/scoping.ts:5
integrations/deepseek-plugin/src/telemetry.ts:6 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/telemetry.ts) — import the package by name instead. — integrations/deepseek-plugin/src/telemetry.ts:6
integrations/openclaw/index.ts:56 reaches into another package with a relative path (../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead. — integrations/openclaw/index.ts:56
integrations/openclaw/telemetry.ts:3 reaches into another package with a relative path (../agent-plugin-core/typescript/src/telemetry.ts) — import the package by name instead. — integrations/openclaw/telemetry.ts:3
integrations/openclaw/tools/memory-search.ts:2 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/prompts.ts) — import the package by name instead. — integrations/openclaw/tools/memory-search.ts:2
integrations/opencode-plugin/opencode-mem0.ts:1 reaches into another package with a relative path (../agent-plugin-core/typescript/src/scoping.ts) — import the package by name instead. — integrations/opencode-plugin/opencode-mem0.ts:1
integrations/opencode-plugin/opencode-mem0.ts:20 reaches into another package with a relative path (../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead. — integrations/opencode-plugin/opencode-mem0.ts:20
integrations/opencode-plugin/opencode-mem0.ts:21 reaches into another package with a relative path (../agent-plugin-core/typescript/src/prompts.ts) — import the package by name instead. — integrations/opencode-plugin/opencode-mem0.ts:21
integrations/opencode-plugin/project.ts:1 reaches into another package with a relative path (../agent-plugin-core/typescript/src/identity.ts) — import the package by name instead. — integrations/opencode-plugin/project.ts:1
integrations/opencode-plugin/scope.ts:1 reaches into another package with a relative path (../agent-plugin-core/typescript/src/scoping.ts) — import the package by name instead. — integrations/opencode-plugin/scope.ts:1
integrations/opencode-plugin/telemetry.ts:5 reaches into another package with a relative path (../agent-plugin-core/typescript/src/telemetry.ts) — import the package by name instead. — integrations/opencode-plugin/telemetry.ts:5
integrations/pi-agent-plugin/src/capture/index.ts:7 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/capture/index.ts:7
integrations/pi-agent-plugin/src/capture/index.ts:9 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/capture/index.ts:9
integrations/pi-agent-plugin/src/entry.ts:12 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/entry.ts:12
integrations/pi-agent-plugin/src/entry.ts:15 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/entry.ts:15
integrations/pi-agent-plugin/src/memory/formatting.ts:1 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/memory/formatting.ts:1
integrations/pi-agent-plugin/src/memory/formatting.ts:7 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/memory/formatting.ts:7
integrations/pi-agent-plugin/src/memory/scoping.ts:5 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/scoping.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/memory/scoping.ts:5
integrations/pi-agent-plugin/src/memory/tools.ts:1 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/scoping.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/memory/tools.ts:1
integrations/pi-agent-plugin/src/memory/tools.ts:2 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/prompts.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/memory/tools.ts:2
integrations/pi-agent-plugin/src/prompt.ts:1 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/prompts.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/prompt.ts:1
integrations/pi-agent-plugin/src/telemetry.ts:5 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/telemetry.ts) — import the package by name instead. — integrations/pi-agent-plugin/src/telemetry.ts:5
mem0-ts/src/oss/src/memory/index.ts:81 reaches into another package with a relative path (../../../client/config) — import the package by name instead. — mem0-ts/src/oss/src/memory/index.ts:81
What to do
Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
(anonymous) has cyclomatic complexity 90 and cognitive complexity 169; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — integrations/openclaw/cli/commands.ts:463
addToVectorStore has cyclomatic complexity 77 and cognitive complexity 167; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/src/memory/index.ts:840
(anonymous) has cyclomatic complexity 61 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/tests/vector-stores-compat.test.ts:3371
execute has cyclomatic complexity 51 and cognitive complexity 126; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts:370
runInit has cyclomatic complexity 49 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — cli/node/src/commands/init.ts:307
search has cyclomatic complexity 47 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/src/memory/index.ts:1332
runOssWizardInteractive has cyclomatic complexity 46 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — integrations/openclaw/cli/commands.ts:239
(anonymous) has cyclomatic complexity 41 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — integrations/openclaw/index.ts:711
cmdAdd has cyclomatic complexity 39 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — cli/node/src/commands/memory.ts:40
SetupPage has cyclomatic complexity 35 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — server/dashboard/src/app/setup/page.tsx:65
extractJson has cyclomatic complexity 34 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/src/prompts/index.ts:901
richFormatHelp has cyclomatic complexity 33 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — cli/node/src/help.ts:218
parse has cyclomatic complexity 32 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — integrations/openclaw/config.ts:177
createFilter has cyclomatic complexity 31 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/src/vector_stores/qdrant.ts:215
matchFieldCondition has cyclomatic complexity 31 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/src/vector_stores/databricks.ts:1469
generateResponse has cyclomatic complexity 31 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/src/llms/langchain.ts:59
matchFieldCondition has cyclomatic complexity 30 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/src/vector_stores/cassandra.ts:440
chatMessageHook has cyclomatic complexity 29 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — integrations/opencode-plugin/opencode-mem0.ts:592
createFilter has cyclomatic complexity 29 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — mem0-ts/src/oss/src/vector_stores/pinecone.ts:156
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files5.8 / 10Adequate✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
mem0-ts/src/oss/src/memory/index.ts has 2010 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/memory/index.ts:1
integrations/openclaw/cli/commands.ts has 1631 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — integrations/openclaw/cli/commands.ts:1
mem0-ts/src/oss/src/vector_stores/databricks.ts has 1456 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/databricks.ts:1
mem0-ts/src/oss/src/utils/notices.ts has 1295 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/utils/notices.ts:1
mem0-ts/src/client/mem0.ts has 999 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/client/mem0.ts:1
mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts has 985 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:1
cli/node/src/index.ts has 882 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — cli/node/src/index.ts:1
integrations/opencode-plugin/opencode-mem0.ts has 836 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — integrations/opencode-plugin/opencode-mem0.ts:1
integrations/openclaw/index.ts has 825 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — integrations/openclaw/index.ts:1
mem0-ts/src/oss/src/prompts/index.ts has 806 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/prompts/index.ts:1
mem0-ts/src/oss/src/vector_stores/s3_vectors.ts has 793 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:1
mem0-ts/src/oss/src/utils/entity_extraction.ts has 761 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/utils/entity_extraction.ts:1
server/dashboard/src/app/setup/page.tsx has 710 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — server/dashboard/src/app/setup/page.tsx:1
cli/node/src/commands/memory.ts has 700 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — cli/node/src/commands/memory.ts:1
mem0-ts/src/oss/src/vector_stores/oracledb.ts has 666 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/oracledb.ts:1
mem0-ts/src/oss/src/vector_stores/redis.ts has 656 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/redis.ts:1
mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts has 633 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:1
integrations/openclaw/skill-loader.ts has 618 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — integrations/openclaw/skill-loader.ts:1
mem0-ts/src/oss/src/vector_stores/qdrant.ts has 616 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/qdrant.ts:1
integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts has 605 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts:1
mem0-ts/src/oss/src/vector_stores/opensearch.ts has 575 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/opensearch.ts:1
mem0-ts/src/oss/src/vector_stores/cassandra.ts has 569 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/cassandra.ts:1
integrations/openclaw/providers.ts has 568 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — integrations/openclaw/providers.ts:1
cli/node/src/commands/init.ts has 557 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — cli/node/src/commands/init.ts:1
mem0-ts/src/oss/src/vector_stores/baidu.ts has 537 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/baidu.ts:1
mem0-ts/src/oss/src/vector_stores/valkey.ts has 535 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/valkey.ts:1
mem0-ts/src/oss/src/vector_stores/pgvector.ts has 506 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/pgvector.ts:1
mem0-ts/src/oss/src/vector_stores/milvus.ts has 489 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/milvus.ts:1
mem0-ts/src/oss/src/vector_stores/mongodb.ts has 466 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/mongodb.ts:1
mem0-ts/src/oss/src/vector_stores/memory.ts has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/memory.ts:1
mem0-ts/src/oss/src/vector_stores/vectorize.ts has 433 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/vectorize.ts:1
mem0-ts/src/oss/src/vector_stores/supabase.ts has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — mem0-ts/src/oss/src/vector_stores/supabase.ts:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage6.3 / 10Adequate✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
integrations/n8n-nodes-mem0/jest.config.js declares environment "node", and no package here declares a DOM implementation (jsdom / happy-dom), a component testing library or a browser runner — so none of the 76 unreached component module(s) can be tested as written, however the suite is authored: server/dashboard/src/app/setup/page.tsx, server/dashboard/src/app/(root)/dashboard/memories/page.tsx, server/dashboard/src/app/(root)/dashboard/requests/page.tsx, server/dashboard/src/components/ui/sidebar.tsx, server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx, server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx and 70 more. Add a DOM environment and a component testing library (for example jsdom + @testing-library, or the runner's browser mode), then test the components. Reported once because these files share one cause, not one omission each. — integrations/n8n-nodes-mem0/jest.config.js:1
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×26) — server/dashboard/src/utils/api.ts:1, REDACTED:1, server/dashboard/src/middleware.ts:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each REDACTED script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: REDACTED scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code8.5 / 10Strong✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
12 file(s) (~1213 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — integrations/agent-plugin-core/typescript
Unreachable from the 62 application, 26 tooling and 183 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×32) — server/dashboard/src/components/ui/form.tsx, server/dashboard/src/components/ui/command.tsx, server/dashboard/src/components/ui/pagination.tsx, …
no import path from any entry point (62 application, 26 tooling, 183 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (server/dashboard/src/components/misc/truncated-text.tsx) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — server/dashboard/src/components/ui/hover-card.tsx
Nothing imports this binding — it is safe to review for removal. (×4) — cli/node/src/plugin-sync.ts:40, integrations/openclaw/skill-loader.ts:300, server/dashboard/src/lib/utils.ts:8, …
Nothing ultimately consumes this binding: its only referrer is the re-export in integrations/deepseek-plugin/src/output.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in integrations/deepseek-plugin/src/output.ts in the same commit, or the barrel will import a name that no longer exists. — integrations/agent-plugin-core/typescript/src/formatting.ts:10
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Declared in integrations/vercel-ai-sdk/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2)
Declared in mem0-ts/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Only test files import it (first: integrations/vercel-ai-sdk/tests/generate-output.test.ts:1) — move it to devDependencies. — integrations/vercel-ai-sdk/package.json:41
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. 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 `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document1.6 / 10Critical✓ 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.
`update_config` is public, takes a document from its caller (line 86) and hands it to `_merge_config`, which calls itself at line 69 (`_merge_config`) with a piece of `base` — and nowhere in `_merge_config` 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_config` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — server/server_state.py:69
`buildFilterConditions` is exported and takes `filters: Record<string, any> | undefined` from its caller, and it calls itself at line 79 (`buildFilterConditions`) with a piece of `filters` (and at line 95) — and nowhere in `buildFilterConditions` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `buildFilterConditions` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — mem0-ts/src/oss/src/vector_stores/pgvector.ts:79
`camelToSnakeKeys` is exported and takes `obj: any` from its caller, and it calls itself at line 49 (`camelToSnakeKeys`) with a piece of `obj` (and at line 55) — and nowhere in `camelToSnakeKeys` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `camelToSnakeKeys` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — mem0-ts/src/client/utils.ts:49
`snakeToCamelKeys` is exported and takes `obj: any` from its caller, and it calls itself at line 67 (`snakeToCamelKeys`) with a piece of `obj` (and at line 73) — and nowhere in `snakeToCamelKeys` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `snakeToCamelKeys` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — mem0-ts/src/client/utils.ts:67
`search` is public, takes a document from its caller (line 415) and hands it to `_create_filter`, which calls itself at line 388 (`self._create_filter`) with a piece of `filters` (and at line 393, line 398) — and nowhere in `_create_filter` 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 `_create_filter` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — mem0/vector_stores/qdrant.py:388
`detect_temporal_usage_from_metadata` is public, takes a document from its caller (line 906) and hands it to `_walk_mapping`, which calls itself at line 1600 (`_walk_mapping`) with a piece of `value` (and at line 1603) — and nowhere in `_walk_mapping` 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_mapping` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:1600
`detect_temporal_usage_from_search` is public, takes a document from its caller (line 920) and hands it to `_has_temporal_filter`, which calls itself at line 1648 (`_has_temporal_filter`) with a piece of `filters` (and at line 1650, line 1662) — and nowhere in `_has_temporal_filter` 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 `_has_temporal_filter` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:1648
`record` is public, takes a document from its caller (line 477) and hands it to `_safe_value`, which calls itself at line 251 (`_safe_value`) with a piece of `value` (and at line 257) — and nowhere in `_safe_value` 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 `_safe_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. (×7) — REDACTED:251, REDACTED:251, REDACTED:251, …
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 type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether 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 15/32 async functions that make a cancellable request (fetch, axios, ky, ofetch) 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.
`refreshAccessToken` 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 })`. — server/dashboard/src/utils/api.ts:24
`postStream` 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 })`. — server/dashboard/src/utils/api.ts:86
`storeRefreshToken` 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 })`. — server/dashboard/src/lib/auth.tsx:41
`clearRefreshToken` 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 })`. — server/dashboard/src/lib/auth.tsx:49
`refreshSession` 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 })`. — server/dashboard/src/lib/auth.tsx:53
`getOAuthAccessToken` awaits `axios.post(…)` 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: `axios.post(url, { signal })`. — mem0-ts/src/oss/src/vector_stores/databricks.ts:964
`insert` 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 })`. — mem0-ts/src/oss/src/vector_stores/vectorize.ts:45
`update` 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 })`. — mem0-ts/src/oss/src/vector_stores/vectorize.ts:152
`getUserId` 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 })`. — mem0-ts/src/oss/src/vector_stores/vectorize.ts:264
`setUserId` 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 })`. — mem0-ts/src/oss/src/vector_stores/vectorize.ts:331
`captureEvent` 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 })`. (×2) — mem0-ts/src/oss/src/utils/telemetry.ts:55, mem0-ts/src/client/telemetry.ts:35
`captureIdentify` 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 })`. — mem0-ts/src/client/telemetry.ts:77
`searchInternalMemories` 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 })`. — integrations/vercel-ai-sdk/src/mem0-utils.ts:243
`updateMemories` 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 })`. — integrations/vercel-ai-sdk/src/mem0-utils.ts:325
`apiPost` 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 })`. — integrations/openclaw/cli/commands.ts:95
`validateApiKey` 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 })`. — integrations/openclaw/cli/commands.ts:140
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 a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
`debug` at line 37 is called with an argument built by `sorted(kwargs)` (line 37), 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. — mem0/vector_stores/vertex_ai_vector_search.py:37
`debug` at line 49 is called with an argument built by `sorted(config.model_dump())` (line 49), 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. — mem0/vector_stores/vertex_ai_vector_search.py:49
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.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — server/main.py:73, server/server_state.py:34
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. (×33) — server/dashboard/src/middleware.ts:37, server/dashboard/src/utils/api.ts:72, server/dashboard/src/app/setup/page.tsx:289, …
`.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. (×3) — server/dashboard/src/app/setup/page.tsx:298, mem0-ts/src/oss/src/vector_stores/oracledb.ts:406, mem0-ts/src/oss/src/vector_stores/pinecone.ts:325
`catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — mem0-ts/src/oss/src/prompts/index.ts:957, mem0-ts/src/oss/src/prompts/index.ts:1019
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `REDACTED` 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.
`info` at line 182 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. — mem0/vector_stores/azure_ai_search.py:182
`info` at line 295 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. — mem0/vector_stores/azure_ai_search.py:295
`warning` at line 394 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. — mem0/vector_stores/azure_ai_search.py:394
`error` at line 430 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. — mem0/vector_stores/azure_ai_search.py:430
`error` at line 126 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. — mem0/vector_stores/azure_mysql.py:126
`error` at line 160 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. — mem0/vector_stores/azure_mysql.py:160
`error` at line 177 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. — mem0/vector_stores/azure_mysql.py:177
`info` at line 208 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. — mem0/vector_stores/azure_mysql.py:208
`info` 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.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. — mem0/vector_stores/azure_mysql.py:216
`debug` at line 218 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. — mem0/vector_stores/azure_mysql.py:218
`info` at line 232 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. — mem0/vector_stores/azure_mysql.py:232
`debug` at line 389 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. — mem0/vector_stores/azure_mysql.py:389
`info` at line 467 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. — mem0/vector_stores/azure_mysql.py:467
`warning` at line 545 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. — mem0/vector_stores/azure_mysql.py:545
`info` at line 102 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. — mem0/vector_stores/baidu.py:102
`info` 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.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. — mem0/vector_stores/baidu.py:105
`error` at line 107 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. — mem0/vector_stores/baidu.py:107
`info` at line 123 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. — mem0/vector_stores/baidu.py:123
`info` at line 164 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. — mem0/vector_stores/baidu.py:164
`info` at line 171 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. — mem0/vector_stores/baidu.py:171
`info` at line 173 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. — mem0/vector_stores/baidu.py:173
`error` at line 176 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. — mem0/vector_stores/baidu.py:176
`error` at line 280 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. — mem0/vector_stores/baidu.py:280
`info` at line 337 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. — mem0/vector_stores/baidu.py:337
`info` at line 342 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. — mem0/vector_stores/baidu.py:342
`info` 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.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. — mem0/vector_stores/baidu.py:349
`info` at line 352 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. — mem0/vector_stores/baidu.py:352
`error` at line 354 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. — mem0/vector_stores/baidu.py:354
`error` at line 357 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. — mem0/vector_stores/baidu.py:357
`warning` at line 393 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. — mem0/vector_stores/baidu.py:393
`warning` at line 402 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. — mem0/vector_stores/baidu.py:402
`error` at line 127 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. — mem0/vector_stores/cassandra.py:127
`info` at line 140 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. — mem0/vector_stores/cassandra.py:140
`error` at line 142 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. — mem0/vector_stores/cassandra.py:142
`info` at line 157 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. — mem0/vector_stores/cassandra.py:157
`error` at line 159 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. — mem0/vector_stores/cassandra.py:159
`info` at line 183 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. — mem0/vector_stores/cassandra.py:183
`error` at line 185 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. — mem0/vector_stores/cassandra.py:185
`info` at line 202 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. — mem0/vector_stores/cassandra.py:202
`error` at line 222 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. — mem0/vector_stores/cassandra.py:222
Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
18/19 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
~1.6 `!` null assertions per 1k TypeScript source lines — 86 assertion(s) across the 54559 source line(s) of the 299 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: mem0-ts/src/oss/src/vector_stores/azure_mysql.ts (12), mem0-ts/src/oss/src/vector_stores/cassandra.ts (9), mem0-ts/src/oss/src/memory/index.ts (6). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
What to do
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 12 of 55 WCAG 2.2 Level A/AA success criteria (22%; ≈24% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 43 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 — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Repo shows no audit-logging mechanism (an audit-log table or model — a class or table named for it — django-simple-history, django-auditlog, django-reversion, django-pghistory or SQLAlchemy-Continuum recording each change, or an event-sourced store beside one) for sensitive changes — absence of evidence is not evidence of a working control. Record an audit trail in code (or document where it lives) so this dimension can be scored.
C5 Data-Subject Rights — Repo shows no corroborated data-subject-rights mechanism (erasure / export-portability / consent) tied to a subject id or GDPR vocabulary — absence of evidence is not evidence of a working control. Implement erasure, data export/portability and consent tracking over the subject's records.
Not included — 39 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.
AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — compose up failed (exit 15 — the compose project is invalid) — time="2026-10-26T13:08:18Z" level=warning msg="The \"JWT_SECRET\" variable is not set. Defaulting to a blank string." error while interpolating services.postgres.environment.[]: required variable POSTGRES_PASSWORD is missing a value: Set POSTGRES_PASSWORD in .env; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, Python, TypeScript not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Python, TypeScript surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Aggregate roots were found in only one source directory (server), which is a layered codebase, not two contexts. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .ts, .tsx, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.py), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 1 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not measured — polyglot repository, one half has no runner
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 6 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit); 52 value object(s); its 6 aggregate(s) are ORM models only — persistence, not behaviour: a CRUD model, measured, not claimed as DDD
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P9 Domain vs controller coverage — coverage data present for 143 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: Python and TypeScript/JavaScript runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
R5 Dependency Freshness — uses a bun lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
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.
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.
AC2 · Forms & labels· <button> with no accessible text · ×4
<button> with no accessible text server/dashboard/src/app/(root)/dashboard/settings/page.tsx:195— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text server/dashboard/src/app/(root)/dashboard/settings/page.tsx:201— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text server/dashboard/src/app/(root)/dashboard/settings/page.tsx:207— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text server/dashboard/src/components/self-hosted/upgrade-banner.tsx:61— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
AC4 · Keyboard semantics· Hover-only interaction on <div> · ×2
Hover-only interaction on <div> server/dashboard/src/components/ui/categories-display.tsx:68— This <div> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}="0" so the element can receive that focus.
Hover-only interaction on <div> server/dashboard/src/components/ui/categories-display.tsx:114— This <div> binds mouse-enter and mouse-leave and nothing else — no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}="0" so the element can receive that focus.
Banned license: psycopg — `psycopg` 3.3.6 is published on PyPI under `LGPL-3.0-only`, which this policy bans, and it is in the SHIPPED closure of this repository — so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception.
Banned license: psycopg-pool — `psycopg-pool` 3.3.3 is published on PyPI under `LGPL-3.0-only`, which this policy bans, and it is in the SHIPPED closure of this repository — so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception.
D30 · Dependency Vulnerabilities· High vulnerability · ×2
REDACTED
REDACTED
AC2 · Forms & labels· Link with no accessible name · ×1
Link with no accessible name server/dashboard/src/app/(root)/dashboard/components/nav-wrapper.tsx:159— A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label.
AC3 · Page structure· Document without a <title> · ×1
Document without a <title> server/dashboard/src/app/(root)/dashboard-client-layout.tsx:28— A page with no <title> gives no name in the tab, history or screen-reader page list. Declare it the way this router does — Next App Router `export const metadata = { title }`, React Router/Remix `export function meta`, TanStack Start `head`, or a Helmet/Head component.
AC4 · Keyboard semantics· Click handler on a non-interactive <tr> · ×1
Click handler on a non-interactive <tr> server/dashboard/src/components/shared/data-table.tsx:160— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
D11 · Test Reliability· Test suite declares a test script but contains no test files · ×1
Test suite declares a test script but contains no test files: mem0-ts/src/community/ — The jest suite in mem0-ts/src/community/ was installed and launched successfully, and the runner then found no test files to run — No tests found, exiting with code 1. The package declares a test script, so it reads as a tested package to anyone who checks its manifest, but there is nothing behind the declaration: no test case exists, so it cannot detect a regression and its presence overstates how much of this repository is tested. The ask is the owner's: write the first test for this package, or remove the test script from a package that has none. This is not a report that the tests FAIL — there are none.
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×74
Members sharing a duplicated core (7 members, 50+ identical tokens) integrations/agent-plugin-core/python/mcp_server.py:78— integrations/agent-plugin-core/python/mcp_server.py:78-112 | integrations/antigravity-plugin/core/mcp_server.py:78-112 | integrations/claude-code-plugin/core/mcp_server.py:78-112 | integrations/codex-plugin/core/mcp_server.py:78-112 | integrations/cursor-plugin/core/mcp_server.py:78-112 | integrations/kimi-plugin/core/mcp_server.py:78-112 | integrations/mem0-agent-plugin/core/mcp_server.py:78-112 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) integrations/agent-plugin-core/python/mcp_server.py:116— integrations/agent-plugin-core/python/mcp_server.py:116-129 | integrations/antigravity-plugin/core/mcp_server.py:116-129 | integrations/claude-code-plugin/core/mcp_server.py:116-129 | integrations/codex-plugin/core/mcp_server.py:116-129 | integrations/cursor-plugin/core/mcp_server.py:116-129 | integrations/kimi-plugin/core/mcp_server.py:116-129 | integrations/mem0-agent-plugin/core/mcp_server.py:116-129 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) integrations/agent-plugin-core/python/mcp_server.py:133— integrations/agent-plugin-core/python/mcp_server.py:133-142 | integrations/antigravity-plugin/core/mcp_server.py:133-142 | integrations/claude-code-plugin/core/mcp_server.py:133-142 | integrations/codex-plugin/core/mcp_server.py:133-142 | integrations/cursor-plugin/core/mcp_server.py:133-142 | integrations/kimi-plugin/core/mcp_server.py:133-142 | integrations/mem0-agent-plugin/core/mcp_server.py:133-142 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) integrations/agent-plugin-core/python/mcp_server.py:153— integrations/agent-plugin-core/python/mcp_server.py:153-212 | integrations/antigravity-plugin/core/mcp_server.py:153-212 | integrations/claude-code-plugin/core/mcp_server.py:153-212 | integrations/codex-plugin/core/mcp_server.py:153-212 | integrations/cursor-plugin/core/mcp_server.py:153-212 | integrations/kimi-plugin/core/mcp_server.py:153-212 | integrations/mem0-agent-plugin/core/mcp_server.py:153-212 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) integrations/agent-plugin-core/python/mcp_server.py:216— integrations/agent-plugin-core/python/mcp_server.py:216-236 | integrations/antigravity-plugin/core/mcp_server.py:216-236 | integrations/claude-code-plugin/core/mcp_server.py:216-236 | integrations/codex-plugin/core/mcp_server.py:216-236 | integrations/cursor-plugin/core/mcp_server.py:216-236 | integrations/kimi-plugin/core/mcp_server.py:216-236 | integrations/mem0-agent-plugin/core/mcp_server.py:216-236 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) integrations/agent-plugin-core/python/memory_cli.py:24— integrations/agent-plugin-core/python/memory_cli.py:24-58 | integrations/antigravity-plugin/core/memory_cli.py:24-58 | integrations/claude-code-plugin/core/memory_cli.py:24-58 | integrations/codex-plugin/core/memory_cli.py:24-58 | integrations/cursor-plugin/core/memory_cli.py:24-58 | integrations/kimi-plugin/core/memory_cli.py:24-58 | integrations/mem0-agent-plugin/core/memory_cli.py:24-58 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) integrations/agent-plugin-core/python/memory_cli.py:62— integrations/agent-plugin-core/python/memory_cli.py:62-150 | integrations/antigravity-plugin/core/memory_cli.py:62-150 | integrations/claude-code-plugin/core/memory_cli.py:62-150 | integrations/codex-plugin/core/memory_cli.py:62-150 | integrations/cursor-plugin/core/memory_cli.py:62-150 | integrations/kimi-plugin/core/memory_cli.py:62-150 | integrations/mem0-agent-plugin/core/memory_cli.py:62-150 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:169— REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:190— REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:204— REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:252— REDACTED:252-261 | REDACTED:252-261 | REDACTED:252-261 | REDACTED:252-261 | REDACTED:252-261 | REDACTED:252-261 | REDACTED:252-261 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:279— REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:298— REDACTED:298-320 | REDACTED:298-320 | REDACTED:298-320 | REDACTED:298-320 | REDACTED:298-320 | REDACTED:298-320 | REDACTED:298-320 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:357— REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:382— REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:398— REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:431— REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:471— REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:482— REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:510— REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:540— REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:567— REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:578— REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:598— REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 — 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.
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:739— REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 — 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.
Swallowed exception (empty catch) server/dashboard/src/middleware.ts:37— 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) server/dashboard/src/utils/api.ts:72— 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) server/dashboard/src/app/setup/page.tsx:289— 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) server/dashboard/src/app/setup/page.tsx:298— `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
Swallowed exception (empty catch) mem0-ts/src/oss/src/vector_stores/azure_mysql.ts:137— 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) mem0-ts/src/oss/src/vector_stores/mongodb.ts:125— 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) mem0-ts/src/oss/src/vector_stores/mongodb.ts:161— 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) mem0-ts/src/oss/src/vector_stores/oracledb.ts:406— `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
Swallowed exception (empty catch) mem0-ts/src/oss/src/vector_stores/pinecone.ts:325— `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
Swallowed exception (empty catch) mem0-ts/src/oss/src/vector_stores/pinecone.ts:364— 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) mem0-ts/src/oss/src/vector_stores/redis.ts:223— 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) mem0-ts/src/oss/src/utils/entity_extraction.ts:339— 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) mem0-ts/src/oss/src/utils/notices.ts:54— 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) mem0-ts/src/oss/src/utils/notices.ts:209— 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) mem0-ts/src/oss/src/utils/notices.ts:679— 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) mem0-ts/src/oss/src/utils/notices.ts:724— 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) mem0-ts/src/oss/src/utils/notices.ts:842— 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) mem0-ts/src/oss/src/utils/notices.ts:899— 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) mem0-ts/src/oss/src/utils/notices.ts:921— 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) mem0-ts/src/oss/src/utils/notices.ts:1004— 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) mem0-ts/src/oss/src/utils/notices.ts:1185— 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) mem0-ts/src/oss/src/utils/notices.ts:1249— 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) mem0-ts/src/oss/src/utils/notices.ts:1305— 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) mem0-ts/src/oss/src/utils/notices.ts:1373— 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) mem0-ts/src/oss/src/utils/notices.ts:1438— 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.
FileTooLong: REDACTED REDACTED— FileTooLong — 2592 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2092 over it, 5.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1974 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1474 over it, 3.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1974 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1474 over it, 3.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1974 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1474 over it, 3.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1974 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1474 over it, 3.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1974 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1474 over it, 3.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1974 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1474 over it, 3.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1974 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1474 over it, 3.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: memory/index.ts mem0-ts/src/oss/src/memory/index.ts— FileTooLong — 1481 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: Memory (205-2201). The bar is 500 significant lines; this is 981 over it, 2.96× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1355 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 855 over it, 2.71× 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/commands.ts integrations/openclaw/cli/commands.ts— FileTooLong — 1265 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: registerCliCommands (398-1777). The bar is 500 significant lines; this is 765 over it, 2.53× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: utils/notices.ts mem0-ts/src/oss/src/utils/notices.ts— FileTooLong — 1078 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 578 over it, 2.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: vector_stores/databricks.ts mem0-ts/src/oss/src/vector_stores/databricks.ts— FileTooLong — 1055 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: DatabricksVectorStore (421-1627). The bar is 500 significant lines; this is 555 over it, 2.11× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: REDACTED REDACTED— FileTooLong — 994 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 494 over it, 1.99× 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: mem0_cli/app.py cli/python/src/mem0_cli/app.py— FileTooLong — 915 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 415 over it, 1.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: vector_stores/neptune_analytics.ts mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts— FileTooLong — 716 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: NeptuneAnalyticsVectorStore (42-1120). The bar is 500 significant lines; this is 216 over it, 1.43× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: client/mem0.ts mem0-ts/src/client/mem0.ts— FileTooLong — 690 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: MemoryClient (196-1103). The bar is 500 significant lines; this is 190 over it, 1.38× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/index.ts cli/node/src/index.ts— FileTooLong — 689 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 189 over it, 1.38× 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: opencode-plugin/opencode-mem0.ts integrations/opencode-plugin/opencode-mem0.ts— FileTooLong — 644 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: Mem0Plugin (235-928). The bar is 500 significant lines; this is 144 over it, 1.29× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: prompts/index.ts mem0-ts/src/oss/src/prompts/index.ts— FileTooLong — 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: setup/page.tsx server/dashboard/src/app/setup/page.tsx— FileTooLong — 636 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: SetupPage (65-763). The bar is 500 significant lines; this is 136 over it, 1.27× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: configs/prompts.py mem0/configs/prompts.py— FileTooLong — 616 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 116 over it, 1.23× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: commands/memory.py cli/python/src/mem0_cli/commands/memory.py— FileTooLong — 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: vector_stores/s3_vectors.ts mem0-ts/src/oss/src/vector_stores/s3_vectors.ts— FileTooLong — 601 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: S3Vectors (35-889). The bar is 500 significant lines; this is 101 over it, 1.20× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: REDACTED REDACTED— FileTooLong — 595 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 95 over it, 1.19× 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.
Boundary violation [package:relative-cross-package] integrations/deepseek-plugin/src/formatting.ts:1— integrations/deepseek-plugin/src/formatting.ts:1 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/deepseek-plugin/src/formatting.ts:7— integrations/deepseek-plugin/src/formatting.ts:7 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/deepseek-plugin/src/index.ts:23— integrations/deepseek-plugin/src/index.ts:23 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/deepseek-plugin/src/index.ts:24— integrations/deepseek-plugin/src/index.ts:24 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/prompts.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/deepseek-plugin/src/output.ts:1— integrations/deepseek-plugin/src/output.ts:1 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/deepseek-plugin/src/scoping.ts:1— integrations/deepseek-plugin/src/scoping.ts:1 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/identity.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/deepseek-plugin/src/scoping.ts:5— integrations/deepseek-plugin/src/scoping.ts:5 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/identity.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/deepseek-plugin/src/telemetry.ts:6— integrations/deepseek-plugin/src/telemetry.ts:6 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/telemetry.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/openclaw/index.ts:56— integrations/openclaw/index.ts:56 reaches into another package with a relative path (../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/openclaw/telemetry.ts:3— integrations/openclaw/telemetry.ts:3 reaches into another package with a relative path (../agent-plugin-core/typescript/src/telemetry.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/openclaw/tools/memory-search.ts:2— integrations/openclaw/tools/memory-search.ts:2 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/prompts.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/opencode-plugin/opencode-mem0.ts:1— integrations/opencode-plugin/opencode-mem0.ts:1 reaches into another package with a relative path (../agent-plugin-core/typescript/src/scoping.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/opencode-plugin/opencode-mem0.ts:20— integrations/opencode-plugin/opencode-mem0.ts:20 reaches into another package with a relative path (../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/opencode-plugin/opencode-mem0.ts:21— integrations/opencode-plugin/opencode-mem0.ts:21 reaches into another package with a relative path (../agent-plugin-core/typescript/src/prompts.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/opencode-plugin/project.ts:1— integrations/opencode-plugin/project.ts:1 reaches into another package with a relative path (../agent-plugin-core/typescript/src/identity.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/opencode-plugin/scope.ts:1— integrations/opencode-plugin/scope.ts:1 reaches into another package with a relative path (../agent-plugin-core/typescript/src/scoping.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/opencode-plugin/telemetry.ts:5— integrations/opencode-plugin/telemetry.ts:5 reaches into another package with a relative path (../agent-plugin-core/typescript/src/telemetry.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/pi-agent-plugin/src/capture/index.ts:7— integrations/pi-agent-plugin/src/capture/index.ts:7 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/pi-agent-plugin/src/capture/index.ts:9— integrations/pi-agent-plugin/src/capture/index.ts:9 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/pi-agent-plugin/src/entry.ts:12— integrations/pi-agent-plugin/src/entry.ts:12 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/pi-agent-plugin/src/entry.ts:15— integrations/pi-agent-plugin/src/entry.ts:15 reaches into another package with a relative path (../../agent-plugin-core/typescript/src/lifecycle.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/pi-agent-plugin/src/memory/formatting.ts:1— integrations/pi-agent-plugin/src/memory/formatting.ts:1 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/pi-agent-plugin/src/memory/formatting.ts:7— integrations/pi-agent-plugin/src/memory/formatting.ts:7 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/formatting.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/pi-agent-plugin/src/memory/scoping.ts:5— integrations/pi-agent-plugin/src/memory/scoping.ts:5 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/scoping.ts) — import the package by name instead.
Boundary violation [package:relative-cross-package] integrations/pi-agent-plugin/src/memory/tools.ts:1— integrations/pi-agent-plugin/src/memory/tools.ts:1 reaches into another package with a relative path (../../../agent-plugin-core/typescript/src/scoping.ts) — import the package by name instead.
+ 4 more in this group — see findings.md.
R4 · Test Coverage· No test reaches this file · ×26
No test reaches this file server/dashboard/src/utils/api.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/middleware.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file mem0-ts/src/oss/src/utils/bm25.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file integrations/n8n-nodes-mem0/credentials/Mem0Api.credentials.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/components/ui/use-toast.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/hooks/use-api-query.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/utils/self-hosted-config.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file mem0-ts/src/oss/src/utils/telemetry.types.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file mem0-ts/src/client/telemetry.types.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/utils/api-endpoints.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file integrations/vercel-ai-sdk/src/stream-utils.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/store/reducers/layoutReducer.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/lib/error-message.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/hooks/useDebounce.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/constants/ui-components.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/lib/utils.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/store/store.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/hooks/use-auth.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/store/rootReducer.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/lib/server-api-url.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file server/dashboard/src/utils/helpers.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file integrations/zapier-mem0/index.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file mem0-ts/jest.setup.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
+ 1 more in this group — see findings.md.
D30 · Dependency Vulnerabilities· Medium CVE · ×21
Sync-over-async blocking cli/node/src/commands/init.ts:83— `fs.existsSync` in `maybeIdentify` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking cli/node/src/commands/init.ts:357— `fs.existsSync` in `runInit` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking cli/node/src/commands/init.ts:435— `fs.existsSync` in `runInit` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking cli/node/src/commands/memory.ts:78— `fs.readFileSync` in `cmdAdd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking cli/node/src/commands/memory.ts:98— `fs.readFileSync` in `cmdAdd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking cli/node/src/commands/utils.ts:92— `fs.readFileSync` in `cmdImport` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:123— `existsSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:124— `readFileSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:137— `mkdirSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:138— `writeFileSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:145— `mkdirSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:146— `writeFileSync` in `autoSetupCategories` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:297— `readdirSync` in `registerCommands` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:300— `existsSync` in `registerCommands` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking integrations/opencode-plugin/opencode-mem0.ts:304— `readFileSync` in `registerCommands` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking mem0-ts/src/oss/src/vector_stores/qdrant.ts:115— `fs.existsSync` in `ensureClient` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking mem0-ts/src/oss/src/vector_stores/qdrant.ts:116— `fs.statSync` in `ensureClient` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking mem0-ts/src/oss/src/vector_stores/qdrant.ts:118— `fs.rmSync` in `ensureClient` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Hotspot: integrations/openclaw/cli/commands.ts integrations/openclaw/cli/commands.ts:398— integrations/openclaw/cli/commands.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 218 in commands.registerCliCommands at line 398. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- integrations/openclaw/cli/commands.ts`: 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:1493— REDACTED changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in memory_core.build_episode at line 1493. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: integrations/deepseek-plugin/src/index.ts integrations/deepseek-plugin/src/index.ts:96— integrations/deepseek-plugin/src/index.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in index.apply at line 96. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- integrations/deepseek-plugin/src/index.ts`: 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: integrations/opencode-plugin/opencode-mem0.ts integrations/opencode-plugin/opencode-mem0.ts:235— integrations/opencode-plugin/opencode-mem0.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in opencode-mem0.Mem0Plugin at line 235. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- integrations/opencode-plugin/opencode-mem0.ts`: 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: mem0-ts/src/oss/src/memory/index.ts mem0-ts/src/oss/src/memory/index.ts:720— mem0-ts/src/oss/src/memory/index.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Memory.add at line 720. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- mem0-ts/src/oss/src/memory/index.ts`: 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:760— REDACTED changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Memory.add at line 760. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: REDACTED REDACTED:896— REDACTED changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in telemetry._drain at line 896. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: REDACTED REDACTED:896— REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in telemetry._drain at line 896. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: REDACTED REDACTED:896— REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in telemetry._drain at line 896. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: REDACTED REDACTED:896— REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in telemetry._drain at line 896. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: REDACTED REDACTED:896— REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in telemetry._drain at line 896. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: REDACTED REDACTED:896— REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in telemetry._drain at line 896. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: REDACTED REDACTED:896— REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in telemetry._drain at line 896. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04: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: cli/node/src/commands/memory.ts cli/node/src/commands/memory.ts:40— cli/node/src/commands/memory.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in memory.cmdAdd at line 40. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- cli/node/src/commands/memory.ts`: 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: cli/python/src/mem0_cli/commands/memory.py cli/python/src/mem0_cli/commands/memory.py:64— cli/python/src/mem0_cli/commands/memory.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in memory.cmd_add at line 64. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- cli/python/src/mem0_cli/commands/memory.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: cli/node/src/backend/platform.ts cli/node/src/backend/platform.ts:134— cli/node/src/backend/platform.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PlatformBackend.add at line 134. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- cli/node/src/backend/platform.ts`: 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: cli/python/src/mem0_cli/backend/platform.py cli/python/src/mem0_cli/backend/platform.py:78— cli/python/src/mem0_cli/backend/platform.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PlatformBackend.add at line 78. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- cli/python/src/mem0_cli/backend/platform.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.
X2 · Cancellation propagation· Async function without AbortSignal · ×17
Async function without AbortSignal: refreshAccessToken server/dashboard/src/utils/api.ts:24— `refreshAccessToken` 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: postStream server/dashboard/src/utils/api.ts:86— `postStream` 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: storeRefreshToken server/dashboard/src/lib/auth.tsx:41— `storeRefreshToken` 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: clearRefreshToken server/dashboard/src/lib/auth.tsx:49— `clearRefreshToken` 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: refreshSession server/dashboard/src/lib/auth.tsx:53— `refreshSession` 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: getOAuthAccessToken mem0-ts/src/oss/src/vector_stores/databricks.ts:964— `getOAuthAccessToken` awaits `axios.post(…)` 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: `axios.post(url, { signal })`.
Async function without AbortSignal: insert mem0-ts/src/oss/src/vector_stores/vectorize.ts:45— `insert` 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: update mem0-ts/src/oss/src/vector_stores/vectorize.ts:152— `update` 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: getUserId mem0-ts/src/oss/src/vector_stores/vectorize.ts:264— `getUserId` 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: setUserId mem0-ts/src/oss/src/vector_stores/vectorize.ts:331— `setUserId` 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: captureEvent mem0-ts/src/oss/src/utils/telemetry.ts:55— `captureEvent` 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: captureEvent mem0-ts/src/client/telemetry.ts:35— `captureEvent` 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: captureIdentify mem0-ts/src/client/telemetry.ts:77— `captureIdentify` 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: searchInternalMemories integrations/vercel-ai-sdk/src/mem0-utils.ts:243— `searchInternalMemories` 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: updateMemories integrations/vercel-ai-sdk/src/mem0-utils.ts:325— `updateMemories` 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: apiPost integrations/openclaw/cli/commands.ts:95— `apiPost` 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: validateApiKey integrations/openclaw/cli/commands.ts:140— `validateApiKey` 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 })`.
FunctionTooLong: commands.registerCliCommands integrations/openclaw/cli/commands.ts:398— FunctionTooLong — registerCliCommands runs 1008 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 908 over it, 10.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: page.SetupPage server/dashboard/src/app/setup/page.tsx:65— FunctionTooLong — SetupPage runs 582 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 482 over it, 5.82× 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: opencode-mem0.Mem0Plugin integrations/opencode-plugin/opencode-mem0.ts:235— FunctionTooLong — Mem0Plugin runs 486 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 386 over it, 4.86× 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: page.MemoriesPage server/dashboard/src/app/(root)/dashboard/memories/page.tsx:33— FunctionTooLong — MemoriesPage runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.10× 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: login-form.LoginForm server/dashboard/src/app/(auth)/login/login-form.tsx:27— FunctionTooLong — LoginForm runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89× 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: page.SettingsPage server/dashboard/src/app/(root)/dashboard/settings/page.tsx:16— FunctionTooLong — SettingsPage runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78× 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: page.ApiKeysPage server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:30— FunctionTooLong — ApiKeysPage runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77× 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: page.ConfigurationPage server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:32— FunctionTooLong — ConfigurationPage runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71× 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: main-nav.MainNav server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx:39— FunctionTooLong — MainNav runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67× 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: index.apply integrations/deepseek-plugin/src/index.ts:96— FunctionTooLong — apply runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63× 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: page.RequestsPage server/dashboard/src/app/(root)/dashboard/requests/page.tsx:83— FunctionTooLong — RequestsPage runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54× 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: nav-wrapper.NavWrapper server/dashboard/src/app/(root)/dashboard/components/nav-wrapper.tsx:31— FunctionTooLong — NavWrapper runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27× 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: data-table.DataTable server/dashboard/src/components/shared/data-table.tsx:45— FunctionTooLong — DataTable runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× 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: mem0-utils.convertToMem0Format integrations/vercel-ai-sdk/src/mem0-utils.ts:73— FunctionTooLong — convertToMem0Format runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× 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: skill-loader.loadTriagePrompt integrations/openclaw/skill-loader.ts:390— FunctionTooLong — loadTriagePrompt runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× 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: categories-display.CategoriesDisplay server/dashboard/src/components/ui/categories-display.tsx:11— FunctionTooLong — CategoriesDisplay runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× 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.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×14
Animation without a prefers-reduced-motion guard server/dashboard/src/components/misc/spinner.tsx:6— <div> moves — its `animate-spin` utility runs with no motion-safe:/motion-reduce: variant — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
Animation without a prefers-reduced-motion guard server/dashboard/src/styles/animations.css:35— `.fade-in` moves (`animation: fadeIn 0.3s ease-in-out`) 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.
Animation without a prefers-reduced-motion guard server/dashboard/src/styles/animations.css:39— `.slide-in-right` moves (`animation: slideInRight 0.3s ease-in-out`) 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.
Animation without a prefers-reduced-motion guard server/dashboard/src/styles/animations.css:43— `.slide-in-left` moves (`animation: slideInLeft 0.3s ease-in-out`) 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.
Animation without a prefers-reduced-motion guard server/dashboard/src/styles/animations.css:47— `.animate-fadeIn` moves (`animation: fadeIn 0.2s ease-in-out forwards`) 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.
Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/content.css:154— `.ai-chat-message` moves (`animation: message-fade-in 0.3s ease`) 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.
Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/options.css:241— `.status` moves (`animation: fade-in 0.3s ease`) 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.
Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/options.css:396— `.loading-spinner` moves (`animation: spin 1s linear infinite`) 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.
Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/options.css:415— `.memories-sidebar` moves (`transition: transform 0.3s ease`) 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.
Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/options.css:577— `.main-content` moves (`transition: margin-right 0.3s ease`) 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.
Animation without a prefers-reduced-motion guard examples/yt-assistant-chrome/styles/popup.css:72— `.status` moves (`animation: fade-in 0.3s ease`) 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.
Animation without a prefers-reduced-motion guard examples/vercel-ai-sdk-chat-app/src/index.css:79— `.ball` moves (`animation: bounce 0.6s infinite alternate`) 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.
Animation without a prefers-reduced-motion guard examples/multimodal-demo/src/index.css:79— `.ball` moves (`animation: bounce 0.6s infinite alternate`) 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.
Animation without a prefers-reduced-motion guard examples/mem0-demo/components/mem0/markdown.css:79— `.highlight-text.animate::before` moves (`animation: highlightSweep 0.5s ease-out forwards`) 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.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×14
Recursive walk over a caller-supplied document has no depth cap server/server_state.py:69— `update_config` is public, takes a document from its caller (line 86) and hands it to `_merge_config`, which calls itself at line 69 (`_merge_config`) with a piece of `base` — and nowhere in `_merge_config` 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_config` 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 mem0-ts/src/oss/src/vector_stores/pgvector.ts:79— `buildFilterConditions` is exported and takes `filters: Record<string, any> | undefined` from its caller, and it calls itself at line 79 (`buildFilterConditions`) with a piece of `filters` (and at line 95) — and nowhere in `buildFilterConditions` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `buildFilterConditions` 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 mem0-ts/src/client/utils.ts:49— `camelToSnakeKeys` is exported and takes `obj: any` from its caller, and it calls itself at line 49 (`camelToSnakeKeys`) with a piece of `obj` (and at line 55) — and nowhere in `camelToSnakeKeys` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `camelToSnakeKeys` 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 mem0-ts/src/client/utils.ts:67— `snakeToCamelKeys` is exported and takes `obj: any` from its caller, and it calls itself at line 67 (`snakeToCamelKeys`) with a piece of `obj` (and at line 73) — and nowhere in `snakeToCamelKeys` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `snakeToCamelKeys` 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 mem0/vector_stores/qdrant.py:388— `search` is public, takes a document from its caller (line 415) and hands it to `_create_filter`, which calls itself at line 388 (`self._create_filter`) with a piece of `filters` (and at line 393, line 398) — and nowhere in `_create_filter` 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 `_create_filter` 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 REDACTED:1600— `detect_temporal_usage_from_metadata` is public, takes a document from its caller (line 906) and hands it to `_walk_mapping`, which calls itself at line 1600 (`_walk_mapping`) with a piece of `value` (and at line 1603) — and nowhere in `_walk_mapping` 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_mapping` 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 REDACTED:1648— `detect_temporal_usage_from_search` is public, takes a document from its caller (line 920) and hands it to `_has_temporal_filter`, which calls itself at line 1648 (`_has_temporal_filter`) with a piece of `filters` (and at line 1650, line 1662) — and nowhere in `_has_temporal_filter` 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 `_has_temporal_filter` 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 REDACTED:251— `record` is public, takes a document from its caller (line 477) and hands it to `_safe_value`, which calls itself at line 251 (`_safe_value`) with a piece of `value` (and at line 257) — and nowhere in `_safe_value` 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 `_safe_value` 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 REDACTED:251— `record` is public, takes a document from its caller (line 477) and hands it to `_safe_value`, which calls itself at line 251 (`_safe_value`) with a piece of `value` (and at line 257) — and nowhere in `_safe_value` 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 `_safe_value` 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 REDACTED:251— `record` is public, takes a document from its caller (line 477) and hands it to `_safe_value`, which calls itself at line 251 (`_safe_value`) with a piece of `value` (and at line 257) — and nowhere in `_safe_value` 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 `_safe_value` 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 REDACTED:251— `record` is public, takes a document from its caller (line 477) and hands it to `_safe_value`, which calls itself at line 251 (`_safe_value`) with a piece of `value` (and at line 257) — and nowhere in `_safe_value` 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 `_safe_value` 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 REDACTED:251— `record` is public, takes a document from its caller (line 477) and hands it to `_safe_value`, which calls itself at line 251 (`_safe_value`) with a piece of `value` (and at line 257) — and nowhere in `_safe_value` 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 `_safe_value` 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 REDACTED:251— `record` is public, takes a document from its caller (line 477) and hands it to `_safe_value`, which calls itself at line 251 (`_safe_value`) with a piece of `value` (and at line 257) — and nowhere in `_safe_value` 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 `_safe_value` 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 REDACTED:251— `record` is public, takes a document from its caller (line 477) and hands it to `_safe_value`, which calls itself at line 251 (`_safe_value`) with a piece of `value` (and at line 257) — and nowhere in `_safe_value` 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 `_safe_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
TodoComment mem0-ts/src/client/mem0.types.ts:128— // TODO: Review this response field for removal in a future breaking release. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mem0/vector_stores/redis.py:19— # TODO: Improve as these are not the best fields for the Redis's perspective. Might do away with them. — 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 mem0/vector_stores/redis.py:28— # TODO: Although it is numeric but also accepts string — 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 mem0/proxy/main.py:165— # TODO: Make it better by summarizing the past conversation — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:853— # TODO: Remove procedural-memory support in a future breaking release. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:2526— # TODO: Remove procedural-memory support in a future breaking release. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mem0/llms/anthropic.py:136— # TODO: Remove tools if no issues found with new memory addition logic — 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 mem0/llms/litellm.py:87— # TODO: Remove tools if no issues found with new memory addition logic — 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 mem0/llms/openai.py:138— # TODO: Remove tools if no issues found with new memory addition logic — 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 mem0/llms/together.py:87— # TODO: Remove tools if no issues found with new memory addition logic — 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 mem0/configs/base.py:20— # TODO After prompt changes from platform, update this — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TooManyMethods: NeptuneAnalyticsVectorStore mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:42— TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× 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: DatabricksVectorStore mem0-ts/src/oss/src/vector_stores/databricks.ts:421— TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× 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: MemoryClient mem0-ts/src/client/mem0.ts:196— TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× 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: S3Vectors mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:35— 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: Memory mem0-ts/src/oss/src/memory/index.ts:205— TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AsyncMemoryClient REDACTED:1290— TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: MemoryClient REDACTED:227— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AsyncMemory REDACTED:2193— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× 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: Memory REDACTED:487— 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 (8 lines × 7) REDACTED:471— REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 | REDACTED:471-478 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (8 lines × 7) REDACTED:1876— REDACTED:1876-1883 | REDACTED:1876-1883 | REDACTED:1876-1883 | REDACTED:1876-1883 | REDACTED:1876-1883 | REDACTED:1876-1883 | REDACTED:1876-1883 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (8 lines × 7) REDACTED:557— REDACTED:557-564 | REDACTED:557-564 | REDACTED:557-564 | REDACTED:557-564 | REDACTED:557-564 | REDACTED:557-564 | REDACTED:557-564 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 7) REDACTED:979— REDACTED:979-986 | REDACTED:979-986 | REDACTED:979-986 | REDACTED:979-986 | REDACTED:979-986 | REDACTED:979-986 | REDACTED:979-986 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (8 lines × 7) REDACTED:1848— REDACTED:1848-1855 | REDACTED:1848-1855 | REDACTED:1848-1855 | REDACTED:1848-1855 | REDACTED:1848-1855 | REDACTED:1848-1855 | REDACTED:1848-1855 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (8 lines × 7) REDACTED:1861— REDACTED:1861-1868 | REDACTED:1861-1868 | REDACTED:1861-1868 | REDACTED:1861-1868 | REDACTED:1861-1868 | REDACTED:1861-1868 | REDACTED:1861-1868 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (8 lines × 7) REDACTED:1894— REDACTED:1894-1901 | REDACTED:1894-1901 | REDACTED:1894-1901 | REDACTED:1894-1901 | REDACTED:1894-1901 | REDACTED:1894-1901 | REDACTED:1894-1901 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (8 lines × 7) REDACTED:2464— REDACTED:2464-2471 | REDACTED:2464-2471 | REDACTED:2464-2471 | REDACTED:2464-2471 | REDACTED:2464-2471 | REDACTED:2464-2471 | REDACTED:2464-2471 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (8 lines × 7) REDACTED:399— REDACTED:399-406 | REDACTED:399-406 | REDACTED:399-406 | REDACTED:399-406 | REDACTED:399-406 | REDACTED:399-406 | REDACTED:399-406 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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.
Low cohesion: EvidenceStore (LCOM4 20) REDACTED:555— EvidenceStore's methods fall into 20 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 20 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: EvidenceStore (LCOM4 20) REDACTED:555— EvidenceStore's methods fall into 20 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 20 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: EvidenceStore (LCOM4 20) REDACTED:555— EvidenceStore's methods fall into 20 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 20 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: EvidenceStore (LCOM4 20) REDACTED:555— EvidenceStore's methods fall into 20 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 20 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: EvidenceStore (LCOM4 20) REDACTED:555— EvidenceStore's methods fall into 20 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 20 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: EvidenceStore (LCOM4 20) REDACTED:555— EvidenceStore's methods fall into 20 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 20 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: EvidenceStore (LCOM4 20) REDACTED:555— EvidenceStore's methods fall into 20 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 20 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: BaiduDB (LCOM4 6) mem0/vector_stores/baidu.py:50— BaiduDB'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.
Low cohesion: AWSBedrockConfig (LCOM4 4) mem0/configs/llms/aws_bedrock.py:7— AWSBedrockConfig's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×8
Members sharing a duplicated core (6 members, 50+ identical tokens) integrations/agent-plugin-core/python/flush_worker.py:26— integrations/agent-plugin-core/python/flush_worker.py:26-96 | integrations/antigravity-plugin/core/flush_worker.py:26-96 | integrations/claude-code-plugin/core/flush_worker.py:26-96 | integrations/codex-plugin/core/flush_worker.py:26-96 | integrations/cursor-plugin/core/flush_worker.py:26-96 | integrations/kimi-plugin/core/flush_worker.py:26-96 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) integrations/agent-plugin-core/python/hook_runner.py:63— integrations/agent-plugin-core/python/hook_runner.py:63-94 | integrations/antigravity-plugin/core/hook_runner.py:63-94 | integrations/claude-code-plugin/core/hook_runner.py:63-94 | integrations/codex-plugin/core/hook_runner.py:63-94 | integrations/cursor-plugin/core/hook_runner.py:63-94 | integrations/kimi-plugin/core/hook_runner.py:63-94 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) integrations/agent-plugin-core/python/hook_runner.py:98— integrations/agent-plugin-core/python/hook_runner.py:98-128 | integrations/antigravity-plugin/core/hook_runner.py:98-128 | integrations/claude-code-plugin/core/hook_runner.py:98-128 | integrations/codex-plugin/core/hook_runner.py:98-128 | integrations/cursor-plugin/core/hook_runner.py:98-128 | integrations/kimi-plugin/core/hook_runner.py:98-128 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) integrations/agent-plugin-core/python/hook_runner.py:132— integrations/agent-plugin-core/python/hook_runner.py:132-155 | integrations/antigravity-plugin/core/hook_runner.py:132-155 | integrations/claude-code-plugin/core/hook_runner.py:132-155 | integrations/codex-plugin/core/hook_runner.py:132-155 | integrations/cursor-plugin/core/hook_runner.py:132-155 | integrations/kimi-plugin/core/hook_runner.py:132-155 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) integrations/agent-plugin-core/python/hook_runner.py:173— integrations/agent-plugin-core/python/hook_runner.py:173-190 | integrations/antigravity-plugin/core/hook_runner.py:173-190 | integrations/claude-code-plugin/core/hook_runner.py:173-190 | integrations/codex-plugin/core/hook_runner.py:173-190 | integrations/cursor-plugin/core/hook_runner.py:173-190 | integrations/kimi-plugin/core/hook_runner.py:173-190 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) integrations/agent-plugin-core/python/hook_runner.py:271— integrations/agent-plugin-core/python/hook_runner.py:271-365 | integrations/antigravity-plugin/core/hook_runner.py:271-365 | integrations/claude-code-plugin/core/hook_runner.py:271-365 | integrations/codex-plugin/core/hook_runner.py:271-365 | integrations/cursor-plugin/core/hook_runner.py:271-365 | integrations/kimi-plugin/core/hook_runner.py:271-365 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) mem0/llms/anthropic.py:17— mem0/llms/anthropic.py:17-45 | mem0/llms/deepseek.py:16-41 | mem0/llms/lmstudio.py:15-41 | mem0/llms/minimax.py:16-45 | mem0/llms/ollama.py:18-41 | mem0/llms/vllm.py:16-40 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:166— REDACTED:166-231 | REDACTED:247-321 | REDACTED:381-459 | REDACTED:559-641 | REDACTED:675-752 | REDACTED:829-903 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
memory_core.build_episode (cyclomatic 47) REDACTED:1493— memory_core.build_episode has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_core.build_episode (cyclomatic 47) REDACTED:1493— memory_core.build_episode has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_core.build_episode (cyclomatic 47) REDACTED:1493— memory_core.build_episode has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_core.build_episode (cyclomatic 47) REDACTED:1493— memory_core.build_episode has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_core.build_episode (cyclomatic 47) REDACTED:1493— memory_core.build_episode has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_core.build_episode (cyclomatic 47) REDACTED:1493— memory_core.build_episode has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_core.build_episode (cyclomatic 47) REDACTED:1493— memory_core.build_episode has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_core.flush_session (cyclomatic 35) REDACTED:1962— memory_core.flush_session 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.
memory_core.flush_session (cyclomatic 35) REDACTED:1962— memory_core.flush_session 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.
memory_core.flush_session (cyclomatic 35) REDACTED:1962— memory_core.flush_session 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.
memory_core.flush_session (cyclomatic 35) REDACTED:1962— memory_core.flush_session 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.
memory_core.flush_session (cyclomatic 35) REDACTED:1962— memory_core.flush_session 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.
memory_core.flush_session (cyclomatic 35) REDACTED:1962— memory_core.flush_session 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.
memory_core.flush_session (cyclomatic 35) REDACTED:1962— memory_core.flush_session 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.
memory_core.extraction_message_batches (cyclomatic 23) REDACTED:1729— memory_core.extraction_message_batches 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.
memory_core.extraction_message_batches (cyclomatic 23) REDACTED:1729— memory_core.extraction_message_batches 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.
memory_core.extraction_message_batches (cyclomatic 23) REDACTED:1729— memory_core.extraction_message_batches 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.
memory_core.extraction_message_batches (cyclomatic 23) REDACTED:1729— memory_core.extraction_message_batches 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.
memory_core.extraction_message_batches (cyclomatic 23) REDACTED:1729— memory_core.extraction_message_batches 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.
memory_core.extraction_message_batches (cyclomatic 23) REDACTED:1729— memory_core.extraction_message_batches 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.
memory_core.extraction_message_batches (cyclomatic 23) REDACTED:1729— memory_core.extraction_message_batches 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.
memory_core.tool_payload (cyclomatic 22) REDACTED:1316— memory_core.tool_payload 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.
memory_core.tool_payload (cyclomatic 22) REDACTED:1316— memory_core.tool_payload 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.
memory_core.tool_payload (cyclomatic 22) REDACTED:1316— memory_core.tool_payload 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.
memory_core.tool_payload (cyclomatic 22) REDACTED:1316— memory_core.tool_payload 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.
memory_core.tool_payload (cyclomatic 22) REDACTED:1316— memory_core.tool_payload 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.
memory_core.tool_payload (cyclomatic 22) REDACTED:1316— memory_core.tool_payload 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.
memory_core.tool_payload (cyclomatic 22) REDACTED:1316— memory_core.tool_payload 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.
memory_core.search_memories (cyclomatic 21) REDACTED:2274— memory_core.search_memories has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cyclomatic 21) REDACTED:2274— memory_core.search_memories has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cyclomatic 21) REDACTED:2274— memory_core.search_memories has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cyclomatic 21) REDACTED:2274— memory_core.search_memories has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cyclomatic 21) REDACTED:2274— memory_core.search_memories has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cyclomatic 21) REDACTED:2274— memory_core.search_memories has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cyclomatic 21) REDACTED:2274— memory_core.search_memories has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
telemetry._drain (cyclomatic 19) REDACTED:896— telemetry._drain has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
telemetry._drain (cyclomatic 19) REDACTED:896— telemetry._drain has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
telemetry._drain (cyclomatic 19) REDACTED:896— telemetry._drain has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
telemetry._drain (cyclomatic 19) REDACTED:896— telemetry._drain has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
telemetry._drain (cyclomatic 19) REDACTED:896— telemetry._drain has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
telemetry._drain (cyclomatic 19) REDACTED:896— telemetry._drain has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
telemetry._drain (cyclomatic 19) REDACTED:896— telemetry._drain has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
memory_core.format_context (cyclomatic 18) REDACTED:2407— memory_core.format_context 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.
memory_core.format_context (cyclomatic 18) REDACTED:2407— memory_core.format_context 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.
memory_core.format_context (cyclomatic 18) REDACTED:2407— memory_core.format_context 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.
memory_core.format_context (cyclomatic 18) REDACTED:2407— memory_core.format_context 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.
memory_core.format_context (cyclomatic 18) REDACTED:2407— memory_core.format_context 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.
memory_core.format_context (cyclomatic 18) REDACTED:2407— memory_core.format_context 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.
memory_core.format_context (cyclomatic 18) REDACTED:2407— memory_core.format_context 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.
memory_cli.main (cyclomatic 17) integrations/agent-plugin-core/python/memory_cli.py:61— memory_cli.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_cli.main (cyclomatic 17) integrations/antigravity-plugin/core/memory_cli.py:61— memory_cli.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_cli.main (cyclomatic 17) integrations/claude-code-plugin/core/memory_cli.py:61— memory_cli.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_cli.main (cyclomatic 17) integrations/codex-plugin/core/memory_cli.py:61— memory_cli.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_cli.main (cyclomatic 17) integrations/cursor-plugin/core/memory_cli.py:61— memory_cli.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_cli.main (cyclomatic 17) integrations/kimi-plugin/core/memory_cli.py:61— memory_cli.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory_cli.main (cyclomatic 17) integrations/mem0-agent-plugin/core/memory_cli.py:61— memory_cli.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mcp_server._validate_arguments (cyclomatic 16) integrations/agent-plugin-core/python/mcp_server.py:75— mcp_server._validate_arguments 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.
mcp_server._validate_arguments (cyclomatic 16) integrations/antigravity-plugin/core/mcp_server.py:75— mcp_server._validate_arguments 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.
mcp_server._validate_arguments (cyclomatic 16) integrations/claude-code-plugin/core/mcp_server.py:75— mcp_server._validate_arguments 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.
mcp_server._validate_arguments (cyclomatic 16) integrations/codex-plugin/core/mcp_server.py:75— mcp_server._validate_arguments 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.
mcp_server._validate_arguments (cyclomatic 16) integrations/cursor-plugin/core/mcp_server.py:75— mcp_server._validate_arguments 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.
mcp_server._validate_arguments (cyclomatic 16) integrations/kimi-plugin/core/mcp_server.py:75— mcp_server._validate_arguments 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.
mcp_server._validate_arguments (cyclomatic 16) integrations/mem0-agent-plugin/core/mcp_server.py:75— mcp_server._validate_arguments 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.
memory_core.build_episode (cognitive 60) REDACTED:1493— memory_core.build_episode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 16, ternaries 4, 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.
memory_core.build_episode (cognitive 60) REDACTED:1493— memory_core.build_episode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 16, ternaries 4, 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.
memory_core.build_episode (cognitive 60) REDACTED:1493— memory_core.build_episode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 16, ternaries 4, 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.
memory_core.build_episode (cognitive 60) REDACTED:1493— memory_core.build_episode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 16, ternaries 4, 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.
memory_core.build_episode (cognitive 60) REDACTED:1493— memory_core.build_episode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 16, ternaries 4, 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.
memory_core.build_episode (cognitive 60) REDACTED:1493— memory_core.build_episode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 16, ternaries 4, 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.
memory_core.build_episode (cognitive 60) REDACTED:1493— memory_core.build_episode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 16, ternaries 4, 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.
memory_core.extraction_message_batches (cognitive 45) REDACTED:1729— memory_core.extraction_message_batches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (15 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.
memory_core.extraction_message_batches (cognitive 45) REDACTED:1729— memory_core.extraction_message_batches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (15 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.
memory_core.extraction_message_batches (cognitive 45) REDACTED:1729— memory_core.extraction_message_batches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (15 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.
memory_core.extraction_message_batches (cognitive 45) REDACTED:1729— memory_core.extraction_message_batches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (15 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.
memory_core.extraction_message_batches (cognitive 45) REDACTED:1729— memory_core.extraction_message_batches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (15 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.
memory_core.extraction_message_batches (cognitive 45) REDACTED:1729— memory_core.extraction_message_batches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (15 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.
memory_core.extraction_message_batches (cognitive 45) REDACTED:1729— memory_core.extraction_message_batches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (15 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.
memory_core.flush_session (cognitive 42) REDACTED:1962— memory_core.flush_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 12, loops 2, ternaries 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.flush_session (cognitive 42) REDACTED:1962— memory_core.flush_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 12, loops 2, ternaries 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.flush_session (cognitive 42) REDACTED:1962— memory_core.flush_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 12, loops 2, ternaries 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.flush_session (cognitive 42) REDACTED:1962— memory_core.flush_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 12, loops 2, ternaries 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.flush_session (cognitive 42) REDACTED:1962— memory_core.flush_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 12, loops 2, ternaries 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.flush_session (cognitive 42) REDACTED:1962— memory_core.flush_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 12, loops 2, ternaries 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.flush_session (cognitive 42) REDACTED:1962— memory_core.flush_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 12, loops 2, ternaries 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.tool_payload (cognitive 29) REDACTED:1316— memory_core.tool_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), boolean chains 5, 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.
memory_core.tool_payload (cognitive 29) REDACTED:1316— memory_core.tool_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), boolean chains 5, 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.
memory_core.tool_payload (cognitive 29) REDACTED:1316— memory_core.tool_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), boolean chains 5, 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.
memory_core.tool_payload (cognitive 29) REDACTED:1316— memory_core.tool_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), boolean chains 5, 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.
memory_core.tool_payload (cognitive 29) REDACTED:1316— memory_core.tool_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), boolean chains 5, 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.
memory_core.tool_payload (cognitive 29) REDACTED:1316— memory_core.tool_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), boolean chains 5, 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.
memory_core.tool_payload (cognitive 29) REDACTED:1316— memory_core.tool_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), boolean chains 5, 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.
telemetry._drain (cognitive 28) REDACTED:896— telemetry._drain has cognitive complexity 28 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 6 (9 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry._drain (cognitive 28) REDACTED:896— telemetry._drain has cognitive complexity 28 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 6 (9 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry._drain (cognitive 28) REDACTED:896— telemetry._drain has cognitive complexity 28 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 6 (9 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry._drain (cognitive 28) REDACTED:896— telemetry._drain has cognitive complexity 28 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 6 (9 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry._drain (cognitive 28) REDACTED:896— telemetry._drain has cognitive complexity 28 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 6 (9 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry._drain (cognitive 28) REDACTED:896— telemetry._drain has cognitive complexity 28 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 6 (9 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry._drain (cognitive 28) REDACTED:896— telemetry._drain has cognitive complexity 28 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 6 (9 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.format_context (cognitive 26) REDACTED:2407— memory_core.format_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.format_context (cognitive 26) REDACTED:2407— memory_core.format_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.format_context (cognitive 26) REDACTED:2407— memory_core.format_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.format_context (cognitive 26) REDACTED:2407— memory_core.format_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.format_context (cognitive 26) REDACTED:2407— memory_core.format_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.format_context (cognitive 26) REDACTED:2407— memory_core.format_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.format_context (cognitive 26) REDACTED:2407— memory_core.format_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core._collect_memory_ids (cognitive 26) REDACTED:2519— memory_core._collect_memory_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core._collect_memory_ids (cognitive 26) REDACTED:2519— memory_core._collect_memory_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core._collect_memory_ids (cognitive 26) REDACTED:2519— memory_core._collect_memory_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core._collect_memory_ids (cognitive 26) REDACTED:2519— memory_core._collect_memory_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core._collect_memory_ids (cognitive 26) REDACTED:2519— memory_core._collect_memory_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core._collect_memory_ids (cognitive 26) REDACTED:2519— memory_core._collect_memory_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core._collect_memory_ids (cognitive 26) REDACTED:2519— memory_core._collect_memory_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_cli.main (cognitive 25) integrations/agent-plugin-core/python/memory_cli.py:61— memory_cli.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_cli.main (cognitive 25) integrations/antigravity-plugin/core/memory_cli.py:61— memory_cli.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_cli.main (cognitive 25) integrations/claude-code-plugin/core/memory_cli.py:61— memory_cli.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_cli.main (cognitive 25) integrations/codex-plugin/core/memory_cli.py:61— memory_cli.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_cli.main (cognitive 25) integrations/cursor-plugin/core/memory_cli.py:61— memory_cli.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_cli.main (cognitive 25) integrations/kimi-plugin/core/memory_cli.py:61— memory_cli.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_cli.main (cognitive 25) integrations/mem0-agent-plugin/core/memory_cli.py:61— memory_cli.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory_core.search_memories (cognitive 22) REDACTED:2274— memory_core.search_memories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cognitive 22) REDACTED:2274— memory_core.search_memories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cognitive 22) REDACTED:2274— memory_core.search_memories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cognitive 22) REDACTED:2274— memory_core.search_memories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cognitive 22) REDACTED:2274— memory_core.search_memories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cognitive 22) REDACTED:2274— memory_core.search_memories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
memory_core.search_memories (cognitive 22) REDACTED:2274— memory_core.search_memories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mcp_server.handle_request (cognitive 19) integrations/agent-plugin-core/python/mcp_server.py:152— mcp_server.handle_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 5). 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.
mcp_server.handle_request (cognitive 19) integrations/antigravity-plugin/core/mcp_server.py:152— mcp_server.handle_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 5). 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.
mcp_server.handle_request (cognitive 19) integrations/claude-code-plugin/core/mcp_server.py:152— mcp_server.handle_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 5). 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.
mcp_server.handle_request (cognitive 19) integrations/codex-plugin/core/mcp_server.py:152— mcp_server.handle_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 5). 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.
mcp_server.handle_request (cognitive 19) integrations/cursor-plugin/core/mcp_server.py:152— mcp_server.handle_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 5). 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.
mcp_server.handle_request (cognitive 19) integrations/kimi-plugin/core/mcp_server.py:152— mcp_server.handle_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 5). 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.
mcp_server.handle_request (cognitive 19) integrations/mem0-agent-plugin/core/mcp_server.py:152— mcp_server.handle_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 5). 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.
telemetry.resolve_distinct_id (cognitive 19) REDACTED:802— telemetry.resolve_distinct_id has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry.resolve_distinct_id (cognitive 19) REDACTED:802— telemetry.resolve_distinct_id has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry.resolve_distinct_id (cognitive 19) REDACTED:802— telemetry.resolve_distinct_id has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry.resolve_distinct_id (cognitive 19) REDACTED:802— telemetry.resolve_distinct_id has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry.resolve_distinct_id (cognitive 19) REDACTED:802— telemetry.resolve_distinct_id has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry.resolve_distinct_id (cognitive 19) REDACTED:802— telemetry.resolve_distinct_id has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telemetry.resolve_distinct_id (cognitive 19) REDACTED:802— telemetry.resolve_distinct_id has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mcp_server._validate_arguments (cognitive 16) integrations/agent-plugin-core/python/mcp_server.py:75— mcp_server._validate_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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.
mcp_server._validate_arguments (cognitive 16) integrations/antigravity-plugin/core/mcp_server.py:75— mcp_server._validate_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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.
mcp_server._validate_arguments (cognitive 16) integrations/claude-code-plugin/core/mcp_server.py:75— mcp_server._validate_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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.
mcp_server._validate_arguments (cognitive 16) integrations/codex-plugin/core/mcp_server.py:75— mcp_server._validate_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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.
mcp_server._validate_arguments (cognitive 16) integrations/cursor-plugin/core/mcp_server.py:75— mcp_server._validate_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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.
mcp_server._validate_arguments (cognitive 16) integrations/kimi-plugin/core/mcp_server.py:75— mcp_server._validate_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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.
mcp_server._validate_arguments (cognitive 16) integrations/mem0-agent-plugin/core/mcp_server.py:75— mcp_server._validate_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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.
hook_runner.run (cyclomatic 32) integrations/agent-plugin-core/python/hook_runner.py:264— hook_runner.run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hook_runner.run (cyclomatic 32) integrations/antigravity-plugin/core/hook_runner.py:264— hook_runner.run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hook_runner.run (cyclomatic 32) integrations/claude-code-plugin/core/hook_runner.py:264— hook_runner.run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hook_runner.run (cyclomatic 32) integrations/codex-plugin/core/hook_runner.py:264— hook_runner.run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hook_runner.run (cyclomatic 32) integrations/cursor-plugin/core/hook_runner.py:264— hook_runner.run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hook_runner.run (cyclomatic 32) integrations/kimi-plugin/core/hook_runner.py:264— hook_runner.run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
flush_worker.main (cyclomatic 16) integrations/agent-plugin-core/python/flush_worker.py:25— flush_worker.main 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.
flush_worker.main (cyclomatic 16) integrations/antigravity-plugin/core/flush_worker.py:25— flush_worker.main 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.
flush_worker.main (cyclomatic 16) integrations/claude-code-plugin/core/flush_worker.py:25— flush_worker.main 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.
flush_worker.main (cyclomatic 16) integrations/codex-plugin/core/flush_worker.py:25— flush_worker.main 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.
flush_worker.main (cyclomatic 16) integrations/cursor-plugin/core/flush_worker.py:25— flush_worker.main 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.
flush_worker.main (cyclomatic 16) integrations/kimi-plugin/core/flush_worker.py:25— flush_worker.main 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.
No assertions: initialize() is idempotent mem0-ts/src/oss/tests/dimension-autodetect.test.ts:219— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: initialize() is idempotent (same promise returned) mem0-ts/src/oss/tests/vector-stores-compat.test.ts:599— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: initialize() is idempotent (same promise returned) mem0-ts/src/oss/tests/vector-stores-compat.test.ts:795— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: initialize() is idempotent (same promise returned) mem0-ts/src/oss/tests/vector-stores-compat.test.ts:4605— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: initialize() is a no-op and safe to call multiple times mem0-ts/src/oss/tests/vector-stores-compat.test.ts:4648— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should call onFinish handler without throwing an error integrations/vercel-ai-sdk/tests/text-properties.test.ts:38— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
hook_runner.run (cognitive 39) integrations/agent-plugin-core/python/hook_runner.py:264— hook_runner.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6 (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.
hook_runner.run (cognitive 39) integrations/antigravity-plugin/core/hook_runner.py:264— hook_runner.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6 (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.
hook_runner.run (cognitive 39) integrations/claude-code-plugin/core/hook_runner.py:264— hook_runner.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6 (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.
hook_runner.run (cognitive 39) integrations/codex-plugin/core/hook_runner.py:264— hook_runner.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6 (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.
hook_runner.run (cognitive 39) integrations/cursor-plugin/core/hook_runner.py:264— hook_runner.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6 (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.
hook_runner.run (cognitive 39) integrations/kimi-plugin/core/hook_runner.py:264— hook_runner.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6 (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.
flush_worker.main (cognitive 18) integrations/agent-plugin-core/python/flush_worker.py:25— flush_worker.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flush_worker.main (cognitive 18) integrations/antigravity-plugin/core/flush_worker.py:25— flush_worker.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flush_worker.main (cognitive 18) integrations/claude-code-plugin/core/flush_worker.py:25— flush_worker.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flush_worker.main (cognitive 18) integrations/codex-plugin/core/flush_worker.py:25— flush_worker.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flush_worker.main (cognitive 18) integrations/cursor-plugin/core/flush_worker.py:25— flush_worker.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flush_worker.main (cognitive 18) integrations/kimi-plugin/core/flush_worker.py:25— flush_worker.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ClassTooLong: Memory mem0-ts/src/oss/src/memory/index.ts:205— ClassTooLong — 1335 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 935 over it, 3.34× 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.
ClassTooLong: DatabricksVectorStore mem0-ts/src/oss/src/vector_stores/databricks.ts:421— ClassTooLong — 772 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 372 over it, 1.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: NeptuneAnalyticsVectorStore mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:42— ClassTooLong — 692 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 292 over it, 1.73× 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.
ClassTooLong: S3Vectors mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:35— ClassTooLong — 576 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 176 over it, 1.44× 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.
ClassTooLong: MemoryClient mem0-ts/src/client/mem0.ts:196— ClassTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 161 over it, 1.40× 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.
ClassTooLong: CassandraDB mem0-ts/src/oss/src/vector_stores/cassandra.ts:41— ClassTooLong — 405 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 5 over it, 1.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (11 lines × 7) REDACTED:169— REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 | REDACTED:169-179 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 7) REDACTED:190— REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 | REDACTED:190-200 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (11 lines × 7) REDACTED:1372— REDACTED:1372-1382 | REDACTED:1372-1382 | REDACTED:1372-1382 | REDACTED:1372-1382 | REDACTED:1372-1382 | REDACTED:1372-1382 | REDACTED:1372-1382 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 7) REDACTED:1832— REDACTED:1832-1842 | REDACTED:1832-1842 | REDACTED:1832-1842 | REDACTED:1832-1842 | REDACTED:1832-1842 | REDACTED:1832-1842 | REDACTED:1832-1842 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (11 lines × 7) REDACTED:280— REDACTED:280-290 | REDACTED:280-290 | REDACTED:280-290 | REDACTED:280-290 | REDACTED:280-290 | REDACTED:280-290 | REDACTED:280-290 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 7) REDACTED:618— REDACTED:618-628 | REDACTED:618-628 | REDACTED:618-628 | REDACTED:618-628 | REDACTED:618-628 | REDACTED:618-628 | REDACTED:618-628 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (10 lines × 7) integrations/agent-plugin-core/python/mcp_server.py:133— integrations/agent-plugin-core/python/mcp_server.py:133-142 | integrations/antigravity-plugin/core/mcp_server.py:133-142 | integrations/claude-code-plugin/core/mcp_server.py:133-142 | integrations/codex-plugin/core/mcp_server.py:133-142 | integrations/cursor-plugin/core/mcp_server.py:133-142 | integrations/kimi-plugin/core/mcp_server.py:133-142 | integrations/mem0-agent-plugin/core/mcp_server.py:133-142 — before extracting anything, compare `integrations/agent-plugin-core/python/mcp_server.py` and `integrations/antigravity-plugin/core/mcp_server.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 140 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 (10 lines × 7) REDACTED:2557— REDACTED:2557-2566 | REDACTED:2557-2566 | REDACTED:2557-2566 | REDACTED:2557-2566 | REDACTED:2557-2566 | REDACTED:2557-2566 | REDACTED:2557-2566 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (10 lines × 7) REDACTED:410— REDACTED:410-419 | REDACTED:410-419 | REDACTED:410-419 | REDACTED:410-419 | REDACTED:410-419 | REDACTED:410-419 | REDACTED:410-419 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 7) REDACTED:790— REDACTED:790-799 | REDACTED:790-799 | REDACTED:790-799 | REDACTED:790-799 | REDACTED:790-799 | REDACTED:790-799 | REDACTED:790-799 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (10 lines × 7) REDACTED:1950— REDACTED:1950-1959 | REDACTED:1950-1959 | REDACTED:1950-1959 | REDACTED:1950-1959 | REDACTED:1950-1959 | REDACTED:1950-1959 | REDACTED:1950-1959 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 7) REDACTED:2633— REDACTED:2633-2642 | REDACTED:2633-2642 | REDACTED:2633-2642 | REDACTED:2633-2642 | REDACTED:2633-2642 | REDACTED:2633-2642 | REDACTED:2633-2642 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (8 lines × 2) REDACTED:681— REDACTED:681-688 | REDACTED:2379-2386 — 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) REDACTED:1981— REDACTED:1981-1988 | REDACTED:3678-3685 — 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) mem0/vector_stores/cassandra.py:265— mem0/vector_stores/cassandra.py:265-272 | mem0/vector_stores/cassandra.py:460-469 — 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 `mem0/vector_stores/cassandra.py:460` 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 (8 lines × 2) mem0/vector_stores/databricks.py:515— mem0/vector_stores/databricks.py:515-522 | mem0/vector_stores/databricks.py:564-571 — 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) mem0/vector_stores/supabase.py:136— mem0/vector_stores/supabase.py:136-143 | mem0/vector_stores/supabase.py:240-247 — 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 `mem0/vector_stores/supabase.py:136` 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 first that the copies are not typed on the same thing: the declarations holding them bind `top_k` to `int = 5` in one and `int = 100` 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 (8 lines × 2) examples/misc/strands_agent_aws_elasticache_neptune.py:215— examples/misc/strands_agent_aws_elasticache_neptune.py:215-222 | examples/misc/strands_agent_aws_elasticache_neptune.py:306-313 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19 lines × 7) REDACTED:298— REDACTED:298-316 | REDACTED:298-316 | REDACTED:298-316 | REDACTED:298-316 | REDACTED:298-316 | REDACTED:298-316 | REDACTED:298-316 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 7) REDACTED:558— REDACTED:558-576 | REDACTED:558-576 | REDACTED:558-576 | REDACTED:558-576 | REDACTED:558-576 | REDACTED:558-576 | REDACTED:558-576 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (19 lines × 7) REDACTED:1128— REDACTED:1128-1146 | REDACTED:1128-1146 | REDACTED:1128-1146 | REDACTED:1128-1146 | REDACTED:1128-1146 | REDACTED:1128-1146 | REDACTED:1128-1146 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 7) REDACTED:225— REDACTED:225-243 | REDACTED:225-243 | REDACTED:225-243 | REDACTED:225-243 | REDACTED:225-243 | REDACTED:225-243 | REDACTED:225-243 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (19 lines × 7) REDACTED:753— REDACTED:753-771 | REDACTED:753-771 | REDACTED:753-771 | REDACTED:753-771 | REDACTED:753-771 | REDACTED:753-771 | REDACTED:753-771 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (18 lines × 7) REDACTED:357— REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 | REDACTED:357-374 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (18 lines × 7) REDACTED:431— REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 | REDACTED:431-448 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (18 lines × 7) REDACTED:510— REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 | REDACTED:510-527 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (18 lines × 7) REDACTED:537— REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (18 lines × 7) REDACTED:898— REDACTED:898-915 | REDACTED:898-915 | REDACTED:898-915 | REDACTED:898-915 | REDACTED:898-915 | REDACTED:898-915 | REDACTED:898-915 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (16 lines × 7) REDACTED:279— REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 | REDACTED:279-294 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (16 lines × 7) REDACTED:1209— REDACTED:1209-1224 | REDACTED:1209-1224 | REDACTED:1209-1224 | REDACTED:1209-1224 | REDACTED:1209-1224 | REDACTED:1209-1224 | REDACTED:1209-1224 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (16 lines × 7) REDACTED:1298— REDACTED:1298-1313 | REDACTED:1298-1313 | REDACTED:1298-1313 | REDACTED:1298-1313 | REDACTED:1298-1313 | REDACTED:1298-1313 | REDACTED:1298-1313 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (16 lines × 7) REDACTED:1689— REDACTED:1689-1704 | REDACTED:1689-1704 | REDACTED:1689-1704 | REDACTED:1689-1704 | REDACTED:1689-1704 | REDACTED:1689-1704 | REDACTED:1689-1704 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (16 lines × 7) REDACTED:306— REDACTED:306-321 | REDACTED:306-321 | REDACTED:306-321 | REDACTED:306-321 | REDACTED:306-321 | REDACTED:306-321 | REDACTED:306-321 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (15 lines × 7) REDACTED:204— REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 | REDACTED:204-218 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (15 lines × 7) REDACTED:960— REDACTED:960-974 | REDACTED:960-974 | REDACTED:960-974 | REDACTED:960-974 | REDACTED:960-974 | REDACTED:960-974 | REDACTED:960-974 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 7) REDACTED:2502— REDACTED:2502-2516 | REDACTED:2502-2516 | REDACTED:2502-2516 | REDACTED:2502-2516 | REDACTED:2502-2516 | REDACTED:2502-2516 | REDACTED:2502-2516 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (15 lines × 7) REDACTED:586— REDACTED:586-600 | REDACTED:586-600 | REDACTED:586-600 | REDACTED:586-600 | REDACTED:586-600 | REDACTED:586-600 | REDACTED:586-600 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (15 lines × 7) REDACTED:722— REDACTED:722-736 | REDACTED:722-736 | REDACTED:722-736 | REDACTED:722-736 | REDACTED:722-736 | REDACTED:722-736 | REDACTED:722-736 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (10 lines × 2) mem0/client/project.py:543— mem0/client/project.py:543-552 | mem0/client/project.py:867-876 — 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 `mem0/client/project.py:543` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 2) mem0/client/project.py:579— mem0/client/project.py:579-588 | mem0/client/project.py:903-912 — 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 `mem0/client/project.py:579` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 2) REDACTED:696— REDACTED:696-705 | REDACTED:2395-2404 — 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:696` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) cli/python/src/mem0_cli/app.py:195— cli/python/src/mem0_cli/app.py:195-204 | cli/python/src/mem0_cli/commands/memory.py:40-49 — 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 (10 lines × 2) mem0/embeddings/azure_openai.py:45— mem0/embeddings/azure_openai.py:45-55 | mem0/embeddings/lmstudio.py:20-29 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 2) cli/python/src/mem0_cli/commands/memory.py:636— cli/python/src/mem0_cli/commands/memory.py:636-644 | cli/python/src/mem0_cli/commands/memory.py:712-720 — 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 `cli/python/src/mem0_cli/commands/memory.py:636` 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) REDACTED:671— REDACTED:671-679 | REDACTED:2369-2377 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) mem0/vector_stores/elasticsearch.py:178— mem0/vector_stores/elasticsearch.py:178-186 | mem0/vector_stores/elasticsearch.py:222-230 — 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 (9 lines × 2) mem0/vector_stores/opensearch.py:306— mem0/vector_stores/opensearch.py:306-314 | mem0/vector_stores/opensearch.py:332-340 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) mem0/vector_stores/pgvector.py:60— mem0/vector_stores/pgvector.py:60-68 | mem0/vector_stores/pgvector.py:71-79 — 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.
D10 · Test Quality· Fixed-sleep synchronisation · ×4
Fixed-sleep synchronisation: all public methods wait for initialization mem0-ts/src/oss/tests/dimension-autodetect.test.ts:375— This test starts work it did not wait for (`getAllP`, still running when the sleep starts) and then orders itself against it with `new Promise((r) => setTimeout(r, 50))` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Fixed-sleep synchronisation: a failed delivery keeps the batch instead of deleting it integrations/agent-plugin-core/typescript/tests/telemetry.test.ts:126— This test starts work it did not wait for (`telemetry`, still running when the sleep starts) and then orders itself against it with `new Promise((resolve) => setTimeout(resolve, 2_100))` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Fixed-sleep synchronisation: a retried event carries the same uuid so PostHog can collapse it integrations/agent-plugin-core/typescript/tests/telemetry.test.ts:157— This test starts work it did not wait for (`telemetry`, still running when the sleep starts) and then orders itself against it with `new Promise((resolve) => setTimeout(resolve, 2_100))` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Fixed-sleep synchronisation: every event carries a capture-time timestamp integrations/agent-plugin-core/typescript/tests/telemetry.test.ts:250— This test starts work it did not wait for (`telemetry`, still running when the sleep starts) and then orders itself against it with `new Promise((resolve) => setTimeout(resolve, 50))` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
MethodTooLong: Memory.addToVectorStore mem0-ts/src/oss/src/memory/index.ts:840— MethodTooLong — addToVectorStore runs 308 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 208 over it, 3.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.
MethodTooLong: Memory.search mem0-ts/src/oss/src/memory/index.ts:1332— MethodTooLong — search runs 213 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 113 over it, 2.13× 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.
MethodTooLong: ConfigManager.mergeConfig mem0-ts/src/oss/src/config/manager.ts:5— MethodTooLong — mergeConfig runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53× 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.
MethodTooLong: Mem0.execute integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts:370— MethodTooLong — execute runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52× 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.
Duplicated block (50 lines × 7) REDACTED:1317— REDACTED:1317-1366 | REDACTED:1317-1366 | REDACTED:1317-1366 | REDACTED:1317-1366 | REDACTED:1317-1366 | REDACTED:1317-1366 | REDACTED:1317-1366 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (50 lines × 7) REDACTED:2411— REDACTED:2411-2460 | REDACTED:2411-2460 | REDACTED:2411-2460 | REDACTED:2411-2460 | REDACTED:2411-2460 | REDACTED:2411-2460 | REDACTED:2411-2460 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (50 lines × 7) REDACTED:135— REDACTED:135-184 | REDACTED:135-184 | REDACTED:135-184 | REDACTED:135-184 | REDACTED:135-184 | REDACTED:135-184 | REDACTED:135-184 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (50 lines × 7) REDACTED:484— REDACTED:484-533 | REDACTED:484-533 | REDACTED:484-533 | REDACTED:484-533 | REDACTED:484-533 | REDACTED:484-533 | REDACTED:484-533 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) mem0/llms/ollama.py:26— mem0/llms/ollama.py:26-39 | mem0/llms/vllm.py:24-37 — before extracting anything, compare `mem0/llms/ollama.py` and `mem0/llms/vllm.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 `mem0/llms/ollama.py:26` 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) REDACTED:489— REDACTED:489-502 | REDACTED:2195-2208 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) REDACTED:2095— REDACTED:2095-2108 | REDACTED:3815-3828 — 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:2095` 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) mem0/vector_stores/weaviate.py:197— mem0/vector_stores/weaviate.py:197-210 | mem0/vector_stores/weaviate.py:248-261 — 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 `mem0/vector_stores/weaviate.py:197` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 7) REDACTED:382— REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 | REDACTED:382-394 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (13 lines × 7) REDACTED:540— REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 | REDACTED:540-552 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (13 lines × 7) REDACTED:1169— REDACTED:1169-1181 | REDACTED:1169-1181 | REDACTED:1169-1181 | REDACTED:1169-1181 | REDACTED:1169-1181 | REDACTED:1169-1181 | REDACTED:1169-1181 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (13 lines × 7) REDACTED:1468— REDACTED:1468-1480 | REDACTED:1468-1480 | REDACTED:1468-1480 | REDACTED:1468-1480 | REDACTED:1468-1480 | REDACTED:1468-1480 | REDACTED:1468-1480 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) integrations/claude-code-plugin/adapters/claude/transcript.py:131— integrations/claude-code-plugin/adapters/claude/transcript.py:131-137 | integrations/claude-code-plugin/adapters/claude/transcript.py:143-149 — 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 (7 lines × 2) REDACTED:882— REDACTED:882-888 | REDACTED:1954-1960 — 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:882` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7 lines × 2) REDACTED:1671— REDACTED:1671-1677 | REDACTED:3358-3364 — 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) REDACTED:2531— REDACTED:2531-2538 | REDACTED:2547-2553 — 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:2531` 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 (6 lines × 7) REDACTED:252— REDACTED:252-257 | REDACTED:252-257 | REDACTED:252-257 | REDACTED:252-257 | REDACTED:252-257 | REDACTED:252-257 | REDACTED:252-257 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 7) REDACTED:462— REDACTED:462-467 | REDACTED:462-467 | REDACTED:462-467 | REDACTED:462-467 | REDACTED:462-467 | REDACTED:462-467 | REDACTED:462-467 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 7) REDACTED:708— REDACTED:708-713 | REDACTED:708-713 | REDACTED:708-713 | REDACTED:708-713 | REDACTED:708-713 | REDACTED:708-713 | REDACTED:708-713 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 7) REDACTED:1289— REDACTED:1289-1294 | REDACTED:1289-1294 | REDACTED:1289-1294 | REDACTED:1289-1294 | REDACTED:1289-1294 | REDACTED:1289-1294 | REDACTED:1289-1294 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (6 lines × 2) mem0/embeddings/azure_openai.py:72— mem0/embeddings/azure_openai.py:72-77 | mem0/embeddings/openai.py:76-81 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 2) REDACTED:1097— REDACTED:1097-1102 | REDACTED:2778-2785 — 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:2778` 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 (6 lines × 2) REDACTED:2118— REDACTED:2118-2123 | REDACTED:3838-3843 — 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 (6 lines × 2) mem0/vector_stores/elasticsearch.py:95— mem0/vector_stores/elasticsearch.py:95-100 | mem0/vector_stores/opensearch.py:107-112 — 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 `mem0/vector_stores/elasticsearch.py:95` 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 (5 lines × 2) REDACTED:1068— REDACTED:1068-1072 | REDACTED:2748-2753 — 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:2748` 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 (5 lines × 2) mem0/vector_stores/langchain.py:79— mem0/vector_stores/langchain.py:79-83 | mem0/vector_stores/weaviate.py:113-117 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `mem0/vector_stores/langchain.py:79` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (5 lines × 2) server/alembic/versions/001_create_users_and_api_keys.py:21— server/alembic/versions/001_create_users_and_api_keys.py:21-25 | server/alembic/versions/002_create_request_logs.py:21-25 — 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 `server/alembic/versions/001_create_users_and_api_keys.py:21` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) cli/python/src/mem0_cli/commands/events_cmd.py:91— cli/python/src/mem0_cli/commands/events_cmd.py:91-95 | cli/python/src/mem0_cli/commands/events_cmd.py:136-140 — 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.
Swallowed exception (caught, then discarded) server/main.py:73— `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) server/server_state.py:34— `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) mem0-ts/src/oss/src/prompts/index.ts:957— `catch` 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) mem0-ts/src/oss/src/prompts/index.ts:1019— `catch` 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.
AC3 · Page structure· Page without a main landmark · ×3
Page without a main landmark server/dashboard/src/app/(auth)/layout.tsx:19— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark server/dashboard/src/app/(root)/dashboard-client-layout.tsx:28— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark server/dashboard/src/app/setup/layout.tsx:18— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Change coupling: factory.ts ↔ tsup.config.ts mem0-ts/src/oss/src/utils/factory.ts:1— `mem0-ts/src/oss/src/utils/factory.ts` and `mem0-ts/tsup.config.ts` change together 87% of the time (20 of the 23 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 20 shared commits counted here, the most recent 3 are `18021dd1` feat(ts-oss): add Oracle AI Vector Search vector store (#6690); `17836748` feat(vector-stores): add Databricks provider to TypeScript OSS SDK (#…; `33a0ed75` feat(ts-sdk): add AWS Neptune Analytics vector store (#5797) — run `git show` on any of them.
Change coupling: manager.ts ↔ factory.ts mem0-ts/src/oss/src/config/manager.ts:1— `mem0-ts/src/oss/src/config/manager.ts` and `mem0-ts/src/oss/src/utils/factory.ts` change together 50% of the time (10 of the 20 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 10 shared commits counted here, the most recent 3 are `17836748` feat(vector-stores): add Databricks provider to TypeScript OSS SDK (#…; `ba9054e0` feat(ts-sdk): add AWS Bedrock LLM provider (closes #5765) (#5890); `3b2357bf` feat(ts-sdk): add Vertex AI embedding provider (#5882) — run `git show` on any of them.
Change coupling: azure_openai.py ↔ azure_openai_structured.py mem0/llms/azure_openai.py:1— `mem0/llms/azure_openai.py` and `mem0/llms/azure_openai_structured.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 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 5 shared commits counted here, the most recent 3 are `8a786bf7` fix(azure): stop mutating and corrupting caller messages in content r…; `9692726d` fix(ts-oss): isolate entity store from memory store by default (#4829); `4487785c` feature: add Azure Identity for Azure OpenAI and Azure AI Search auth… — run `git show` on any of them.
Duplicated block (31 lines × 7) REDACTED:1388— REDACTED:1388-1418 | REDACTED:1388-1418 | REDACTED:1388-1418 | REDACTED:1388-1418 | REDACTED:1388-1418 | REDACTED:1388-1418 | REDACTED:1388-1418 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (31 lines × 7) REDACTED:2572— REDACTED:2572-2602 | REDACTED:2572-2602 | REDACTED:2572-2602 | REDACTED:2572-2602 | REDACTED:2572-2602 | REDACTED:2572-2602 | REDACTED:2572-2602 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (31 lines × 7) REDACTED:2646— REDACTED:2646-2676 | REDACTED:2646-2676 | REDACTED:2646-2676 | REDACTED:2646-2676 | REDACTED:2646-2676 | REDACTED:2646-2676 | REDACTED:2646-2676 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (28 lines × 2) REDACTED:246— REDACTED:246-273 | REDACTED:1303-1330 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (28 lines × 2) REDACTED:2057— REDACTED:2057-2084 | REDACTED:3775-3802 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (28 lines × 2) mem0/reranker/huggingface_reranker.py:145— mem0/reranker/huggingface_reranker.py:145-172 | mem0/reranker/sentence_transformer_reranker.py:92-119 — before extracting anything, compare `mem0/reranker/huggingface_reranker.py` and `mem0/reranker/sentence_transformer_reranker.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) REDACTED:933— REDACTED:933-957 | REDACTED:2616-2640 — 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:933` 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 (25 lines × 2) REDACTED:1616— REDACTED:1616-1640 | REDACTED:3304-3328 — 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 (25 lines × 2) REDACTED:1803— REDACTED:1803-1827 | REDACTED:3481-3505 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (22 lines × 7) REDACTED:1262— REDACTED:1262-1283 | REDACTED:1262-1283 | REDACTED:1262-1283 | REDACTED:1262-1283 | REDACTED:1262-1283 | REDACTED:1262-1283 | REDACTED:1262-1283 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (22 lines × 7) REDACTED:2475— REDACTED:2475-2496 | REDACTED:2475-2496 | REDACTED:2475-2496 | REDACTED:2475-2496 | REDACTED:2475-2496 | REDACTED:2475-2496 | REDACTED:2475-2496 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (22 lines × 7) REDACTED:872— REDACTED:872-893 | REDACTED:872-893 | REDACTED:872-893 | REDACTED:872-893 | REDACTED:872-893 | REDACTED:872-893 | REDACTED:872-893 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (17 lines × 7) REDACTED:739— REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 | REDACTED:739-755 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (17 lines × 7) REDACTED:1024— REDACTED:1024-1040 | REDACTED:1024-1040 | REDACTED:1024-1040 | REDACTED:1024-1040 | REDACTED:1024-1040 | REDACTED:1024-1040 | REDACTED:1024-1040 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (17 lines × 7) REDACTED:1050— REDACTED:1050-1066 | REDACTED:1050-1066 | REDACTED:1050-1066 | REDACTED:1050-1066 | REDACTED:1050-1066 | REDACTED:1050-1066 | REDACTED:1050-1066 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (16 lines × 2) mem0/llms/aws_bedrock.py:185— mem0/llms/aws_bedrock.py:185-200 | mem0/llms/aws_bedrock.py:214-229 — 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 (16 lines × 2) REDACTED:1106— REDACTED:1106-1121 | REDACTED:2789-2804 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) mem0/vector_stores/chroma.py:77— mem0/vector_stores/chroma.py:77-92 | mem0/vector_stores/weaviate.py:87-102 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15 lines × 2) REDACTED:2029— REDACTED:2029-2043 | REDACTED:3746-3761 — 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) mem0/vector_stores/redis.py:129— mem0/vector_stores/redis.py:129-143 | mem0/vector_stores/valkey.py:307-321 — 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 × 2) mem0/vector_stores/valkey.py:316— mem0/vector_stores/valkey.py:316-330 | mem0/vector_stores/valkey.py:518-532 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 7) integrations/agent-plugin-core/python/mcp_server.py:116— integrations/agent-plugin-core/python/mcp_server.py:116-129 | integrations/antigravity-plugin/core/mcp_server.py:116-129 | integrations/claude-code-plugin/core/mcp_server.py:116-129 | integrations/codex-plugin/core/mcp_server.py:116-129 | integrations/cursor-plugin/core/mcp_server.py:116-129 | integrations/kimi-plugin/core/mcp_server.py:116-129 | integrations/mem0-agent-plugin/core/mcp_server.py:116-129 — before extracting anything, compare `integrations/agent-plugin-core/python/mcp_server.py` and `integrations/antigravity-plugin/core/mcp_server.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 140 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 (14 lines × 7) REDACTED:578— REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 | REDACTED:578-591 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 7) REDACTED:247— REDACTED:247-260 | REDACTED:247-260 | REDACTED:247-260 | REDACTED:247-260 | REDACTED:247-260 | REDACTED:247-260 | REDACTED:247-260 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (12 lines × 2) mem0/configs/vector_stores/azure_mysql.py:84— mem0/configs/vector_stores/azure_mysql.py:84-95 | mem0/configs/vector_stores/cassandra.py:62-73 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 2) REDACTED:1209— REDACTED:1209-1220 | REDACTED:2890-2901 — 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 (12 lines × 2) mem0/vector_stores/upstash_vector.py:124— mem0/vector_stores/upstash_vector.py:124-139 | mem0/vector_stores/upstash_vector.py:273-284 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:227— integrations/agent-plugin-core/python/hook_runner.py:227-236 | integrations/antigravity-plugin/core/hook_runner.py:227-236 | integrations/claude-code-plugin/core/hook_runner.py:227-236 | integrations/codex-plugin/core/hook_runner.py:227-236 | integrations/cursor-plugin/core/hook_runner.py:227-236 | integrations/kimi-plugin/core/hook_runner.py:227-236 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 (10 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:202— integrations/agent-plugin-core/python/hook_runner.py:202-211 | integrations/antigravity-plugin/core/hook_runner.py:202-211 | integrations/claude-code-plugin/core/hook_runner.py:202-211 | integrations/codex-plugin/core/hook_runner.py:202-211 | integrations/cursor-plugin/core/hook_runner.py:202-211 | integrations/kimi-plugin/core/hook_runner.py:202-211 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 (10 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:375— integrations/agent-plugin-core/python/hook_runner.py:375-384 | integrations/antigravity-plugin/core/hook_runner.py:375-384 | integrations/claude-code-plugin/core/hook_runner.py:375-384 | integrations/codex-plugin/core/hook_runner.py:375-384 | integrations/cursor-plugin/core/hook_runner.py:375-384 | integrations/kimi-plugin/core/hook_runner.py:375-384 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 7) REDACTED:482— REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 | REDACTED:482-490 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 × 7) REDACTED:567— REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 | REDACTED:567-575 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 7) REDACTED:294— REDACTED:294-302 | REDACTED:294-302 | REDACTED:294-302 | REDACTED:294-302 | REDACTED:294-302 | REDACTED:294-302 | REDACTED:294-302 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 7) REDACTED:949— REDACTED:949-955 | REDACTED:949-955 | REDACTED:949-955 | REDACTED:949-955 | REDACTED:949-955 | REDACTED:949-955 | REDACTED:949-955 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (7 lines × 7) REDACTED:1458— REDACTED:1458-1464 | REDACTED:1458-1464 | REDACTED:1458-1464 | REDACTED:1458-1464 | REDACTED:1458-1464 | REDACTED:1458-1464 | REDACTED:1458-1464 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (7 lines × 7) REDACTED:1484— REDACTED:1484-1490 | REDACTED:1484-1490 | REDACTED:1484-1490 | REDACTED:1484-1490 | REDACTED:1484-1490 | REDACTED:1484-1490 | REDACTED:1484-1490 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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.
Outbound HTTP without resilience REDACTED:1359— `requests.get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience mem0/utils/http.py:10— `httpx.Client(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience mem0/utils/http.py:13— `httpx.Client(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Duplicated block (24 lines × 2 locations) cli/node/src/commands/init.ts:475— cli/node/src/commands/init.ts:475 · cli/node/src/commands/init.ts:558 — 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 (24 lines × 2 locations) mem0-ts/src/oss/src/llms/aws_bedrock.ts:116— mem0-ts/src/oss/src/llms/aws_bedrock.ts:116 · mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:1033 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (24 lines × 2 locations) server/dashboard/src/app/(auth)/layout.tsx:10— server/dashboard/src/app/(auth)/layout.tsx:10 · server/dashboard/src/app/setup/layout.tsx:9 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (23 lines × 2 locations) integrations/openclaw/cli/commands.ts:1369— integrations/openclaw/cli/commands.ts:1369 · integrations/openclaw/cli/commands.ts:1402 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23 lines × 2 locations) integrations/vercel-ai-sdk/src/mem0-utils.ts:283— integrations/vercel-ai-sdk/src/mem0-utils.ts:283 · integrations/vercel-ai-sdk/src/mem0-utils.ts:341 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23 lines × 2 locations) server/dashboard/src/components/ui/dropdown-menu.tsx:78— server/dashboard/src/components/ui/dropdown-menu.tsx:78 · server/dashboard/src/components/ui/dropdown-menu.tsx:142 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
AC2 · Forms & labels· <Select> field component without a label · ×2
<Select> field component without a label server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:129— This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
<Select> field component without a label server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:180— This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
Low contrast colour pair in CSS (3.6:1) examples/yt-assistant-chrome/styles/options.css:201— `button` sets color: white on background-color: #3d84f7 — 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
Low contrast colour pair in CSS (3.6:1) examples/yt-assistant-chrome/styles/popup.css:104— `button` sets color: white on background-color: #3d84f7 — 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
PlatformBackend.add (cyclomatic 16) cli/python/src/mem0_cli/backend/platform.py:78— PlatformBackend.add 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.
PlatformBackend.add (cyclomatic 16) cli/node/src/backend/platform.ts:134— PlatformBackend.add 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.
opencode-mem0.Mem0Plugin::chatMessageHook (cognitive 44) integrations/opencode-plugin/opencode-mem0.ts:592— opencode-mem0.Mem0Plugin::chatMessageHook has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (23 pts), error handling 5 (12 pts), ternaries 3 (6 pts), boolean chains 3 (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. This shape REPEATS in the file: 2 other methods here (opencode-mem0.Mem0Plugin, opencode-mem0.Mem0Plugin::toolExecuteAfterHook) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
opencode-mem0.Mem0Plugin::toolExecuteAfterHook (cognitive 17) integrations/opencode-plugin/opencode-mem0.ts:818— opencode-mem0.Mem0Plugin::toolExecuteAfterHook has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (opencode-mem0.Mem0Plugin, opencode-mem0.Mem0Plugin::chatMessageHook) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:389— REDACTED:389-433 | REDACTED:437-480 | REDACTED:1474-1518 | REDACTED:1522-1565 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1277— REDACTED:1277-1338 | REDACTED:1406-1536 | REDACTED:2958-3019 | REDACTED:3087-3224 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (35 lines × 7) integrations/agent-plugin-core/python/mcp_server.py:78— integrations/agent-plugin-core/python/mcp_server.py:78-112 | integrations/antigravity-plugin/core/mcp_server.py:78-112 | integrations/claude-code-plugin/core/mcp_server.py:78-112 | integrations/codex-plugin/core/mcp_server.py:78-112 | integrations/cursor-plugin/core/mcp_server.py:78-112 | integrations/kimi-plugin/core/mcp_server.py:78-112 | integrations/mem0-agent-plugin/core/mcp_server.py:78-112 — before extracting anything, compare `integrations/agent-plugin-core/python/mcp_server.py` and `integrations/antigravity-plugin/core/mcp_server.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 140 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 (35 lines × 7) REDACTED:1905— REDACTED:1905-1939 | REDACTED:1905-1939 | REDACTED:1905-1939 | REDACTED:1905-1939 | REDACTED:1905-1939 | REDACTED:1905-1939 | REDACTED:1905-1939 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (30 lines × 7) REDACTED:398— REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 | REDACTED:398-427 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (30 lines × 7) REDACTED:1425— REDACTED:1425-1454 | REDACTED:1425-1454 | REDACTED:1425-1454 | REDACTED:1425-1454 | REDACTED:1425-1454 | REDACTED:1425-1454 | REDACTED:1425-1454 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (29 lines × 2) REDACTED:629— REDACTED:629-657 | REDACTED:1715-1743 — 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 (29 lines × 2) REDACTED:1236— REDACTED:1236-1264 | REDACTED:2917-2945 — 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 × 7) REDACTED:1227— REDACTED:1227-1254 | REDACTED:1227-1254 | REDACTED:1227-1254 | REDACTED:1227-1254 | REDACTED:1227-1254 | REDACTED:1227-1254 | REDACTED:1227-1254 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (28 lines × 7) REDACTED:1658— REDACTED:1658-1685 | REDACTED:1658-1685 | REDACTED:1658-1685 | REDACTED:1658-1685 | REDACTED:1658-1685 | REDACTED:1658-1685 | REDACTED:1658-1685 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (19–20 lines × 2) REDACTED:837— REDACTED:837-855 | REDACTED:2509-2528 — 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:837` 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–20 lines × 2) REDACTED:1176— REDACTED:1176-1195 | REDACTED:2857-2875 — 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:1176` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17–18 lines × 2) mem0/llms/azure_openai.py:27— mem0/llms/azure_openai.py:27-44 | mem0/llms/openai.py:24-40 — 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 `mem0/llms/azure_openai.py:27` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17–18 lines × 2) REDACTED:1157— REDACTED:1157-1174 | REDACTED:2838-2854 — 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:1157` 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 × 2) REDACTED:587— REDACTED:587-603 | REDACTED:2272-2288 — 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) mem0/llms/azure_openai.py:75— mem0/llms/azure_openai.py:75-91 | mem0/llms/azure_openai_structured.py:107-123 — before extracting anything, compare `mem0/llms/azure_openai.py` and `mem0/llms/azure_openai_structured.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 70 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 `mem0/llms/azure_openai.py:75` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14–15 lines × 2) REDACTED:615— REDACTED:615-629 | REDACTED:2303-2316 — 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:615` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–15 lines × 2) mem0/utils/entity_extraction.py:662— mem0/utils/entity_extraction.py:662-675 | mem0/utils/entity_extraction.py:682-696 — 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 `mem0/utils/entity_extraction.py:662` 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 × 7) REDACTED:775— REDACTED:775-786 | REDACTED:775-786 | REDACTED:775-786 | REDACTED:775-786 | REDACTED:775-786 | REDACTED:775-786 | REDACTED:775-786 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (12 lines × 7) REDACTED:81— REDACTED:81-92 | REDACTED:81-92 | REDACTED:81-92 | REDACTED:81-92 | REDACTED:81-92 | REDACTED:81-92 | REDACTED:81-92 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) cli/python/src/mem0_cli/commands/events_cmd.py:166— cli/python/src/mem0_cli/commands/events_cmd.py:166-176 | cli/python/src/mem0_cli/commands/utils.py:84-94 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) cli/python/src/mem0_cli/commands/init_cmd.py:46— cli/python/src/mem0_cli/commands/init_cmd.py:46-56 | cli/python/src/mem0_cli/commands/init_cmd.py:71-81 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9–10 lines × 2) cli/python/src/mem0_cli/commands/entities.py:109— cli/python/src/mem0_cli/commands/entities.py:109-118 | cli/python/src/mem0_cli/commands/memory.py:665-673 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9–10 lines × 2) mem0/vector_stores/databricks.py:590— mem0/vector_stores/databricks.py:590-599 | mem0/vector_stores/databricks.py:652-660 — 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 `mem0/vector_stores/databricks.py:590` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:53— integrations/agent-plugin-core/python/hook_runner.py:53-59 | integrations/antigravity-plugin/core/hook_runner.py:53-59 | integrations/claude-code-plugin/core/hook_runner.py:53-59 | integrations/codex-plugin/core/hook_runner.py:53-59 | integrations/cursor-plugin/core/hook_runner.py:53-59 | integrations/kimi-plugin/core/hook_runner.py:53-59 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 (7 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:215— integrations/agent-plugin-core/python/hook_runner.py:215-221 | integrations/antigravity-plugin/core/hook_runner.py:215-221 | integrations/claude-code-plugin/core/hook_runner.py:215-221 | integrations/codex-plugin/core/hook_runner.py:215-221 | integrations/cursor-plugin/core/hook_runner.py:215-221 | integrations/kimi-plugin/core/hook_runner.py:215-221 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 (5 lines × 7) REDACTED:46— REDACTED:46-50 | REDACTED:46-50 | REDACTED:46-50 | REDACTED:46-50 | REDACTED:46-50 | REDACTED:46-50 | REDACTED:46-50 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 7) REDACTED:272— REDACTED:272-276 | REDACTED:272-276 | REDACTED:272-276 | REDACTED:272-276 | REDACTED:272-276 | REDACTED:272-276 | REDACTED:272-276 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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.
R10 · Code Duplication· Duplicated block with local edits (65 matched lines × 2 locations) · ×2
Duplicated block with local edits (65 matched lines × 2 locations) integrations/deepseek-plugin/src/telemetry.ts:14— integrations/deepseek-plugin/src/telemetry.ts:14 · integrations/pi-agent-plugin/src/telemetry.ts:8 — the two spans are one implementation copied and then locally edited — 383 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (65 matched lines × 2 locations) server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:35— server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:35 · server/dashboard/src/app/(root)/dashboard/entities/page.tsx:21 — the two spans are one implementation copied and then locally edited — 346 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (41 lines × 2 locations) integrations/openclaw/providers.ts:163— integrations/openclaw/providers.ts:163 · integrations/openclaw/providers.ts:459 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (41 lines × 2 locations) mem0-ts/src/oss/src/embeddings/azure.ts:20— mem0-ts/src/oss/src/embeddings/azure.ts:20 · mem0-ts/src/oss/src/embeddings/openai.ts:13 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (29 lines × 2 locations) mem0-ts/src/oss/src/vector_stores/cassandra.ts:513— mem0-ts/src/oss/src/vector_stores/cassandra.ts:513 · mem0-ts/src/oss/src/vector_stores/databricks.ts:1554 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (29 lines × 2 locations) server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:165— server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:165 · server/dashboard/src/app/setup/page.tsx:553 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
Dead file (~33 LoC) server/dashboard/src/components/ui/popover.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~33 LoC) server/dashboard/src/components/ui/progress.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~29 LoC) server/dashboard/src/components/ui/hover-card.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (server/dashboard/src/components/misc/truncated-text.tsx) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~29 LoC) server/dashboard/src/components/ui/switch.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~28 LoC) integrations/vercel-ai-sdk/src/stream-utils.ts— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~28 LoC) server/dashboard/src/components/ui/slider.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Focus outline removed inline server/dashboard/src/components/ui/textarea.tsx:29— <textarea> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×1
Focus outline removed in CSS without a :focus replacement examples/yt-assistant-chrome/styles/options.css:309— `.slider` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 74 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
commands.registerCliCommands (cyclomatic 218) integrations/openclaw/cli/commands.ts:398— commands.registerCliCommands has cyclomatic complexity 218 (threshold 15). Most of this is not in the body itself: 1 of the 218 points is its own statement and the rest belongs to 20 function literals inside it that branch (lines 463, 890, 1161, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
index.registerHooks (cyclomatic 86) integrations/openclaw/index.ts:395— index.registerHooks has cyclomatic complexity 86 (threshold 15). Most of this is not in the body itself: 4 of the 86 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 711, 434, 555, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
transcript.transcript_extraction_messages (cyclomatic 76) integrations/claude-code-plugin/adapters/claude/transcript.py:156— transcript.transcript_extraction_messages has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
page.SetupPage (cyclomatic 73) server/dashboard/src/app/setup/page.tsx:65— page.SetupPage has cyclomatic complexity 73 (threshold 15). Of this number, 36 points are the body's own statements and 37 belong to 9 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Memory.addToVectorStore (cyclomatic 72) mem0-ts/src/oss/src/memory/index.ts:840— Memory.addToVectorStore has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Memory._add_to_vector_store (cyclomatic 65) REDACTED:881— Memory._add_to_vector_store has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (AsyncMemory._add_to_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._add_to_vector_store (cyclomatic 65) REDACTED:2556— AsyncMemory._add_to_vector_store has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Memory._add_to_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
init.runInit (cyclomatic 52) cli/node/src/commands/init.ts:307— init.runInit has cyclomatic complexity 52 (threshold 15). Of this number, 47 points are the body's own statements and 5 belong to 2 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.
Mem0.execute (cyclomatic 52) integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts:370— Mem0.execute has cyclomatic complexity 52 (threshold 15). Of this number, 51 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Memory.search (cyclomatic 49) mem0-ts/src/oss/src/memory/index.ts:1332— Memory.search has cyclomatic complexity 49 (threshold 15). Of this number, 41 points are the body's own statements and 8 belong to 3 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.
entity_extraction._add_topic_phrase_candidates (cyclomatic 48) mem0/utils/entity_extraction.py:590— entity_extraction._add_topic_phrase_candidates 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.
commands.runOssWizardInteractive (cyclomatic 44) integrations/openclaw/cli/commands.ts:239— commands.runOssWizardInteractive has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mem0-utils.convertToMem0Format (cyclomatic 44) integrations/vercel-ai-sdk/src/mem0-utils.ts:73— mem0-utils.convertToMem0Format has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 2 of the 44 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 75, 84). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
init_cmd.run_init (cyclomatic 39) cli/python/src/mem0_cli/commands/init_cmd.py:197— init_cmd.run_init has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
memory.cmdAdd (cyclomatic 37) cli/node/src/commands/memory.ts:40— memory.cmdAdd 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.
index.apply (cyclomatic 37) integrations/deepseek-plugin/src/index.ts:96— index.apply has cyclomatic complexity 37 (threshold 15). Of this number, 22 points are the body's own statements and 15 belong to 5 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.
memory.cmd_add (cyclomatic 36) cli/python/src/mem0_cli/commands/memory.py:64— memory.cmd_add has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
index.extractJson (cyclomatic 34) mem0-ts/src/oss/src/prompts/index.ts:901— index.extractJson 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.
ConfigManager.mergeConfig (cyclomatic 34) mem0-ts/src/oss/src/config/manager.ts:5— ConfigManager.mergeConfig has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 8 of the 34 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 111, 13, 71, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
help.richFormatHelp (cyclomatic 33) cli/node/src/help.ts:218— help.richFormatHelp 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.
LangchainLLM.generateResponse (cyclomatic 33) mem0-ts/src/oss/src/llms/langchain.ts:59— LangchainLLM.generateResponse has cyclomatic complexity 33 (threshold 15). Of this number, 31 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Qdrant.createFilter (cyclomatic 31) mem0-ts/src/oss/src/vector_stores/qdrant.ts:215— Qdrant.createFilter 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.
DatabricksVectorStore.matchFieldCondition (cyclomatic 31) mem0-ts/src/oss/src/vector_stores/databricks.ts:1469— DatabricksVectorStore.matchFieldCondition 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.
PineconeDB.createFilter (cyclomatic 31) mem0-ts/src/oss/src/vector_stores/pinecone.ts:156— PineconeDB.createFilter 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.
memory.cmd_delete_all (cyclomatic 30) cli/python/src/mem0_cli/commands/memory.py:583— memory.cmd_delete_all 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.
CassandraDB.matchFieldCondition (cyclomatic 30) mem0-ts/src/oss/src/vector_stores/cassandra.ts:440— CassandraDB.matchFieldCondition 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.
opencode-mem0.Mem0Plugin::chatMessageHook (cyclomatic 29) integrations/opencode-plugin/opencode-mem0.ts:592— opencode-mem0.Mem0Plugin::chatMessageHook 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. This shape REPEATS in the file: one other method here (opencode-mem0.Mem0Plugin) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
data-table.DataTable (cyclomatic 29) server/dashboard/src/components/shared/data-table.tsx:45— data-table.DataTable has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 2 of the 29 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 77, 100, 159, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
memory.cmdDeleteAll (cyclomatic 28) cli/node/src/commands/memory.ts:584— memory.cmdDeleteAll 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.
opencode-mem0.resolveFilters (cyclomatic 27) integrations/opencode-plugin/opencode-mem0.ts:162— opencode-mem0.resolveFilters has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body's own statements and 6 belong to 3 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.
OSSProvider._buildConfig (cyclomatic 25) integrations/openclaw/providers.ts:247— OSSProvider._buildConfig has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
oracledb.buildFieldCondition (cyclomatic 25) mem0-ts/src/oss/src/vector_stores/oracledb.ts:120— oracledb.buildFieldCondition 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.
lemmatization.simpleStem (cyclomatic 25) mem0-ts/src/oss/src/utils/lemmatization.ts:193— lemmatization.simpleStem 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.
commands.registerCommands (cyclomatic 24) integrations/pi-agent-plugin/src/commands.ts:18— commands.registerCommands has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 77, a function literal at line 159, a function literal at line 50, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
pgvector.buildFilterConditions (cyclomatic 24) mem0-ts/src/oss/src/vector_stores/pgvector.ts:63— pgvector.buildFilterConditions 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.
S3Vectors.convertFilterNode (cyclomatic 24) mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:492— S3Vectors.convertFilterNode 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.
Memory._search_vector_store (cyclomatic 23) REDACTED:1642— Memory._search_vector_store 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. This shape REPEATS in the file: one other method here (AsyncMemory._search_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._search_vector_store (cyclomatic 23) REDACTED:3330— AsyncMemory._search_vector_store 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. This shape REPEATS in the file: one other method here (Memory._search_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Qdrant._create_filter (cyclomatic 23) mem0/vector_stores/qdrant.py:339— Qdrant._create_filter 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.
mem0_doc_search.main (cyclomatic 23) skills/mem0/scripts/mem0_doc_search.py:143— mem0_doc_search.main 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.
S3Vectors.convertFieldFilter (cyclomatic 23) mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:583— S3Vectors.convertFieldFilter has cyclomatic complexity 23 (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.
S3Vectors.evaluateOperator (cyclomatic 23) mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:753— S3Vectors.evaluateOperator 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.
Memory.add (cyclomatic 23) mem0-ts/src/oss/src/memory/index.ts:720— Memory.add has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Memory._processMetadataFilters (cyclomatic 23) mem0-ts/src/oss/src/memory/index.ts:2100— Memory._processMetadataFilters has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body's own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
AWSBedrockLLM._generate_standard (cyclomatic 22) mem0/llms/aws_bedrock.py:562— AWSBedrockLLM._generate_standard 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.
Databricks.insert (cyclomatic 21) mem0/vector_stores/databricks.py:398— Databricks.insert 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.
pgvector._build_filter_conditions (cyclomatic 21) mem0/vector_stores/pgvector.py:50— pgvector._build_filter_conditions 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.
PlatformBackend._request (cyclomatic 21) cli/node/src/backend/platform.ts:41— PlatformBackend._request has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
opencode-mem0.Mem0Plugin (cyclomatic 21) integrations/opencode-plugin/opencode-mem0.ts:235— opencode-mem0.Mem0Plugin 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. This shape REPEATS in the file: one other method here (opencode-mem0.Mem0Plugin::chatMessageHook) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
add_memory.perform (cyclomatic 21) integrations/zapier-mem0/src/creates/add_memory.ts:30— add_memory.perform has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
output.sanitize_agent_data (cyclomatic 20) cli/python/src/mem0_cli/output.py:245— output.sanitize_agent_data has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
AWSBedrockLLM._parse_response (cyclomatic 20) mem0/llms/aws_bedrock.py:363— AWSBedrockLLM._parse_response has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Memory._remove_memory_from_entity_store (cyclomatic 20) REDACTED:652— Memory._remove_memory_from_entity_store has cyclomatic complexity 20 (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. This shape REPEATS in the file: one other method here (AsyncMemory._remove_memory_from_entity_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._remove_memory_from_entity_store (cyclomatic 20) REDACTED:2361— AsyncMemory._remove_memory_from_entity_store has cyclomatic complexity 20 (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. This shape REPEATS in the file: one other method here (Memory._remove_memory_from_entity_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
oracledb._build_field_condition (cyclomatic 20) mem0/vector_stores/oracledb.py:111— oracledb._build_field_condition 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.
entity_extraction.extractEntities (cyclomatic 20) mem0-ts/src/oss/src/utils/entity_extraction.ts:725— entity_extraction.extractEntities has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
output.format_add_result (cyclomatic 19) cli/python/src/mem0_cli/output.py:143— output.format_add_result 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.
Memory.search (cyclomatic 19) REDACTED:1393— Memory.search 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. This shape REPEATS in the file: one other method here (AsyncMemory.search) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory.search (cyclomatic 19) REDACTED:3074— AsyncMemory.search 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. This shape REPEATS in the file: one other method here (Memory.search) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
notices.display_scale_threshold_notice (cyclomatic 19) REDACTED:549— notices.display_scale_threshold_notice 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.
ValkeyDB._process_document_fields (cyclomatic 19) mem0/vector_stores/valkey.py:549— ValkeyDB._process_document_fields 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.
entities.cmdEntitiesDelete (cyclomatic 19) cli/node/src/commands/entities.ts:84— entities.cmdEntitiesDelete 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.
OSSProvider._init (cyclomatic 19) integrations/openclaw/providers.ts:328— OSSProvider._init has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body's own statements and 5 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.
memory-add.createMemoryAddTool.execute (cyclomatic 19) integrations/openclaw/tools/memory-add.ts:26— memory-add.createMemoryAddTool.execute has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MemoryVectorStore.matchFieldCondition (cyclomatic 19) mem0-ts/src/oss/src/vector_stores/memory.ts:92— MemoryVectorStore.matchFieldCondition 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.
ChromaDB.generateWhereClause (cyclomatic 19) mem0-ts/src/oss/src/vector_stores/chroma.ts:328— ChromaDB.generateWhereClause 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.
notices.hasTemporalFilter (cyclomatic 19) mem0-ts/src/oss/src/utils/notices.ts:847— notices.hasTemporalFilter 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.
page.MemoriesPage (cyclomatic 19) server/dashboard/src/app/(root)/dashboard/memories/page.tsx:33— page.MemoriesPage has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body's own statements and 9 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Memory._compute_entity_boosts (cyclomatic 18) REDACTED:1747— Memory._compute_entity_boosts 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.
AsyncMemory._compute_entity_boosts_async (cyclomatic 18) REDACTED:3433— AsyncMemory._compute_entity_boosts_async 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.
tools.buildToolExecute (cyclomatic 18) integrations/pi-agent-plugin/src/memory/tools.ts:53— tools.buildToolExecute has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 58). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
databricks.buildStorageOptimizedDatabricksFilterClause (cyclomatic 18) mem0-ts/src/oss/src/vector_stores/databricks.ts:267— databricks.buildStorageOptimizedDatabricksFilterClause 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.
VertexAIVectorSearch.search (cyclomatic 18) mem0-ts/src/oss/src/vector_stores/vertex_ai_vector_search.ts:117— VertexAIVectorSearch.search has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body's own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
entity_extraction.extractProper (cyclomatic 18) mem0-ts/src/oss/src/utils/entity_extraction.ts:517— entity_extraction.extractProper 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.
Memory._linkEntitiesForMemory (cyclomatic 18) mem0-ts/src/oss/src/memory/index.ts:484— Memory._linkEntitiesForMemory 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.
page.ConfigurationPage (cyclomatic 18) server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:32— page.ConfigurationPage has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (handleSave, a function literal at line 61, a function literal at line 62, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
middleware.middleware (cyclomatic 18) server/dashboard/src/middleware.ts:13— middleware.middleware 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.
entities.cmd_entities_delete (cyclomatic 17) cli/python/src/mem0_cli/commands/entities.py:83— entities.cmd_entities_delete 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.
_setup.build_oss_config (cyclomatic 17) REDACTED:140— _setup.build_oss_config 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.
GeminiLLM._parse_response (cyclomatic 17) mem0/llms/gemini.py:45— GeminiLLM._parse_response has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
notices.display_first_run_notice (cyclomatic 17) REDACTED:165— notices.display_first_run_notice 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.
notices.display_temporal_usage_notice (cyclomatic 17) REDACTED:240— notices.display_temporal_usage_notice 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. This shape REPEATS in the file: 2 other methods here (notices.display_decay_usage_notice, notices.display_performance_slow_query_notice) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
notices.display_decay_usage_notice (cyclomatic 17) REDACTED:372— notices.display_decay_usage_notice 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. This shape REPEATS in the file: 2 other methods here (notices.display_temporal_usage_notice, notices.display_performance_slow_query_notice) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
notices.display_performance_slow_query_notice (cyclomatic 17) REDACTED:667— notices.display_performance_slow_query_notice 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. This shape REPEATS in the file: 2 other methods here (notices.display_temporal_usage_notice, notices.display_decay_usage_notice) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Langchain._parse_output (cyclomatic 17) mem0/vector_stores/langchain.py:39— Langchain._parse_output has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Qdrant.insert (cyclomatic 17) mem0/vector_stores/qdrant.py:186— Qdrant.insert 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.
Qdrant._build_field_condition (cyclomatic 17) mem0/vector_stores/qdrant.py:265— Qdrant._build_field_condition 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.
agent-mode.claimViaOtp (cyclomatic 17) cli/node/src/commands/agent-mode.ts:163— agent-mode.claimViaOtp 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.
output.formatAddResult (cyclomatic 17) cli/node/src/output.ts:153— output.formatAddResult 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.
MemoryVectorStore.filterVector (cyclomatic 17) mem0-ts/src/oss/src/vector_stores/memory.ts:160— MemoryVectorStore.filterVector 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.
Qdrant.ensureCollection (cyclomatic 17) mem0-ts/src/oss/src/vector_stores/qdrant.ts:558— Qdrant.ensureCollection 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.
RedisDB.get (cyclomatic 17) mem0-ts/src/oss/src/vector_stores/redis.ts:470— RedisDB.get 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.
DatabricksVectorStore.filterVector (cyclomatic 17) mem0-ts/src/oss/src/vector_stores/databricks.ts:1559— DatabricksVectorStore.filterVector 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.
CassandraDB.filterVector (cyclomatic 17) mem0-ts/src/oss/src/vector_stores/cassandra.ts:518— CassandraDB.filterVector 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.
S3Vectors.negateFilter (cyclomatic 17) mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:652— S3Vectors.negateFilter has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
entity_extraction.extractCompoundsRegex (cyclomatic 17) mem0-ts/src/oss/src/utils/entity_extraction.ts:639— entity_extraction.extractCompoundsRegex has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 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.
main-nav.MainNav (cyclomatic 17) server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx:39— main-nav.MainNav has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 84, 153, 218). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
memory.cmd_search (cyclomatic 16) cli/python/src/mem0_cli/commands/memory.py:240— memory.cmd_search 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.
Mem0MemoryProvider.handle_tool_call (cyclomatic 16) integrations/hermes-plugin-mem0/__init__.py:376— Mem0MemoryProvider.handle_tool_call 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.
Memory._process_metadata_filters (cyclomatic 16) REDACTED:1538— Memory._process_metadata_filters has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (AsyncMemory._process_metadata_filters) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._process_metadata_filters (cyclomatic 16) REDACTED:3226— AsyncMemory._process_metadata_filters has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Memory._process_metadata_filters) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
notices._get_feature_error_message (cyclomatic 16) REDACTED:822— notices._get_feature_error_message 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.
notices._get_provider_memory_count (cyclomatic 16) REDACTED:1489— notices._get_provider_memory_count 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.
notices._has_temporal_filter (cyclomatic 16) REDACTED:1642— notices._has_temporal_filter 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.
HuggingFaceReranker.rerank (cyclomatic 16) mem0/reranker/huggingface_reranker.py:83— HuggingFaceReranker.rerank 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.
ChromaDB._generate_where_clause (cyclomatic 16) mem0/vector_stores/chroma.py:254— ChromaDB._generate_where_clause 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.
errors._classify_one (cyclomatic 16) server/errors.py:28— errors._classify_one has cyclomatic complexity 16 (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.
memory.cmdSearch (cyclomatic 16) cli/node/src/commands/memory.ts:231— memory.cmdSearch 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.
mem0-utils.flattenPrompt (cyclomatic 16) integrations/vercel-ai-sdk/src/mem0-utils.ts:36— mem0-utils.flattenPrompt has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 38). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
Qdrant.buildFieldCondition (cyclomatic 16) mem0-ts/src/oss/src/vector_stores/qdrant.ts:135— Qdrant.buildFieldCondition 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.
DatabricksVectorStore.constructor (cyclomatic 16) mem0-ts/src/oss/src/vector_stores/databricks.ts:458— DatabricksVectorStore.constructor has cyclomatic complexity 16 (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.
NeptuneAnalyticsVectorStore.buildWhereClause (cyclomatic 16) mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:737— NeptuneAnalyticsVectorStore.buildWhereClause has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: NeptuneAnalyticsVectorStore.buildFieldWhereClauses (cyclomatic 17) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
VertexAIEmbedder.constructor (cyclomatic 16) mem0-ts/src/oss/src/embeddings/vertexai.ts:56— VertexAIEmbedder.constructor has cyclomatic complexity 16 (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.
notices.detectTemporalUsageFromMetadata (cyclomatic 16) mem0-ts/src/oss/src/utils/notices.ts:791— notices.detectTemporalUsageFromMetadata 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.
Memory._removeMemoryFromEntityStore (cyclomatic 16) mem0-ts/src/oss/src/memory/index.ts:405— Memory._removeMemoryFromEntityStore 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.
Repeated repair: mem0-ts/src/client/mem0.ts mem0-ts/src/client/mem0.ts:307— mem0-ts/src/client/mem0.ts changed 6 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 13 (its worst body is MemoryClient._maybeAliasAnonToEmail at line 307), 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): reject empty entity IDs and filters in add and delete_all (#7581)”; “fix(client): honor page_size in get_all when page is not passed (#6900)”; “fix(ts-sdk): await identity before building project-scoped URLs (#6802)”; “fix(ts-sdk): take /v1/ping/ off the request critical path (#6788)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 21:16:17 -04:00' --until='2026-10-20 21:16:17 -04:00' --full-history --no-merges -- mem0-ts/src/client/mem0.ts`: 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.
commands.registerCliCommands (cognitive 339) integrations/openclaw/cli/commands.ts:398— commands.registerCliCommands has cognitive complexity 339 (threshold 15). Drivers by points: if/else 140 (238 pts), boolean chains 38, ternaries 18 (32 pts), error handling 14 (16 pts), loops 10 (15 pts) (nesting depth added 119). None of this is in the body itself: all 339 points belong to 20 function literals inside it that branch (lines 463, 890, 1161, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Memory.addToVectorStore (cognitive 162) mem0-ts/src/oss/src/memory/index.ts:840— Memory.addToVectorStore has cognitive complexity 162 (threshold 15). Drivers by points: if/else 31 (67 pts), error handling 20 (52 pts), loops 15 (31 pts), boolean chains 6, ternaries 2 (6 pts) (nesting depth added 88). 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.
index.registerHooks (cognitive 155) integrations/openclaw/index.ts:395— index.registerHooks has cognitive complexity 155 (threshold 15). Drivers by points: if/else 45 (103 pts), boolean chains 19, ternaries 6 (15 pts), loops 5 (13 pts), error handling 2 (5 pts) (nesting depth added 78). Most of this is not in the body itself: 3 of the 155 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 711, 434, 605, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
entity_extraction._add_topic_phrase_candidates (cognitive 138) mem0/utils/entity_extraction.py:590— entity_extraction._add_topic_phrase_candidates has cognitive complexity 138 (threshold 15). Drivers by points: if/else 28 (105 pts), boolean chains 13, ternaries 2 (12 pts), loops 4 (8 pts) (nesting depth added 91). 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.
transcript.transcript_extraction_messages (cognitive 125) integrations/claude-code-plugin/adapters/claude/transcript.py:156— transcript.transcript_extraction_messages has cognitive complexity 125 (threshold 15). Drivers by points: if/else 30 (75 pts), boolean chains 30, loops 7 (12 pts), ternaries 4 (8 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Memory._add_to_vector_store (cognitive 125) REDACTED:881— Memory._add_to_vector_store has cognitive complexity 125 (threshold 15). Drivers by points: if/else 26 (47 pts), error handling 14 (32 pts), loops 11 (20 pts), ternaries 5 (15 pts), boolean chains 11 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (AsyncMemory._add_to_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._add_to_vector_store (cognitive 125) REDACTED:2556— AsyncMemory._add_to_vector_store has cognitive complexity 125 (threshold 15). Drivers by points: if/else 26 (47 pts), error handling 14 (32 pts), loops 11 (20 pts), ternaries 5 (15 pts), boolean chains 11 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Memory._add_to_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Memory.search (cognitive 105) mem0-ts/src/oss/src/memory/index.ts:1332— Memory.search has cognitive complexity 105 (threshold 15). Drivers by points: if/else 24 (59 pts), loops 8 (26 pts), boolean chains 13, error handling 3 (6 pts), ternaries 1 (nesting depth added 56). Of this number, 97 points are the body's own statements and 8 belong to 3 function literals inside it that branch. 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.
Mem0.execute (cognitive 104) integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts:370— Mem0.execute has cognitive complexity 104 (threshold 15). Drivers by points: if/else 27 (66 pts), error handling 4 (14 pts), ternaries 4 (11 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 60). Of this number, 103 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
index.extractJson (cognitive 73) mem0-ts/src/oss/src/prompts/index.ts:901— index.extractJson has cognitive complexity 73 (threshold 15). Drivers by points: if/else 19 (47 pts), error handling 4 (14 pts), loops 6 (8 pts), boolean chains 4 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
help.richFormatHelp (cognitive 67) cli/node/src/help.ts:218— help.richFormatHelp has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (49 pts), loops 6 (11 pts), boolean chains 6, ternaries 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
opencode-mem0.resolveFilters (cognitive 63) integrations/opencode-plugin/opencode-mem0.ts:162— opencode-mem0.resolveFilters has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (55 pts), boolean chains 8 (nesting depth added 38). Of this number, 60 points are the body's own statements and 3 belong to 3 function literals inside it that branch. 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.
Qdrant.createFilter (cognitive 62) mem0-ts/src/oss/src/vector_stores/qdrant.ts:215— Qdrant.createFilter has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 6 (17 pts), boolean chains 5, ternaries 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
init_cmd.run_init (cognitive 61) cli/python/src/mem0_cli/commands/init_cmd.py:197— init_cmd.run_init has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (47 pts), boolean chains 14 (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.
init.runInit (cognitive 59) cli/node/src/commands/init.ts:307— init.runInit has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29 (42 pts), boolean chains 14, ternaries 1 (3 pts) (nesting depth added 15). Of this number, 50 points are the body's own statements and 9 belong to 2 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.
pgvector._build_filter_conditions (cognitive 58) mem0/vector_stores/pgvector.py:50— pgvector._build_filter_conditions has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (48 pts), loops 4 (10 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
commands.runOssWizardInteractive (cognitive 57) integrations/openclaw/cli/commands.ts:239— commands.runOssWizardInteractive has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 19, ternaries 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
S3Vectors.convertFilterNode (cognitive 57) mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:492— S3Vectors.convertFilterNode has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (43 pts), ternaries 3 (10 pts), boolean chains 3, loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory.cmdAdd (cognitive 54) cli/node/src/commands/memory.ts:40— memory.cmdAdd has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (23 pts), ternaries 7 (14 pts), error handling 6 (11 pts), boolean chains 5, 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.
pgvector.buildFilterConditions (cognitive 53) mem0-ts/src/oss/src/vector_stores/pgvector.ts:63— pgvector.buildFilterConditions has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChromaDB.generateWhereClause (cognitive 52) mem0-ts/src/oss/src/vector_stores/chroma.ts:328— ChromaDB.generateWhereClause has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 6 (21 pts), boolean chains 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Memory._processMetadataFilters (cognitive 50) mem0-ts/src/oss/src/memory/index.ts:2100— Memory._processMetadataFilters has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 8 (23 pts), boolean chains 3 (nesting depth added 26). Of this number, 38 points are the body's own statements and 12 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
page.SetupPage (cognitive 50) server/dashboard/src/app/setup/page.tsx:65— page.SetupPage has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 27, if/else 12 (13 pts), error handling 6 (7 pts), ternaries 3 (nesting depth added 2). Of this number, 18 points are the body's own statements and 32 belong to 9 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
memory.cmdDeleteAll (cognitive 49) cli/node/src/commands/memory.ts:584— memory.cmdDeleteAll has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (33 pts), ternaries 4 (10 pts), error handling 3 (5 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.
oracledb.buildFieldCondition (cognitive 49) mem0-ts/src/oss/src/vector_stores/oracledb.ts:120— oracledb.buildFieldCondition has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory.cmd_add (cognitive 48) cli/python/src/mem0_cli/commands/memory.py:64— memory.cmd_add has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (25 pts), error handling 6 (11 pts), boolean chains 6, ternaries 3 (5 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.
ChromaDB._generate_where_clause (cognitive 48) mem0/vector_stores/chroma.py:254— ChromaDB._generate_where_clause has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 6 (21 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Qdrant._create_filter (cognitive 48) mem0/vector_stores/qdrant.py:339— Qdrant._create_filter has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 6 (14 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AWSBedrockLLM._generate_standard (cognitive 45) mem0/llms/aws_bedrock.py:562— AWSBedrockLLM._generate_standard has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mem0-utils.convertToMem0Format (cognitive 45) integrations/vercel-ai-sdk/src/mem0-utils.ts:73— mem0-utils.convertToMem0Format has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 16, error handling 3 (4 pts) (nesting depth added 7). Most of this is not in the body itself: 1 of the 45 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 75, 84). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
memory.cmd_delete_all (cognitive 44) cli/python/src/mem0_cli/commands/memory.py:583— memory.cmd_delete_all has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (32 pts), error handling 3 (5 pts), ternaries 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.
Databricks.insert (cognitive 44) mem0/vector_stores/databricks.py:398— Databricks.insert has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 7 (22 pts), if/else 7 (14 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
index.apply (cognitive 43) integrations/deepseek-plugin/src/index.ts:96— index.apply has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 11, ternaries 5 (7 pts), error handling 3 (4 pts) (nesting depth added 9). Of this number, 21 points are the body's own statements and 22 belong to 5 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.
LangchainLLM.generateResponse (cognitive 42) mem0-ts/src/oss/src/llms/langchain.ts:59— LangchainLLM.generateResponse has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 14, error handling 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 9). Of this number, 39 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabricksVectorStore.matchFieldCondition (cognitive 41) mem0-ts/src/oss/src/vector_stores/databricks.ts:1469— DatabricksVectorStore.matchFieldCondition has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 5, 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.
Memory._search_vector_store (cognitive 40) REDACTED:1642— Memory._search_vector_store has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 3 (8 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (AsyncMemory._search_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._search_vector_store (cognitive 40) REDACTED:3330— AsyncMemory._search_vector_store has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 3 (8 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Memory._search_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
oracledb._build_field_condition (cognitive 40) mem0/vector_stores/oracledb.py:111— oracledb._build_field_condition has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (35 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CassandraDB.matchFieldCondition (cognitive 40) mem0-ts/src/oss/src/vector_stores/cassandra.ts:440— CassandraDB.matchFieldCondition has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 5, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NeptuneAnalyticsVectorStore.buildWhereClause (cognitive 39) mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:737— NeptuneAnalyticsVectorStore.buildWhereClause has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (7 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GeminiLLM._parse_response (cognitive 38) mem0/llms/gemini.py:45— GeminiLLM._parse_response has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (9 pts), ternaries 3 (7 pts), boolean chains 4 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Qdrant.insert (cognitive 38) mem0/vector_stores/qdrant.py:186— Qdrant.insert has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (12 pts), error handling 1 (4 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Memory._linkEntitiesForMemory (cognitive 37) mem0-ts/src/oss/src/memory/index.ts:484— Memory._linkEntitiesForMemory has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 6 (14 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Memory._process_metadata_filters (cognitive 36) REDACTED:1538— Memory._process_metadata_filters has cognitive complexity 36 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 5 (12 pts), boolean chains 2 (nesting depth added 22). 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. This shape REPEATS in the file: one other method here (AsyncMemory._process_metadata_filters) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._process_metadata_filters (cognitive 36) REDACTED:3226— AsyncMemory._process_metadata_filters has cognitive complexity 36 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 5 (12 pts), boolean chains 2 (nesting depth added 22). 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. This shape REPEATS in the file: one other method here (Memory._process_metadata_filters) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Qdrant.ensureCollection (cognitive 36) mem0-ts/src/oss/src/vector_stores/qdrant.ts:558— Qdrant.ensureCollection has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (27 pts), error handling 2 (5 pts), boolean chains 4 (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.
mem0_doc_search.main (cognitive 35) skills/mem0/scripts/mem0_doc_search.py:143— mem0_doc_search.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (12 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.
PineconeDB.createFilter (cognitive 35) mem0-ts/src/oss/src/vector_stores/pinecone.ts:156— PineconeDB.createFilter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 8, loops 2 (4 pts), match/switch 1 (4 pts), ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
notices.hasTemporalFilter (cognitive 35) mem0-ts/src/oss/src/utils/notices.ts:847— notices.hasTemporalFilter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (6 pts), boolean chains 4, 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.
utils.parse_vision_messages (cognitive 34) REDACTED:186— utils.parse_vision_messages has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (25 pts), error handling 1 (3 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
init_cmd._prompt_secret (cognitive 33) cli/python/src/mem0_cli/commands/init_cmd.py:34— init_cmd._prompt_secret has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Memory._compute_entity_boosts (cognitive 33) REDACTED:1747— Memory._compute_entity_boosts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (7 pts), ternaries 2 (6 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncMemory._compute_entity_boosts_async (cognitive 33) REDACTED:3433— AsyncMemory._compute_entity_boosts_async has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (7 pts), ternaries 2 (6 pts), boolean chains 2, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MemoryVectorStore.filterVector (cognitive 33) mem0-ts/src/oss/src/vector_stores/memory.ts:160— MemoryVectorStore.filterVector has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 2, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Memory._remove_memory_from_entity_store (cognitive 32) REDACTED:652— Memory._remove_memory_from_entity_store has cognitive complexity 32 (threshold 15). Drivers by points: error handling 5 (12 pts), if/else 7 (12 pts), boolean chains 6, loops 1, 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. This shape REPEATS in the file: one other method here (AsyncMemory._remove_memory_from_entity_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._remove_memory_from_entity_store (cognitive 32) REDACTED:2361— AsyncMemory._remove_memory_from_entity_store has cognitive complexity 32 (threshold 15). Drivers by points: error handling 5 (12 pts), if/else 7 (12 pts), boolean chains 6, loops 1, 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. This shape REPEATS in the file: one other method here (Memory._remove_memory_from_entity_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
OSSProvider._buildConfig (cognitive 32) integrations/openclaw/providers.ts:247— OSSProvider._buildConfig has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 10, ternaries 1 (2 pts), loops 1 (nesting depth added 6). Of this number, 29 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ValkeyDB._process_document_fields (cognitive 31) mem0/vector_stores/valkey.py:549— ValkeyDB._process_document_fields has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 4 (12 pts), loops 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.
ConfigManager.mergeConfig (cognitive 31) mem0-ts/src/oss/src/config/manager.ts:5— ConfigManager.mergeConfig has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 17, ternaries 8, if/else 6. Most of this is not in the body itself: 6 of the 31 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 111, 13, 71, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
DatabricksVectorStore.filterVector (cognitive 30) mem0-ts/src/oss/src/vector_stores/databricks.ts:1559— DatabricksVectorStore.filterVector has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 2, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CassandraDB.filterVector (cognitive 30) mem0-ts/src/oss/src/vector_stores/cassandra.ts:518— CassandraDB.filterVector has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 2, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
entity_extraction.extractCompoundsRegex (cognitive 30) mem0-ts/src/oss/src/utils/entity_extraction.ts:639— entity_extraction.extractCompoundsRegex has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 5, loops 2 (nesting depth added 16). Of this number, 28 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
AWSBedrockLLM._parse_response (cognitive 29) mem0/llms/aws_bedrock.py:363— AWSBedrockLLM._parse_response has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (5 pts), boolean chains 1, error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
notices._get_provider_memory_count (cognitive 29) REDACTED:1489— notices._get_provider_memory_count has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), error handling 3 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
notices.detectTemporalUsageFromMetadata (cognitive 29) mem0-ts/src/oss/src/utils/notices.ts:791— notices.detectTemporalUsageFromMetadata has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Memory._removeMemoryFromEntityStore (cognitive 29) mem0-ts/src/oss/src/memory/index.ts:405— Memory._removeMemoryFromEntityStore has cognitive complexity 29 (threshold 15). Drivers by points: error handling 6 (13 pts), if/else 4 (8 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
output.sanitize_agent_data (cognitive 28) cli/python/src/mem0_cli/output.py:245— output.sanitize_agent_data has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 3 (6 pts), ternaries 2 (5 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.
agent-mode.claimViaOtp (cognitive 28) cli/node/src/commands/agent-mode.ts:163— agent-mode.claimViaOtp has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), error handling 2 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
config-file.writeFullConfig (cognitive 28) integrations/openclaw/cli/config-file.ts:87— config-file.writeFullConfig has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (8 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
output.formatAddResult (cognitive 27) cli/node/src/output.ts:153— output.formatAddResult has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
output.format_add_result (cognitive 26) cli/python/src/mem0_cli/output.py:143— output.format_add_result has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OllamaLLM._parse_response (cognitive 26) mem0/llms/ollama.py:43— OllamaLLM._parse_response has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (8 pts), boolean chains 2, 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.
notices._has_temporal_filter (cognitive 26) REDACTED:1642— notices._has_temporal_filter has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Memory.add (cognitive 26) mem0-ts/src/oss/src/memory/index.ts:720— Memory.add has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 3, ternaries 2 (nesting depth added 3). Of this number, 25 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
data-table.DataTable (cognitive 26) server/dashboard/src/components/shared/data-table.tsx:45— data-table.DataTable has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 16 (19 pts), boolean chains 6, if/else 1 (nesting depth added 3). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 77, 159, 167, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
commands.registerCommands (cognitive 25) integrations/pi-agent-plugin/src/commands.ts:18— commands.registerCommands has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 5, loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 2). None of this is in the body itself: all 25 points belong to 7 function items inside it that branch (a function literal at line 77, a function literal at line 159, a function literal at line 50, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
NeptuneAnalyticsVectorStore.buildMetadataVertexFilter (cognitive 24) mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:481— NeptuneAnalyticsVectorStore.buildMetadataVertexFilter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NeptuneAnalyticsVector.update (cognitive 23) mem0/vector_stores/neptune_analytics.py:218— NeptuneAnalyticsVector.update has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (6 pts), boolean chains 4, 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.
GoogleMatchingEngine.search (cognitive 23) mem0/vector_stores/vertex_ai_vector_search.py:211— GoogleMatchingEngine.search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GoogleMatchingEngine.get (cognitive 23) mem0/vector_stores/vertex_ai_vector_search.py:376— GoogleMatchingEngine.get has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (4 pts), error handling 3, ternaries 1 (3 pts), boolean chains 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.
tools.buildToolExecute (cognitive 23) integrations/pi-agent-plugin/src/memory/tools.ts:53— tools.buildToolExecute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (nesting depth added 11). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 58). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
RedisDB.get (cognitive 23) mem0-ts/src/oss/src/vector_stores/redis.ts:470— RedisDB.get has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, error handling 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VertexAIVectorSearch.search (cognitive 23) mem0-ts/src/oss/src/vector_stores/vertex_ai_vector_search.ts:117— VertexAIVectorSearch.search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 2 (4 pts), ternaries 2 (nesting depth added 6). Of this number, 15 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lemmatization.simpleStem (cognitive 23) mem0-ts/src/oss/src/utils/lemmatization.ts:193— lemmatization.simpleStem has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 10. 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.
middleware.middleware (cognitive 23) server/dashboard/src/middleware.ts:13— middleware.middleware has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agent_mode_cmd.claim_via_otp (cognitive 22) cli/python/src/mem0_cli/commands/agent_mode_cmd.py:143— agent_mode_cmd.claim_via_otp has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (5 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.
Memory._get_all_from_vector_store (cognitive 22) REDACTED:1340— Memory._get_all_from_vector_store has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (AsyncMemory._get_all_from_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Memory.search (cognitive 22) REDACTED:1393— Memory.search has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (nesting depth added 5). 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. This shape REPEATS in the file: one other method here (AsyncMemory.search) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory._get_all_from_vector_store (cognitive 22) REDACTED:3021— AsyncMemory._get_all_from_vector_store has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Memory._get_all_from_vector_store) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
AsyncMemory.search (cognitive 22) REDACTED:3074— AsyncMemory.search has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (nesting depth added 5). 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. This shape REPEATS in the file: one other method here (Memory.search) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
memory.cmdSearch (cognitive 22) cli/node/src/commands/memory.ts:231— memory.cmdSearch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), error handling 2 (3 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
memory-add.createMemoryAddTool.execute (cognitive 22) integrations/openclaw/tools/memory-add.ts:26— memory-add.createMemoryAddTool.execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 5 (8 pts), boolean chains 4, error handling 1 (nesting depth added 4). Of this number, 19 points are the body's own statements and 3 belong to 2 function literals inside it that branch. 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.
ElasticsearchDB.ensureClient (cognitive 22) mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:65— ElasticsearchDB.ensureClient has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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.
entity_extraction.extractEntities (cognitive 22) mem0-ts/src/oss/src/utils/entity_extraction.ts:725— entity_extraction.extractEntities has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 3 (nesting depth added 5). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
adapter.main (cognitive 21) integrations/antigravity-plugin/hooks/adapter.py:117— adapter.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (7 pts), error handling 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_setup.build_oss_config (cognitive 21) REDACTED:140— _setup.build_oss_config has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (6 pts), boolean chains 4, 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.
Langchain._parse_output (cognitive 21) mem0/vector_stores/langchain.py:39— Langchain._parse_output has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (6 pts), if/else 4 (5 pts), loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Qdrant._build_field_condition (cognitive 21) mem0/vector_stores/qdrant.py:265— Qdrant._build_field_condition has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
skill-loader.loadSkill (cognitive 21) integrations/openclaw/skill-loader.ts:324— skill-loader.loadSkill has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
opencode-mem0.Mem0Plugin (cognitive 21) integrations/opencode-plugin/opencode-mem0.ts:235— opencode-mem0.Mem0Plugin has cognitive complexity 21 (threshold 15). Drivers by points: if/else 45 (63 pts), error handling 12 (23 pts), ternaries 13 (18 pts), boolean chains 12, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (opencode-mem0.Mem0Plugin::chatMessageHook, opencode-mem0.Mem0Plugin::toolExecuteAfterHook) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
mem0-utils.flattenPrompt (cognitive 21) integrations/vercel-ai-sdk/src/mem0-utils.ts:36— mem0-utils.flattenPrompt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, error handling 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to one function literal inside it that branches (line 38). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
S3Vectors.evaluateOperator (cognitive 21) mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:753— S3Vectors.evaluateOperator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, ternaries 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
entity_extraction.extractProper (cognitive 21) mem0-ts/src/oss/src/utils/entity_extraction.ts:517— entity_extraction.extractProper has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
page.MemoriesPage (cognitive 21) server/dashboard/src/app/(root)/dashboard/memories/page.tsx:33— page.MemoriesPage has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (9 pts), boolean chains 7, if/else 4, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (handleDelete, a function literal at line 45, a function literal at line 94, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
output.format_memories_table (cognitive 20) cli/python/src/mem0_cli/output.py:52— output.format_memories_table has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Databricks.update (cognitive 20) mem0/vector_stores/databricks.py:601— Databricks.update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
oracledb._build_filter_group (cognitive 20) mem0/vector_stores/oracledb.py:194— oracledb._build_filter_group has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MemoryVectorStore.keywordSearch (cognitive 20) mem0-ts/src/oss/src/vector_stores/memory.ts:251— MemoryVectorStore.keywordSearch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (7 pts), boolean chains 2, error handling 1 (nesting depth added 7). Of this number, 18 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Qdrant.buildFieldCondition (cognitive 20) mem0-ts/src/oss/src/vector_stores/qdrant.ts:135— Qdrant.buildFieldCondition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
adapter._last_assistant_message (cognitive 19) integrations/kimi-plugin/hooks/adapter.py:54— adapter._last_assistant_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsyncMemory.delete_all (cognitive 19) REDACTED:3583— AsyncMemory.delete_all has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HuggingFaceReranker.rerank (cognitive 19) mem0/reranker/huggingface_reranker.py:83— HuggingFaceReranker.rerank has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
entity_extraction._add_proper_name_candidates (cognitive 19) mem0/utils/entity_extraction.py:543— entity_extraction._add_proper_name_candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lifecycle.buildRecallContext (cognitive 19) integrations/agent-plugin-core/typescript/src/lifecycle.ts:129— lifecycle.buildRecallContext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OSSProvider._init (cognitive 19) integrations/openclaw/providers.ts:328— OSSProvider._init has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, error handling 2 (3 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MemoryVectorStore.matchFieldCondition (cognitive 19) mem0-ts/src/oss/src/vector_stores/memory.ts:92— MemoryVectorStore.matchFieldCondition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5 (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.
DatabricksVectorStore.shouldPaginateForLocalFiltering (cognitive 19) mem0-ts/src/oss/src/vector_stores/databricks.ts:1267— DatabricksVectorStore.shouldPaginateForLocalFiltering has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TurbopufferDB.convertFilters (cognitive 19) mem0-ts/src/oss/src/vector_stores/turbopuffer.ts:262— TurbopufferDB.convertFilters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
oracledb.buildFilterGroup (cognitive 19) mem0-ts/src/oss/src/vector_stores/oracledb.ts:247— oracledb.buildFilterGroup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
memory.cmd_search (cognitive 18) cli/python/src/mem0_cli/commands/memory.py:240— memory.cmd_search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 2 (3 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.
output.format_memories_text (cognitive 18) cli/python/src/mem0_cli/output.py:17— output.format_memories_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Mem0MemoryProvider.handle_tool_call (cognitive 18) integrations/hermes-plugin-mem0/__init__.py:376— Mem0MemoryProvider.handle_tool_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3 (4 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
OSSBackend.__init__ (cognitive 18) integrations/hermes-plugin-mem0/_backend.py:148— OSSBackend.__init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (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.
GeminiLLM.generate_response (cognitive 18) mem0/llms/gemini.py:158— GeminiLLM.generate_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (3 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.
ChromaDB._parse_output (cognitive 18) mem0/vector_stores/chroma.py:76— ChromaDB._parse_output has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 5, if/else 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Databricks.list (cognitive 18) mem0/vector_stores/databricks.py:785— Databricks.list has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (5 pts), boolean chains 4, error handling 2 (4 pts), if/else 3 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Weaviate.search (cognitive 18) mem0/vector_stores/weaviate.py:181— Weaviate.search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 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.
Weaviate.keyword_search (cognitive 18) mem0/vector_stores/weaviate.py:226— Weaviate.keyword_search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 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.
agent-mode.bootstrapViaBackend (cognitive 18) cli/node/src/commands/agent-mode.ts:49— agent-mode.bootstrapViaBackend has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
entities.cmdEntitiesDelete (cognitive 18) cli/node/src/commands/entities.ts:84— entities.cmdEntitiesDelete has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, ternaries 1 (2 pts), 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.
VectorizeDB._doInitialize (cognitive 18) mem0-ts/src/oss/src/vector_stores/vectorize.ts:378— VectorizeDB._doInitialize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (6 pts), error handling 2 (3 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.
RedisDB._doInitialize (cognitive 18) mem0-ts/src/oss/src/vector_stores/redis.ts:277— RedisDB._doInitialize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, error handling 2 (3 pts), loops 2 (3 pts) (nesting depth added 5). Of this number, 11 points are the body's own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
databricks.collectConjunctiveDatabricksFilters (cognitive 18) mem0-ts/src/oss/src/vector_stores/databricks.ts:327— databricks.collectConjunctiveDatabricksFilters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
S3Vectors.convertFieldFilter (cognitive 18) mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:583— S3Vectors.convertFieldFilter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
entity_extraction.extractCompoundsWithNlp (cognitive 18) mem0-ts/src/oss/src/utils/entity_extraction.ts:584— entity_extraction.extractCompoundsWithNlp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Memory._hasAdvancedOperators (cognitive 18) mem0-ts/src/oss/src/memory/index.ts:2053— Memory._hasAdvancedOperators has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
agent_mode_cmd.bootstrap_via_backend (cognitive 17) cli/python/src/mem0_cli/commands/agent_mode_cmd.py:52— agent_mode_cmd.bootstrap_via_backend has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_setup._ensure_ollama (cognitive 17) REDACTED:358— _setup._ensure_ollama has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Databricks.search (cognitive 17) mem0/vector_stores/databricks.py:463— Databricks.search has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 4, if/else 3 (4 pts), error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Databricks.get (cognitive 17) mem0/vector_stores/databricks.py:662— Databricks.get has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 3, error handling 2 (3 pts), ternaries 3, loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Qdrant.update (cognitive 17) mem0/vector_stores/qdrant.py:500— Qdrant.update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2 (nesting depth added 8). 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.
ValkeyDB._process_search_results (cognitive 17) mem0/vector_stores/valkey.py:387— ValkeyDB._process_search_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (4 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
entities.list_entities (cognitive 17) server/routers/entities.py:44— entities.list_entities has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PlatformBackend._request (cognitive 17) cli/node/src/backend/platform.ts:41— PlatformBackend._request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, error handling 2 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
output.formatMemoriesTable (cognitive 17) cli/node/src/output.ts:56— output.formatMemoriesTable has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (5 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.
add_memory.perform (cognitive 17) integrations/zapier-mem0/src/creates/add_memory.ts:30— add_memory.perform has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, error handling 2 (4 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
error-message.getErrorMessage (cognitive 17) server/dashboard/src/lib/error-message.ts:3— error-message.getErrorMessage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
entities.cmd_entities_delete (cognitive 16) cli/python/src/mem0_cli/commands/entities.py:83— entities.cmd_entities_delete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, 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.
init_cmd._email_login (cognitive 16) cli/python/src/mem0_cli/commands/init_cmd.py:125— init_cmd._email_login has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (5 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.
run.main (cognitive 16) integrations/agent-plugin-core/conformance/run.py:267— run.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 3, boolean chains 2 (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.
notices.display_scale_threshold_notice (cognitive 16) REDACTED:549— notices.display_scale_threshold_notice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 5 (6 pts), boolean chains 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CassandraDB.search (cognitive 16) mem0/vector_stores/cassandra.py:225— CassandraDB.search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (4 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Databricks._format_sql_value (cognitive 16) mem0/vector_stores/databricks.py:363— Databricks._format_sql_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 1 (2 pts), loops 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.
Weaviate._parse_output (cognitive 16) mem0/vector_stores/weaviate.py:86— Weaviate._parse_output has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
events.cmdEventStatus (cognitive 16) cli/node/src/commands/events.ts:96— events.cmdEventStatus has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 3 (5 pts), boolean chains 2, loops 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.
init.emailLogin (cognitive 16) cli/node/src/commands/init.ts:97— init.emailLogin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (5 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.
init.promptSecret (cognitive 16) cli/node/src/commands/init.ts:178— init.promptSecret has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to 3 function literals inside it that branch (lines 190, 179, 220). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
memory.cmdList (cognitive 16) cli/node/src/commands/memory.ts:380— memory.cmdList has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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.
Qdrant.ensureClient (cognitive 16) mem0-ts/src/oss/src/vector_stores/qdrant.ts:84— Qdrant.ensureClient has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Milvus.createFilter (cognitive 16) mem0-ts/src/oss/src/vector_stores/milvus.ts:230— Milvus.createFilter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RerankerFactory.buildLLMRerankerLLM (cognitive 16) mem0-ts/src/oss/src/utils/factory.ts:244— RerankerFactory.buildLLMRerankerLLM has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Near-duplicate member family (7 members, 86 shared lines) · ×1
Near-duplicate member family (7 members, 86 shared lines) REDACTED:135— REDACTED:135-221 | REDACTED:135-221 | REDACTED:135-221 | REDACTED:135-221 | REDACTED:135-221 | REDACTED:135-221 | REDACTED:135-221 — These 7 members are variants of one another: a block of 86 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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· Near-duplicate member family (6 members, 24 shared lines) · ×1
Near-duplicate member family (6 members, 24 shared lines) integrations/agent-plugin-core/python/hook_runner.py:227— integrations/agent-plugin-core/python/hook_runner.py:227-252 | integrations/antigravity-plugin/core/hook_runner.py:227-252 | integrations/claude-code-plugin/core/hook_runner.py:227-252 | integrations/codex-plugin/core/hook_runner.py:227-252 | integrations/cursor-plugin/core/hook_runner.py:227-252 | integrations/kimi-plugin/core/hook_runner.py:227-252 — These 6 members are variants of one another: a block of 24 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Near-duplicate member family (4 members, 39 shared lines) · ×1
Near-duplicate member family (4 members, 39 shared lines) mem0/reranker/cohere_reranker.py:38— mem0/reranker/cohere_reranker.py:38-93 | mem0/reranker/huggingface_reranker.py:84-173 | mem0/reranker/sentence_transformer_reranker.py:53-120 | mem0/reranker/zero_entropy_reranker.py:43-104 — These 4 members are variants of one another: a block of 39 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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.
Near-duplicate member pair (208 shared lines) REDACTED:882— REDACTED:882-1220 | REDACTED:2564-2901 — These two members are variants of one another: 208 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (27 shared lines) REDACTED:653— REDACTED:653-705 | REDACTED:2362-2404 — These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×1
Edited copy of a member (22 corresponding lines) mem0/vector_stores/langchain.py:40— mem0/vector_stores/langchain.py:40-83 | mem0/vector_stores/weaviate.py:87-117 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (8 members, 50+ identical tokens) REDACTED:537— REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | REDACTED:537-554 | integrations/mem0-strands/python/src/mem0_strands/telemetry.py:34-46 — These 8 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 8 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 8 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) mem0/llms/azure_openai.py:131— mem0/llms/azure_openai.py:131-166 | mem0/llms/deepseek.py:81-109 | mem0/llms/minimax.py:85-114 | mem0/llms/vllm.py:80-108 | mem0/llms/xai.py:81-110 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Duplicated block (299 lines × 7) REDACTED:1965— REDACTED:1965-2263 | REDACTED:1965-2263 | REDACTED:1965-2263 | REDACTED:1965-2263 | REDACTED:1965-2263 | REDACTED:1965-2263 | REDACTED:1965-2263 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (153 lines × 7) REDACTED:1502— REDACTED:1502-1654 | REDACTED:1502-1654 | REDACTED:1502-1654 | REDACTED:1502-1654 | REDACTED:1502-1654 | REDACTED:1502-1654 | REDACTED:1502-1654 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (118 lines × 7) REDACTED:2287— REDACTED:2287-2404 | REDACTED:2287-2404 | REDACTED:2287-2404 | REDACTED:2287-2404 | REDACTED:2287-2404 | REDACTED:2287-2404 | REDACTED:2287-2404 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (108 lines × 7) REDACTED:598— REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 | REDACTED:598-705 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (105 lines × 7) REDACTED:897— REDACTED:897-1001 | REDACTED:897-1001 | REDACTED:897-1001 | REDACTED:897-1001 | REDACTED:897-1001 | REDACTED:897-1001 | REDACTED:897-1001 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (96 lines × 7) REDACTED:800— REDACTED:800-895 | REDACTED:800-895 | REDACTED:800-895 | REDACTED:800-895 | REDACTED:800-895 | REDACTED:800-895 | REDACTED:800-895 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (95 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:271— integrations/agent-plugin-core/python/hook_runner.py:271-365 | integrations/antigravity-plugin/core/hook_runner.py:271-365 | integrations/claude-code-plugin/core/hook_runner.py:271-365 | integrations/codex-plugin/core/hook_runner.py:271-365 | integrations/cursor-plugin/core/hook_runner.py:271-365 | integrations/kimi-plugin/core/hook_runner.py:271-365 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 (89 lines × 7) integrations/agent-plugin-core/python/memory_cli.py:62— integrations/agent-plugin-core/python/memory_cli.py:62-150 | integrations/antigravity-plugin/core/memory_cli.py:62-150 | integrations/claude-code-plugin/core/memory_cli.py:62-150 | integrations/codex-plugin/core/memory_cli.py:62-150 | integrations/cursor-plugin/core/memory_cli.py:62-150 | integrations/kimi-plugin/core/memory_cli.py:62-150 | integrations/mem0-agent-plugin/core/memory_cli.py:62-150 — before extracting anything, compare `integrations/agent-plugin-core/python/memory_cli.py` and `integrations/antigravity-plugin/core/memory_cli.py` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (75 lines × 2) REDACTED:1539— REDACTED:1539-1613 | REDACTED:3227-3301 — 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 (71 lines × 6) integrations/agent-plugin-core/python/flush_worker.py:26— integrations/agent-plugin-core/python/flush_worker.py:26-96 | integrations/antigravity-plugin/core/flush_worker.py:26-96 | integrations/claude-code-plugin/core/flush_worker.py:26-96 | integrations/codex-plugin/core/flush_worker.py:26-96 | integrations/cursor-plugin/core/flush_worker.py:26-96 | integrations/kimi-plugin/core/flush_worker.py:26-96 — before extracting anything, compare `integrations/agent-plugin-core/python/flush_worker.py` and `integrations/antigravity-plugin/core/flush_worker.py` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (66 lines × 7) REDACTED:803— REDACTED:803-868 | REDACTED:803-868 | REDACTED:803-868 | REDACTED:803-868 | REDACTED:803-868 | REDACTED:803-868 | REDACTED:803-868 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (65 lines × 7) REDACTED:1734— REDACTED:1734-1798 | REDACTED:1734-1798 | REDACTED:1734-1798 | REDACTED:1734-1798 | REDACTED:1734-1798 | REDACTED:1734-1798 | REDACTED:1734-1798 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (64–65 lines × 2) REDACTED:1681— REDACTED:1681-1745 | REDACTED:3368-3431 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (60 lines × 7) integrations/agent-plugin-core/python/mcp_server.py:153— integrations/agent-plugin-core/python/mcp_server.py:153-212 | integrations/antigravity-plugin/core/mcp_server.py:153-212 | integrations/claude-code-plugin/core/mcp_server.py:153-212 | integrations/codex-plugin/core/mcp_server.py:153-212 | integrations/cursor-plugin/core/mcp_server.py:153-212 | integrations/kimi-plugin/core/mcp_server.py:153-212 | integrations/mem0-agent-plugin/core/mcp_server.py:153-212 — before extracting anything, compare `integrations/agent-plugin-core/python/mcp_server.py` and `integrations/antigravity-plugin/core/mcp_server.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 140 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 (54 lines × 2) REDACTED:1277— REDACTED:1277-1330 | REDACTED:2958-3011 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (52 lines × 7) REDACTED:423— REDACTED:423-474 | REDACTED:423-474 | REDACTED:423-474 | REDACTED:423-474 | REDACTED:423-474 | REDACTED:423-474 | REDACTED:423-474 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (48 lines × 2) REDACTED:1344— REDACTED:1344-1391 | REDACTED:3025-3072 — 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 (45 lines × 7) REDACTED:351— REDACTED:351-395 | REDACTED:351-395 | REDACTED:351-395 | REDACTED:351-395 | REDACTED:351-395 | REDACTED:351-395 | REDACTED:351-395 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (37–42 lines × 2) REDACTED:1450— REDACTED:1450-1486 | REDACTED:3130-3171 — 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:3130` 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 (40 lines × 7) REDACTED:668— REDACTED:668-707 | REDACTED:668-707 | REDACTED:668-707 | REDACTED:668-707 | REDACTED:668-707 | REDACTED:668-707 | REDACTED:668-707 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (39–40 lines × 2) REDACTED:1004— REDACTED:1004-1043 | REDACTED:2684-2722 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (40 lines × 2) REDACTED:1837— REDACTED:1837-1876 | REDACTED:3515-3554 — 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 (38 lines × 7) REDACTED:758— REDACTED:758-795 | REDACTED:758-795 | REDACTED:758-795 | REDACTED:758-795 | REDACTED:758-795 | REDACTED:758-795 | REDACTED:758-795 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (37 lines × 7) REDACTED:1077— REDACTED:1077-1113 | REDACTED:1077-1113 | REDACTED:1077-1113 | REDACTED:1077-1113 | REDACTED:1077-1113 | REDACTED:1077-1113 | REDACTED:1077-1113 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (36–37 lines × 2) REDACTED:424— REDACTED:424-459 | REDACTED:605-641 — 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:424` 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 (36 lines × 7) REDACTED:186— REDACTED:186-221 | REDACTED:186-221 | REDACTED:186-221 | REDACTED:186-221 | REDACTED:186-221 | REDACTED:186-221 | REDACTED:186-221 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (34 lines × 7) integrations/agent-plugin-core/python/memory_cli.py:25— integrations/agent-plugin-core/python/memory_cli.py:25-58 | integrations/antigravity-plugin/core/memory_cli.py:25-58 | integrations/claude-code-plugin/core/memory_cli.py:25-58 | integrations/codex-plugin/core/memory_cli.py:25-58 | integrations/cursor-plugin/core/memory_cli.py:25-58 | integrations/kimi-plugin/core/memory_cli.py:25-58 | integrations/mem0-agent-plugin/core/memory_cli.py:25-58 — before extracting anything, compare `integrations/agent-plugin-core/python/memory_cli.py` and `integrations/antigravity-plugin/core/memory_cli.py` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (34 lines × 2) REDACTED:322— REDACTED:322-355 | REDACTED:1423-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.
Duplicated block (33 lines × 7) REDACTED:632— REDACTED:632-664 | REDACTED:632-664 | REDACTED:632-664 | REDACTED:632-664 | REDACTED:632-664 | REDACTED:632-664 | REDACTED:632-664 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (32 lines × 7) REDACTED:718— REDACTED:718-749 | REDACTED:718-749 | REDACTED:718-749 | REDACTED:718-749 | REDACTED:718-749 | REDACTED:718-749 | REDACTED:718-749 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (32 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:63— integrations/agent-plugin-core/python/hook_runner.py:63-94 | integrations/antigravity-plugin/core/hook_runner.py:63-94 | integrations/claude-code-plugin/core/hook_runner.py:63-94 | integrations/codex-plugin/core/hook_runner.py:63-94 | integrations/cursor-plugin/core/hook_runner.py:63-94 | integrations/kimi-plugin/core/hook_runner.py:63-94 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 (31 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:98— integrations/agent-plugin-core/python/hook_runner.py:98-128 | integrations/antigravity-plugin/core/hook_runner.py:98-128 | integrations/claude-code-plugin/core/hook_runner.py:98-128 | integrations/codex-plugin/core/hook_runner.py:98-128 | integrations/cursor-plugin/core/hook_runner.py:98-128 | integrations/kimi-plugin/core/hook_runner.py:98-128 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 (31 lines × 2) cli/python/src/mem0_cli/commands/entities.py:137— cli/python/src/mem0_cli/commands/entities.py:137-167 | cli/python/src/mem0_cli/commands/memory.py:686-716 — 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 `cli/python/src/mem0_cli/commands/entities.py:137` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (30 lines × 2) REDACTED:489— REDACTED:489-518 | REDACTED:1574-1603 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (28–30 lines × 2) REDACTED:959— REDACTED:959-988 | REDACTED:2643-2670 — 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:959` 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 × 7) REDACTED:991— REDACTED:991-1019 | REDACTED:991-1019 | REDACTED:991-1019 | REDACTED:991-1019 | REDACTED:991-1019 | REDACTED:991-1019 | REDACTED:991-1019 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (27–28 lines × 4) REDACTED:389— REDACTED:389-415 | REDACTED:437-464 | REDACTED:1474-1500 | REDACTED:1522-1549 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `options` to `Optional[GetAllMemoryOptions] = None` in one and `Optional[SearchMemoryOptions] = None` 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 (28 lines × 4) mem0/llms/deepseek.py:81— mem0/llms/deepseek.py:81-108 | mem0/llms/minimax.py:85-113 | mem0/llms/vllm.py:80-107 | mem0/llms/xai.py:81-109 — before extracting anything, compare `mem0/llms/deepseek.py` and `mem0/llms/minimax.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 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 (24–28 lines × 2) mem0/vector_stores/azure_mysql.py:280— mem0/vector_stores/azure_mysql.py:280-307 | mem0/vector_stores/azure_mysql.py:500-523 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (27 lines × 4) mem0/reranker/cohere_reranker.py:38— mem0/reranker/cohere_reranker.py:38-64 | mem0/reranker/huggingface_reranker.py:84-110 | mem0/reranker/sentence_transformer_reranker.py:53-79 | mem0/reranker/zero_entropy_reranker.py:43-69 — before extracting anything, compare `mem0/reranker/cohere_reranker.py` and `mem0/reranker/huggingface_reranker.py` as WHOLE FILES: this scan already matched 3 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. 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 (17–27 lines × 2) REDACTED:1748— REDACTED:1748-1774 | REDACTED:3434-3450 — 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 (26 lines × 7) REDACTED:2528— REDACTED:2528-2553 | REDACTED:2528-2553 | REDACTED:2528-2553 | REDACTED:2528-2553 | REDACTED:2528-2553 | REDACTED:2528-2553 | REDACTED:2528-2553 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (24–25 lines × 3) mem0/embeddings/azure_openai.py:19— mem0/embeddings/azure_openai.py:19-42 | mem0/llms/azure_openai.py:48-71 | mem0/llms/azure_openai_structured.py:26-50 — before extracting anything, compare `mem0/llms/azure_openai.py` and `mem0/llms/azure_openai_structured.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 70 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `config` to `Optional[BaseEmbedderConfig] = None` in one and `Optional[BaseLlmConfig] = None` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (22–25 lines × 2) mem0/vector_stores/pgvector.py:338— mem0/vector_stores/pgvector.py:338-362 | mem0/vector_stores/pgvector.py:518-539 — 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 `mem0/vector_stores/pgvector.py:338` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (24 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:132— integrations/agent-plugin-core/python/hook_runner.py:132-155 | integrations/antigravity-plugin/core/hook_runner.py:132-155 | integrations/claude-code-plugin/core/hook_runner.py:132-155 | integrations/codex-plugin/core/hook_runner.py:132-155 | integrations/cursor-plugin/core/hook_runner.py:132-155 | integrations/kimi-plugin/core/hook_runner.py:132-155 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (22–24 lines × 2) cli/python/src/mem0_cli/commands/init_cmd.py:379— cli/python/src/mem0_cli/commands/init_cmd.py:379-400 | cli/python/src/mem0_cli/commands/init_cmd.py:452-475 — 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 (23 lines × 7) REDACTED:2606— REDACTED:2606-2628 | REDACTED:2606-2628 | REDACTED:2606-2628 | REDACTED:2606-2628 | REDACTED:2606-2628 | REDACTED:2606-2628 | REDACTED:2606-2628 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 1937 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 (22 lines × 2) REDACTED:882— REDACTED:882-903 | REDACTED:2564-2585 — 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 (21 lines × 7) integrations/agent-plugin-core/python/mcp_server.py:216— integrations/agent-plugin-core/python/mcp_server.py:216-236 | integrations/antigravity-plugin/core/mcp_server.py:216-236 | integrations/claude-code-plugin/core/mcp_server.py:216-236 | integrations/codex-plugin/core/mcp_server.py:216-236 | integrations/cursor-plugin/core/mcp_server.py:216-236 | integrations/kimi-plugin/core/mcp_server.py:216-236 | integrations/mem0-agent-plugin/core/mcp_server.py:216-236 — before extracting anything, compare `integrations/agent-plugin-core/python/mcp_server.py` and `integrations/antigravity-plugin/core/mcp_server.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 140 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 (19–21 lines × 4) REDACTED:1303— REDACTED:1303-1323 | REDACTED:1459-1477 | REDACTED:2984-3004 | REDACTED:3142-3162 — 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 (20–21 lines × 2) REDACTED:560— REDACTED:560-580 | REDACTED:2246-2265 — 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 (21 lines × 2) REDACTED:1487— REDACTED:1487-1507 | REDACTED:3172-3192 — 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 (18–20 lines × 2) mem0/vector_stores/databricks.py:678— mem0/vector_stores/databricks.py:678-697 | mem0/vector_stores/databricks.py:801-818 — 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 (18–19 lines × 2) cli/python/src/mem0_cli/commands/entities.py:47— cli/python/src/mem0_cli/commands/entities.py:47-64 | cli/python/src/mem0_cli/commands/events_cmd.py:53-71 — 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 (19 lines × 2) cli/python/src/mem0_cli/commands/memory.py:291— cli/python/src/mem0_cli/commands/memory.py:291-309 | cli/python/src/mem0_cli/commands/memory.py:409-427 — 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 `cli/python/src/mem0_cli/commands/memory.py:291` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (18 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:173— integrations/agent-plugin-core/python/hook_runner.py:173-190 | integrations/antigravity-plugin/core/hook_runner.py:173-190 | integrations/claude-code-plugin/core/hook_runner.py:173-190 | integrations/codex-plugin/core/hook_runner.py:173-190 | integrations/cursor-plugin/core/hook_runner.py:173-190 | integrations/kimi-plugin/core/hook_runner.py:173-190 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16–18 lines × 2) REDACTED:1129— REDACTED:1129-1146 | REDACTED:2811-2826 — 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 (18 lines × 2) mem0/vector_stores/vertex_ai_vector_search.py:167— mem0/vector_stores/vertex_ai_vector_search.py:167-184 | mem0/vector_stores/vertex_ai_vector_search.py:549-570 — 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–17 lines × 5) mem0/llms/azure_openai.py:151— mem0/llms/azure_openai.py:151-166 | mem0/llms/deepseek.py:94-109 | mem0/llms/minimax.py:98-114 | mem0/llms/vllm.py:93-108 | mem0/llms/xai.py:95-110 — before extracting anything, compare `mem0/llms/deepseek.py` and `mem0/llms/minimax.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `mem0/llms/azure_openai.py:149` calls `_rewrite_assistant_keyword` and `mem0/llms/deepseek.py:92` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17 lines × 3) mem0/llms/anthropic.py:24— mem0/llms/anthropic.py:24-40 | mem0/llms/deepseek.py:23-39 | mem0/llms/minimax.py:23-39 — before extracting anything, compare `mem0/llms/deepseek.py` and `mem0/llms/minimax.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 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 `mem0/llms/anthropic.py:24` 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–17 lines × 2) REDACTED:1918— REDACTED:1918-1934 | REDACTED:3597-3611 — 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–17 lines × 2) mem0/vector_stores/weaviate.py:184— mem0/vector_stores/weaviate.py:184-192 | mem0/vector_stores/weaviate.py:227-243 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 5) REDACTED:192— REDACTED:192-207 | REDACTED:272-287 | REDACTED:406-421 | REDACTED:586-601 | REDACTED:700-715 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15–16 lines × 5) REDACTED:189— REDACTED:189-203 | REDACTED:268-283 | REDACTED:402-417 | REDACTED:696-711 | REDACTED:849-864 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:268` 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 × 4) REDACTED:252— REDACTED:252-266 | REDACTED:386-400 | REDACTED:564-578 | REDACTED:680-694 — 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 `REDACTED:252` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12–15 lines × 2) mem0/vector_stores/opensearch.py:239— mem0/vector_stores/opensearch.py:239-250 | mem0/vector_stores/opensearch.py:286-300 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:239— integrations/agent-plugin-core/python/hook_runner.py:239-252 | integrations/antigravity-plugin/core/hook_runner.py:239-252 | integrations/claude-code-plugin/core/hook_runner.py:239-252 | integrations/codex-plugin/core/hook_runner.py:239-252 | integrations/cursor-plugin/core/hook_runner.py:239-252 | integrations/kimi-plugin/core/hook_runner.py:239-252 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 (14 lines × 3) mem0/vector_stores/chroma.py:86— mem0/vector_stores/chroma.py:86-99 | mem0/vector_stores/langchain.py:62-75 | mem0/vector_stores/weaviate.py:96-109 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `mem0/vector_stores/chroma.py:100` calls `isinstance` and `mem0/vector_stores/langchain.py:76` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7–14 lines × 2) mem0/llms/gemini.py:183— mem0/llms/gemini.py:183-189 | mem0/llms/sarvam.py:50-63 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (13 lines × 3) mem0/reranker/cohere_reranker.py:80— mem0/reranker/cohere_reranker.py:80-92 | mem0/reranker/huggingface_reranker.py:160-172 | mem0/reranker/sentence_transformer_reranker.py:107-119 — before extracting anything, compare `mem0/reranker/cohere_reranker.py` and `mem0/reranker/huggingface_reranker.py` as WHOLE FILES: this scan already matched 3 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. 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–13 lines × 2) REDACTED:540— REDACTED:540-552 | REDACTED:2227-2238 — 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 × 5) mem0/llms/anthropic.py:27— mem0/llms/anthropic.py:27-38 | mem0/llms/deepseek.py:26-37 | mem0/llms/minimax.py:26-37 | mem0/llms/ollama.py:28-39 | mem0/llms/vllm.py:26-37 — before extracting anything, compare `mem0/llms/deepseek.py` and `mem0/llms/minimax.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 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 `mem0/llms/anthropic.py:27` 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 × 4) mem0/reranker/cohere_reranker.py:82— mem0/reranker/cohere_reranker.py:82-93 | mem0/reranker/huggingface_reranker.py:162-173 | mem0/reranker/sentence_transformer_reranker.py:109-120 | mem0/reranker/zero_entropy_reranker.py:93-104 — before extracting anything, compare `mem0/reranker/cohere_reranker.py` and `mem0/reranker/huggingface_reranker.py` as WHOLE FILES: this scan already matched 3 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. 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 × 3) mem0/llms/lmstudio.py:22— mem0/llms/lmstudio.py:22-33 | mem0/llms/ollama.py:25-36 | mem0/llms/vllm.py:23-34 — before extracting anything, compare `mem0/llms/ollama.py` and `mem0/llms/vllm.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 `mem0/llms/lmstudio.py:22` 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–12 lines × 3) mem0/vector_stores/azure_mysql.py:292— mem0/vector_stores/azure_mysql.py:292-301 | mem0/vector_stores/azure_mysql.py:351-362 | mem0/vector_stores/azure_mysql.py:510-519 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 3) cli/python/src/mem0_cli/commands/agent_mode_cmd.py:171— cli/python/src/mem0_cli/commands/agent_mode_cmd.py:171-181 | cli/python/src/mem0_cli/commands/init_cmd.py:149-159 | cli/python/src/mem0_cli/commands/init_cmd.py:182-192 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `cli/python/src/mem0_cli/commands/agent_mode_cmd.py:171` 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 first that the copies are not typed on the same thing: the declarations holding them bind `code` to `str | None = None` in one and `str | None` 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 (6–11 lines × 2) REDACTED:2341— REDACTED:2341-2351 | REDACTED:2362-2367 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 8) REDACTED:540— REDACTED:540-549 | REDACTED:540-549 | REDACTED:540-549 | REDACTED:540-549 | REDACTED:540-549 | REDACTED:540-549 | REDACTED:540-549 | integrations/mem0-strands/python/src/mem0_strands/telemetry.py:36-45 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 749 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 (8–9 lines × 2) REDACTED:1662— REDACTED:1662-1670 | REDACTED:3350-3357 — 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:1662` 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 × 3) mem0/embeddings/huggingface.py:53— mem0/embeddings/huggingface.py:53-60 | mem0/embeddings/lmstudio.py:36-43 | mem0/embeddings/together.py:36-43 — 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.
Duplicated block (7–8 lines × 2) mem0/vector_stores/databricks.py:504— mem0/vector_stores/databricks.py:504-510 | mem0/vector_stores/databricks.py:552-559 — 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 `mem0/vector_stores/databricks.py:552` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) mem0/vector_stores/elasticsearch.py:29— mem0/vector_stores/elasticsearch.py:29-35 | mem0/vector_stores/neptune_analytics.py:23-29 | mem0/vector_stores/opensearch.py:23-29 — 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.
Duplicated block (6 lines × 3) mem0/vector_stores/weaviate.py:188— mem0/vector_stores/weaviate.py:188-193 | mem0/vector_stores/weaviate.py:239-244 | mem0/vector_stores/weaviate.py:362-367 — 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 (5 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:45— integrations/agent-plugin-core/python/hook_runner.py:45-49 | integrations/antigravity-plugin/core/hook_runner.py:45-49 | integrations/claude-code-plugin/core/hook_runner.py:45-49 | integrations/codex-plugin/core/hook_runner.py:45-49 | integrations/cursor-plugin/core/hook_runner.py:45-49 | integrations/kimi-plugin/core/hook_runner.py:45-49 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 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 × 6) integrations/agent-plugin-core/python/hook_runner.py:159— integrations/agent-plugin-core/python/hook_runner.py:159-167 | integrations/antigravity-plugin/core/hook_runner.py:159-167 | integrations/claude-code-plugin/core/hook_runner.py:159-167 | integrations/codex-plugin/core/hook_runner.py:159-167 | integrations/cursor-plugin/core/hook_runner.py:159-167 | integrations/kimi-plugin/core/hook_runner.py:159-167 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 6) integrations/agent-plugin-core/python/hook_runner.py:256— integrations/agent-plugin-core/python/hook_runner.py:256-261 | integrations/antigravity-plugin/core/hook_runner.py:256-261 | integrations/claude-code-plugin/core/hook_runner.py:256-261 | integrations/codex-plugin/core/hook_runner.py:256-261 | integrations/cursor-plugin/core/hook_runner.py:256-261 | integrations/kimi-plugin/core/hook_runner.py:256-261 — before extracting anything, compare `integrations/agent-plugin-core/python/hook_runner.py` and `integrations/antigravity-plugin/core/hook_runner.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 13) mem0/configs/vector_stores/baidu.py:18— mem0/configs/vector_stores/baidu.py:18-25 | mem0/configs/vector_stores/chroma.py:49-56 | mem0/configs/vector_stores/databricks.py:37-44 | mem0/configs/vector_stores/faiss.py:28-35 | mem0/configs/vector_stores/langchain.py:21-28 | mem0/configs/vector_stores/milvus.py:33-40 | mem0/configs/vector_stores/opensearch.py:40-47 | mem0/configs/vector_stores/pgvector.py:45-52 | mem0/configs/vector_stores/pinecone.py:46-53 | mem0/configs/vector_stores/qdrant.py:42-49 | mem0/configs/vector_stores/s3_vectors.py:19-26 | mem0/configs/vector_stores/supabase.py:37-44 | mem0/configs/vector_stores/weaviate.py:30-39 — 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 13 call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 3) mem0/configs/vector_stores/elasticsearch.py:58— mem0/configs/vector_stores/elasticsearch.py:58-66 | mem0/configs/vector_stores/turbopuffer.py:35-43 | mem0/configs/vector_stores/valkey.py:22-30 — 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 `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (28 lines × 11) mem0/llms/azure_openai.py:94— mem0/llms/azure_openai.py:94-121 | mem0/llms/azure_openai_structured.py:126-153 | mem0/llms/deepseek.py:44-71 | mem0/llms/groq.py:47-74 | mem0/llms/litellm.py:24-51 | mem0/llms/lmstudio.py:44-71 | mem0/llms/minimax.py:48-75 | mem0/llms/openai.py:56-83 | mem0/llms/together.py:26-53 | mem0/llms/vllm.py:43-70 | mem0/llms/xai.py:44-71 — before extracting anything, compare `mem0/llms/azure_openai.py` and `mem0/llms/azure_openai_structured.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `mem0/llms/deepseek.py:39` calls `getenv`, `OpenAI` and `mem0/llms/litellm.py:21` 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 (29 lines × 4) mem0/configs/llms/deepseek.py:27— mem0/configs/llms/deepseek.py:27-56 | mem0/configs/llms/minimax.py:27-56 | mem0/configs/llms/ollama.py:27-56 | mem0/configs/llms/xai.py:27-55 — 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 4 call sites, so a change lands once.
Duplicated block (4–8 lines × 3) examples/misc/strands_agent_aws_elasticache_neptune.py:203— examples/misc/strands_agent_aws_elasticache_neptune.py:203-210 | examples/misc/strands_agent_aws_elasticache_neptune.py:255-258 | examples/misc/strands_agent_aws_elasticache_neptune.py:295-302 — 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.
P12 · CI test-gate honesty· Coverage collected but not gated · ×1
Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
No DR/backup evidence — The only persistence guard found is a data volume in a stack this repo names a DEVELOPER stack, and no backup, geo-recovery or RTO/RPO controls were evidenced anywhere. A dev volume holds no production data, so there may be nothing here to recover — if this system's data lives in a platform or ops repo we can't see, that is where the DR evidence belongs, and this row is about what this repository can show rather than about that volume.
Duplication concentrated across 3 sibling directories (14 clone groups) cli/node/src/backend/platform.ts:37— 14 duplicated blocks under the repository root have copies in at least two of the sibling directories cli, integrations, mem0-ts — 8 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 14 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 14 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 14 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 3 sibling directories (9 clone groups) server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:165— 9 duplicated blocks under server/dashboard/src/app/ have copies in at least two of the sibling directories (auth), (root), setup — 6 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 5 sibling directories (8 clone groups) mem0-ts/src/oss/src/llms/aws_bedrock.ts:116— 8 duplicated blocks under mem0-ts/src/oss/src/ have copies in at least two of the sibling directories embeddings, llms, memory, utils, vector_stores — 7 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 8 sibling directories (6 clone groups) server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx:35— 6 duplicated blocks under server/dashboard/src/app/(root)/dashboard/ have copies in at least two of the sibling directories analytics, api-keys, configuration, entities, export, memories (+2 more sibling(s) not listed) — 4 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication· Duplicated block with local edits (128 matched lines × 2 locations) · ×1
Duplicated block with local edits (128 matched lines × 2 locations) mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:44— mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:44 · mem0-ts/src/oss/src/vector_stores/opensearch.ts:64 — the two spans are one implementation copied and then locally edited — 739 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (122 matched lines × 2 locations) · ×1
Duplicated block with local edits (122 matched lines × 2 locations) cli/node/src/backend/platform.ts:37— cli/node/src/backend/platform.ts:37 · integrations/openclaw/backend/platform.ts:32 — the two spans are one implementation copied and then locally edited — 923 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (111 matched lines × 2 locations) · ×1
Duplicated block with local edits (111 matched lines × 2 locations) cli/node/src/backend/platform.ts:284— cli/node/src/backend/platform.ts:284 · integrations/openclaw/backend/platform.ts:219 — the two spans are one implementation copied and then locally edited — 877 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (72 matched lines × 2 locations) · ×1
Duplicated block with local edits (72 matched lines × 2 locations) cli/node/src/backend/base.ts:37— cli/node/src/backend/base.ts:37 · integrations/openclaw/backend/base.ts:26 — the two spans are one implementation copied and then locally edited — 427 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (55 matched lines × 2 locations) · ×1
Duplicated block with local edits (55 matched lines × 2 locations) mem0-ts/src/oss/src/vector_stores/redis.ts:353— mem0-ts/src/oss/src/vector_stores/redis.ts:353 · mem0-ts/src/oss/src/vector_stores/redis.ts:582 — the two spans are one implementation copied and then locally edited — 377 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (54 lines × 2 locations) integrations/vercel-ai-sdk/src/mem0-utils.ts:86— integrations/vercel-ai-sdk/src/mem0-utils.ts:86 · integrations/vercel-ai-sdk/src/mem0-utils.ts:162 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication· Duplicated block with local edits (52 matched lines × 2 locations) · ×1
Duplicated block with local edits (52 matched lines × 2 locations) server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:98— server/dashboard/src/app/(root)/dashboard/configuration/page.tsx:98 · server/dashboard/src/app/(root)/dashboard/settings/page.tsx:78 — the two spans are one implementation copied and then locally edited — 244 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (48 lines × 2 locations) mem0-ts/src/oss/src/prompts/index.ts:918— mem0-ts/src/oss/src/prompts/index.ts:918 · mem0-ts/src/oss/src/prompts/index.ts:981 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication· Duplicated block with local edits (43 matched lines × 2 locations) · ×1
Duplicated block with local edits (43 matched lines × 2 locations) integrations/openclaw/skill-loader.ts:390— integrations/openclaw/skill-loader.ts:390 · integrations/openclaw/skill-loader.ts:554 — the two spans are one implementation copied and then locally edited — 207 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (39 lines × 2 locations) mem0-ts/src/oss/src/rerankers/cohere.ts:12— mem0-ts/src/oss/src/rerankers/cohere.ts:12 · mem0-ts/src/oss/src/rerankers/zeroentropy.ts:10 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication· Duplicated block with local edits (38 matched lines × 2 locations) · ×1
Duplicated block with local edits (38 matched lines × 2 locations) cli/node/src/commands/entities.ts:92— cli/node/src/commands/entities.ts:92 · cli/node/src/commands/memory.ts:593 — the two spans are one implementation copied and then locally edited — 230 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (36 lines × 2 locations) mem0-ts/src/oss/src/llms/azure.ts:24— mem0-ts/src/oss/src/llms/azure.ts:24 · mem0-ts/src/oss/src/llms/openai.ts:18 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (35 lines × 5 locations) mem0-ts/src/oss/src/llms/deepseek.ts:5— mem0-ts/src/oss/src/llms/deepseek.ts:5 · mem0-ts/src/oss/src/llms/minimax.ts:5 · mem0-ts/src/oss/src/llms/sarvam.ts:14 · mem0-ts/src/oss/src/llms/together.ts:5 · +1 more site(s) not listed — the 5 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
Duplicated block (35 lines × 3 locations) server/dashboard/src/components/ui/alert-dialog.tsx:43— server/dashboard/src/components/ui/alert-dialog.tsx:43 · server/dashboard/src/components/ui/dialog.tsx:55 · server/dashboard/src/components/ui/sheet.tsx:73 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (34 lines × 2 locations) cli/node/src/backend/platform.ts:245— cli/node/src/backend/platform.ts:245 · integrations/openclaw/backend/platform.ts:180 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (34 lines × 3 locations) mem0-ts/src/oss/src/utils/notices.ts:450— mem0-ts/src/oss/src/utils/notices.ts:450 · mem0-ts/src/oss/src/utils/notices.ts:529 · mem0-ts/src/oss/src/utils/notices.ts:591 — 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 (32 lines × 2 locations) server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx:76— server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx:76 · server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx:210 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (30 matched lines × 2 locations) · ×1
Duplicated block with local edits (30 matched lines × 2 locations) mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:82— mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:82 · mem0-ts/src/oss/src/vector_stores/supabase.ts:93 — the two spans are one implementation copied and then locally edited — 170 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (30 lines × 2 locations) server/dashboard/src/components/ui/dialog.tsx:82— server/dashboard/src/components/ui/dialog.tsx:82 · server/dashboard/src/components/ui/drawer.tsx:74 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (29 matched lines × 2 locations) · ×1
Duplicated block with local edits (29 matched lines × 2 locations) mem0-ts/src/client/telemetry.ts:26— mem0-ts/src/client/telemetry.ts:26 · mem0-ts/src/oss/src/utils/telemetry.ts:46 — the two spans are one implementation copied and then locally edited — 151 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (28 matched lines × 2 locations) · ×1
Duplicated block with local edits (28 matched lines × 2 locations) integrations/openclaw/tools/memory-event-list.ts:13— integrations/openclaw/tools/memory-event-list.ts:13 · integrations/openclaw/tools/memory-event-status.ts:16 — the two spans are one implementation copied and then locally edited — 263 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (28 lines × 2 locations) mem0-ts/src/oss/src/utils/notices.ts:1247— mem0-ts/src/oss/src/utils/notices.ts:1247 · mem0-ts/src/oss/src/utils/notices.ts:1303 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (27 lines × 2 locations) server/dashboard/src/components/ui/pagination.tsx:70— server/dashboard/src/components/ui/pagination.tsx:70 · server/dashboard/src/components/ui/pagination.tsx:98 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication· Duplicated block with local edits (24 matched lines × 2 locations) · ×1
Duplicated block with local edits (24 matched lines × 2 locations) mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:289— mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:289 · mem0-ts/src/oss/src/vector_stores/milvus.ts:425 — the two spans are one implementation copied and then locally edited — 171 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Complex function (anonymous) (cyclomatic 90, cognitive 169) integrations/openclaw/cli/commands.ts:463— (anonymous) has cyclomatic complexity 90 and cognitive complexity 169; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function addToVectorStore (cyclomatic 77, cognitive 167) mem0-ts/src/oss/src/memory/index.ts:840— addToVectorStore has cyclomatic complexity 77 and cognitive complexity 167; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 61, cognitive 81) mem0-ts/src/oss/tests/vector-stores-compat.test.ts:3371— (anonymous) has cyclomatic complexity 61 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function execute (cyclomatic 51, cognitive 126) integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts:370— execute has cyclomatic complexity 51 and cognitive complexity 126; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function runInit (cyclomatic 49, cognitive 52) cli/node/src/commands/init.ts:307— runInit has cyclomatic complexity 49 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function search (cyclomatic 47, cognitive 105) mem0-ts/src/oss/src/memory/index.ts:1332— search has cyclomatic complexity 47 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function runOssWizardInteractive (cyclomatic 46, cognitive 59) integrations/openclaw/cli/commands.ts:239— runOssWizardInteractive has cyclomatic complexity 46 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 41, cognitive 60) integrations/openclaw/index.ts:711— (anonymous) has cyclomatic complexity 41 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function cmdAdd (cyclomatic 39, cognitive 56) cli/node/src/commands/memory.ts:40— cmdAdd has cyclomatic complexity 39 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function SetupPage (cyclomatic 35, cognitive 27) server/dashboard/src/app/setup/page.tsx:65— SetupPage has cyclomatic complexity 35 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function extractJson (cyclomatic 34, cognitive 73) mem0-ts/src/oss/src/prompts/index.ts:901— extractJson has cyclomatic complexity 34 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function richFormatHelp (cyclomatic 33, cognitive 67) cli/node/src/help.ts:218— richFormatHelp has cyclomatic complexity 33 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parse (cyclomatic 32, cognitive 31) integrations/openclaw/config.ts:177— parse has cyclomatic complexity 32 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function createFilter (cyclomatic 31, cognitive 63) mem0-ts/src/oss/src/vector_stores/qdrant.ts:215— createFilter has cyclomatic complexity 31 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function matchFieldCondition (cyclomatic 31, cognitive 41) mem0-ts/src/oss/src/vector_stores/databricks.ts:1469— matchFieldCondition has cyclomatic complexity 31 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function generateResponse (cyclomatic 31, cognitive 39) mem0-ts/src/oss/src/llms/langchain.ts:59— generateResponse has cyclomatic complexity 31 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function matchFieldCondition (cyclomatic 30, cognitive 40) mem0-ts/src/oss/src/vector_stores/cassandra.ts:440— matchFieldCondition has cyclomatic complexity 30 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function chatMessageHook (cyclomatic 29, cognitive 50) integrations/opencode-plugin/opencode-mem0.ts:592— chatMessageHook has cyclomatic complexity 29 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function createFilter (cyclomatic 29, cognitive 33) mem0-ts/src/oss/src/vector_stores/pinecone.ts:156— createFilter has cyclomatic complexity 29 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· mem0-ts/src/oss/src/memory/index.ts · ×1
mem0-ts/src/oss/src/memory/index.ts: 2010 lines of code mem0-ts/src/oss/src/memory/index.ts:1— mem0-ts/src/oss/src/memory/index.ts has 2010 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· integrations/openclaw/cli/commands.ts · ×1
integrations/openclaw/cli/commands.ts: 1631 lines of code integrations/openclaw/cli/commands.ts:1— integrations/openclaw/cli/commands.ts has 1631 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/databricks.ts · ×1
mem0-ts/src/oss/src/vector_stores/databricks.ts: 1456 lines of code mem0-ts/src/oss/src/vector_stores/databricks.ts:1— mem0-ts/src/oss/src/vector_stores/databricks.ts has 1456 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/utils/notices.ts · ×1
mem0-ts/src/oss/src/utils/notices.ts: 1295 lines of code mem0-ts/src/oss/src/utils/notices.ts:1— mem0-ts/src/oss/src/utils/notices.ts has 1295 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
mem0-ts/src/client/mem0.ts: 999 lines of code mem0-ts/src/client/mem0.ts:1— mem0-ts/src/client/mem0.ts has 999 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts · ×1
mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts: 985 lines of code mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts:1— mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts has 985 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
cli/node/src/index.ts: 882 lines of code cli/node/src/index.ts:1— cli/node/src/index.ts has 882 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· integrations/opencode-plugin/opencode-mem0.ts · ×1
integrations/opencode-plugin/opencode-mem0.ts: 836 lines of code integrations/opencode-plugin/opencode-mem0.ts:1— integrations/opencode-plugin/opencode-mem0.ts has 836 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· integrations/openclaw/index.ts · ×1
integrations/openclaw/index.ts: 825 lines of code integrations/openclaw/index.ts:1— integrations/openclaw/index.ts has 825 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/prompts/index.ts · ×1
mem0-ts/src/oss/src/prompts/index.ts: 806 lines of code mem0-ts/src/oss/src/prompts/index.ts:1— mem0-ts/src/oss/src/prompts/index.ts has 806 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/s3_vectors.ts · ×1
mem0-ts/src/oss/src/vector_stores/s3_vectors.ts: 793 lines of code mem0-ts/src/oss/src/vector_stores/s3_vectors.ts:1— mem0-ts/src/oss/src/vector_stores/s3_vectors.ts has 793 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/utils/entity_extraction.ts · ×1
mem0-ts/src/oss/src/utils/entity_extraction.ts: 761 lines of code mem0-ts/src/oss/src/utils/entity_extraction.ts:1— mem0-ts/src/oss/src/utils/entity_extraction.ts has 761 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· server/dashboard/src/app/setup/page.tsx · ×1
server/dashboard/src/app/setup/page.tsx: 710 lines of code server/dashboard/src/app/setup/page.tsx:1— server/dashboard/src/app/setup/page.tsx has 710 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· cli/node/src/commands/memory.ts · ×1
cli/node/src/commands/memory.ts: 700 lines of code cli/node/src/commands/memory.ts:1— cli/node/src/commands/memory.ts has 700 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/oracledb.ts · ×1
mem0-ts/src/oss/src/vector_stores/oracledb.ts: 666 lines of code mem0-ts/src/oss/src/vector_stores/oracledb.ts:1— mem0-ts/src/oss/src/vector_stores/oracledb.ts has 666 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/redis.ts · ×1
mem0-ts/src/oss/src/vector_stores/redis.ts: 656 lines of code mem0-ts/src/oss/src/vector_stores/redis.ts:1— mem0-ts/src/oss/src/vector_stores/redis.ts has 656 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts · ×1
mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts: 633 lines of code mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:1— mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts has 633 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· integrations/openclaw/skill-loader.ts · ×1
integrations/openclaw/skill-loader.ts: 618 lines of code integrations/openclaw/skill-loader.ts:1— integrations/openclaw/skill-loader.ts has 618 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/qdrant.ts · ×1
mem0-ts/src/oss/src/vector_stores/qdrant.ts: 616 lines of code mem0-ts/src/oss/src/vector_stores/qdrant.ts:1— mem0-ts/src/oss/src/vector_stores/qdrant.ts has 616 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts · ×1
integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts: 605 lines of code integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts:1— integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts has 605 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/opensearch.ts · ×1
mem0-ts/src/oss/src/vector_stores/opensearch.ts: 575 lines of code mem0-ts/src/oss/src/vector_stores/opensearch.ts:1— mem0-ts/src/oss/src/vector_stores/opensearch.ts has 575 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/cassandra.ts · ×1
mem0-ts/src/oss/src/vector_stores/cassandra.ts: 569 lines of code mem0-ts/src/oss/src/vector_stores/cassandra.ts:1— mem0-ts/src/oss/src/vector_stores/cassandra.ts has 569 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· integrations/openclaw/providers.ts · ×1
integrations/openclaw/providers.ts: 568 lines of code integrations/openclaw/providers.ts:1— integrations/openclaw/providers.ts has 568 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· cli/node/src/commands/init.ts · ×1
cli/node/src/commands/init.ts: 557 lines of code cli/node/src/commands/init.ts:1— cli/node/src/commands/init.ts has 557 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/baidu.ts · ×1
mem0-ts/src/oss/src/vector_stores/baidu.ts: 537 lines of code mem0-ts/src/oss/src/vector_stores/baidu.ts:1— mem0-ts/src/oss/src/vector_stores/baidu.ts has 537 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/valkey.ts · ×1
mem0-ts/src/oss/src/vector_stores/valkey.ts: 535 lines of code mem0-ts/src/oss/src/vector_stores/valkey.ts:1— mem0-ts/src/oss/src/vector_stores/valkey.ts has 535 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/pgvector.ts · ×1
mem0-ts/src/oss/src/vector_stores/pgvector.ts: 506 lines of code mem0-ts/src/oss/src/vector_stores/pgvector.ts:1— mem0-ts/src/oss/src/vector_stores/pgvector.ts has 506 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/milvus.ts · ×1
mem0-ts/src/oss/src/vector_stores/milvus.ts: 489 lines of code mem0-ts/src/oss/src/vector_stores/milvus.ts:1— mem0-ts/src/oss/src/vector_stores/milvus.ts has 489 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/mongodb.ts · ×1
mem0-ts/src/oss/src/vector_stores/mongodb.ts: 466 lines of code mem0-ts/src/oss/src/vector_stores/mongodb.ts:1— mem0-ts/src/oss/src/vector_stores/mongodb.ts has 466 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/memory.ts · ×1
mem0-ts/src/oss/src/vector_stores/memory.ts: 440 lines of code mem0-ts/src/oss/src/vector_stores/memory.ts:1— mem0-ts/src/oss/src/vector_stores/memory.ts has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/vectorize.ts · ×1
mem0-ts/src/oss/src/vector_stores/vectorize.ts: 433 lines of code mem0-ts/src/oss/src/vector_stores/vectorize.ts:1— mem0-ts/src/oss/src/vector_stores/vectorize.ts has 433 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· mem0-ts/src/oss/src/vector_stores/supabase.ts · ×1
mem0-ts/src/oss/src/vector_stores/supabase.ts: 401 lines of code mem0-ts/src/oss/src/vector_stores/supabase.ts:1— mem0-ts/src/oss/src/vector_stores/supabase.ts has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R4 · Test Coverage· No test rig can mount a component in this workspace · ×1
No test rig can mount a component in this workspace integrations/n8n-nodes-mem0/jest.config.js:1— integrations/n8n-nodes-mem0/jest.config.js declares environment "node", and no package here declares a DOM implementation (jsdom / happy-dom), a component testing library or a browser runner — so none of the 76 unreached component module(s) can be tested as written, however the suite is authored: server/dashboard/src/app/setup/page.tsx, server/dashboard/src/app/(root)/dashboard/memories/page.tsx, server/dashboard/src/app/(root)/dashboard/requests/page.tsx, server/dashboard/src/components/ui/sidebar.tsx, server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx, server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx and 70 more. Add a DOM environment and a component testing library (for example jsdom + @testing-library, or the runner's browser mode), then test the components. Reported once because these files share one cause, not one omission each.
Dead file (~177 LoC) server/dashboard/src/components/ui/form.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~158 LoC) server/dashboard/src/components/ui/command.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~149 LoC) server/dashboard/src/components/ui/pagination.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~142 LoC) server/dashboard/src/components/ui/categories-display.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~141 LoC) server/dashboard/src/components/ui/alert-dialog.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~129 LoC) server/dashboard/src/components/ui/toast.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~120 LoC) server/dashboard/src/components/ui/table.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~118 LoC) server/dashboard/src/components/ui/drawer.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~87 LoC) server/dashboard/src/components/ui/typography.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~77 LoC) server/dashboard/src/components/shared/event-badge.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~72 LoC) server/dashboard/src/components/ui/calendar.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~64 LoC) mem0-ts/src/oss/src/utils/bm25.ts— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~60 LoC) server/dashboard/src/components/ui/textarea.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~59 LoC) server/dashboard/src/components/ui/alert.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~57 LoC) server/dashboard/src/components/ui/accordion.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~56 LoC) integrations/n8n-nodes-mem0/credentials/Mem0Api.credentials.ts— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~55 LoC) server/dashboard/src/components/ui/tabs.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~50 LoC) server/dashboard/src/components/ui/avatar.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~44 LoC) server/dashboard/src/components/ui/radio-group.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~40 LoC) server/dashboard/src/components/ui/theme-toggle.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~38 LoC) server/dashboard/src/components/misc/truncated-text.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~36 LoC) server/dashboard/src/components/misc/copy-button.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~31 LoC) server/dashboard/src/components/ui/separator.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~21 LoC) server/dashboard/src/components/ui/tableLoader.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~19 LoC) server/dashboard/src/hooks/useDebounce.ts— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~10 LoC) server/dashboard/src/components/misc/spinner.tsx— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~5 LoC) server/dashboard/src/utils/helpers.ts— no import path from any entry point (62 application, 26 tooling, 183 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Unused dependency '@edge-runtime/vm' — Declared in integrations/vercel-ai-sdk/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'partial-json' — Declared in integrations/vercel-ai-sdk/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'fix-tsup-cjs' — Declared in mem0-ts/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Orphaned file mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts: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 mem0-ts/src/oss/src/vector_stores/vertex_ai_vector_search.ts: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 cli/python/src/mem0_cli/commands/agent_mode_cmd.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 server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx: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 cli/node/src/commands/agent-mode.ts: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 server/dashboard/src/app/(auth)/login/login-form.tsx: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 server/dashboard/src/app/(root)/dashboard/requests/page.tsx: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 server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx: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 server/dashboard/src/components/ui/sidebar.tsx: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 server/dashboard/src/components/shared/data-table.tsx: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 server/dashboard/src/components/ui/dropdown-menu.tsx: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 server/dashboard/src/app/(root)/dashboard/settings/page.tsx: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 server/dashboard/src/app/(root)/dashboard/components/nav-wrapper.tsx: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 server/dashboard/src/components/ui/select.tsx: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 mem0/utils/gcp_auth.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 server/dashboard/src/components/ui/toast.tsx: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 server/dashboard/src/components/ui/command.tsx: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 mem0-ts/src/client/config.ts: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 server/dashboard/src/components/ui/categories-display.tsx: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 cli/python/src/mem0_cli/commands/agent_rush_cmd.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 server/dashboard/src/components/ui/alert-dialog.tsx: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 cli/node/src/commands/agent-rush.ts: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 server/dashboard/src/components/ui/sheet.tsx: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 cli/python/src/mem0_cli/plugin_sync.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 server/dashboard/src/components/ui/form.tsx: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.
Interpolated log message defeats structured logging mem0/vector_stores/azure_ai_search.py:182— `info` at line 182 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/azure_ai_search.py:295— `info` at line 295 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/azure_ai_search.py:394— `warning` at line 394 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 mem0/vector_stores/azure_ai_search.py:430— `error` at line 430 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 mem0/vector_stores/azure_mysql.py:126— `error` at line 126 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 mem0/vector_stores/azure_mysql.py:160— `error` at line 160 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 mem0/vector_stores/azure_mysql.py:177— `error` at line 177 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 mem0/vector_stores/azure_mysql.py:208— `info` at line 208 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/azure_mysql.py:216— `info` 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.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 mem0/vector_stores/azure_mysql.py:218— `debug` at line 218 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 mem0/vector_stores/azure_mysql.py:232— `info` at line 232 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/azure_mysql.py:389— `debug` at line 389 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 mem0/vector_stores/azure_mysql.py:467— `info` at line 467 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/azure_mysql.py:545— `warning` at line 545 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 mem0/vector_stores/baidu.py:102— `info` at line 102 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/baidu.py:105— `info` 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.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 mem0/vector_stores/baidu.py:107— `error` at line 107 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 mem0/vector_stores/baidu.py:123— `info` at line 123 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/baidu.py:164— `info` at line 164 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/baidu.py:171— `info` at line 171 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/baidu.py:173— `info` at line 173 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/baidu.py:176— `error` at line 176 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 mem0/vector_stores/baidu.py:280— `error` at line 280 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 mem0/vector_stores/baidu.py:337— `info` at line 337 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging mem0/vector_stores/baidu.py:342— `info` at line 342 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.
+ 15 more in this group — see findings.md.
P2 · Observability· Console output used as the logging channel · ×39
Console output used as the logging channel integrations/openclaw/config.ts:190— `integrations/openclaw/config.ts` reports through `console.*` at line 190 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel integrations/openclaw/providers.ts:384— `integrations/openclaw/providers.ts` reports through `console.*` at line 384 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel integrations/openclaw/providers.ts:517— `integrations/openclaw/providers.ts` reports through `console.*` at line 517 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel integrations/openclaw/providers.ts:606— `integrations/openclaw/providers.ts` reports through `console.*` at line 606 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel integrations/openclaw/public-artifacts.ts:51— `integrations/openclaw/public-artifacts.ts` reports through `console.*` at line 51 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel integrations/openclaw/recall.ts:273— `integrations/openclaw/recall.ts` reports through `console.*` at line 273 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:151— `mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 151 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:283— `mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 283 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:382— `mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 382 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:465— `mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 465 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:667— `mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 667 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:698— `mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 698 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:708— `mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 708 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts:717— `mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts` reports through `console.*` at line 717 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/baidu.ts:387— `mem0-ts/src/oss/src/vector_stores/baidu.ts` reports through `console.*` at line 387 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:129— `mem0-ts/src/oss/src/vector_stores/elasticsearch.ts` reports through `console.*` at line 129 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:332— `mem0-ts/src/oss/src/vector_stores/elasticsearch.ts` reports through `console.*` at line 332 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/elasticsearch.ts:357— `mem0-ts/src/oss/src/vector_stores/elasticsearch.ts` reports through `console.*` at line 357 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/langchain.ts:50— `mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 50 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/langchain.ts:94— `mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 94 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/langchain.ts:121— `mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 121 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/langchain.ts:142— `mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 142 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/langchain.ts:159— `mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 159 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/langchain.ts:175— `mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 175 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel mem0-ts/src/oss/src/vector_stores/langchain.ts:182— `mem0-ts/src/oss/src/vector_stores/langchain.ts` reports through `console.*` at line 182 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Silent fallback default on parse failure integrations/agent-plugin-core/python/hook_runner.py:48— `read_hook_input` returns `{}` when `(json.JSONDecodeError, OSError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure REDACTED:1179— `latest_event_payload` returns `{}` when `json.JSONDecodeError` 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 REDACTED:282— `_legacy_project_map` returns `''` when `(OSError, json.JSONDecodeError)` 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 REDACTED:1476— `_repo_relative_path` 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 REDACTED:1881— `_stored_event_ids` returns `[]` when `json.JSONDecodeError` 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 REDACTED:274— `_read_identity` returns `{}` when `(OSError, json.JSONDecodeError)` 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 integrations/antigravity-plugin/core/hook_runner.py:48— `read_hook_input` returns `{}` when `(json.JSONDecodeError, OSError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure REDACTED:1179— `latest_event_payload` returns `{}` when `json.JSONDecodeError` 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 REDACTED:282— `_legacy_project_map` returns `''` when `(OSError, json.JSONDecodeError)` 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 REDACTED:1476— `_repo_relative_path` 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 REDACTED:1881— `_stored_event_ids` returns `[]` when `json.JSONDecodeError` 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 REDACTED:274— `_read_identity` returns `{}` when `(OSError, json.JSONDecodeError)` 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 integrations/claude-code-plugin/core/hook_runner.py:48— `read_hook_input` returns `{}` when `(json.JSONDecodeError, OSError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure REDACTED:1179— `latest_event_payload` returns `{}` when `json.JSONDecodeError` 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 REDACTED:282— `_legacy_project_map` returns `''` when `(OSError, json.JSONDecodeError)` 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 REDACTED:1476— `_repo_relative_path` 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 REDACTED:1881— `_stored_event_ids` returns `[]` when `json.JSONDecodeError` 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 REDACTED:274— `_read_identity` returns `{}` when `(OSError, json.JSONDecodeError)` 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 integrations/codex-plugin/core/hook_runner.py:48— `read_hook_input` returns `{}` when `(json.JSONDecodeError, OSError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure REDACTED:1179— `latest_event_payload` returns `{}` when `json.JSONDecodeError` 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 REDACTED:282— `_legacy_project_map` returns `''` when `(OSError, json.JSONDecodeError)` 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 REDACTED:1476— `_repo_relative_path` 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 REDACTED:1881— `_stored_event_ids` returns `[]` when `json.JSONDecodeError` 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 REDACTED:274— `_read_identity` returns `{}` when `(OSError, json.JSONDecodeError)` 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 integrations/cursor-plugin/core/hook_runner.py:48— `read_hook_input` returns `{}` when `(json.JSONDecodeError, OSError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Duplicated predicate mem0-ts/src/oss/src/vector_stores/oracledb.ts:188— `!Array.isArray(operand) || operand.length === 0` appears character-identically in 2 files — mem0-ts/src/oss/src/vector_stores/oracledb.ts, mem0-ts/src/oss/src/vector_stores/s3_vectors.ts. 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 mem0-ts/src/oss/src/memory/index.ts:2162— `!Array.isArray(value) || value.length === 0` appears character-identically in 3 files — mem0-ts/src/oss/src/memory/index.ts, mem0-ts/src/oss/src/vector_stores/oracledb.ts, mem0-ts/src/oss/src/vector_stores/s3_vectors.ts. 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 mem0-ts/src/oss/src/embeddings/azure.ts:11— `!config.apiKey || !config.modelProperties?.endpoint` appears character-identically in 2 files — mem0-ts/src/oss/src/embeddings/azure.ts, mem0-ts/src/oss/src/llms/azure.ts. 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 mem0-ts/src/oss/src/embeddings/langchain.ts:11— `!config.model || typeof config.model !== "object"` appears character-identically in 2 files — mem0-ts/src/oss/src/embeddings/langchain.ts, mem0-ts/src/oss/src/llms/langchain.ts. 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 mem0-ts/src/oss/src/vector_stores/cassandra.ts:522— `!filters || Object.keys(filters).length === 0` appears character-identically in 10 files — mem0-ts/src/oss/src/vector_stores/cassandra.ts, mem0-ts/src/oss/src/vector_stores/databricks.ts, mem0-ts/src/oss/src/vector_stores/memory.ts, mem0-ts/src/oss/src/vector_stores/milvus.ts. 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 mem0-ts/src/oss/src/embeddings/lmstudio.ts:16— `config.apiKey || DEFAULT_LMSTUDIO_API_KEY` appears character-identically in 2 files — mem0-ts/src/oss/src/embeddings/lmstudio.ts, mem0-ts/src/oss/src/llms/lmstudio.ts. 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 mem0-ts/src/oss/src/embeddings/together.ts:12— `config.apiKey || process.env.TOGETHER_API_KEY` appears character-identically in 2 files — mem0-ts/src/oss/src/embeddings/together.ts, mem0-ts/src/oss/src/llms/together.ts. 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 mem0-ts/src/oss/src/embeddings/aws_bedrock.ts:89— `config.awsAccessKeyId && config.awsSecretAccessKey` appears character-identically in 2 files — mem0-ts/src/oss/src/embeddings/aws_bedrock.ts, mem0-ts/src/oss/src/llms/aws_bedrock.ts. 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 mem0-ts/src/oss/src/vector_stores/cassandra.ts:72— `config.embeddingModelDims || config.dimension || 1536` appears character-identically in 5 files — mem0-ts/src/oss/src/vector_stores/cassandra.ts, mem0-ts/src/oss/src/vector_stores/databricks.ts, mem0-ts/src/oss/src/vector_stores/milvus.ts, mem0-ts/src/oss/src/vector_stores/mongodb.ts. 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 mem0-ts/src/oss/src/embeddings/azure.ts:22— `config.model || "text-embedding-3-small"` appears character-identically in 2 files — mem0-ts/src/oss/src/embeddings/azure.ts, mem0-ts/src/oss/src/embeddings/openai.ts. 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 cli/node/src/commands/agent-mode.ts:56— `config.platform.baseUrl || "https://api.mem0.ai"` appears character-identically in 3 files — cli/node/src/commands/agent-mode.ts, cli/node/src/commands/identify.ts, cli/node/src/telemetry.ts. 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 mem0-ts/src/oss/src/embeddings/ollama.ts:16— `config.url || config.baseURL || "http://localhost:11434"` appears character-identically in 2 files — mem0-ts/src/oss/src/embeddings/ollama.ts, mem0-ts/src/oss/src/llms/ollama.ts. 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 mem0-ts/src/oss/src/vector_stores/baidu.ts:288— `filters && Object.keys(filters).length > 0` appears character-identically in 3 files — mem0-ts/src/oss/src/vector_stores/baidu.ts, mem0-ts/src/oss/src/vector_stores/elasticsearch.ts, mem0-ts/src/oss/src/vector_stores/mongodb.ts. 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 mem0-ts/src/oss/src/memory/index.ts:2060— `key === "AND" || key === "OR" || key === "NOT"` appears character-identically in 3 files — mem0-ts/src/oss/src/memory/index.ts, mem0-ts/src/oss/src/vector_stores/opensearch.ts, mem0-ts/src/oss/src/vector_stores/qdrant.ts. 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 cli/node/src/backend/platform.ts:180— `opts.extraFilters && ("AND" in opts.extraFilters || "OR" in opts.extraFilters)` appears character-identically in 2 files — cli/node/src/backend/platform.ts, integrations/openclaw/backend/platform.ts. 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 cli/node/src/commands/config.ts:23— `opts.output === "agent" || opts.output === "json"` appears character-identically in 5 files — cli/node/src/commands/config.ts, cli/node/src/commands/entities.ts, cli/node/src/commands/events.ts, cli/node/src/commands/memory.ts. 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 mem0-ts/src/oss/src/utils/notices.ts:183— `parsed && typeof parsed === "object" && !Array.isArray(parsed)` appears character-identically in 3 files — mem0-ts/src/oss/src/utils/notices.ts, mem0-ts/src/oss/src/vector_stores/cassandra.ts, mem0-ts/src/oss/src/vector_stores/databricks.ts. 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 mem0-ts/src/oss/src/vector_stores/cassandra.ts:434— `rawValue && typeof rawValue === "object" && !Array.isArray(rawValue)` appears character-identically in 2 files — mem0-ts/src/oss/src/vector_stores/cassandra.ts, mem0-ts/src/oss/src/vector_stores/databricks.ts. 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 integrations/openclaw/cli/commands.ts:1683— `results && Array.isArray(results) && results.length` appears character-identically in 2 files — integrations/openclaw/cli/commands.ts, integrations/openclaw/tools/memory-event-status.ts. 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 mem0-ts/src/oss/src/vector_stores/cassandra.ts:307— `typeof existing === "string" && existing.length > 0` appears character-identically in 2 files — mem0-ts/src/oss/src/vector_stores/cassandra.ts, mem0-ts/src/oss/src/vector_stores/databricks.ts. 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 mem0-ts/src/oss/src/vector_stores/baidu.ts:78— `typeof payload.textLemmatized === "string" && payload.textLemmatized.length > 0` appears character-identically in 2 files — mem0-ts/src/oss/src/vector_stores/baidu.ts, mem0-ts/src/oss/src/vector_stores/databricks.ts. 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 mem0-ts/src/oss/src/embeddings/vertexai.ts:29— `typeof value !== "object" || value === null` appears character-identically in 7 files — mem0-ts/src/oss/src/embeddings/vertexai.ts, mem0-ts/src/oss/src/vector_stores/cassandra.ts, mem0-ts/src/oss/src/vector_stores/databricks.ts, mem0-ts/src/oss/src/vector_stores/memory.ts. 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 mem0-ts/src/oss/src/vector_stores/baidu.ts:274— `typeof value === "number" || typeof value === "boolean"` appears character-identically in 3 files — mem0-ts/src/oss/src/vector_stores/baidu.ts, mem0-ts/src/oss/src/vector_stores/milvus.ts, mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts. 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 mem0-ts/src/oss/src/vector_stores/mongodb.ts:186— `typeof value === "object" && value !== null` appears character-identically in 4 files — mem0-ts/src/oss/src/vector_stores/mongodb.ts, mem0-ts/src/oss/src/vector_stores/pinecone.ts, mem0-ts/src/oss/src/vector_stores/turbopuffer.ts, mem0-ts/src/oss/src/vector_stores/vertex_ai_vector_search.ts. 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 mem0-ts/src/oss/src/memory/index.ts:2065— `typeof value === "object" && value !== null && !Array.isArray(value)` appears character-identically in 3 files — mem0-ts/src/oss/src/memory/index.ts, mem0-ts/src/oss/src/vector_stores/databricks.ts, mem0-ts/src/oss/src/vector_stores/pgvector.ts. 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.
Mock-dominated test: add flow works with lmstudio LLM for fact extraction mem0-ts/src/oss/tests/config-manager.test.ts:886— This test sets up 3 test doubles (for example `a double assigned in a shared setup`) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: should use Promise.allSettled for concurrent entity searches mem0-ts/src/oss/tests/memory.entity-boost.test.ts:86— This test sets up 7 test doubles (for example `jest.spyOn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: does not pass port when using pre-configured client mem0-ts/src/oss/tests/qdrant-url-port.test.ts:134— This test sets up 8 test doubles (for example `jest.fn`) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: should drop and recreate a stale text search index on upgrade mem0-ts/src/oss/src/tests/mongodb.test.ts:113— This test sets up 6 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: should not recreate a text search index that already has textLemmatized mem0-ts/src/oss/src/tests/mongodb.test.ts:151— This test sets up 6 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: should perform vector search correctly with filters mem0-ts/src/oss/src/tests/mongodb.test.ts:240— This test sets up 4 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: saves config and validates API key with --api-key flag integrations/openclaw/tests/cli-commands.test.ts:323— This test sets up 4 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: warns when API key validation returns non-ok status integrations/openclaw/tests/cli-commands.test.ts:362— This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: sends verification code with --email only integrations/openclaw/tests/cli-commands.test.ts:408— This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: verifies email code with --email and --code, saves config integrations/openclaw/tests/cli-commands.test.ts:435— This test sets up 4 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: does not save config when email verification returns no api_key integrations/openclaw/tests/cli-commands.test.ts:472— This test sets up 4 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: preserves userId from --user-id flag during init integrations/openclaw/tests/cli-commands.test.ts:508— This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: event list returns early in open-source mode integrations/openclaw/tests/cli-commands.test.ts:1455— This test sets up 8 test doubles (for example `vi.fn`) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: event status returns early in open-source mode integrations/openclaw/tests/cli-commands.test.ts:1489— This test sets up 8 test doubles (for example `vi.fn`) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: performs dedup search before adding in legacy mode integrations/openclaw/tests/tools.test.ts:429— This test sets up 7 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Silent fallback default in catch REDACTED:783— `_resolve_email` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:783— `_resolve_email` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:783— `_resolve_email` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:783— `_resolve_email` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:783— `_resolve_email` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 14 significant file(s) lose their only recent owner: mem0-ts/src/oss/src/vector_stores/oracledb.ts, integrations/openclaw/backend/platform.ts, mem0-ts/src/oss/src/embeddings/aws_bedrock.ts, integrations/pi-agent-plugin/src/memory/tools.ts, integrations/claude-code-plugin/core/mcp_server.py, integrations/openclaw/tools/memory-add.ts, integrations/claude-code-plugin/core/memory_cli.py, integrations/openclaw/tools/memory-delete.ts (+6 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 8 significant file(s) lose their only recent owner: REDACTED, REDACTED, REDACTED, REDACTED, REDACTED, REDACTED, cli/node/src/branding.ts, cli/node/src/commands/config.ts. Pair on, review, or document these before any departure.
X23 · Unguarded diagnostic materialisation· Diagnostic log message is built whether or not it is wanted · ×2
Diagnostic log message is built whether or not it is wanted mem0/vector_stores/vertex_ai_vector_search.py:37— `debug` at line 37 is called with an argument built by `sorted(kwargs)` (line 37), 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 mem0/vector_stores/vertex_ai_vector_search.py:49— `debug` at line 49 is called with an argument built by `sorted(config.model_dump())` (line 49), 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.
C2 · Access Controls· No named authorization policies · ×1
No named authorization policies — Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
C4 · Data Retention· Partial data-retention evidence · ×1
Partial data-retention evidence — A retention mechanism is present, but the data-lifecycle is not yet complete — missing: an expiry limit — a declared maximum age / TTL after which the data is no longer kept, a scheduled purge / cleanup job (a Celery beat task, APScheduler job or management command that deletes rows past their retention — Session.objects.filter(created__lt=cutoff).delete(), purge_expired… / delete_old…).
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 10 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (34 single-owned of 318 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 318 of the 558 production source files in this repository met that bar). They are anonymized user #3 (3 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)) (+4 more) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: mem0-ts/src/oss/src/vector_stores/neptune_analytics.ts, server/dashboard/src/app/setup/page.tsx, server/dashboard/src/app/(root)/dashboard/configuration/page.tsx, mem0-ts/src/oss/src/utils/entity_extraction.ts, integrations/n8n-nodes-mem0/nodes/Mem0/Mem0.node.ts, server/dashboard/src/app/(root)/dashboard/memories/page.tsx, server/routers/auth.py, mem0/configs/vector_stores/oracledb.py (+4 more).
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 3 of 19 project(s) overshoot their size bounds, lowering Project Cohesion to 6.8/10. The most over is `(repository root)` (53429 LoC, 300 module-visible types across 31 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 53 of 318 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; 318 of the 558 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: mem0-ts/src/oss/src/vector_stores/azure_ai_search.ts, mem0-ts/src/oss/src/vector_stores/vertex_ai_vector_search.ts, cli/python/src/mem0_cli/commands/agent_mode_cmd.py, server/dashboard/src/app/(root)/dashboard/components/main-nav.tsx, cli/node/src/commands/agent-mode.ts, server/dashboard/src/app/(auth)/login/login-form.tsx, server/dashboard/src/app/(root)/dashboard/requests/page.tsx, server/dashboard/src/app/(root)/dashboard/api-keys/page.tsx (and 45 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
Logging is not universal — Only 6/9 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `cli/node`, `cli/python`, `server/dashboard`.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Unused export 'syncApiKey' cli/node/src/plugin-sync.ts:40— Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code· Unused export 'MAX_OUTPUT_BYTES' · ×1
Unused export 'MAX_OUTPUT_BYTES' integrations/agent-plugin-core/typescript/src/formatting.ts:10— Nothing ultimately consumes this binding: its only referrer is the re-export in integrations/deepseek-plugin/src/output.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in integrations/deepseek-plugin/src/output.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code· Unused export 'ttlToExpirationDate' · ×1
Unused export 'ttlToExpirationDate' integrations/openclaw/skill-loader.ts:300— Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code· Unused export 'formatCompactNumber' · ×1
Unused export 'formatCompactNumber' server/dashboard/src/lib/utils.ts:8— Nothing imports this binding — it is safe to review for removal.
Unused export 'AppDispatch' server/dashboard/src/store/store.ts:9— Nothing imports this binding — it is safe to review for removal.
R8 · Dependency Hygiene· Test-only dependency 'ai' in production deps · ×1
Test-only dependency 'ai' in production deps integrations/vercel-ai-sdk/package.json:41— Only test files import it (first: integrations/vercel-ai-sdk/tests/generate-output.test.ts:1) — move it to devDependencies.
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 15/32 async functions that make a cancellable request (fetch, axios, ky, ofetch) 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.
X5 · Nullable reference types· Strict null checking is not enabled everywhere the repository type-checks · ×1
Strict null checking is not enabled everywhere the repository type-checks — 18/19 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
Null assertions (`!`) reduce the strict null checking score — ~1.6 `!` null assertions per 1k TypeScript source lines — 86 assertion(s) across the 54559 source line(s) of the 299 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: mem0-ts/src/oss/src/vector_stores/azure_mysql.ts (12), mem0-ts/src/oss/src/vector_stores/cassandra.ts (9), mem0-ts/src/oss/src/memory/index.ts (6). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
Outdated: bcrypt — `bcrypt` is pinned to 4.0.1, but 5.0.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 4.0.1 until the declaration is edited. This crosses a major version, so it is a migration rather than a bump.
Outdated: fastapi — `fastapi` is pinned to 0.115.8, but 0.162.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.115.8 until the declaration is edited.
Outdated: python-dotenv — `python-dotenv` is pinned to 1.2.2, but 1.2.4 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 1.2.2 until the declaration is edited.
Outdated: uvicorn — `uvicorn` is pinned to 0.34.0, but 0.54.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.34.0 until the declaration is edited.
Skipped (documented): (unnamed test) integrations/openclaw/skill-loader.test.ts:95— Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
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) — `server/dashboard/tailwind.config.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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 01a17853-1d92-71de-8dff-1dbe6f6b4546 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 253 · Warnings: 1271 · Recommendations: 283 · Info: 5 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 26-10-2026 @ 13:07 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.