Public report of ghuntley/overalls, published 16 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 16 November 2026, 19:04 UTC · Survey ID cd_33a6d0f80ce647ca99d28a94a6232124
ghuntley/overalls
Measured 16 November 2026, 19:03 UTC, at code version 3e6a2f2
Boundary Type-Coupling is not measured: Bounded contexts not declared.
CAI scoreAt risk
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: 339,521 lines of product code in 49 projects, tests not counted · Estimated rebuild effort: about 9.1 person-years · Weakest lens: Production Readiness, 68.5
Findings by how serious they are
41 critical2500 serious283 minor
21 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
16 November 2026, 19:03 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
75of 75 dimensions measured by tools.
2758of 2824 findings point to an exact file and line, so you can open each one in the code. The other 66 concern the repository as a whole, such as missing documentation.
75dimensions across 9 lenses, read from 339,521 lines of product code in 49 projects.
ghuntley/overalls is rated At risk because critical security findings are open, most of them in the packages it uses. It scores 69.5 out of 100, which the At risk rating leaves unchanged. We judged it as a preview release, against a lower bar.
Every lens scores high enough to be rated Strong, so no single lens holds the score back. The best first step is replacing each retired release, worth about 0.6 points.
Sixteen known security holes in the packages the code depends on can be used by attackers. Three weaknesses in the code could be used by an attacker, and fifteen errors are caught and ignored, so failures can go unnoticed. Updating the vulnerable packages, fixing the weaknesses the scanner points to and handling or logging the ignored errors would close these risks. The two unsafe settings in infrastructure or container files need changing to safe values. The password or key in the code's history needs replacing, with the old one switched off. Referring to the other business object by its identifier would take care of the four business objects holding another business object directly.
The product code is 339,521 lines, about €1,300,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.
The weakest lenses score close to each other, so improving any of them moves the score.
Code composition: what the lines of code are
Business logic 2%Supporting code 1%Tests 97%
Rebuild cost: about €1,300,000 · Estimate
Cost to rebuild
€440,000 to €2,200,000, for 7,286 to 23,155 hours of work, about 9.1 person-years for 5 to 18 engineers
Difficulty of the problem
High, 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
×1.0 at a score of 70. 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: 339,521 lines of product code
Comment lines
The estimate prices 338,581 lines. Comment lines count towards the size of 339,521 lines but aren't priced as work.
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 Retired release finding(s) in Dependency Hygiene.
Resolve the 15 EmptyCatchBlock finding(s) in Explicit Debt — start with DeploymentStore.cs (4), JourneyPages.cs (2), JourneySmoke.cs (2).
Raises the score by about 0.6 points · Medium effort · Explicit Debt
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.
If you do one thing first · First action
Resolve the 1 Retired release finding(s) in Dependency Hygiene. Of all the actions in this report, it raises the score most for the work it takes: about 0.6 points for low effort, because it clears the 1 Dependency Hygiene findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.9 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 3% to 6% on every change. The history of the code shows how much it changes: about 5,156,674 lines over the last 90 days, which is about 20,913,178 lines a year. At that pace, the extra work comes to an estimated 1390.8 to 8344.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 our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
745 modules, with 535 dependencies between them. 3 loops run through 9 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 705 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.
antithesis.workload.access uses antithesis.workload.core.config, so a change to antithesis.workload.core.config can break antithesis.workload.access, while a change to antithesis.workload.access can't break antithesis.workload.core.config.
Position
Below the diagonal: antithesis.workload.access uses a module listed above it, which is the healthy direction.
antithesis.workload.core.sql uses antithesis.workload.core.config, so a change to antithesis.workload.core.config can break antithesis.workload.core.sql, while a change to antithesis.workload.core.sql can't break antithesis.workload.core.config.
Position
Below the diagonal: antithesis.workload.core.sql uses a module listed above it, which is the healthy direction.
antithesis.workload.satellite.runtime uses antithesis.workload.admission.client, so a change to antithesis.workload.admission.client can break antithesis.workload.satellite.runtime, while a change to antithesis.workload.satellite.runtime can't break antithesis.workload.admission.client.
Position
Below the diagonal: antithesis.workload.satellite.runtime uses a module listed above it, which is the healthy direction.
antithesis.workload.satellite.runtime uses antithesis.workload.core.config, so a change to antithesis.workload.core.config can break antithesis.workload.satellite.runtime, while a change to antithesis.workload.satellite.runtime can't break antithesis.workload.core.config.
Position
Below the diagonal: antithesis.workload.satellite.runtime uses a module listed above it, which is the healthy direction.
lyra.workspace_receiver uses lyra.agent.managed_skills, so a change to lyra.agent.managed_skills can break lyra.workspace_receiver, while a change to lyra.workspace_receiver can't break lyra.agent.managed_skills.
Position
Below the diagonal: lyra.workspace_receiver uses a module listed above it, which is the healthy direction.
lyra.workspace_receiver uses lyra.main, so a change to lyra.main can break lyra.workspace_receiver, while a change to lyra.workspace_receiver can't break lyra.main.
Position
Below the diagonal: lyra.workspace_receiver uses a module listed above it, which is the healthy direction.
lyra.workspace_receiver uses lyra.workspace_source, so a change to lyra.workspace_source can break lyra.workspace_receiver, while a change to lyra.workspace_receiver can't break lyra.workspace_source.
Position
Below the diagonal: lyra.workspace_receiver uses a module listed above it, which is the healthy direction.
mila_ffi.session uses mila_session, so a change to mila_session can break mila_ffi.session, while a change to mila_ffi.session can't break mila_session.
Position
Below the diagonal: mila_ffi.session uses a module listed above it, which is the healthy direction.
25→32 mila_native_linux.terminal uses mila_native_linux.adapterpart of a loop✕
Connections
1 pair of types, where a type in mila_native_linux.terminal uses a type in mila_native_linux.adapter.
mila_native_linux.terminal uses mila_native_linux.adapter, so a change to mila_native_linux.adapter can break mila_native_linux.terminal, while a change to mila_native_linux.terminal can't break mila_native_linux.adapter.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
overalls_vscode_web_broker.windows_model uses overalls_vscode_web_broker, so a change to overalls_vscode_web_broker can break overalls_vscode_web_broker.windows_model, while a change to overalls_vscode_web_broker.windows_model can't break overalls_vscode_web_broker.
Position
Below the diagonal: overalls_vscode_web_broker.windows_model uses a module listed above it, which is the healthy direction.
antithesis.workload.admission.scenarios uses antithesis.workload.admission.client, so a change to antithesis.workload.admission.client can break antithesis.workload.admission.scenarios, while a change to antithesis.workload.admission.scenarios can't break antithesis.workload.admission.client.
Position
Below the diagonal: antithesis.workload.admission.scenarios uses a module listed above it, which is the healthy direction.
antithesis.workload.admission.scenarios uses antithesis.workload.core.sql, so a change to antithesis.workload.core.sql can break antithesis.workload.admission.scenarios, while a change to antithesis.workload.admission.scenarios can't break antithesis.workload.core.sql.
Position
Below the diagonal: antithesis.workload.admission.scenarios uses a module listed above it, which is the healthy direction.
antithesis.workload.control uses antithesis.workload.control.credential, so a change to antithesis.workload.control.credential can break antithesis.workload.control, while a change to antithesis.workload.control can't break antithesis.workload.control.credential.
Position
Below the diagonal: antithesis.workload.control uses a module listed above it, which is the healthy direction.
antithesis.workload.control uses antithesis.workload.core.sql, so a change to antithesis.workload.core.sql can break antithesis.workload.control, while a change to antithesis.workload.control can't break antithesis.workload.core.sql.
Position
Below the diagonal: antithesis.workload.control uses a module listed above it, which is the healthy direction.
antithesis.workload.satellite uses antithesis.workload.core.config, so a change to antithesis.workload.core.config can break antithesis.workload.satellite, while a change to antithesis.workload.satellite can't break antithesis.workload.core.config.
Position
Below the diagonal: antithesis.workload.satellite uses a module listed above it, which is the healthy direction.
antithesis.workload.satellite uses antithesis.workload.core.sql, so a change to antithesis.workload.core.sql can break antithesis.workload.satellite, while a change to antithesis.workload.satellite can't break antithesis.workload.core.sql.
Position
Below the diagonal: antithesis.workload.satellite uses a module listed above it, which is the healthy direction.
antithesis.workload.satellite uses antithesis.workload.satellite.runtime, so a change to antithesis.workload.satellite.runtime can break antithesis.workload.satellite, while a change to antithesis.workload.satellite can't break antithesis.workload.satellite.runtime.
Position
Below the diagonal: antithesis.workload.satellite uses a module listed above it, which is the healthy direction.
lyra.agent.attachment uses lyra.agent, so a change to lyra.agent can break lyra.agent.attachment, while a change to lyra.agent.attachment can't break lyra.agent.
Position
Below the diagonal: lyra.agent.attachment uses a module listed above it, which is the healthy direction.
lyra.bin.overalls-ssh-sync-windows.sync uses lyra.agent, so a change to lyra.agent can break lyra.bin.overalls-ssh-sync-windows.sync, while a change to lyra.bin.overalls-ssh-sync-windows.sync can't break lyra.agent.
Position
Below the diagonal: lyra.bin.overalls-ssh-sync-windows.sync uses a module listed above it, which is the healthy direction.
mila_native_linux.adapter uses mila_native_linux.terminal, so a change to mila_native_linux.terminal can break mila_native_linux.adapter, while a change to mila_native_linux.adapter can't break mila_native_linux.terminal.
Position
Below the diagonal: mila_native_linux.adapter uses a module listed above it, which is the healthy direction.
mila_native_linux.session.connection uses mila_native_linux.signin_driver, so a change to mila_native_linux.signin_driver can break mila_native_linux.session.connection, while a change to mila_native_linux.session.connection can't break mila_native_linux.signin_driver.
Position
Below the diagonal: mila_native_linux.session.connection uses a module listed above it, which is the healthy direction.
mila_native_linux.session.connection uses mila_native_linux.terminal, so a change to mila_native_linux.terminal can break mila_native_linux.session.connection, while a change to mila_native_linux.session.connection can't break mila_native_linux.terminal.
Position
Below the diagonal: mila_native_linux.session.connection uses a module listed above it, which is the healthy direction.
33→37 mila_native_linux.session.connection uses mila_native_linux.sessionpart of a loop✕
Connections
1 pair of types, where a type in mila_native_linux.session.connection uses a type in mila_native_linux.session.
mila_native_linux.session.connection uses mila_native_linux.session, so a change to mila_native_linux.session can break mila_native_linux.session.connection, while a change to mila_native_linux.session.connection can't break mila_native_linux.session.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
1 pair of types, where a type in mila_native_linux.views uses a type in (global).
The types involved
mila_native_linux.views.views$module → Key
Direction
mila_native_linux.views uses (global), so a change to (global) can break mila_native_linux.views, while a change to mila_native_linux.views can't break (global).
Position
Below the diagonal: mila_native_linux.views uses a module listed above it, which is the healthy direction.
mila_native_linux.views uses mila_ffi.session, so a change to mila_ffi.session can break mila_native_linux.views, while a change to mila_native_linux.views can't break mila_ffi.session.
Position
Below the diagonal: mila_native_linux.views uses a module listed above it, which is the healthy direction.
mila_native_linux.views uses mila_native_linux.terminal, so a change to mila_native_linux.terminal can break mila_native_linux.views, while a change to mila_native_linux.views can't break mila_native_linux.terminal.
Position
Below the diagonal: mila_native_linux.views uses a module listed above it, which is the healthy direction.
34→39 mila_native_linux.views uses mila_native_linux.mainpart of a loop✕
Connections
1 pair of types, where a type in mila_native_linux.views uses a type in mila_native_linux.main.
mila_native_linux.views uses mila_native_linux.main, so a change to mila_native_linux.main can break mila_native_linux.views, while a change to mila_native_linux.views can't break mila_native_linux.main.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
34→40 mila_native_linux.views uses mila_native_linux.gtk_journeypart of a loop✕
Connections
1 pair of types, where a type in mila_native_linux.views uses a type in mila_native_linux.gtk_journey.
mila_native_linux.views uses mila_native_linux.gtk_journey, so a change to mila_native_linux.gtk_journey can break mila_native_linux.views, while a change to mila_native_linux.views can't break mila_native_linux.gtk_journey.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
antithesis.workload.admission uses antithesis.workload.admission.client, so a change to antithesis.workload.admission.client can break antithesis.workload.admission, while a change to antithesis.workload.admission can't break antithesis.workload.admission.client.
Position
Below the diagonal: antithesis.workload.admission uses a module listed above it, which is the healthy direction.
antithesis.workload.admission uses antithesis.workload.admission.scenarios, so a change to antithesis.workload.admission.scenarios can break antithesis.workload.admission, while a change to antithesis.workload.admission can't break antithesis.workload.admission.scenarios.
Position
Below the diagonal: antithesis.workload.admission uses a module listed above it, which is the healthy direction.
lyra.bin.overalls-trustd uses lyra.agent.managed_skills, so a change to lyra.agent.managed_skills can break lyra.bin.overalls-trustd, while a change to lyra.bin.overalls-trustd can't break lyra.agent.managed_skills.
Position
Below the diagonal: lyra.bin.overalls-trustd uses a module listed above it, which is the healthy direction.
lyra.bin.overalls-trustd uses lyra.agent.attachment, so a change to lyra.agent.attachment can break lyra.bin.overalls-trustd, while a change to lyra.bin.overalls-trustd can't break lyra.agent.attachment.
Position
Below the diagonal: lyra.bin.overalls-trustd uses a module listed above it, which is the healthy direction.
mila_native_linux.session uses mila_native_linux.signin_driver, so a change to mila_native_linux.signin_driver can break mila_native_linux.session, while a change to mila_native_linux.session can't break mila_native_linux.signin_driver.
Position
Below the diagonal: mila_native_linux.session uses a module listed above it, which is the healthy direction.
mila_native_linux.session uses mila_ffi.session, so a change to mila_ffi.session can break mila_native_linux.session, while a change to mila_native_linux.session can't break mila_ffi.session.
Position
Below the diagonal: mila_native_linux.session uses a module listed above it, which is the healthy direction.
mila_native_linux.session uses mila_native_linux.session.connection, so a change to mila_native_linux.session.connection can break mila_native_linux.session, while a change to mila_native_linux.session can't break mila_native_linux.session.connection.
Position
Below the diagonal: mila_native_linux.session uses a module listed above it, which is the healthy direction.
mila_native_linux.journey uses mila_native_linux.signin_driver, so a change to mila_native_linux.signin_driver can break mila_native_linux.journey, while a change to mila_native_linux.journey can't break mila_native_linux.signin_driver.
Position
Below the diagonal: mila_native_linux.journey uses a module listed above it, which is the healthy direction.
mila_native_linux.journey uses mila_native_linux.session.connection, so a change to mila_native_linux.session.connection can break mila_native_linux.journey, while a change to mila_native_linux.journey can't break mila_native_linux.session.connection.
Position
Below the diagonal: mila_native_linux.journey uses a module listed above it, which is the healthy direction.
mila_native_linux.journey uses mila_native_linux.session, so a change to mila_native_linux.session can break mila_native_linux.journey, while a change to mila_native_linux.journey can't break mila_native_linux.session.
Position
Below the diagonal: mila_native_linux.journey uses a module listed above it, which is the healthy direction.
mila_native_linux.main uses mila_native_linux.signin_driver, so a change to mila_native_linux.signin_driver can break mila_native_linux.main, while a change to mila_native_linux.main can't break mila_native_linux.signin_driver.
Position
Below the diagonal: mila_native_linux.main uses a module listed above it, which is the healthy direction.
mila_native_linux.main uses mila_native_linux.adapter, so a change to mila_native_linux.adapter can break mila_native_linux.main, while a change to mila_native_linux.main can't break mila_native_linux.adapter.
Position
Below the diagonal: mila_native_linux.main uses a module listed above it, which is the healthy direction.
mila_native_linux.main uses mila_native_linux.session.connection, so a change to mila_native_linux.session.connection can break mila_native_linux.main, while a change to mila_native_linux.main can't break mila_native_linux.session.connection.
Position
Below the diagonal: mila_native_linux.main uses a module listed above it, which is the healthy direction.
mila_native_linux.main uses mila_native_linux.views, so a change to mila_native_linux.views can break mila_native_linux.main, while a change to mila_native_linux.main can't break mila_native_linux.views.
Position
Below the diagonal: mila_native_linux.main uses a module listed above it, which is the healthy direction.
mila_native_linux.main uses mila_native_linux.session, so a change to mila_native_linux.session can break mila_native_linux.main, while a change to mila_native_linux.main can't break mila_native_linux.session.
Position
Below the diagonal: mila_native_linux.main uses a module listed above it, which is the healthy direction.
mila_native_linux.gtk_journey uses mila_ffi.session, so a change to mila_ffi.session can break mila_native_linux.gtk_journey, while a change to mila_native_linux.gtk_journey can't break mila_ffi.session.
Position
Below the diagonal: mila_native_linux.gtk_journey uses a module listed above it, which is the healthy direction.
mila_native_linux.gtk_journey uses mila_native_linux.journey, so a change to mila_native_linux.journey can break mila_native_linux.gtk_journey, while a change to mila_native_linux.gtk_journey can't break mila_native_linux.journey.
Position
Below the diagonal: mila_native_linux.gtk_journey uses a module listed above it, which is the healthy direction.
mila_native_linux.gtk_journey uses mila_native_linux.main, so a change to mila_native_linux.main can break mila_native_linux.gtk_journey, while a change to mila_native_linux.gtk_journey can't break mila_native_linux.main.
Position
Below the diagonal: mila_native_linux.gtk_journey uses a module listed above it, which is the healthy direction.
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
A03:2025 — Software Supply Chain Failures
70
High / Critical
A05:2025 — Injection
27
High / Critical
A02:2025 — Security Misconfiguration
3
High / Critical
A07:2025 — Authentication Failures
2
High / Critical
Roadmap
Top priorities: Make the call chain async end-to-end and await it — never block on a Task with .Wait()/.GetAwaiter().GetResult(); Resolve the 1 Retired release finding(s) in Dependency Hygiene; Resolve the 1 Unbounded dependency requirement finding(s) in Dependency Hygiene.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Retired release finding(s) in Dependency Hygiene.
A `static` field is one slot for the whole process, however its type is created: back it with a thread-safe type (ConcurrentDictionary, Interlocked), take a lock around every write, or move it into a registered singleton that does.
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 — 41
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 — 2500
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 — 283
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 21
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 75 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 75 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, 2758 of 2824 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the .NET half could not be measured — no coverage produced (collector absent, or test run exceeded the inline budget); the JavaScript/TypeScript half measured 93.4% (node:test via `npm ci --ignore-scripts` in marvin/, the 3 run(s) test reliability made). This repository's production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo.
D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 88 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 1,642 test source file(s) (.exs, .py, .ex, .rs, .swift, .kt) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT SCORED: this repository's production source includes .ex, .rs, and the built-in reliability runner cannot re-run the .ex test suite(s); the rust executor ran against the .rs half and could not be re-run to completion inside our analyzer environment — so reliability was not measured for the repository as a whole. The JavaScript/TypeScript (node:test via `npm ci --ignore-scripts` in marvin/ (17 tests)): measured (0 flaky) suite(s) did re-run, and came back with 0 flaky across 1 measured tier(s) — 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 — test reliability is excluded from the score rather than counted. The half was driven by a runner we ship, so this is not a missing-runner gap.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Python pyproject.toml/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Cargo manifest, but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its Cargo dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its NuGet package 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.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares an Elixir mix.exs/mix.lock (Hex), but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its Mix dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-contributor repository — bus factor is not applicable (1 contributor(s) across 2380 commit(s) sampled, automation and bot accounts excluded). Concentration needs a team to concentrate: with one contributor there is nobody to spread the knowledge to, so there is nothing here for the owner to act on.
D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 15 deducted marker(s) and the 1.3/KLoC density on this row were taken over this repository's .NET projects ALONE: .ex (170,791 lines, 51% of production source), .rs (79,740 lines, 24% of production source) went unread, because every marker collector on this path is reached through a C# workspace. D17's marker collectors need a compiler we do not have for that language, so none of its nine marker kinds were read there. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): 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.
D23 Boundary Type-Coupling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Large codebase (334,963 production LoC in the .NET projects) with no declared bounded contexts — cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (≥2 module groups, e.g. per subsystem) so cross-boundary type coupling can 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 — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D27 Navigability — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Tracing effort is measured over resolved call sites, and all 734 sampled here came from .ex/.exs files. This repository's .rs source is a material share of its production lines and contributed none, so the score above is a verdict about the part that was read. Not a finding that the unread half navigates well — it is unmeasured.
D31 IaC & Container Security — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. REDACTED.dockerignore carries no `FROM` instruction, so it declares no build stage and every REDACTED rule this engine owns — the runtime-hardening, key-material, mutable-clone, no-op-shim, build-context, trust-anchor, install-guard, setuid and world-writable-path rules — is outside its own premise there and returned nothing. That silence is deliberate and correct: with no base image there is no image to reason about. It is reported here because it is NOT the same fact as a clean file, and coverage is stated as 16 of 17 Infrastructure-as-Code manifest(s) fully judged rather than as 100%. The vendor scanners (trivy, checkov) do read these files and their findings above stand; only this engine's own stage-keyed rules are absent. No owner action: a build file with no FROM is a legitimate include fragment.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `antithesis/verification/schema.py`, `antithesis/workload/access/session.py`, `antithesis/workload/core/config.py`, `antithesis/workload/core/interesting.py`, `antithesis/workload/core/outcome.py`, … (+35 more) 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.
AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (antithesis/config/compose.enrico.yaml). compose up failed (exit 15 — the compose project is invalid) — service "workload" has neither an image nor a build context specified: invalid compose project; runtime evidence skipped.
DM8 Value-object opportunities — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check finds primitive parameters that travel together through several signatures of the domain (a missing value object). Its deterministic rule has not yet shown 95 % precision on adjudicated rows, so the clumps it finds are counted here and not published as findings, and the card carries no score. That is a limit of the analyzer, not a finding about your code.
DM9 Scattered domain decisions — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Scattered domain decisions could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: InvalidCastException: Invalid cast from 'Char' to 'Double'.
ED5 Idempotency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check decides whether a handler's mutation is safe to re-run by recognising its persistence writes (a database save, a repository write, an event publish) and its guards. Those markers are .NET member names, so in this repository's language a write such as `repository.save(order)` is not recognised and a same-named call on an unrelated library type could be. The handlers were found; their idempotency was neither confirmed nor ruled out.
IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
X1 Async correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X1 Async correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 4 further occurrence(s) are not listed individually; the score already reflects all 44.
X10 Duplicated predicate — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 149 further occurrence(s) are not listed individually; the score already reflects all 189.
X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X13 Undrained process stream — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X18 Disposal-pattern correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X2 Cancellation propagation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X21 Side-effecting pattern guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X22 Contradicted release guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X25 Inert configuration knob — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X28 Index access outside its own emptiness guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X29 Per-element action decided by a fixed element — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X3 Exception handling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X7 Silent fallback defaults — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 251 further occurrence(s) are not listed individually; the score already reflects all 291.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
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 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
D25 ADR Conformance: ADR conformance checks only decisions stated in a checkable form (a ruled-out element, package or dependency, an adr-rules block, a declared delivery status): a decision written only as prose is unverifiable, and decisions never written down are not checked.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (REDACTED, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
DM4 Rich vs anemic model: Behaviour is detected as state mutation inside a method body — a method that enforces an invariant by validating-and-throwing without mutating reads as a query, and mutation delegated through an interface the scan can't resolve isn't credited; entities with zero public properties still drop out of the population. It detects that state changes, not whether the rule is correct.
DM6 Domain ↔ infrastructure boundary: Infrastructure reached through a hand-rolled wrapper, a domain-named facade, reflection, or a string-keyed service locator resolves to a non-infra type and isn't seen; the body scan is symbol resolution over syntax, not full dataflow. A clean result means "no resolved infra reference in a domain body", not a proof of purity.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
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.
391 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was probe.advance at 114. A further 27 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 mila_native_linux::strings::id at 195 — they are counted neither in the figure above nor in this dimension's score. 14 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: mila/native/linux/src/strings.rs (mila_native_linux::strings::id at 195), mila/native/apple/Sources/MilaNativeUI/MilaStrings.swift (MilaStrings.fallback at 121), porsche/lib/porsche/ssh/output.ex (Output.error_message at 78), REDACTED (LifecycleSmoke.DeploymentPickerController at 41), marshall/lib/marshall_web/controllers/error_html.ex (ErrorHTML.status_message at 41), and 9 more not listed here. 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.
+ 344 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 5 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with probe.advance (cyclomatic 114), mila_protocol::grammar::validate_command (cyclomatic 87), mounted (cyclomatic 83). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 5 together lifts Cyclomatic Complexity from 5.9 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 612 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 Cognitive Complexity — start with probe.advance (cognitive 168). — Refactoring it lifts Cognitive Complexity from 4.5 to about 5.0/10.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.5 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 81 FileTooLong finding(s) in God Classes — start with session.rs (3), REDACTED (2), events.ex (2). — One of this dimension's main actionable groups (81 warning-level).
Resolve the 17 FunctionTooLong finding(s) in God Classes — start with views.rs (3), pages.rs (2), journey.rs (2). — One of this dimension's main actionable groups (17 warning-level).
Resolve the 12 MethodTooLong finding(s) in God Classes — start with main.rs (2), session.rs (2), gtk_journey.rs. — One of this dimension's main actionable groups (12 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
475 duplicated block group(s) detected. 6.3 % of the production lines (21,245 of 334,963) are in a reported copy. A further 599 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 10 of the 1074 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.
+ 217 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 45 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with pages.rs (3), config.ex (2), overalls-host-certificate-windows.rs (2). — One of this dimension's main actionable groups (45 warning-level).
Resolve the 43 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with overalls-ssh-authorize.rs (3), overalls-host-certificate-windows.rs (2), RustNative.cs. — One of this dimension's main actionable groups (43 warning-level).
Resolve the 41 Edited copy of a member (2 corresponding lines) finding(s) in Code Duplication — start with fleet_certificate.ex (2), proxy.ex (2), machines_live.ex (2). — One of this dimension's main actionable groups (41 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling9.0 / 10Stronggated by 6 serious findings✓ 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.
49 production modules (Gradle+Cargo+Python+SwiftPM+OTP), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; edges a convention plugin adds from buildSrc or build-logic are not visible there; 6 module(s) off the main sequence, with abstractness counted on 46 of the 49 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: mila-model · ×6
What to do
Resolve the 6 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
What it measures: Whether the code respects its intended layering / architecture rules.
Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.
No mechanizable ADR was identified, so enforcement is not measured. Cycles found: 0.
Detailed fixes: d7_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 88 tests. Measured on the JavaScript/TypeScript suite only — at least 1,642 test source file(s) (.exs, .py, .ex, .rs, .swift, .kt) went unread, so its test quality is unmeasured and is not in these counts.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
46 outdated, 1 retired direct Hex dependencies, 1 pinning defect(s). Whether any of these packages is UNMAINTAINED is not graded — hex.pm publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: a Hex app name does not determine the modules it provides (`ecto_sql` provides Ecto.Adapters.SQL), and a large idiomatic class of BEAM dependencies — runtime adapters, codec plugins, protocol implementations and OTP applications the release starts — is correctly declared and never referenced in source, so absence of a reference is not evidence of an unused dependency. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Retired release: earmark
Unbounded dependency requirement: postgrex
Outdated: ash · ×46
What to do
Resolve the 1 Retired release finding(s) in Dependency Hygiene. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unbounded dependency requirement finding(s) in Dependency Hygiene. — One of this dimension's main actionable groups (1 warning-level).
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.
REDACTED scan ran and found no leaked secrets. 13 detection(s) were excluded as holding no minted credential in material that runs: a name, reference or comparison rather than a value, a readable phrase or pattern, a value that declares itself fake, or development, test, example, mock or demo material.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 93 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 2 direct `PackageReference`(s), and 91 further package(s) were reached beyond them by closing the graph over the committed `packages.lock.json` and nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution. ★ COVERAGE OF THIS VERDICT: it grades this repository's NuGet package dependencies and nothing else. The repository also declares a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Cargo manifest, package.json and an Elixir mix.exs/mix.lock (Hex), and the licences of those dependency graphs 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.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt (78×39=3042); mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift (72×41=2952); REDACTED (55×43=2365) Repeated repair below the complexity floor: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt (4 of 7 changes were fixes); marshall/lib/marshall/compute/ledger.ex (3 of 5 changes were fixes); lilly/lib/lilly/terminal/stream.ex (3 of 5 changes were fixes)
Resolve the 69 Hotspot finding(s) in Churn × Complexity Hotspots — start with main.rs (5), scenarios.py (4), session.rs (2). — One of this dimension's main actionable groups (69 warning-level).
Resolve the 5 Repeated repair finding(s) in Churn × Complexity Hotspots — start with MilaSessionListing.kt, ledger.ex, stream.ex. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
15 deducted debt markers + 4 dead symbols across 10118 LoC in the .NET projects (1.3/KLoC) → score 7.4. Measured on the .NET source only: .ex, .rs (75% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).
Dead code: TryClassifyMachineCommand · ×4mila/windows-dotnet/Interop/RustNative.cs:774
What to do
Resolve the 15 EmptyCatchBlock finding(s) in Explicit Debt — start with DeploymentStore.cs (4), JourneyPages.cs (2), JourneySmoke.cs (2). — One of this dimension's main actionable groups (15 issue-level).
Resolve the 4 Dead code finding(s) in Explicit Debt — start with RustNative.cs (3), WindowsPushRegistration.cs. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 2 documentation facets pass in full; short on: F4 map. 542 document(s) read across 6 unit(s).
Documentation: no map of the repository's partsREADME.md:1
What to do
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
4 of 264 evaluated ADRs have a defect readable from the log itself (a missing or empty section, no title, a single option, consequences with no cost, no status, a missing enforcement field, a status the log contradicts, a dangling link, an unlinked second decision on one question, a date that is no calendar day). How well each record argues its case is not measured.
ADR considers only one option · ×2docs/architecture/decisions/0225-marshall-notifications-domain.md:42detected by adr-integrity
ADR superseded but its status says otherwisedocs/architecture/decisions/0182-unprivileged-lilly-beam.md:5detected by adr-integrity
ADR decides a question another record already decideddocs/architecture/decisions/0204-git-attribution-and-guest-identity.md:1detected by adr-integrity
✓ On the Gold path — maintain.
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.
What it measures: Whether the code actually follows the decisions recorded in the project's ADRs.
Method: Each binding ADR read for checkable forms: a backticked element its Decision section rules out, a ruled-out package the manifests declare, a forbidden module dependency, an opt-in adr-rules block, and a declared delivery status the code does not yet carry. A prose decision with no checkable form is unverifiable, neither a finding nor a pass. Deterministic, no model. Advisory.
122 of 145 checkable records are broken by the code or by their own declared delivery (145 of 146 binding records state a rule in checkable form or declare their delivery; prose decisions are unverifiable).
ADR accepted but its delivery is incomplete · ×122docs/architecture/decisions/0002-elixir-ash-and-types.md:6detected by adr-delivery
ADR not followed: ADR-0255: Thread lifecycle state machine and Oban server-tool dispatchdocs/architecture/decisions/0255-thread-lifecycle-and-server-tool-dispatch.md:26detected by adr-prohibition
What to do
Resolve the 122 ADR accepted but its delivery is incomplete finding(s) in ADR Conformance — start with 0002-elixir-ash-and-types.md, 0003-control-plane-coordination.md, 0004-lilly-and-vm-actors.md. — One of this dimension's main actionable groups (122 recommendation-level).
Resolve the 1 ADR not followed finding(s) in ADR Conformance — start with 0255-thread-lifecycle-and-server-tool-dispatch.md. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d25_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
31 % of calls cross a namespace and 0 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: medium — clean/modular boundaries expected. Measured over the .ex/.exs source only — this repository's .rs was not sampled for call sites, so this score covers part of the tree, not all of it.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
28 finding(s): 0 critical, 3 high, 19 medium, 6 low. semgrep hit a parse error in 62 file(s) — `.agents/skills/antithesis-mutation-testing/assets/mutation-testing/build-mutants.sh` (lines 168–170), `.agents/skills/antithesis-mutation-testing/assets/mutation-testing/clean.sh` (lines 16–158), `.agents/skills/antithesis-mutation-testing/assets/mutation-testing/sync-patches.sh` (line 52), `antithesis/entrypoints/health-marshall.sh` (line 3), `antithesis/entrypoints/health-satellite.sh` (line 4), … (+57 more) — 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. In 16 of those file(s) — `mila/windows-dotnet-smoke/DeviceKeyCustodySmoke.cs`, `mila/windows-dotnet-smoke/JourneyPages.cs`, `mila/windows-dotnet-smoke/JourneySmoke.cs`, `REDACTED`, `REDACTED`, … (+11 more) — the break is a C# primary constructor, which semgrep's grammar cannot parse and which hides the type from every rule scoped to it; those files were re-scanned from a shadow copy with the constructor's parameter list blanked (line and column preserving), which restores the type to the rules, and 0 additional row(s) came from that pass. Only the header's own parameter list is unread in them. In 3 of those file(s) — `REDACTED`, `mila/windows-dotnet-uia/PickerJourney.cs`, `mila/windows-dotnet/Interop/WindowsPushRegistration.cs` — the break is at a TYPE DECLARATION (a C# primary constructor semgrep's grammar cannot parse), so the loss is wider than the named lines: rules scoped to that type see no type to scope to and are blind over its whole body, while rules matching statements keep working there. Absence of a type-scoped finding in those types is not evidence of anything. Separately, one or more rules could not re-parse an embedded snippet in 7 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 6 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (6). — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 39 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (24), REDACTED (8), REDACTED (5). — One of this dimension's main actionable groups (39 warning-level).
Resolve the 12 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (10), REDACTED, REDACTED. — One of this dimension's main actionable groups (12 issue-level).
Resolve the 4 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 2 High IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Medium IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 warning-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.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 1320 of the 2101 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 7 platform declaration(s) and 11 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
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.
`MilaStrings` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Catalog; e.g. `Catalog` at line 22). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — mila/windows-dotnet/MilaStrings.cs:7
What to do
A `static` field is one slot for the whole process, however its type is created: back it with a thread-safe type (ConcurrentDictionary, Interlocked), take a lock around every write, or move it into a registered singleton that does.
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 the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
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 imperative guard methods that throw on violation) — this is NOT a claim that the code is unprotected. What's missing is a NAMED rule set: the guards encode the access rules inline, so the rules can't be listed, reviewed or tested apart from the call sites that apply them. Recommendation, not a defect.
What to do
Name the access rules — give each one a named predicate/policy object your guards consult, so the rule set can be reviewed and unit-tested independently of the call sites that enforce it.
Other · Domain Modelling — Whether aggregates reference each other by identity (id) rather than by direct object reference — the core DDD consistency-boundary rule.
Method: Roslyn (DDD-gated): aggregate roots identified by convention; each aggregate field checked for direct references to other aggregates versus id-only. Deterministic, DDD-native.
Coverage: Population: aggregate roots identified by AggregateRoot/IAggregateRoot base/interface NAME convention; reference-by-identity then checked exhaustively within that set — a root not using those names is invisible.
`Hmac` references the aggregate root `Sha256` directly (via `inner`) — hold its `Sha256Id` instead. — nix/domains/artifacts/terminald/src/crypto.rs:130
`Hmac` references the aggregate root `Sha256` directly (via `outer`) — hold its `Sha256Id` instead. — nix/domains/artifacts/terminald/src/crypto.rs:131
`IntakeLimit` references the aggregate root `Window` directly (via `host`) — hold its `WindowId` instead. — nix/domains/system/otel-guest/receiver/src/intake.rs:47
`Runtime` references the aggregate root `Store` directly (via `store`) — hold its `StoreId` instead. — nix/domains/system/otel-guest/receiver/src/request_recorder.rs:307
What to do
Reference other aggregates by their strongly-typed id, never by object reference, so each aggregate stays an independent consistency boundary.
Do you agree with this assessment?
DM10 · One transaction, one aggregate10.0 / 10Exemplary○ Nothing flagged
Other · Domain Modelling — Whether a single operation mutates more than one aggregate root. An aggregate is a consistency boundary, so saving two together fuses them into one — the second's invariants come to depend on the first's transaction, and the pair can no longer be separated. Reads of other aggregates are not counted.
Method: Neutral body surface (DDD-gated): every method body scanned for repository WRITE calls (Add/Update/Save/Remove/Delete/Insert/Store and their async forms), keyed on the ARGUMENT type rather than the repository type — three `IRepository<T>` writes collapse to one repository but are three distinct aggregates. Reads (Get/Find/Load/Query) are excluded, so loading another aggregate for context never counts. Score is offending methods over methods that write at all. Deterministic.
Other · Domain Modelling — Whether an aggregate can be constructed in a state its own rules forbid — a public constructor that takes a raw primitive, stores it, and validates nothing, with no factory beside it. A constructor taking only value objects is not counted: each parameter has already validated itself.
Method: Neutral surface (DDD-gated): each non-abstract entity/aggregate checked for a PUBLIC constructor taking at least one RAW PRIMITIVE parameter whose body contains no guard token (throw / Guard. / Ensure. / ArgumentException / CheckRule / an XException.ThrowIf* helper). C#: a static factory beside a public constructor does not exempt it, and a public parameterless constructor followed by public raw-primitive setters that refuse nothing is charged when the type also declares a validating way in (a guarded constructor or a guarding static method returning the type); TypeScript: a static Create/Of/From/New factory exempts the type. A constructor taking only value objects is never charged -- measured: 64 of 87 unguarded public constructors on the C# corpus take value objects only, so ignoring parameter types would be 73% false positives. One finding per entity. Deterministic.
Do you agree with this assessment?
DM12 · Ambient inputs in the domain10.0 / 10Exemplary○ Nothing flagged
Other · Domain Modelling — Whether domain types receive the time and randomness their rules depend on, rather than reading the process clock or a global random source directly — an ambient read makes the rule it feeds untestable at the instant that matters and lets two reads inside one operation disagree.
Method: Roslyn (DDD-gated, C#/VB only): domain-layer types scanned for ambient reads — DateTime/DateTimeOffset.Now/UtcNow/Today, Random.Shared, new Random(), Stopwatch.GetTimestamp — resolved against the semantic model, with a comment/string-stripped token fallback only where resolution fails. Body reads are scored; field/property initialisers are surfaced unscored. Apply/When folds excluded (ES1 owns them). Deterministic, symbol-resolved.
Do you agree with this assessment?
DM4 · Rich vs anemic model3.0 / 10Weak✓ Tool-verified
Other · Domain Modelling — Whether aggregates/entities carry the behaviour that protects their invariants, rather than being data bags driven by external services.
Method: Roslyn (DDD-gated): entity method BODIES classified mutator-vs-query — only methods that mutate the entity's own declared state count as invariant-protecting behaviour, so a getter/passthrough doesn't rescue an anemic class. Deterministic, exhaustive over domain-layer entities.
Coverage: Population: entities by name/base convention; rich-vs-anemic judged by classifying each method body mutator-vs-query — logic-bearing domain types outside the convention are invisible.
`Runtime` is an aggregate/entity with 3 data propert(ies) but no state-changing behaviour (only data and queries) — the business logic lives in a service. — nix/domains/system/otel-guest/receiver/src/request_recorder.rs:306
What to do
Move business rules onto the aggregates/entities they govern so invariants are enforced at the source, not in anemic services.
Other · Domain Modelling — Whether entities protect their state — private/init-only setters, and collections handed out as read-only views rather than the mutable backing collection — instead of exposing writable state that bypasses invariants. Softened when a rehydration framework (Marten/EF) is present.
Method: Roslyn (DDD-gated): entities scanned for publicly writable state — public setters, and (C#/VB) own mutable collections handed out through an auto-property, a public field or a bare-field expression getter, where a computed/copying getter is never charged. One finding per entity; score softened when Marten/EF rehydration frameworks present. Deterministic, framework-aware.
Coverage: Population: entities by convention; encapsulation (setter shape) checked exhaustively within the set.
Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies (EF/Marten/HTTP/ASP.NET) — the clean-architecture dependency rule.
Method: Roslyn (DDD-gated): domain-layer types scanned for infrastructure usage in member SIGNATURES and inside method/accessor BODIES — resolved calls and object-creations into EF/Marten/HTTP/Mongo/Redis/message-bus types (not just a namespace allowlist). Deterministic, symbol-resolved, exhaustive over domain-layer bodies, DDD-native.
Coverage: Domain layer identified by NAMESPACE heuristic; infrastructure then resolved by symbol in member SIGNATURES and method/accessor BODIES — rename the layer and the check evaporates.
Other · Event-Driven — Whether persisted/published domain events are named in the past tense (facts that happened) rather than imperatively.
Method: Roslyn scan (event-driven gated): domain and integration events checked for past-tense naming (-ed/-en suffix or irregular set). Naming nudge, low-weight advisory.
`UpdateRolledBack` is an imperative name inside a domain-event set whose siblings are past-tense facts — it reads as an intent, not something that happened. Name new events for the fact that occurred (e.g. `ItemAdded`). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe. — lyra/src/log.rs:12
What to do
Name new events in the past tense: they record facts that already happened. Do not rename an event that is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
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.
`audi/README.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `audi-private`, `porsche`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape. — audi/README.md:9
`galileo/README.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `ziggy`, `porsche`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape. — galileo/README.md:9
`protocol/README.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `peach`, `susan`, `audi-private`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape. — protocol/README.md:9
`ziggy/README.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `galileo`, `porsche`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape. — ziggy/README.md:8
`antithesis/scratchbook/sut-analysis.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `peach`, `protocol`, `susan`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape. — antithesis/scratchbook/sut-analysis.md:65
`antithesis/scratchbook/discovery/focus-01-architecture.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `peach`, `protocol`, `susan`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape. — antithesis/scratchbook/discovery/focus-01-architecture.md:36
What to do
Update audi/README.md so it draws the parts the code has today: add audi-private, porsche.
Update galileo/README.md so it draws the parts the code has today: add ziggy, porsche.
Update protocol/README.md so it draws the parts the code has today: add peach, susan, audi-private.
Update ziggy/README.md so it draws the parts the code has today: add galileo, porsche.
Update antithesis/scratchbook/sut-analysis.md so it draws the parts the code has today: add peach, protocol, susan.
Update antithesis/scratchbook/discovery/focus-01-architecture.md so it draws the parts the code has today: add peach, protocol, susan.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
No explicit version was found for the SwiftPM library declared by `Package.swift`. This check read nothing in Package.swift, which has no version field, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library's directory or at the repository root, or a semver release tag (or a Drupal `8.x-1.2` release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes. — mila/native/apple/Package.swift
No explicit version was found for the Go module library declared by `REDACTED`. This check read a `/vN` major-version suffix on the REDACTED module path, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library's directory or at the repository root, or a semver release tag (or a Drupal `8.x-1.2` release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes. — REDACTED
What to do
Declare the version where the ecosystem expects it, or keep a CHANGELOG with semver release headings, and follow semver for breaking changes.
Do you agree with this assessment?
P2 · Observability7.5 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 5/33 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `antithesis/fixtures`, `antithesis/integration`, `elixir/diagnostics/native/spool`, `enrico` and 23 more.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
`vendor/ash_scim/.github/dependabot.yml` schedules updates, but no `package-ecosystem` entry covers `github-actions`, `nuget`, `npm`, `cargo`, `gomod`, `pip`, `gradle`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the `updates:` list. — vendor/ash_scim/.github/dependabot.yml:6
What to do
Dependabot is configured but does not watch `github-actions`, `nuget`, `npm`, `cargo`, `gomod`, `pip`, `gradle` — add those `package-ecosystem` entries to .github/dependabot.yml so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Do you agree with this assessment?
P5 · DR & Backup10.0 / 10Exemplary✓ 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.
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.
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 the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
26 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
`.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). (×25) — mila/windows-dotnet-smoke/JourneySmoke.cs:201, REDACTED:224, REDACTED:234, …
What to do
Make the call chain async end-to-end and await it — never block on a Task with .Wait()/.GetAwaiter().GetResult().
Do you agree with this assessment?
R1 · Type Safety6.6 / 10Adequate✓ 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.
33 typed · 17 plain JS — the untyped files are buck/probes/esbuild/entry.mjs, buck/probes/esbuild/greeting.mjs, marshall/assets/js/android_display.js, marshall/assets/js/android_display_hook.js, marshall/assets/js/app.js, marshall/assets/js/dashboard.js (+11 more).
React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): 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. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.
marvin/scripts/build.mjs:14 · marvin/scripts/package.mjs:53 — the two spans are one implementation copied and then locally edited — 80 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. — marvin/scripts/build.mjs:14
scripts/check_contracts.mjs:116 · scripts/check_contracts.mjs:126 — 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. — scripts/check_contracts.mjs:116
marvin/scripts/chromium-smoke.mjs:65 · marvin/scripts/chromium-smoke.mjs:90 — the two spans are one implementation copied and then locally edited — 150 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. — marvin/scripts/chromium-smoke.mjs:65
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
(anonymous) has cyclomatic complexity 114 and cognitive complexity 187; 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. — marshall/scripts/localization_browser/probe.ts:56
(anonymous) has cyclomatic complexity 29 and cognitive complexity 45; 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. — marshall/assets/js/terminals.js:730
(anonymous) has cyclomatic complexity 29 and cognitive complexity 37; 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. — marshall/assets/js/terminals.js:802
(anonymous) has cyclomatic complexity 29 and cognitive complexity 32; 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. — marshall/assets/js/thread_composer.js:217
main has cyclomatic complexity 25 and cognitive complexity 23; 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. — nix/domains/artifacts/vscode-web/check-extension.mts:37
parseInputs has cyclomatic complexity 25 and cognitive complexity 17; 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. — nix/domains/artifacts/vscode-web/check-patches.mts:21
parseRequest has cyclomatic complexity 23 and cognitive complexity 19; 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. — REDACTED:25
verify has cyclomatic complexity 19 and cognitive complexity 23; 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. — marshall/assets/js/admin_elevation.js:117
verificationChallenge has cyclomatic complexity 18 and cognitive complexity 12; 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. — marshall/assets/js/admin_elevation.js:29
main has cyclomatic complexity 16 and cognitive complexity 18; 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. — scripts/check_contracts.mjs:331
(anonymous) has cyclomatic complexity 16 and cognitive complexity 12; 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. — marshall/assets/js/thread_composer.js:19
checkFiles has cyclomatic complexity 15 and cognitive complexity 24; 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. — scripts/check_contracts.mjs:173
renderSessions has cyclomatic complexity 15 and cognitive complexity 19; 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. — marshall/assets/js/terminals.js:996
captureRepositoryLaunch has cyclomatic complexity 15 and cognitive complexity 15; 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. — marshall/assets/js/repository_launch.js:42
extractNativeNotes has cyclomatic complexity 14 and cognitive complexity 26; 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. — scripts/check_contracts.mjs:105
isAccountService has cyclomatic complexity 14 and cognitive complexity 13; 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. — nix/domains/artifacts/vscode-web/check-no-account.mts:13
prepare has cyclomatic complexity 13 and cognitive complexity 20; 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. — nix/domains/artifacts/vscode-web/prepare-windows.mts:17
handleControl has cyclomatic complexity 13 and cognitive complexity 18; 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. — marshall/assets/js/terminals.js:534
select has cyclomatic complexity 13 and cognitive complexity 16; 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. — marshall/assets/js/terminals.js:1064
(anonymous) has cyclomatic complexity 13 and cognitive complexity 10; 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. — nix/verification/tests/machines/windows-editor/extension.ts:40
offGridElements has cyclomatic complexity 12 and cognitive complexity 15; 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. — marshall/assets/js/grid.js:41
(anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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. — marshall/scripts/localization_browser/probe.ts:8
(anonymous) has cyclomatic complexity 11 and cognitive complexity 16; 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. — marshall/assets/js/terminals.js:927
click has cyclomatic complexity 11 and cognitive complexity 12; 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. — marshall/assets/js/passkey.js:13
readClipboard has cyclomatic complexity 11 and cognitive complexity 10; 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. — marshall/assets/js/terminals.js:400
Do you agree with this assessment?
R3 · Large Files8.9 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
marshall/assets/js/terminals.js has 1178 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — marshall/assets/js/terminals.js: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 Coverage7.0 / 10Strong✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×12) — marshall/scripts/localization_browser/probe.ts:1, nix/domains/artifacts/vscode-web/check-runtime.mts:1, nix/domains/artifacts/vscode-web/prepare-windows.mts:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code9.3 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Unreachable from the 38 application, 2 tooling and 16 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 (38 application, 2 tooling, 16 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 (×5) — nix/domains/artifacts/vscode-web/prepare-windows.mts, nix/domains/artifacts/vscode-web/check-extension.mts, nix/domains/artifacts/vscode-web/maintenance-entry.ts, …
no import path from any entry point (38 application, 2 tooling, 16 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (buck/probes/esbuild/entry.mjs) — 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 — buck/probes/esbuild/greeting.mjs
This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. — marshall/assets/js/terminals.js:40
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.
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 nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
~0.9 `!` suppressions per 1k syntax nodes — 79 suppression(s) across the 83379 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
What to do
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
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 — 40 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 included — 65 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 user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC2 Forms & labels — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC3 Page structure — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC4 Keyboard semantics — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC5 ARIA correctness — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC6 Visual & motion safety — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AX1 Captive dependencies — no DI registrations detected
AX6 Interface segregation — AX6 reached only 20% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), c (725 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
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) — service "workload" has neither an image nor a build context specified: invalid compose project; 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 — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D11 Test Reliability — Test reliability not scored — polyglot repository, one half's runner produced no measurement
D16 Bus Factor — single-contributor repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution, but this repository's production source is mostly .c, .ex, .exs, .kt, .lua, .py, .rs, .swift, .ts — the .NET project files present are an immaterial minority — so the dimension does not apply.
D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go only; the exposed Rust, Swift surface was not measured.
D23 Boundary Type-Coupling — Cross-context type coupling could not be assessed — this codebase's bounded contexts are neither declared nor inferable.
D32 Data Compliance (PII/GDPR) — 40 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D8 Code Coverage — Coverage not measured — .NET suite
DM2 Strongly-typed ids — no id-bearing domain types detected — strongly-typed-id adoption not assessable
DM3 Integration-event coupling — no integration events detected — coupling check not applicable
DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
DM8 Value-object opportunities — not scored — the deterministic rule found 0 candidate clump(s); its rows are withheld until it has a measured precision of 95 % (a sample of fewer than 10 rows cannot show one)
DM9 Scattered domain decisions — Scattered domain decisions could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — Not assessed, and this one is on us: 1 command handler(s) or message consumer(s) were found here, but this check does not yet recognise persistence writes in this repository's language. Idempotency was neither confirmed nor ruled out — this is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — IC1 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — X1 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X12 Unreachable branch — X12 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X13 Undrained process stream — X13 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X16 Unfloored truncation loop — X16 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X18 Disposal-pattern correctness — X18 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X2 Cancellation propagation — X2 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X21 Side-effecting pattern guard — X21 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X22 Contradicted release guard — X22 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X25 Inert configuration knob — X25 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X27 Collection changed while being enumerated — X27 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X28 Index access outside its own emptiness guard — X28 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X29 Per-element action decided by a fixed element — X29 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X3 Exception handling — X3 reached only 3% of this repository's production lines — elixir (191,228 lines), rust (80,635 lines), python (42,701 lines), swift (5,558 lines), kotlin (4,486 lines), javascript (3,696 lines), c (725 lines), typescript (237 lines), lua (137 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
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.
EmptyCatchBlock mila/windows-dotnet-smoke/JourneyPages.cs:170— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet-smoke/JourneyPages.cs:194— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet-smoke/JourneySmoke.cs:437— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet-smoke/JourneySmoke.cs:452— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet-uia/LoopbackTrustListener.cs:105— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet-uia/PickerJourney.cs:112— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/Interop/DeploymentStore.cs:49— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/Interop/DeploymentStore.cs:59— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/Interop/DeploymentStore.cs:60— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/Interop/DeploymentStore.cs:61— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/Interop/SignInCoordinator.cs:244— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/Interop/WatchStream.cs:141— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/MainWindow.xaml.cs:122— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/MainWindow.xaml.cs:989— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
EmptyCatchBlock mila/windows-dotnet/MilaStrings.cs:39— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
DM1 · Aggregate boundaries· Aggregate holds a reference to another aggregate · ×4
Aggregate holds a reference to another aggregate: Hmac.inner nix/domains/artifacts/terminald/src/crypto.rs:130— `Hmac` references the aggregate root `Sha256` directly (via `inner`) — hold its `Sha256Id` instead.
Aggregate holds a reference to another aggregate: Hmac.outer nix/domains/artifacts/terminald/src/crypto.rs:131— `Hmac` references the aggregate root `Sha256` directly (via `outer`) — hold its `Sha256Id` instead.
Aggregate holds a reference to another aggregate: IntakeLimit.host nix/domains/system/otel-guest/receiver/src/intake.rs:47— `IntakeLimit` references the aggregate root `Window` directly (via `host`) — hold its `WindowId` instead.
Aggregate holds a reference to another aggregate: Runtime.store nix/domains/system/otel-guest/receiver/src/request_recorder.rs:307— `Runtime` references the aggregate root `Store` directly (via `store`) — hold its `StoreId` instead.
FileTooLong: live/threads_live.ex marshall/lib/marshall_web/live/threads_live.ex— FileTooLong — 2841 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 72 functions. The bar is 500 significant lines; this is 2341 over it, 5.68× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: vm/driver.ex lilly/lib/lilly/vm/driver.ex— FileTooLong — 1774 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 117 functions. The bar is 500 significant lines; this is 1274 over it, 3.55× 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: control/runtime.ex lilly/lib/lilly/control/runtime.ex— FileTooLong — 1383 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 74 functions. The bar is 500 significant lines; this is 883 over it, 2.77× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/gtk_journey.rs mila/native/linux/src/gtk_journey.rs— FileTooLong — 1369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 35 free functions. The bar is 500 significant lines; this is 869 over it, 2.74× 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: live/machines_live.ex marshall/lib/marshall_web/live/machines_live.ex— FileTooLong — 1365 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 865 over it, 2.73× 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: host/zfs_dataset.ex lilly/lib/lilly/host/zfs_dataset.ex— FileTooLong — 1332 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 95 functions. The bar is 500 significant lines; this is 832 over it, 2.66× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/session.rs mila/rust/mila-ffi/src/session.rs— FileTooLong — 1314 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 56 free functions. The bar is 500 significant lines; this is 814 over it, 2.63× 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: src/journey.rs mila/native/linux/src/journey.rs— FileTooLong — 1188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 34 free functions. The bar is 500 significant lines; this is 688 over it, 2.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: auto-update/runtime.py nix/domains/system/auto-update/runtime.py— FileTooLong — 1144 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 644 over it, 2.29× 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: ssh/commands.ex marshall/lib/marshall/ssh/commands.ex— FileTooLong — 1139 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 50 functions. The bar is 500 significant lines; this is 639 over it, 2.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: guest/server.py antithesis/emulation/guest/server.py— FileTooLong — 1070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 570 over it, 2.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: host/zfs.ex lilly/lib/lilly/host/zfs.ex— FileTooLong — 1036 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 69 functions. The bar is 500 significant lines; this is 536 over it, 2.07× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: marshall/github.ex marshall/lib/marshall/github.ex— FileTooLong — 1034 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 59 functions. The bar is 500 significant lines; this is 534 over it, 2.07× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: marshall/events.ex marshall/lib/marshall/events.ex— FileTooLong — 978 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 478 over it, 1.96× 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: scripts/monospace_browser_probe.py marshall/scripts/monospace_browser_probe.py— FileTooLong — 976 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 476 over it, 1.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: verification/identity.py antithesis/verification/identity.py— FileTooLong — 942 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 442 over it, 1.88× 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: src/views.rs mila/native/linux/src/views.rs— FileTooLong — 931 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 431 over it, 1.86× 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: src/session.rs nix/domains/artifacts/terminald/src/session.rs— FileTooLong — 924 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 68% of them inside a single declaration: Daemon (2 blocks, 154-1069). The bar is 500 significant lines; this is 424 over it, 1.85× 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: windows-dotnet/MainWindow.xaml.cs mila/windows-dotnet/MainWindow.xaml.cs— FileTooLong — 891 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 391 over it, 1.78× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/pages.rs mila/native/linux/src/pages.rs— FileTooLong — 887 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 387 over it, 1.77× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: js/terminals.js marshall/assets/js/terminals.js— FileTooLong — 866 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 366 over it, 1.73× 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: live/account_live.ex marshall/lib/marshall_web/live/account_live.ex— FileTooLong — 862 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 362 over it, 1.72× 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: agent/maintenance.rs lyra/src/agent/maintenance.rs— FileTooLong — 808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 308 over it, 1.62× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/session.rs lilly/native/hostd/src/session.rs— FileTooLong — 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 78% of them inside a single declaration: Session (2 blocks, 127-1180). The bar is 500 significant lines; this is 297 over it, 1.59× 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: admin/lilly_nodes_live.ex marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex— FileTooLong — 790 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 290 over it, 1.58× 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.
Hotspot: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:83— mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in MilaNativeUiKt.MilaNativeRoot at line 83. 16 of those changes were fix/bug commits, and the other 62 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt`: 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: mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:594— mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in SettingsView.body at line 594. 13 of those changes were fix/bug commits, and the other 59 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift`: 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:17— REDACTED changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Program.Main at line 17. 15 of those changes were fix/bug commits, and the other 40 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:26— mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in MilaRouteParser.parse at line 26. 14 of those changes were fix/bug commits, and the other 40 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift`: 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: mila/native/linux/src/main.rs mila/native/linux/src/main.rs:425— mila/native/linux/src/main.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in NativeState::ensure_window at line 425. 7 of those changes were fix/bug commits, and the other 72 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/linux/src/main.rs`: 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: mila/windows-dotnet/MainWindow.xaml.cs mila/windows-dotnet/MainWindow.xaml.cs:958— mila/windows-dotnet/MainWindow.xaml.cs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MainWindow.RefreshMachines at line 958. 14 of those changes were fix/bug commits, and the other 73 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/windows-dotnet/MainWindow.xaml.cs`: 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: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:24— mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MilaFfiAdapterKt.parseMilaRoute at line 24. 7 of those changes were fix/bug commits, and the other 39 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt`: 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: mila/windows-dotnet/Interop/RustNative.cs mila/windows-dotnet/Interop/RustNative.cs:23— mila/windows-dotnet/Interop/RustNative.cs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in MilaRouteParser.Parse at line 23. 2 of those changes were fix/bug commits, and the other 28 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/windows-dotnet/Interop/RustNative.cs`: 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: marshall/lib/marshall_web/live/threads_live.ex marshall/lib/marshall_web/live/threads_live.ex:905— marshall/lib/marshall_web/live/threads_live.ex changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ThreadsLive.load at line 905. 3 of those changes were fix/bug commits, and the other 20 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- marshall/lib/marshall_web/live/threads_live.ex`: 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: mila/native/linux/src/gtk_journey.rs mila/native/linux/src/gtk_journey.rs:1436— mila/native/linux/src/gtk_journey.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in Script::step at line 1436. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/linux/src/gtk_journey.rs`: 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: lilly/lib/lilly/vm/driver.ex lilly/lib/lilly/vm/driver.ex:574— lilly/lib/lilly/vm/driver.ex changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Driver.resume at line 574. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- lilly/lib/lilly/vm/driver.ex`: 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: lilly/native/hostd/src/policy.rs lilly/native/hostd/src/policy.rs:124— lilly/native/hostd/src/policy.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in lilly_hostd::policy::ip at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- lilly/native/hostd/src/policy.rs`: 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: antithesis/workload/recorder/scenarios.py antithesis/workload/recorder/scenarios.py:465— antithesis/workload/recorder/scenarios.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in scenarios.run_traces at line 465. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- antithesis/workload/recorder/scenarios.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: marshall/scripts/monospace_browser_probe.py marshall/scripts/monospace_browser_probe.py:1060— marshall/scripts/monospace_browser_probe.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in monospace_browser_probe.run at line 1060. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- marshall/scripts/monospace_browser_probe.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: marshall/lib/marshall/agents/model_calls.ex marshall/lib/marshall/agents/model_calls.ex:29— marshall/lib/marshall/agents/model_calls.ex changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ModelCalls.queue at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- marshall/lib/marshall/agents/model_calls.ex`: 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: mila/native/linux/src/pages.rs mila/native/linux/src/pages.rs:347— mila/native/linux/src/pages.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in mila_native_linux::pages::build_machines at line 347. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/linux/src/pages.rs`: 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: antithesis/verification/selection.py antithesis/verification/selection.py:331— antithesis/verification/selection.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in selection.validate_compose at line 331. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- antithesis/verification/selection.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: mila/native/linux/src/journey.rs mila/native/linux/src/journey.rs:603— mila/native/linux/src/journey.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in mila_native_linux::journey::run at line 603. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/linux/src/journey.rs`: 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: mila/native/linux/src/views.rs mila/native/linux/src/views.rs:475— mila/native/linux/src/views.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in mila_native_linux::views::build_terminal at line 475. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/linux/src/views.rs`: 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: lilly/native/hostd/src/lib.rs lilly/native/hostd/src/lib.rs:61— lilly/native/hostd/src/lib.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in lilly_hostd::parse_options at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- lilly/native/hostd/src/lib.rs`: 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: lilly/native/hostd/src/session.rs lilly/native/hostd/src/session.rs:319— lilly/native/hostd/src/session.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Session::handle at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- lilly/native/hostd/src/session.rs`: 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: mila/windows-dotnet/Interop/WindowsNotifications.cs mila/windows-dotnet/Interop/WindowsNotifications.cs:55— mila/windows-dotnet/Interop/WindowsNotifications.cs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MilaWindowsNotificationDevicesController.DecodeListing at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/windows-dotnet/Interop/WindowsNotifications.cs`: 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: lilly/lib/lilly/vm/executor.ex lilly/lib/lilly/vm/executor.ex:249— lilly/lib/lilly/vm/executor.ex changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Executor.reconcile at line 249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- lilly/lib/lilly/vm/executor.ex`: 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: antithesis/workload/repository/scenarios.py antithesis/workload/repository/scenarios.py:348— antithesis/workload/repository/scenarios.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in scenarios.run_native_admission_after_restart at line 348. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- antithesis/workload/repository/scenarios.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: nix/domains/system/auto-update/runtime.py nix/domains/system/auto-update/runtime.py:773— nix/domains/system/auto-update/runtime.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Deployment.preflight at line 773. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- nix/domains/system/auto-update/runtime.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Duplicated block (6 lines × 2) audi/lib/audi/config.ex:114— audi/lib/audi/config.ex:114-120 | porsche/lib/porsche/config.ex:26-31 — before extracting anything, compare `audi/lib/audi/config.ex` and `porsche/lib/porsche/config.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 46 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) audi/lib/audi/config.ex:371— audi/lib/audi/config.ex:371-376 | porsche/lib/porsche/config.ex:85-90 — before extracting anything, compare `audi/lib/audi/config.ex` and `porsche/lib/porsche/config.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 46 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 × 2) lilly/lib/lilly/inception/propagation.ex:117— lilly/lib/lilly/inception/propagation.ex:117-122 | marshall/lib/marshall/ingress/acme/propagation.ex:101-106 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) lilly/lib/lilly/transfer/checkpoint_transfer.ex:265— lilly/lib/lilly/transfer/checkpoint_transfer.ex:265-270 | lilly/lib/lilly/vm/checkpoint_storage.ex:637-642 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) marshall/lib/marshall/access/sharing.ex:139— marshall/lib/marshall/access/sharing.ex:139-144 | marshall/lib/marshall/threads/sharing.ex:133-139 — `marshall/lib/marshall/access/sharing.ex` and `marshall/lib/marshall/threads/sharing.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/access/sharing.ex:139` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) marshall/lib/marshall/agents/conversation.ex:87— marshall/lib/marshall/agents/conversation.ex:87-92 | marshall/lib/marshall/threads.ex:113-118 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marshall/lib/marshall/threads.ex:119` calls `error_reason` and `marshall/lib/marshall/agents/conversation.ex:93` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 2) marshall/lib/marshall/compute/evacuations.ex:156— marshall/lib/marshall/compute/evacuations.ex:156-161 | marshall/lib/marshall/compute/evacuations.ex:197-202 — 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) marshall/lib/marshall/compute/relocation_coordinator.ex:291— marshall/lib/marshall/compute/relocation_coordinator.ex:291-298 | marshall/lib/marshall/compute/relocation_probes.ex:255-260 — 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 `marshall/lib/marshall/compute/relocation_coordinator.ex:291` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) marshall/lib/marshall/editor/token.ex:25— marshall/lib/marshall/editor/token.ex:25-30 | marshall/lib/marshall/ssh/token.ex:27-32 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) marshall/lib/marshall_web/admin_elevation.ex:32— marshall/lib/marshall_web/admin_elevation.ex:32-37 | marshall/lib/marshall_web/components/layouts.ex:438-443 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall_web/admin_elevation.ex:32` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) ziggy/lib/ziggy/slo_checkpoint.ex:134— ziggy/lib/ziggy/slo_checkpoint.ex:134-141 | ziggy/lib/ziggy/spool.ex:366-371 — 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 (6 lines × 2) protocol/lib/overalls_protocol.ex:265— protocol/lib/overalls_protocol.ex:265-270 | protocol/lib/overalls_protocol/execution.ex:446-451 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) galileo/lib/galileo/http.ex:319— galileo/lib/galileo/http.ex:319-324 | ziggy/lib/ziggy/http.ex:625-630 — before extracting anything, compare `galileo/lib/galileo/http.ex` and `ziggy/lib/ziggy/http.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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 × 2) lilly/lib/lilly/clone/effects.ex:522— lilly/lib/lilly/clone/effects.ex:522-527 | lilly/lib/lilly/transfer/clone_copy.ex:478-486 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) lilly/lib/lilly/transfer/source_revocation.ex:29— lilly/lib/lilly/transfer/source_revocation.ex:29-34 | lilly/lib/lilly/transfer/source_snapshot_cleanup.ex:75-80 — 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 (6 lines × 2) marshall/lib/marshall/operations/galileo.ex:58— marshall/lib/marshall/operations/galileo.ex:58-63 | marshall/lib/marshall/operations/peach.ex:55-60 — 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 (6 lines × 2) lilly/lib/lilly/terminal/stream.ex:91— lilly/lib/lilly/terminal/stream.ex:91-96 | protocol/lib/overalls_protocol/control/client.ex:127-132 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `protocol/lib/overalls_protocol/control/client.ex:120` calls `handle_call` and `lilly/lib/lilly/terminal/stream.ex:85` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 2) marshall/lib/marshall/operations/inference.ex:57— marshall/lib/marshall/operations/inference.ex:57-62 | marshall/lib/marshall/operations/peach.ex:46-51 — 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 (6 lines × 2) protocol/lib/overalls_protocol/relocation_cleanup.ex:88— protocol/lib/overalls_protocol/relocation_cleanup.ex:88-93 | protocol/lib/overalls_protocol/relocation_receive.ex:88-93 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) audi/lib/audi/http/browser.ex:48— audi/lib/audi/http/browser.ex:48-53 | audi/lib/audi/http/editor_browser.ex:48-53 — before extracting anything, compare `audi/lib/audi/http/browser.ex` and `audi/lib/audi/http/editor_browser.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) audi/lib/audi/tls/fleet_material.ex:98— audi/lib/audi/tls/fleet_material.ex:98-103 | marshall/lib/marshall/ingress/acme/material.ex:98-103 — before extracting anything, compare `audi/lib/audi/tls/fleet_material.ex` and `marshall/lib/marshall/ingress/acme/material.ex` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 × 2) marshall/lib/marshall/compute/service_levels.ex:120— marshall/lib/marshall/compute/service_levels.ex:120-125 | marshall/lib/marshall/compute/workflow_service_levels.ex:273-278 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) ziggy/lib/ziggy/bootstrap_release.ex:13— ziggy/lib/ziggy/bootstrap_release.ex:13-18 | ziggy/lib/ziggy/tool_release.ex:14-19 — 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 (6 lines × 2) antithesis/emulation/host/runner.py:121— antithesis/emulation/host/runner.py:121-126 | antithesis/emulation/recorder/runner.py:106-111 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) antithesis/workload/satellite/scenarios.py:123— antithesis/workload/satellite/scenarios.py:123-129 | antithesis/workload/satellite/scenarios.py:151-156 — 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 `antithesis/workload/satellite/scenarios.py:123` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) mila/windows-dotnet/Interop/RustNative.cs:337— mila/windows-dotnet/Interop/RustNative.cs:337-343 | mila/windows-dotnet/Interop/RustNative.cs:432-438 — 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 `mila/windows-dotnet/Interop/RustNative.cs:337` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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) lilly/lib/lilly/terminal/vsock.ex:192— lilly/lib/lilly/terminal/vsock.ex:192-198 | lilly/lib/lilly/terminal/vsock.ex:264-270 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) lilly/lib/lilly/transfer/key_runtime.ex:81— lilly/lib/lilly/transfer/key_runtime.ex:81-87 | lilly/lib/lilly/transfer/source_runtime.ex:105-111 — before extracting anything, compare `lilly/lib/lilly/transfer/key_runtime.ex` and `lilly/lib/lilly/transfer/source_runtime.ex` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) marshall/lib/marshall/access/sharing.ex:56— marshall/lib/marshall/access/sharing.ex:56-62 | marshall/lib/marshall/teams/coordinator.ex:126-132 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) marshall/lib/marshall/compute/clone_placement.ex:66— marshall/lib/marshall/compute/clone_placement.ex:66-72 | marshall/lib/marshall/compute/resize.ex:136-142 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) marshall/lib/marshall/compute/relocation_destination_cleanups.ex:53— marshall/lib/marshall/compute/relocation_destination_cleanups.ex:53-59 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:47-53 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_destination_cleanups.ex` and `marshall/lib/marshall/compute/relocation_destination_revocations.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) marshall/lib/marshall/compute/relocation_revocations.ex:47— marshall/lib/marshall/compute/relocation_revocations.ex:47-53 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:48-54 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_revocations.ex` and `marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) marshall/lib/marshall/ingress/retention.ex:15— marshall/lib/marshall/ingress/retention.ex:15-21 | marshall/lib/marshall/ssh/retention.ex:16-22 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/ingress/retention.ex:15` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) marshall/lib/marshall/operations/galileo.ex:16— marshall/lib/marshall/operations/galileo.ex:16-22 | marshall/lib/marshall/operations/peach.ex:16-22 — 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 `marshall/lib/marshall/operations/galileo.ex:16` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) marshall/lib/marshall/redaction/coordinator.ex:87— marshall/lib/marshall/redaction/coordinator.ex:87-93 | marshall/lib/marshall/redaction/coordinator.ex:178-184 — 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 `marshall/lib/marshall/redaction/coordinator.ex:87` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) marshall/lib/marshall/ssh/authority.ex:183— marshall/lib/marshall/ssh/authority.ex:183-189 | marshall/lib/marshall/ssh/authority.ex:198-204 — 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) marshall/lib/marshall_web/admin_elevation.ex:49— marshall/lib/marshall_web/admin_elevation.ex:49-55 | marshall/lib/marshall_web/browser_messages.ex:83-90 — 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 `marshall/lib/marshall_web/admin_elevation.ex:49` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) marshall/lib/marshall/compute/lifecycle.ex:425— marshall/lib/marshall/compute/lifecycle.ex:425-431 | marshall/lib/marshall/compute/resize.ex:591-597 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) protocol/lib/overalls_protocol/relocation.ex:57— protocol/lib/overalls_protocol/relocation.ex:57-63 | protocol/lib/overalls_protocol/relocation.ex:84-90 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) marshall/lib/marshall/compute/service_levels.ex:69— marshall/lib/marshall/compute/service_levels.ex:69-75 | marshall/lib/marshall/compute/workflow_service_levels.ex:144-150 — 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 `marshall/lib/marshall/compute/service_levels.ex:69` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) lilly/lib/lilly/transfer/clone_copy_journal.ex:142— lilly/lib/lilly/transfer/clone_copy_journal.ex:142-148 | lilly/lib/lilly/transfer/import_journal.ex:84-90 — before extracting anything, compare `lilly/lib/lilly/transfer/clone_copy_journal.ex` and `lilly/lib/lilly/transfer/import_journal.ex` as WHOLE FILES: this scan already matched 5 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.
Duplicated block (7 lines × 2) ziggy/lib/ziggy/slo_checkpoint.ex:175— ziggy/lib/ziggy/slo_checkpoint.ex:175-181 | ziggy/lib/ziggy/spool.ex:457-463 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) galileo/lib/galileo/application.ex:34— galileo/lib/galileo/application.ex:34-40 | ziggy/lib/ziggy/application.ex:34-40 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `galileo/lib/galileo/application.ex:34` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) antithesis/emulation/guest/server.py:418— antithesis/emulation/guest/server.py:418-424 | antithesis/emulation/guest/server.py:689-695 — 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) antithesis/workload/admission/scenarios.py:346— antithesis/workload/admission/scenarios.py:346-352 | antithesis/workload/admission/scenarios.py:392-398 — 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) antithesis/workload/control/host_sessions.py:91— antithesis/workload/control/host_sessions.py:91-97 | antithesis/workload/terminal/oracle.py:102-108 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/control/host_sessions.py:91` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) antithesis/workload/repository/fixture.py:42— antithesis/workload/repository/fixture.py:42-48 | antithesis/workload/satellite/origin.py:62-68 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/repository/fixture.py:42` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) antithesis/workload/repository/observer.py:94— antithesis/workload/repository/observer.py:94-100 | antithesis/workload/repository/observer.py:134-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. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/repository/observer.py:94` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) nix/domains/system/auto-update/resources.py:413— nix/domains/system/auto-update/resources.py:413-419 | nix/domains/system/auto-update/runtime.py:318-324 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) lilly/native/transfer-stream/src/run.rs:88— lilly/native/transfer-stream/src/run.rs:88-94 | lilly/native/transfer-stream/src/run.rs:97-103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
+ 18 more in this group — see findings.md.
D4 · Code Duplication· Edited copy of a member (2 corresponding lines) · ×41
Edited copy of a member (2 corresponding lines) marshall/lib/marshall_web/ingress_known_hosts.ex:64— marshall/lib/marshall_web/ingress_known_hosts.ex:64-66 | protocol/lib/overalls_protocol/ssh_host_certificate.ex:159-160 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) protocol/lib/overalls_protocol/fleet_certificate.ex:89— protocol/lib/overalls_protocol/fleet_certificate.ex:89-92 | protocol/lib/overalls_protocol/ingress_route.ex:82-83 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) lilly/lib/lilly/lifecycle/image_template.ex:68— lilly/lib/lilly/lifecycle/image_template.ex:68-69 | marshall/lib/marshall/compute/enrollment_request.ex:102-103 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) brady/lib/brady/cache/recovery.ex:86— brady/lib/brady/cache/recovery.ex:86-87 | brady/lib/brady/metrics.ex:198-199 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) marshall/lib/marshall/accounts/git_username.ex:27— marshall/lib/marshall/accounts/git_username.ex:27-28 | protocol/lib/overalls_protocol/git_identity.ex:36-37 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) marshall/lib/marshall/ingress/environment_discovery.ex:10— marshall/lib/marshall/ingress/environment_discovery.ex:10-11 | marshall/lib/marshall/ingress/environment_streams.ex:19-22 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) protocol/lib/overalls_protocol/kernel_attestation.ex:100— protocol/lib/overalls_protocol/kernel_attestation.ex:100-101 | protocol/lib/overalls_protocol/readiness.ex:66-67 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) protocol/lib/overalls_protocol/ssh_command.ex:589— protocol/lib/overalls_protocol/ssh_command.ex:589-590 | protocol/lib/overalls_protocol/susan_poke.ex:67-68 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) antithesis/emulation/host/runner.py:157— antithesis/emulation/host/runner.py:157-160 | antithesis/emulation/storage/runner.py:158-159 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) audi/lib/audi/http/proxy.ex:252— audi/lib/audi/http/proxy.ex:252-253 | audi/lib/audi/private/front.ex:315-317 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) audi/lib/audi/config.ex:379— audi/lib/audi/config.ex:379-380 | porsche/lib/porsche/config.ex:93-94 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) protocol/lib/overalls_protocol/image_manifest.ex:468— protocol/lib/overalls_protocol/image_manifest.ex:468-469 | protocol/lib/overalls_protocol/native_admission.ex:91-92 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) audi/lib/audi/http/proxy.ex:266— audi/lib/audi/http/proxy.ex:266-267 | audi/lib/audi/private/front.ex:338-339 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) audi/lib/audi/privacy.ex:62— audi/lib/audi/privacy.ex:62-63 | porsche/lib/porsche/privacy.ex:53-54 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) lilly/lib/lilly/vm/credentials.ex:190— lilly/lib/lilly/vm/credentials.ex:190-191 | protocol/lib/overalls_protocol/image_manifest.ex:666-667 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) marshall/lib/marshall_web/ingress_api.ex:47— marshall/lib/marshall_web/ingress_api.ex:47-48 | marshall/lib/marshall_web/ssh_api.ex:37-38 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) protocol/lib/overalls_protocol/execution.ex:426— protocol/lib/overalls_protocol/execution.ex:426-427 | protocol/lib/overalls_protocol/ssh_command.ex:487-488 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) protocol/lib/overalls_protocol/github_tools.ex:123— protocol/lib/overalls_protocol/github_tools.ex:123-124 | scripts/localization_catalog_migration.ex:478-479 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) susan/lib/susan/provider/apns.ex:74— susan/lib/susan/provider/apns.ex:74-75 | susan/lib/susan/provider/fcm.ex:78-79 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) lilly/lib/lilly/transfer/destination_revocation.ex:45— lilly/lib/lilly/transfer/destination_revocation.ex:45-46 | lilly/lib/lilly/transfer/source_snapshot_cleanup.ex:126-127 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) antithesis/sdk/lib/overalls_antithesis/sdk.ex:194— antithesis/sdk/lib/overalls_antithesis/sdk.ex:194-195 | marshall/lib/marshall/operations/runtime_config.ex:405-408 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) audi/lib/audi/dns/wire.ex:132— audi/lib/audi/dns/wire.ex:132-133 | brady/lib/brady/tls/hello.ex:85-86 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) galileo/lib/galileo/http.ex:314— galileo/lib/galileo/http.ex:314-315 | ziggy/lib/ziggy/http.ex:620-621 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) lilly/lib/lilly/host/pool_queue.ex:34— lilly/lib/lilly/host/pool_queue.ex:34-35 | lilly/lib/lilly/host/template_steward.ex:19-20 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (2 corresponding lines) marshall/lib/marshall/access/sharing.ex:159— marshall/lib/marshall/access/sharing.ex:159-160 | marshall/lib/marshall/threads/sharing.ex:154-155 — These two members are one piece of code written twice and then edited apart: 2 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.
+ 16 more in this group — see findings.md.
D30 · Dependency Vulnerabilities· Medium CVE · ×39
Duplicated block (5 lines × 2) mila/windows-dotnet/Interop/PokeKeyStore.cs:64— mila/windows-dotnet/Interop/PokeKeyStore.cs:64-72 | mila/windows-dotnet/Interop/SnapshotStore.cs:55-59 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) mila/windows-dotnet/Interop/RustNative.cs:606— mila/windows-dotnet/Interop/RustNative.cs:606-610 | mila/windows-dotnet/Interop/RustNative.cs:626-630 — 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 `mila/windows-dotnet/Interop/RustNative.cs:606` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) mila/windows-dotnet/Interop/RustNativeLifecycle.cs:244— mila/windows-dotnet/Interop/RustNativeLifecycle.cs:244-248 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:352-356 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `mila/windows-dotnet/Interop/RustNativeLifecycle.cs:357` calls `Alloc` and `mila/windows-dotnet/Interop/RustNativeLifecycle.cs:249` 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 (5 lines × 2) lilly/lib/lilly/host/hostd.ex:416— lilly/lib/lilly/host/hostd.ex:416-420 | lilly/lib/lilly/host/hostd.ex:476-480 — 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 `lilly/lib/lilly/host/hostd.ex:416` 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) lilly/lib/lilly/transfer/permit_journal.ex:89— lilly/lib/lilly/transfer/permit_journal.ex:89-93 | lilly/lib/lilly/transfer/permit_journal.ex:185-190 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) marshall/lib/marshall/agents/executor_session.ex:69— marshall/lib/marshall/agents/executor_session.ex:69-73 | marshall/lib/marshall/agents/executor_session.ex:646-650 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) marshall/lib/marshall/compute/evacuation_views.ex:176— marshall/lib/marshall/compute/evacuation_views.ex:176-183 | marshall/lib/marshall/compute/evacuation_views.ex:220-224 — 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 `marshall/lib/marshall/compute/evacuation_views.ex:176` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) marshall/lib/marshall/ssh/guest_access.ex:22— marshall/lib/marshall/ssh/guest_access.ex:22-26 | marshall/lib/marshall/ssh/guest_access.ex:63-67 — 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 `marshall/lib/marshall/ssh/guest_access.ex:22` 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) audi/lib/audi/tls/fleet_material.ex:124— audi/lib/audi/tls/fleet_material.ex:124-128 | marshall/lib/marshall/ingress/acme/material.ex:124-128 — before extracting anything, compare `audi/lib/audi/tls/fleet_material.ex` and `marshall/lib/marshall/ingress/acme/material.ex` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/tls/fleet_material.ex:124` 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) lilly/lib/lilly/observability.ex:23— lilly/lib/lilly/observability.ex:23-27 | marshall/lib/marshall/observability.ex:43-47 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) lilly/lib/lilly/transfer/clone_copy_journal.ex:247— lilly/lib/lilly/transfer/clone_copy_journal.ex:247-251 | lilly/lib/lilly/transfer/import_journal.ex:288-292 — before extracting anything, compare `lilly/lib/lilly/transfer/clone_copy_journal.ex` and `lilly/lib/lilly/transfer/import_journal.ex` as WHOLE FILES: this scan already matched 5 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `lilly/lib/lilly/transfer/import_journal.ex:295` calls `encoded_stream`, `encode_descriptor` and `lilly/lib/lilly/transfer/clone_copy_journal.ex:254` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) marshall/lib/marshall_web/ingress_api.ex:161— marshall/lib/marshall_web/ingress_api.ex:161-165 | marshall/lib/marshall_web/ssh_api.ex:96-100 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) marshall/lib/marshall_web/live/account_live.ex:421— marshall/lib/marshall_web/live/account_live.ex:421-425 | marshall/lib/marshall_web/live_admin_auth.ex:220-224 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) ziggy/lib/ziggy/bootstrap_release.ex:52— ziggy/lib/ziggy/bootstrap_release.ex:52-56 | ziggy/lib/ziggy/tool_release.ex:54-58 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) marshall/lib/marshall/operations/executor_bootstrap.ex:15— marshall/lib/marshall/operations/executor_bootstrap.ex:15-19 | marshall/lib/marshall/operations/git_hub_tools.ex:15-19 — before extracting anything, compare `marshall/lib/marshall/operations/executor_bootstrap.ex` and `marshall/lib/marshall/operations/git_hub_tools.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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 `marshall/lib/marshall/operations/executor_bootstrap.ex:15` 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) audi/lib/audi/http/proxy.ex:233— audi/lib/audi/http/proxy.ex:233-237 | audi/lib/audi/private/front.ex:296-300 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/http/proxy.ex:233` 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) lilly/lib/lilly/host/zfs.ex:650— lilly/lib/lilly/host/zfs.ex:650-654 | lilly/lib/lilly/host/zfs.ex:678-682 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) lilly/lib/lilly/vm/checkpoint_storage.ex:484— lilly/lib/lilly/vm/checkpoint_storage.ex:484-488 | lilly/lib/lilly/vm/checkpoint_storage.ex:492-496 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) marshall/lib/marshall/agents/skills.ex:642— marshall/lib/marshall/agents/skills.ex:642-646 | marshall/lib/marshall/threads/sharing.ex:180-184 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) marshall/lib/marshall/operations/executor_bootstrap.ex:44— marshall/lib/marshall/operations/executor_bootstrap.ex:44-48 | marshall/lib/marshall/operations/git_hub_tools.ex:44-48 — before extracting anything, compare `marshall/lib/marshall/operations/executor_bootstrap.ex` and `marshall/lib/marshall/operations/git_hub_tools.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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 (5 lines × 2) marshall/lib/marshall_web/ingress_api.ex:59— marshall/lib/marshall_web/ingress_api.ex:59-63 | marshall/lib/marshall_web/ssh_api.ex:44-48 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) marshall/lib/marshall_web/terminal_gateway_api.ex:75— marshall/lib/marshall_web/terminal_gateway_api.ex:75-79 | marshall/lib/marshall_web/terminal_socket.ex:20-24 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) marshall/scripts/locale_catalog_review.exs:28— marshall/scripts/locale_catalog_review.exs:28-32 | scripts/localization_catalog_migration.ex:440-444 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/scripts/locale_catalog_review.exs:28` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) antithesis/emulation/host/bootstrap.py:51— antithesis/emulation/host/bootstrap.py:51-55 | antithesis/emulation/host/runner.py:67-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.
Duplicated block (5 lines × 2) antithesis/workload/recorder/client.py:236— antithesis/workload/recorder/client.py:236-242 | audi/priv/private_pki/authority.py:221-225 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) lilly/lib/lilly/host/zfs_dataset.ex:1302— lilly/lib/lilly/host/zfs_dataset.ex:1302-1311 | lilly/lib/lilly/vm/checkpoint_storage.ex:151-158 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/host/zfs_dataset.ex:1302` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lilly/lib/lilly/vm/checkpoint_storage.ex:150` calls `to_string`, `checkpoint_bytes` and `lilly/lib/lilly/host/zfs_dataset.ex:1301` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 2) lilly/lib/lilly/observability.ex:122— lilly/lib/lilly/observability.ex:122-129 | porsche/lib/porsche/observability.ex:260-267 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/observability.ex:122` 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 × 2) lilly/lib/lilly/transfer/import_journal.ex:143— lilly/lib/lilly/transfer/import_journal.ex:143-150 | lilly/lib/lilly/transfer/import_journal.ex:180-187 — 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) marshall/lib/marshall/access/sharing.ex:120— marshall/lib/marshall/access/sharing.ex:120-127 | marshall/lib/marshall/threads/sharing.ex:119-126 — `marshall/lib/marshall/access/sharing.ex` and `marshall/lib/marshall/threads/sharing.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marshall/lib/marshall/threads/sharing.ex:117` calls `list`, `t` and `marshall/lib/marshall/access/sharing.ex:117` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 2) marshall/lib/marshall/accounts/account_lifecycle.ex:137— marshall/lib/marshall/accounts/account_lifecycle.ex:137-144 | marshall/lib/marshall/accounts/administrators.ex: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 both call sites, so a change lands once.
Duplicated block (8 lines × 2) marshall/lib/marshall/agents/context_manifest.ex:146— marshall/lib/marshall/agents/context_manifest.ex:146-153 | marshall/lib/marshall/agents/context_manifest.ex:191-198 — 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 `marshall/lib/marshall/agents/context_manifest.ex:146` 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 × 2) marshall/lib/marshall/ingress/acme/issuer.ex:20— marshall/lib/marshall/ingress/acme/issuer.ex:20-27 | marshall/lib/marshall/ingress/acme/issuer.ex:42-49 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/ingress/acme/issuer.ex:20` 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 × 2) marshall/lib/marshall/ingress/sessions.ex:108— marshall/lib/marshall/ingress/sessions.ex:108-115 | marshall/lib/marshall/ssh/authority.ex:113-120 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) marshall/lib/marshall/ssh/admin_actions.ex:55— marshall/lib/marshall/ssh/admin_actions.ex:55-62 | marshall/lib/marshall/ssh/admin_actions.ex:120-127 — 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 `marshall/lib/marshall/ssh/admin_actions.ex:55` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marshall/lib/marshall/ssh/admin_actions.ex:54` calls `for_read` and `marshall/lib/marshall/ssh/admin_actions.ex:119` 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 (8 lines × 2) marshall/lib/marshall_web/live/account_live.ex:447— marshall/lib/marshall_web/live/account_live.ex:447-454 | marshall/lib/marshall_web/live/integrations_live.ex:179-189 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) protocol/lib/overalls_protocol/editor_stream.ex:35— protocol/lib/overalls_protocol/editor_stream.ex:35-42 | protocol/lib/overalls_protocol/web_stream.ex:41-48 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) galileo/lib/galileo/http.ex:293— galileo/lib/galileo/http.ex:293-300 | ziggy/lib/ziggy/http.ex:599-606 — before extracting anything, compare `galileo/lib/galileo/http.ex` and `ziggy/lib/ziggy/http.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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 × 2) galileo/lib/galileo/http.ex:304— galileo/lib/galileo/http.ex:304-311 | ziggy/lib/ziggy/http.ex:610-617 — before extracting anything, compare `galileo/lib/galileo/http.ex` and `ziggy/lib/ziggy/http.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `galileo/lib/galileo/http.ex:304` 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 × 2) lilly/lib/lilly/transfer/destination_cleanup.ex:104— lilly/lib/lilly/transfer/destination_cleanup.ex:104-111 | lilly/lib/lilly/transfer/destination_revocation.ex:35-42 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) marshall/lib/marshall/galileo/credentials.ex:120— marshall/lib/marshall/galileo/credentials.ex:120-127 | marshall/lib/marshall/peach/credentials.ex:120-127 — `marshall/lib/marshall/galileo/credentials.ex` and `marshall/lib/marshall/peach/credentials.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (8 lines × 2) marshall/lib/marshall/editor/authority.ex:180— marshall/lib/marshall/editor/authority.ex:180-187 | marshall/lib/marshall/ingress/web_streams.ex:95-102 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) antithesis/workload/access/mail.py:80— antithesis/workload/access/mail.py:80-87 | antithesis/workload/access/mail.py:104-111 — 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 `antithesis/workload/access/mail.py:80` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) antithesis/workload/access/mail.py:89— antithesis/workload/access/mail.py:89-96 | antithesis/workload/access/mail.py:113-120 — 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 `antithesis/workload/access/mail.py:89` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) antithesis/workload/control/delivery.py:186— antithesis/workload/control/delivery.py:186-193 | antithesis/workload/control/delivery.py:203-210 — 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) antithesis/workload/repository/fixture.py:28— antithesis/workload/repository/fixture.py:28-35 | antithesis/workload/satellite/origin.py:48-55 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) nix/domains/artifacts/guest/native-kernels/illumos/extract_listener_reset.py:17— nix/domains/artifacts/guest/native-kernels/illumos/extract_listener_reset.py:17-25 | nix/domains/artifacts/guest/native-kernels/illumos/extract_viosock_lifetime.py:16-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) REDACTED:515— REDACTED:515-522 | REDACTED:573-580 — 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) nix/domains/system/fleet-exporter/exporter.py:212— nix/domains/system/fleet-exporter/exporter.py:212-219 | nix/domains/system/logging/health.py:218-225 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `nix/domains/system/fleet-exporter/exporter.py:223` calls `BoundedSemaphore` and `nix/domains/system/logging/health.py:228` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 2) lilly/native/hostd/src/files.rs:146— lilly/native/hostd/src/files.rs:146-153 | lilly/native/hostd/src/mounts.rs:37-44 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) lilly/native/resume-token/src/cli.rs:6— lilly/native/resume-token/src/cli.rs:6-13 | lilly/native/transfer-stream/src/cli.rs:22-29 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:54— antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:54-62 | lilly/lib/lilly/host/ownership.ex:62-70 — before extracting anything, compare `antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex` and `lilly/lib/lilly/host/ownership.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:54` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lilly/lib/lilly/host/ownership.ex:61` calls `run` and `antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:53` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) audi/lib/audi/slo.ex:86— audi/lib/audi/slo.ex:86-94 | marshall/lib/marshall/slo.ex:130-138 — before extracting anything, compare `audi/lib/audi/slo.ex` and `marshall/lib/marshall/slo.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/slo.ex:86` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) galileo/lib/galileo/http.ex:30— galileo/lib/galileo/http.ex:30-38 | ziggy/lib/ziggy/http.ex:32-40 — before extracting anything, compare `galileo/lib/galileo/http.ex` and `ziggy/lib/ziggy/http.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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 × 2) lilly/lib/lilly/ingress/server.ex:18— lilly/lib/lilly/ingress/server.ex:18-26 | lilly/lib/lilly/private/server.ex:11-19 — `lilly/lib/lilly/ingress/server.ex` and `lilly/lib/lilly/private/server.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (9 lines × 2) lilly/lib/lilly/ingress/server.ex:41— lilly/lib/lilly/ingress/server.ex:41-49 | lilly/lib/lilly/private/server.ex:34-42 — `lilly/lib/lilly/ingress/server.ex` and `lilly/lib/lilly/private/server.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/ingress/server.ex:41` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lilly/lib/lilly/ingress/server.ex:40` calls `maximum` and `lilly/lib/lilly/private/server.ex:33` 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 (9 lines × 2) lilly/lib/lilly/vm/disk.ex:325— lilly/lib/lilly/vm/disk.ex:325-333 | lilly/lib/lilly/vm/disk.ex:432-440 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) lilly/lib/lilly/vm/driver.ex:486— lilly/lib/lilly/vm/driver.ex:486-494 | lilly/lib/lilly/vm/driver.ex:576-584 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) marshall/lib/marshall/compute/evacuation_views.ex:121— marshall/lib/marshall/compute/evacuation_views.ex:121-129 | marshall/lib/marshall/compute/evacuation_views.ex:207-215 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) marshall/lib/marshall/galileo/authorizations.ex:191— marshall/lib/marshall/galileo/authorizations.ex:191-199 | marshall/lib/marshall/inference/requests.ex:195-203 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/galileo/authorizations.ex:191` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) marshall/lib/marshall/redaction/coordinator.ex:64— marshall/lib/marshall/redaction/coordinator.ex:64-72 | marshall/lib/marshall/redaction/coordinator.ex:81-89 — 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 `marshall/lib/marshall/redaction/coordinator.ex:64` 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) marshall/lib/marshall/redaction/coordinator.ex:168— marshall/lib/marshall/redaction/coordinator.ex:168-176 | marshall/lib/marshall/redaction/coordinator.ex:181-189 — 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 `marshall/lib/marshall/redaction/coordinator.ex:168` 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) ziggy/lib/ziggy/agent_worker.ex:199— ziggy/lib/ziggy/agent_worker.ex:199-207 | ziggy/lib/ziggy/http.ex:582-590 — 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 `ziggy/lib/ziggy/agent_worker.ex:199` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) lilly/lib/lilly/vm/executor.ex:135— lilly/lib/lilly/vm/executor.ex:135-143 | lilly/lib/lilly/vm/executor.ex:165-173 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) audi/lib/audi/privacy.ex:112— audi/lib/audi/privacy.ex:112-120 | porsche/lib/porsche/privacy.ex:82-90 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/privacy.ex:112` 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) marshall/lib/marshall/agents/executor_session.ex:689— marshall/lib/marshall/agents/executor_session.ex:689-697 | marshall/lib/marshall/agents/prompt.ex:264-272 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) lilly/lib/lilly/transfer/received_dataset.ex:259— lilly/lib/lilly/transfer/received_dataset.ex:259-267 | lilly/lib/lilly/transfer/received_dataset.ex:306-314 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) antithesis/workload/access/oracle.py:46— antithesis/workload/access/oracle.py:46-54 | antithesis/workload/admission/oracle.py:201-209 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/access/oracle.py:46` 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 (9 lines × 2) antithesis/workload/admission/client.py:138— antithesis/workload/admission/client.py:138-146 | antithesis/workload/guest_lifecycle/operation.py:151-159 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/admission/client.py:138` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `antithesis/workload/guest_lifecycle/operation.py:160` calls `get` and `antithesis/workload/admission/client.py:147` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) antithesis/workload/admission/oracle.py:72— antithesis/workload/admission/oracle.py:72-80 | antithesis/workload/terminal/oracle.py:85-93 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/admission/oracle.py:72` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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) antithesis/workload/control/oracle.py:45— antithesis/workload/control/oracle.py:45-53 | antithesis/workload/control/oracle.py:106-114 — 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) antithesis/workload/repository/client.py:64— antithesis/workload/repository/client.py:64-72 | antithesis/workload/repository/client.py:84-92 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/repository/client.py:64` 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 (9 lines × 2) nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:85— nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:85-95 | REDACTED:260-268 — 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 `nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:85` 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 (9 lines × 2) nix/domains/system/backups/common.py:78— nix/domains/system/backups/common.py:78-86 | nix/domains/system/backups/restic.py:84-92 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) lilly/native/hostd/src/exec.rs:501— lilly/native/hostd/src/exec.rs:501-509 | lilly/native/hostd/src/exec.rs:700-708 — 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 `lilly/native/hostd/src/exec.rs:501` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) lilly/native/hostd/src/protocol.rs:726— lilly/native/hostd/src/protocol.rs:726-734 | lilly/native/hostd/src/protocol.rs:745-753 — 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 `lilly/native/hostd/src/protocol.rs:745` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lilly/native/hostd/src/protocol.rs:744` calls `extend` and `lilly/native/hostd/src/protocol.rs:725` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
+ 9 more in this group — see findings.md.
D4 · Code Duplication· Edited copy of a member (4 corresponding lines) · ×30
Edited copy of a member (4 corresponding lines) marshall/lib/marshall/ingress/acme/request.ex:142— marshall/lib/marshall/ingress/acme/request.ex:142-149 | marshall/lib/marshall/operations/runtime_config.ex:362-365 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) protocol/lib/overalls_protocol/editor_login.ex:60— protocol/lib/overalls_protocol/editor_login.ex:60-63 | protocol/lib/overalls_protocol/web_login.ex:69-72 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) lilly/lib/lilly/transfer/ssh.ex:176— lilly/lib/lilly/transfer/ssh.ex:176-181 | lilly/lib/lilly/transfer/ssh.ex:191-194 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) lilly/lib/lilly/host/zfs.ex:1329— lilly/lib/lilly/host/zfs.ex:1329-1332 | lilly/lib/lilly/host/zfs_dataset.ex:1739-1742 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) protocol/lib/overalls_protocol/relocation_import.ex:22— protocol/lib/overalls_protocol/relocation_import.ex:22-25 | protocol/lib/overalls_protocol/execution.ex:190-193 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) protocol/lib/overalls_protocol/relocation_receive.ex:49— protocol/lib/overalls_protocol/relocation_receive.ex:49-52 | protocol/lib/overalls_protocol/relocation_source.ex:64-67 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) elixir/request_accounting/lib/overalls/request_accounting/config.ex:89— elixir/request_accounting/lib/overalls/request_accounting/config.ex:89-92 | elixir/request_accounting/lib/overalls/request_accounting/recorder_rpc.ex:80-83 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) lilly/lib/lilly/inception/propagation.ex:147— lilly/lib/lilly/inception/propagation.ex:147-151 | marshall/lib/marshall/ingress/acme/propagation.ex:145-148 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaSnapshots.swift:19— mila/native/apple/Sources/MilaNativeUI/MilaSnapshots.swift:19-22 | mila/native/apple/Sources/MilaNativeUI/MilaSoftwareDeviceKeyStore.swift:16-19 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) protocol/lib/overalls_protocol/susan_poke.ex:198— protocol/lib/overalls_protocol/susan_poke.ex:198-201 | susan/lib/susan/poke/request.ex:106-109 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) audi/lib/audi/http/browser.ex:95— audi/lib/audi/http/browser.ex:95-98 | audi/lib/audi/http/editor_browser.ex:95-98 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) marshall/lib/marshall/ssh/guest_access.ex:203— marshall/lib/marshall/ssh/guest_access.ex:203-210 | marshall/lib/marshall/accounts/security.ex:23-26 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) audi/lib/audi/dns/server.ex:138— audi/lib/audi/dns/server.ex:138-142 | audi/lib/audi/relay/server.ex:99-102 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) antithesis/operator/fixture.ex:373— antithesis/operator/fixture.ex:373-376 | antithesis/operator/integrations.ex:276-279 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) audi/lib/audi/ssh/listener.ex:120— audi/lib/audi/ssh/listener.ex:120-123 | porsche/lib/porsche/listener.ex:134-137 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) lilly/lib/lilly/host/backup_snapshot.ex:198— lilly/lib/lilly/host/backup_snapshot.ex:198-201 | lilly/lib/lilly/transfer/snapshot_ownership.ex:54-57 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) lilly/lib/lilly/vm/driver.ex:1390— lilly/lib/lilly/vm/driver.ex:1390-1393 | lilly/lib/lilly/vm/workspace_source.ex:272-275 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) marshall/lib/marshall/compute/relocation_receives.ex:248— marshall/lib/marshall/compute/relocation_receives.ex:248-251 | marshall/lib/marshall/compute/relocation_sources.ex:224-227 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) marshall/lib/marshall/operations/audi.ex:164— marshall/lib/marshall/operations/audi.ex:164-167 | protocol/lib/overalls_protocol/ingress_relay.ex:50-56 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) marshall/lib/marshall/compute/relocation_receives.ex:89— marshall/lib/marshall/compute/relocation_receives.ex:89-92 | marshall/lib/marshall/compute/relocation_sources.ex:88-91 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) marshall/lib/marshall_web/control_api.ex:67— marshall/lib/marshall_web/control_api.ex:67-70 | marshall/lib/marshall_web/terminal_gateway_api.ex:98-101 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) antithesis/workload/core/config.py:96— antithesis/workload/core/config.py:96-99 | antithesis/workload/core/profile_readiness.py:37-40 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) audi/lib/audi/http/proxy.ex:270— audi/lib/audi/http/proxy.ex:270-273 | audi/lib/audi/private/front.ex:342-345 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) lyra/src/bin/overalls-agentd-windows.rs:32— lyra/src/bin/overalls-agentd-windows.rs:32-35 | lyra/src/bin/overalls-native-agentd.rs:22-25 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) audi/lib/audi/ssh/proof.ex:84— audi/lib/audi/ssh/proof.ex:84-87 | porsche/lib/porsche/ssh/proof.ex:87-90 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
+ 5 more in this group — see findings.md.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×27
Edited copy of a member (9 corresponding lines) mila/windows-dotnet/Interop/RustNative.cs:602— mila/windows-dotnet/Interop/RustNative.cs:602-610 | mila/windows-dotnet/Interop/RustNative.cs:622-630 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) audi/lib/audi/http/authority.ex:43— audi/lib/audi/http/authority.ex:43-51 | audi/lib/audi/inception/authority.ex:48-56 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) mila/rust/mila-runtime/src/screen.rs:315— mila/rust/mila-runtime/src/screen.rs:315-323 | mila/rust/mila-runtime/src/screen.rs:325-333 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) protocol/lib/overalls_protocol/ingress_route.ex:53— protocol/lib/overalls_protocol/ingress_route.ex:53-77 | protocol/lib/overalls_protocol/ingress_wake.ex:11-19 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) audi/lib/audi/config.ex:252— audi/lib/audi/config.ex:252-260 | porsche/lib/porsche/config.ex:69-77 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) nix/verification/hegel/python/hegel/statemachine.py:137— nix/verification/hegel/python/hegel/statemachine.py:137-145 | nix/verification/hegel/python/hegel/statemachine.py:148-162 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) marshall/lib/marshall_web/live/admin/audit_live.ex:158— marshall/lib/marshall_web/live/admin/audit_live.ex:158-166 | marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex:178-190 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) REDACTED:102— REDACTED:102-115 | REDACTED:119-127 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) marshall/lib/marshall/terminal/host_stream.ex:315— marshall/lib/marshall/terminal/host_stream.ex:315-324 | marshall/lib/marshall/terminal/host_stream.ex:403-411 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) marshall/lib/marshall/control/socket.ex:86— marshall/lib/marshall/control/socket.ex:86-94 | marshall/lib/marshall/control/socket.ex:98-106 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) marshall/lib/marshall/notifications/device_actions.ex:104— marshall/lib/marshall/notifications/device_actions.ex:104-112 | marshall/lib/marshall/ssh/key_actions.ex:26-34 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) lilly/lib/lilly/clone/effects.ex:416— lilly/lib/lilly/clone/effects.ex:416-424 | lilly/lib/lilly/transfer/receiver.ex:181-189 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) antithesis/workload/control/dispatch.py:58— antithesis/workload/control/dispatch.py:58-68 | antithesis/workload/control/host_sessions.py:126-134 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) lyra/src/bin/overalls-agentd-windows.rs:81— lyra/src/bin/overalls-agentd-windows.rs:81-89 | lyra/src/bin/overalls-native-agentd.rs:61-69 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) lyra/src/sys/windows/net_api.rs:130— lyra/src/sys/windows/net_api.rs:130-149 | lyra/src/sys/windows/net_api.rs:182-190 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) marshall/lib/marshall/agents/bootstrap.ex:249— marshall/lib/marshall/agents/bootstrap.ex:249-257 | marshall/lib/marshall/agents/maintenance.ex:198-210 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) marshall/lib/marshall_web/live/account_live.ex:446— marshall/lib/marshall_web/live/account_live.ex:446-454 | marshall/lib/marshall_web/live/integrations_live.ex:176-189 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) marshall/lib/marshall_web/controllers/git_hub_connection_controller.ex:14— marshall/lib/marshall_web/controllers/git_hub_connection_controller.ex:14-22 | marshall/lib/marshall_web/controllers/git_hub_connection_controller.ex:28-38 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) protocol/lib/overalls_protocol/view.ex:158— protocol/lib/overalls_protocol/view.ex:158-166 | protocol/lib/overalls_protocol/view.ex:170-178 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) nix/domains/artifacts/terminald/src/session.rs:1227— nix/domains/artifacts/terminald/src/session.rs:1227-1235 | nix/domains/artifacts/terminald/src/session.rs:1260-1269 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) audi/lib/audi/ssh/listener.ex:127— audi/lib/audi/ssh/listener.ex:127-135 | porsche/lib/porsche/listener.ex:141-149 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) lyra/src/sys/windows/trust.rs:19— lyra/src/sys/windows/trust.rs:19-36 | lyra/src/sys/windows/services.rs:29-37 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) lyra/src/sys/socket.rs:94— lyra/src/sys/socket.rs:94-103 | nix/domains/artifacts/terminald/src/sys/pty.rs:73-81 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) marshall/lib/marshall/agents/bootstrap.ex:188— marshall/lib/marshall/agents/bootstrap.ex:188-196 | marshall/lib/marshall/agents/maintenance.ex:174-182 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) nix/domains/artifacts/underclass/slo.rs:524— nix/domains/artifacts/underclass/slo.rs:524-532 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:483-491 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
+ 2 more in this group — see findings.md.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×27
Edited copy of a member (11 corresponding lines) lilly/lib/lilly/transfer/permit_journal.ex:83— lilly/lib/lilly/transfer/permit_journal.ex:83-93 | lilly/lib/lilly/transfer/permit_journal.ex:180-190 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lilly/lib/lilly/transfer/probe.ex:104— lilly/lib/lilly/transfer/probe.ex:104-115 | lilly/lib/lilly/transfer/source.ex:108-118 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lilly/lib/lilly/vm/boot.ex:23— lilly/lib/lilly/vm/boot.ex:23-33 | lilly/lib/lilly/vm/boot.ex:81-94 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:52— antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:52-62 | lilly/lib/lilly/host/ownership.ex:59-70 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) galileo/lib/galileo/http.ex:28— galileo/lib/galileo/http.ex:28-38 | ziggy/lib/ziggy/http.ex:28-40 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) mila/windows-dotnet/Interop/RustNativeLifecycle.cs:315— mila/windows-dotnet/Interop/RustNativeLifecycle.cs:315-325 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:329-339 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lyra/src/config.rs:144— lyra/src/config.rs:144-154 | lyra/src/ssh_certificate.rs:19-29 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaApplePush.swift:59— mila/native/apple/Sources/MilaNativeUI/MilaApplePush.swift:59-69 | mila/native/apple/Sources/MilaNativeUI/MilaDeviceSigner.swift:131-144 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) audi/lib/audi/http/proxy.ex:233— audi/lib/audi/http/proxy.ex:233-243 | audi/lib/audi/private/front.ex:296-306 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs:166— nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs:166-176 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:290-303 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) audi/lib/audi/control/client.ex:142— audi/lib/audi/control/client.ex:142-152 | audi/lib/audi/control/client.ex:457-469 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lilly/lib/lilly/network.ex:276— lilly/lib/lilly/network.ex:276-286 | lilly/lib/lilly/vm/driver.ex:2271-2282 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) antithesis/workload/recorder/client.py:139— antithesis/workload/recorder/client.py:139-151 | antithesis/workload/recorder/client.py:163-173 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) marshall/lib/marshall/ingress/control_requests.ex:180— marshall/lib/marshall/ingress/control_requests.ex:180-190 | marshall/lib/marshall/ingress/control_requests.ex:194-204 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lilly/lib/lilly/transfer/key.ex:161— lilly/lib/lilly/transfer/key.ex:161-171 | lilly/lib/lilly/vm/checkpoint_storage.ex:272-283 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lyra/src/bin/overalls-ssh-sync-windows.rs:145— lyra/src/bin/overalls-ssh-sync-windows.rs:145-155 | lyra/src/http.rs:277-287 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lilly/lib/lilly/terminal/stream.ex:144— lilly/lib/lilly/terminal/stream.ex:144-154 | protocol/lib/overalls_protocol/control/client.ex:272-282 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) marshall/lib/marshall/compute/relocation_probes.ex:277— marshall/lib/marshall/compute/relocation_probes.ex:277-287 | marshall/lib/marshall/compute/relocation_sources.ex:259-269 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) antithesis/emulation/guest/runner.py:620— antithesis/emulation/guest/runner.py:620-630 | antithesis/emulation/guest/server.py:1114-1124 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lilly/lib/lilly/vm/unit.ex:130— lilly/lib/lilly/vm/unit.ex:130-140 | lilly/lib/lilly/vm/unit.ex:144-155 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) mila/native/linux/src/adapter.rs:659— mila/native/linux/src/adapter.rs:659-670 | mila/native/linux/src/session/mod.rs:123-133 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) lilly/lib/lilly/vm/workload_bundle.ex:147— lilly/lib/lilly/vm/workload_bundle.ex:147-158 | lilly/lib/lilly/vm/workload_bundle.ex:184-194 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) marshall/lib/marshall/threads.ex:265— marshall/lib/marshall/threads.ex:265-278 | marshall/lib/marshall/threads/generation.ex:101-111 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) protocol/lib/overalls_protocol/terminal.ex:384— protocol/lib/overalls_protocol/terminal.ex:384-395 | protocol/lib/overalls_protocol/terminal.ex:565-575 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:343— antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:343-353 | lilly/lib/lilly/vm/jail.ex:173-186 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
+ 2 more in this group — see findings.md.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×27
Edited copy of a member (7 corresponding lines) marshall/lib/marshall/editor/token.ex:22— marshall/lib/marshall/editor/token.ex:22-30 | marshall/lib/marshall/ingress/token.ex:38-44 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) lilly/lib/lilly/uuid.ex:9— lilly/lib/lilly/uuid.ex:9-15 | ziggy/lib/ziggy/request_id.ex:10-16 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) lilly/lib/lilly/host/zfs_dataset.ex:217— lilly/lib/lilly/host/zfs_dataset.ex:217-223 | lilly/lib/lilly/host/zfs_dataset.ex:227-233 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) lilly/lib/lilly/terminal/guest.ex:92— lilly/lib/lilly/terminal/guest.ex:92-98 | lilly/lib/lilly/terminal/guest.ex:189-197 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:629— mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:629-635 | mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:646-652 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) marshall/lib/marshall/scim/oidc.ex:259— marshall/lib/marshall/scim/oidc.ex:259-266 | marshall/lib/marshall/threads/provision_worker.ex:160-166 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) lilly/lib/lilly/terminal/stream.ex:248— lilly/lib/lilly/terminal/stream.ex:248-254 | marshall/lib/marshall/terminal/host_stream.ex:154-163 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) lilly/lib/lilly/control/runtime.ex:327— lilly/lib/lilly/control/runtime.ex:327-333 | lilly/lib/lilly/control/runtime.ex:378-391 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) ziggy/lib/ziggy/slo_checkpoint.ex:133— ziggy/lib/ziggy/slo_checkpoint.ex:133-141 | ziggy/lib/ziggy/spool.ex:365-371 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) mila/windows-dotnet/Interop/RustNative.cs:590— mila/windows-dotnet/Interop/RustNative.cs:590-596 | mila/windows-dotnet/Interop/RustNative.cs:613-619 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) protocol/lib/overalls_protocol/execution.ex:141— protocol/lib/overalls_protocol/execution.ex:141-147 | protocol/lib/overalls_protocol/execution.ex:155-162 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) nix/domains/artifacts/guest/inception/observations.py:89— nix/domains/artifacts/guest/inception/observations.py:89-95 | REDACTED:93-99 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) antithesis/workload/satellite/origin.py:88— antithesis/workload/satellite/origin.py:88-94 | antithesis/workload/satellite/origin.py:97-103 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) marshall/lib/marshall/inference/control_requests.ex:94— marshall/lib/marshall/inference/control_requests.ex:94-100 | marshall/lib/marshall/inference/control_requests.ex:102-108 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) antithesis/operator/compute.ex:268— antithesis/operator/compute.ex:268-274 | antithesis/operator/compute.ex:307-318 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) mila/native/linux/src/route.rs:390— mila/native/linux/src/route.rs:390-396 | mila/rust/mila-model/src/route.rs:274-280 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) antithesis/workload/guest_lifecycle/witness.py:221— antithesis/workload/guest_lifecycle/witness.py:221-227 | antithesis/workload/guest_lifecycle/witness.py:230-243 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:449— mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:449-455 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:469-475 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) mila/windows-dotnet/Interop/RustNative.cs:833— mila/windows-dotnet/Interop/RustNative.cs:833-839 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:67-73 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) elixir/diagnostics/native/spool/src/main.rs:44— elixir/diagnostics/native/spool/src/main.rs:44-50 | nix/domains/artifacts/terminald/src/session.rs:1116-1126 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) lilly/lib/lilly/host/zfs_dataset.ex:1632— lilly/lib/lilly/host/zfs_dataset.ex:1632-1638 | lilly/lib/lilly/vm/disk.ex:512-518 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) marshall/lib/marshall/accounts/account_lifecycle.ex:200— marshall/lib/marshall/accounts/account_lifecycle.ex:200-207 | marshall/lib/marshall/accounts/guest_accounts.ex:56-62 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) marshall/lib/marshall/compute/command_snapshot.ex:176— marshall/lib/marshall/compute/command_snapshot.ex:176-182 | marshall/lib/marshall/compute/git_identity.ex:33-39 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) antithesis/emulation/guest/server.py:876— antithesis/emulation/guest/server.py:876-884 | antithesis/emulation/recorder/bridge.py:104-110 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) lyra/src/update.rs:317— lyra/src/update.rs:317-323 | nix/domains/artifacts/terminald/src/log.rs:283-289 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
+ 2 more in this group — see findings.md.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×26
Edited copy of a member (8 corresponding lines) mila/windows-dotnet/Interop/RustNative.cs:496— mila/windows-dotnet/Interop/RustNative.cs:496-503 | mila/windows-dotnet/Interop/RustNative.cs:507-527 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) lilly/lib/lilly/host/zfs_dataset.ex:303— lilly/lib/lilly/host/zfs_dataset.ex:303-315 | lilly/lib/lilly/transfer/import_cleanup.ex:201-208 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) marshall/lib/marshall/ingress/acme/jws.ex:59— marshall/lib/marshall/ingress/acme/jws.ex:59-66 | protocol/lib/overalls_protocol/inception_public.ex:47-54 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) antithesis/integration/fault_worker.py:202— antithesis/integration/fault_worker.py:202-210 | antithesis/integration/witness_worker.py:107-114 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) marshall/lib/marshall/ssh/token.ex:23— marshall/lib/marshall/ssh/token.ex:23-32 | porsche/lib/porsche/connection.ex:214-221 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:233— mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:233-240 | mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:258-281 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) marshall/lib/marshall/teams/coordinator.ex:367— marshall/lib/marshall/teams/coordinator.ex:367-374 | marshall/lib/marshall/teams/coordinator.ex:378-385 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) elixir/diagnostics/native/spool/src/store.rs:44— elixir/diagnostics/native/spool/src/store.rs:44-51 | nix/domains/system/otel-guest/receiver/src/durable_slo.rs:598-611 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) lyra/src/bin/overalls-host-certificate-windows.rs:50— lyra/src/bin/overalls-host-certificate-windows.rs:50-57 | lyra/src/bin/overalls-ssh-sync-windows.rs:68-75 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) nix/verification/hegel/python/hegel/generators.py:149— nix/verification/hegel/python/hegel/generators.py:149-160 | nix/verification/hegel/python/hegel/generators.py:284-291 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) lyra/src/workspace_receiver.rs:618— lyra/src/workspace_receiver.rs:618-626 | lyra/src/workspace_receiver.rs:656-663 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) nix/domains/system/fleet-addresses.py:125— nix/domains/system/fleet-addresses.py:125-132 | nix/domains/system/runtime-firewall.py:152-161 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) lilly/native/hostd/src/transfer.rs:337— lilly/native/hostd/src/transfer.rs:337-345 | lilly/native/hostd/src/transfer.rs:405-412 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) lilly/lib/lilly/vm/executor.ex:594— lilly/lib/lilly/vm/executor.ex:594-601 | lilly/lib/lilly/vm/executor.ex:605-621 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) lyra/src/bin/overalls-ssh-authorize.rs:435— lyra/src/bin/overalls-ssh-authorize.rs:435-442 | lyra/src/private_http.rs:16-23 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) antithesis/emulation/guest/runner.py:209— antithesis/emulation/guest/runner.py:209-218 | antithesis/emulation/storage/origin.py:115-122 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) nix/domains/system/backups/schema.py:61— nix/domains/system/backups/schema.py:61-68 | scripts/vendor_localization_fonts.py:34-41 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) mila/native/linux/src/journey_checks.rs:110— mila/native/linux/src/journey_checks.rs:110-117 | mila/native/linux/src/journey_checks.rs:129-136 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) lilly/lib/lilly/terminal/vsock.ex:154— lilly/lib/lilly/terminal/vsock.ex:154-161 | lilly/lib/lilly/terminal/vsock.ex:234-241 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) marshall/lib/marshall/compute/relocation_receives.ex:253— marshall/lib/marshall/compute/relocation_receives.ex:253-260 | marshall/lib/marshall/compute/relocation_sources.ex:229-236 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) nix/domains/artifacts/vscode-web-broker/src/validate.rs:45— nix/domains/artifacts/vscode-web-broker/src/validate.rs:45-53 | mila/rust/mila-transport/src/cert.rs:60-67 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) mila/native/linux/src/session/pty.rs:162— mila/native/linux/src/session/pty.rs:162-169 | mila/native/linux/src/session/connection.rs:99-108 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) marshall/lib/marshall/terminal/peer_socket.ex:163— marshall/lib/marshall/terminal/peer_socket.ex:163-170 | marshall/lib/marshall/terminal/remote.ex:188-195 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) lyra/src/sys/windows/job.rs:25— lyra/src/sys/windows/job.rs:25-32 | lyra/src/sys/windows/services.rs:19-26 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) marshall/lib/marshall/compute/clone_coordinator.ex:117— marshall/lib/marshall/compute/clone_coordinator.ex:117-124 | marshall/lib/marshall/compute/clone_effects.ex:77-84 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Sync-over-async blocking — 26 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking mila/windows-dotnet-smoke/JourneySmoke.cs:201— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:224— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:234— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:244— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:253— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:261— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:273— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:285— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:295— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:298— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:303— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:313— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:317— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:595— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:607— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking mila/windows-dotnet-smoke/SessionLifecycleSmoke.cs:26— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:142— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:168— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:188— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking mila/windows-dotnet-smoke/ThreadGenerationSmoke.cs:41— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:47— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:50— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking REDACTED:51— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking mila/windows-dotnet-uia/LoopbackTrustListener.cs:60— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Duplicated block (10 lines × 2) audi/lib/audi/control/client.ex:348— audi/lib/audi/control/client.ex:348-357 | audi/lib/audi/control/client.ex:417-426 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) audi/lib/audi/http/browser.ex:116— audi/lib/audi/http/browser.ex:116-125 | audi/lib/audi/http/editor_browser.ex:116-125 — before extracting anything, compare `audi/lib/audi/http/browser.ex` and `audi/lib/audi/http/editor_browser.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) marshall/lib/marshall/access/sharing.ex:67— marshall/lib/marshall/access/sharing.ex:67-76 | marshall/lib/marshall/threads/sharing.ex:63-72 — `marshall/lib/marshall/access/sharing.ex` and `marshall/lib/marshall/threads/sharing.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/access/sharing.ex:67` 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) marshall/lib/marshall/accounts/scim_retirement.ex:90— marshall/lib/marshall/accounts/scim_retirement.ex:90-99 | marshall/lib/marshall/accounts/scim_retirement.ex:222-231 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/accounts/scim_retirement.ex:90` 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) marshall/lib/marshall/compute/relocation_coordinator.ex:258— marshall/lib/marshall/compute/relocation_coordinator.ex:258-267 | marshall/lib/marshall/compute/relocation_coordinator.ex:279-288 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) marshall/lib/marshall/editor/retention.ex:32— marshall/lib/marshall/editor/retention.ex:32-41 | marshall/lib/marshall/ingress/web_retention.ex:37-46 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marshall/lib/marshall/editor/retention.ex:30` calls `purge`, `module`, `t` and `marshall/lib/marshall/ingress/web_retention.ex:34` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) marshall/lib/marshall/galileo/credentials.ex:93— marshall/lib/marshall/galileo/credentials.ex:93-102 | marshall/lib/marshall/peach/credentials.ex:93-102 — `marshall/lib/marshall/galileo/credentials.ex` and `marshall/lib/marshall/peach/credentials.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (10 lines × 2) marshall/lib/marshall/ingress/execution.ex:60— marshall/lib/marshall/ingress/execution.ex:60-69 | marshall/lib/marshall/ssh/guest_access.ex:335-344 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 2) marshall/lib/marshall_web/components/layouts.ex:400— marshall/lib/marshall_web/components/layouts.ex:400-409 | marshall/lib/marshall_web/components/layouts.ex:415-424 — 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 `marshall/lib/marshall_web/components/layouts.ex:400` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) audi/lib/audi/tls/fleet_material.ex:82— audi/lib/audi/tls/fleet_material.ex:82-91 | marshall/lib/marshall/ingress/acme/material.ex:82-91 — before extracting anything, compare `audi/lib/audi/tls/fleet_material.ex` and `marshall/lib/marshall/ingress/acme/material.ex` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/tls/fleet_material.ex:82` 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) audi/lib/audi/config.ex:124— audi/lib/audi/config.ex:124-133 | porsche/lib/porsche/config.ex:34-43 — before extracting anything, compare `audi/lib/audi/config.ex` and `porsche/lib/porsche/config.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/config.ex:124` 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) antithesis/emulation/guest/runner.py:195— antithesis/emulation/guest/runner.py:195-204 | antithesis/emulation/storage/bootstrap.py:42-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) nix/domains/system/auto-update/runtime.py:1055— nix/domains/system/auto-update/runtime.py:1055-1064 | nix/domains/system/auto-update/runtime.py:1082-1091 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) lyra/src/agent/maintenance.rs:524— lyra/src/agent/maintenance.rs:524-533 | lyra/src/agent/maintenance.rs:964-973 — 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 `lyra/src/agent/maintenance.rs:524` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) lyra/src/bin/overalls-readinessd.rs:95— lyra/src/bin/overalls-readinessd.rs:95-104 | lyra/src/bin/overalls-trustd-windows.rs:33-42 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) lyra/src/bin/overalls-trustd.rs:429— lyra/src/bin/overalls-trustd.rs:429-438 | lyra/src/guest/trust.rs:130-139 — before extracting anything, compare `lyra/src/bin/overalls-trustd.rs` and `lyra/src/guest/trust.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (10 lines × 2) mila/native/linux/src/session/commands.rs:79— mila/native/linux/src/session/commands.rs:79-88 | mila/native/linux/src/session/commands.rs:484-493 — 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 `mila/native/linux/src/session/commands.rs:79` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) mila/native/linux/src/session/commands.rs:227— mila/native/linux/src/session/commands.rs:227-236 | mila/native/linux/src/session/commands.rs:512-521 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mila/native/linux/src/session/commands.rs:227` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) mila/native/linux/src/session/trust.rs:120— mila/native/linux/src/session/trust.rs:120-129 | mila/native/linux/src/session/trust.rs:184-193 — 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 `mila/native/linux/src/session/trust.rs:120` 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) mila/rust/mila-ffi/src/android/terminal.rs:370— mila/rust/mila-ffi/src/android/terminal.rs:370-379 | mila/rust/mila-ffi/src/android/terminal.rs:413-422 — 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 × 2) nix/domains/system/otel-guest/receiver/src/request_recorder.rs:273— nix/domains/system/otel-guest/receiver/src/request_recorder.rs:273-282 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:670-679 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) lyra/src/bin/overalls-trustd.rs:152— lyra/src/bin/overalls-trustd.rs:152-161 | lyra/src/guest/trust.rs:92-101 — before extracting anything, compare `lyra/src/bin/overalls-trustd.rs` and `lyra/src/guest/trust.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lyra/src/bin/overalls-trustd.rs:152` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lyra/src/guest/trust.rs:91` calls `push`, `der` and `lyra/src/bin/overalls-trustd.rs:151` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) elixir/diagnostics/native/spool/src/store.rs:90— elixir/diagnostics/native/spool/src/store.rs:90-99 | nix/domains/system/otel-guest/receiver/src/durable_slo.rs:420-429 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `elixir/diagnostics/native/spool/src/store.rs:90` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (10 lines × 2) antithesis/workload/backup/fixture.py:121— antithesis/workload/backup/fixture.py:121-130 | antithesis/workload/backup/fixture.py:387-396 — 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.
lyra::agent::web_fetch::html_content (cognitive 41) lyra/src/agent/web_fetch.rs:177— lyra::agent::web_fetch::html_content has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (10 pts), boolean chains 3, loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
lyra::native_growth::gpt::read (cognitive 38) lyra/src/native_growth/gpt.rs:216— lyra::native_growth::gpt::read has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 13, loops 3 (4 pts), match/switch 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.
lyra::update::supervise (cognitive 34) lyra/src/update.rs:553— lyra::update::supervise has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
lyra::bin::overalls-host-certificate-windows::agent::run (cognitive 28) lyra/src/bin/overalls-host-certificate-windows.rs:199— lyra::bin::overalls-host-certificate-windows::agent::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 2, 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.
lyra::bin::overalls-ssh-sync-windows::sync::run (cognitive 27) lyra/src/bin/overalls-ssh-sync-windows.rs:479— lyra::bin::overalls-ssh-sync-windows::sync::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (10 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::agent::managed_skills::git::scratch_within_limit (cognitive 25) lyra/src/agent/managed_skills/git.rs:228— lyra::agent::managed_skills::git::scratch_within_limit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::workspace_checkout::resolve (cognitive 25) lyra/src/workspace_checkout.rs:40— lyra::workspace_checkout::resolve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 12). 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.
lyra::agent::managed_skills::materialize::directory_digest (cognitive 24) lyra/src/agent/managed_skills/materialize.rs:314— lyra::agent::managed_skills::materialize::directory_digest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::native_growth::command (cognitive 24) lyra/src/native_growth.rs:152— lyra::native_growth::command has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::agent::attachment::execute_transfer (cognitive 22) lyra/src/agent/attachment.rs:92— lyra::agent::attachment::execute_transfer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 1 (2 pts), match/switch 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.
lyra::agent::attachment::download (cognitive 22) lyra/src/agent/attachment.rs:191— lyra::agent::attachment::download has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::agent::maintenance::install (cognitive 22) lyra/src/agent/maintenance.rs:411— lyra::agent::maintenance::install has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::native_growth::illumos_vdev (cognitive 22) lyra/src/native_growth.rs:322— lyra::native_growth::illumos_vdev has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::bin::overalls-host-certificate::read_response (cognitive 20) lyra/src/bin/overalls-host-certificate.rs:279— lyra::bin::overalls-host-certificate::read_response has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::bin::overalls-native-workspaced::main (cognitive 19) lyra/src/bin/overalls-native-workspaced.rs:9— lyra::bin::overalls-native-workspaced::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (4 pts), boolean chains 1, 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.
lyra::bin::overalls-workspaced-windows::daemon::run (cognitive 19) lyra/src/bin/overalls-workspaced-windows.rs:138— lyra::bin::overalls-workspaced-windows::daemon::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 6 (9 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.
lyra::ssh_config::local_identity (cognitive 19) lyra/src/ssh_config.rs:191— lyra::ssh_config::local_identity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 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.
lyra::agent::managed_skills::materialize::parse_tree (cognitive 18) lyra/src/agent/managed_skills/materialize.rs:273— lyra::agent::managed_skills::materialize::parse_tree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::native_guest::services_ready_in (cognitive 18) lyra/src/native_guest.rs:208— lyra::native_guest::services_ready_in has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), boolean chains 2, 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.
lyra::update::work (cognitive 18) lyra/src/update.rs:329— lyra::update::work has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
lyra::sys::native::unprivileged_socket_status (cognitive 17) lyra/src/sys/native.rs:178— lyra::sys::native::unprivileged_socket_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::agent_cli::run (cognitive 16) lyra/src/agent_cli.rs:70— lyra::agent_cli::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lyra::native_bootstrap::output (cognitive 16) lyra/src/native_bootstrap.rs:131— lyra::native_bootstrap::output has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Edited copy of a member (5 corresponding lines) · ×21
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/ssh/commands.ex:364— marshall/lib/marshall/ssh/commands.ex:364-368 | marshall/lib/marshall/terminal/authority.ex:103-118 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) susan/lib/susan/config.ex:129— susan/lib/susan/config.ex:129-133 | susan/lib/susan/config.ex:143-147 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) audi/lib/audi/http/browser.ex:103— audi/lib/audi/http/browser.ex:103-107 | audi/lib/audi/http/editor_browser.ex:103-107 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/artifacts/publisher.ex:170— marshall/lib/marshall/artifacts/publisher.ex:170-177 | marshall/lib/marshall/artifacts/publisher.ex:181-185 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) brady/lib/brady/destination.ex:119— brady/lib/brady/destination.ex:119-123 | lilly/lib/lilly/lifecycle/backup_history.ex:107-111 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) antithesis/operator/integrations.ex:97— antithesis/operator/integrations.ex:97-101 | antithesis/operator/integrations.ex:109-115 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) lilly/lib/lilly/vm/driver.ex:88— lilly/lib/lilly/vm/driver.ex:88-92 | lilly/lib/lilly/vm/driver.ex:96-101 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/accounts/scim_retirement.ex:312— marshall/lib/marshall/accounts/scim_retirement.ex:312-316 | marshall/lib/marshall/compute/clone_coordinator.ex:253-260 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/compute/ledger.ex:190— marshall/lib/marshall/compute/ledger.ex:190-194 | marshall/lib/marshall/threads/sharing.ex:165-175 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaTerminal.swift:215— mila/native/apple/Sources/MilaNativeUI/MilaTerminal.swift:215-219 | mila/native/apple/Sources/MilaNativeUI/MilaTerminal.swift:227-232 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) lilly/lib/lilly/transfer/import_journal.ex:37— lilly/lib/lilly/transfer/import_journal.ex:37-42 | lilly/lib/lilly/transfer/clone_copy_journal.ex:107-111 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/artifacts/library.ex:51— marshall/lib/marshall/artifacts/library.ex:51-55 | marshall/lib/marshall/threads.ex:235-239 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/agents/context.ex:84— marshall/lib/marshall/agents/context.ex:84-88 | marshall/lib/marshall/compute/evacuation_views.ex:459-463 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/compute/relocation_probes.ex:293— marshall/lib/marshall/compute/relocation_probes.ex:293-297 | marshall/lib/marshall/compute/relocation_sources.ex:281-285 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/compute/evacuations.ex:494— marshall/lib/marshall/compute/evacuations.ex:494-501 | marshall/lib/marshall/agents/skills.ex:653-657 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) .github/scripts/mila-tailnet-join.py:65— .github/scripts/mila-tailnet-join.py:65-70 | .github/scripts/mila-tailnet-peers.py:121-125 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) lilly/lib/lilly/terminal/stream.ex:212— lilly/lib/lilly/terminal/stream.ex:212-216 | protocol/lib/overalls_protocol/control/client.ex:177-181 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) antithesis/workload/admission/client.py:230— antithesis/workload/admission/client.py:230-234 | antithesis/workload/guest_lifecycle/operation.py:266-273 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) lyra/src/bin/overalls-agentd-windows.rs:56— lyra/src/bin/overalls-agentd-windows.rs:56-61 | lyra/src/bin/overalls-native-agentd.rs:48-52 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) marshall/lib/marshall/ssh.ex:52— marshall/lib/marshall/ssh.ex:52-56 | marshall/lib/marshall/teams.ex:32-36 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) lilly/native/hostd/src/policy.rs:47— lilly/native/hostd/src/policy.rs:47-52 | lilly/native/hostd/src/transfer.rs:347-351 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (11 lines × 2) lilly/scripts/smoke_guest.exs:155— lilly/scripts/smoke_guest.exs:155-165 | lilly/scripts/smoke_jailed.exs:469-479 — 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) marshall/lib/marshall/compute/relocation_cancellation.ex:13— marshall/lib/marshall/compute/relocation_cancellation.ex:13-23 | marshall/lib/marshall/compute/relocation_retry_admission.ex:20-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/compute/relocation_cancellation.ex:13` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) marshall/lib/marshall/galileo/configurations.ex:456— marshall/lib/marshall/galileo/configurations.ex:456-466 | marshall/lib/marshall/teams/coordinator.ex:623-633 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) porsche/lib/porsche/ssh/onboarding.ex:28— porsche/lib/porsche/ssh/onboarding.ex:28-38 | protocol/lib/overalls_protocol/ssh_onboarding.ex:27-37 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `porsche/lib/porsche/ssh/onboarding.ex:28` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) porsche/lib/porsche/ssh/onboarding.ex:159— porsche/lib/porsche/ssh/onboarding.ex:159-169 | protocol/lib/overalls_protocol/ssh_onboarding.ex:130-140 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) ziggy/lib/ziggy/bootstrap_release.ex:37— ziggy/lib/ziggy/bootstrap_release.ex:37-47 | ziggy/lib/ziggy/tool_release.ex:39-49 — 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 `ziggy/lib/ziggy/bootstrap_release.ex:37` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) brady/lib/brady/log.ex:165— brady/lib/brady/log.ex:165-175 | marshall/lib/marshall_web/observed_router.ex:25-35 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) lilly/lib/lilly/vm/credentials.ex:147— lilly/lib/lilly/vm/credentials.ex:147-157 | lilly/lib/lilly/vm/workspace_source.ex:296-306 — 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) antithesis/emulation/guest/runner.py:775— antithesis/emulation/guest/runner.py:775-785 | antithesis/emulation/guest/runner.py:827-837 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) antithesis/emulation/host/runner.py:164— antithesis/emulation/host/runner.py:164-174 | antithesis/emulation/storage/runner.py:163-173 — `antithesis/emulation/host/runner.py` and `antithesis/emulation/storage/runner.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) antithesis/verification/identity.py:810— antithesis/verification/identity.py:810-820 | antithesis/verification/identity.py:852-862 — 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 `antithesis/verification/identity.py:810` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) antithesis/workload/admission/scenarios.py:221— antithesis/workload/admission/scenarios.py:221-231 | antithesis/workload/admission/scenarios.py:306-316 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) lyra/src/bin/overalls-ssh-authorize.rs:79— lyra/src/bin/overalls-ssh-authorize.rs:79-89 | lyra/src/guest/ssh_roster.rs:118-128 — before extracting anything, compare `lyra/src/bin/overalls-ssh-authorize.rs` and `lyra/src/guest/ssh_roster.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lyra/src/bin/overalls-ssh-authorize.rs:79` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) mila/rust/mila-ffi/src/android/session_bridge.rs:210— mila/rust/mila-ffi/src/android/session_bridge.rs:210-220 | mila/rust/mila-ffi/src/android/session_bridge.rs:253-263 — 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 `mila/rust/mila-ffi/src/android/session_bridge.rs:210` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) mila/rust/mila-ffi/src/android/terminal.rs:93— mila/rust/mila-ffi/src/android/terminal.rs:93-104 | mila/rust/mila-ffi/src/android/terminal.rs:167-177 — 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 `mila/rust/mila-ffi/src/android/terminal.rs:93` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) mila/rust/mila-ffi/src/android/terminal.rs:288— mila/rust/mila-ffi/src/android/terminal.rs:288-298 | mila/rust/mila-ffi/src/android/watch.rs:50-60 — 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 `mila/rust/mila-ffi/src/android/terminal.rs:288` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (11 lines × 2) mila/rust/mila-ffi/src/android/validation.rs:29— mila/rust/mila-ffi/src/android/validation.rs:29-39 | mila/rust/mila-ffi/src/android/validation.rs:40-50 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:49— nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:49-59 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:109-119 — 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 `nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:49` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (11 lines × 2) nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:315— nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:315-325 | nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:350-360 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) nix/domains/system/otel-guest/receiver/src/slo.rs:350— nix/domains/system/otel-guest/receiver/src/slo.rs:350-360 | nix/domains/system/otel-guest/receiver/src/slo.rs:367-378 — 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 `nix/domains/system/otel-guest/receiver/src/slo.rs:350` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×19
Edited copy of a member (10 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:242— mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:242-251 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:451-462 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) mila/windows-dotnet/Interop/MachineMutation.cs:24— mila/windows-dotnet/Interop/MachineMutation.cs:24-33 | mila/windows-dotnet/Interop/MachineMutation.cs:36-50 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) protocol/lib/overalls_protocol/editor_login.ex:41— protocol/lib/overalls_protocol/editor_login.ex:41-50 | protocol/lib/overalls_protocol/web_login.ex:37-49 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) lilly/lib/lilly/host/zfs_dataset.ex:663— lilly/lib/lilly/host/zfs_dataset.ex:663-672 | lilly/lib/lilly/host/zfs_dataset.ex:1346-1359 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) marshall/lib/marshall/compute/relocation_deletion.ex:131— marshall/lib/marshall/compute/relocation_deletion.ex:131-140 | marshall/lib/marshall/ssh/guest_access.ex:313-322 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) galileo/lib/galileo/github/lfs.ex:26— galileo/lib/galileo/github/lfs.ex:26-39 | protocol/lib/overalls_protocol.ex:265-274 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) lilly/lib/lilly/host/image.ex:309— lilly/lib/lilly/host/image.ex:309-321 | marshall/lib/marshall/artifacts/tool.ex:179-188 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) mila/native/linux/src/session/mod.rs:104— mila/native/linux/src/session/mod.rs:104-113 | mila/native/linux/src/session/pty.rs:140-160 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) marshall/lib/marshall_web/live/threads_live.ex:401— marshall/lib/marshall_web/live/threads_live.ex:401-410 | marshall/lib/marshall_web/live/threads_live.ex:450-461 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) lyra/src/sys/windows/winsock.rs:216— lyra/src/sys/windows/winsock.rs:216-225 | lyra/src/sys/windows/winsock.rs:228-237 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) antithesis/workload/access/browser.py:437— antithesis/workload/access/browser.py:437-446 | antithesis/workload/access/browser.py:462-477 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) audi/lib/audi/slo.ex:84— audi/lib/audi/slo.ex:84-94 | marshall/lib/marshall/slo.ex:129-138 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:539— mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:539-548 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:550-559 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) nix/domains/system/otel-guest/browser_journey.py:684— nix/domains/system/otel-guest/browser_journey.py:684-694 | scripts/galileo_browser.py:139-148 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) lilly/lib/lilly/host/image_template.ex:503— lilly/lib/lilly/host/image_template.ex:503-512 | lilly/lib/lilly/transfer/import_cleanup.ex:224-235 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) mila/native/linux/src/route.rs:379— mila/native/linux/src/route.rs:379-388 | nix/domains/system/otel-guest/receiver/src/binding.rs:15-25 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) lilly/lib/lilly/vm/driver.ex:1397— lilly/lib/lilly/vm/driver.ex:1397-1407 | lilly/lib/lilly/vm/workspace_source.ex:255-264 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) porsche/lib/porsche/ssh/onboarding.ex:75— porsche/lib/porsche/ssh/onboarding.ex:75-87 | protocol/lib/overalls_protocol/ssh_onboarding.ex:66-75 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) scripts/dependency_pins.ex:129— scripts/dependency_pins.ex:129-138 | scripts/dependency_pins.ex:174-186 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (12 lines × 2) audi/lib/audi/slo.ex:105— audi/lib/audi/slo.ex:105-116 | marshall/lib/marshall/slo.ex:153-164 — before extracting anything, compare `audi/lib/audi/slo.ex` and `marshall/lib/marshall/slo.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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 (12 lines × 2) audi/lib/audi/slo.ex:193— audi/lib/audi/slo.ex:193-204 | marshall/lib/marshall/slo.ex:242-253 — before extracting anything, compare `audi/lib/audi/slo.ex` and `marshall/lib/marshall/slo.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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 (12 lines × 2) lilly/lib/lilly/transfer/key_runtime.ex:112— lilly/lib/lilly/transfer/key_runtime.ex:112-123 | lilly/lib/lilly/transfer/source_runtime.ex:134-145 — before extracting anything, compare `lilly/lib/lilly/transfer/key_runtime.ex` and `lilly/lib/lilly/transfer/source_runtime.ex` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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 `lilly/lib/lilly/transfer/key_runtime.ex:112` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) marshall/lib/marshall/compute/relocation_destination_revocations.ex:81— marshall/lib/marshall/compute/relocation_destination_revocations.ex:81-94 | marshall/lib/marshall/compute/relocation_key_retirement.ex:78-89 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_destination_revocations.ex` and `marshall/lib/marshall/compute/relocation_key_retirement.ex` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/compute/relocation_destination_revocations.ex:81` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) marshall/lib/marshall/compute/relocation_receives.ex:265— marshall/lib/marshall/compute/relocation_receives.ex:265-276 | marshall/lib/marshall/compute/relocation_sources.ex:241-252 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) marshall/lib/marshall_web/gettext_interpolation.ex:20— marshall/lib/marshall_web/gettext_interpolation.ex:20-31 | porsche/lib/porsche/gettext_interpolation.ex:20-31 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) ziggy/lib/ziggy/http.ex:205— ziggy/lib/ziggy/http.ex:205-216 | ziggy/lib/ziggy/http.ex:234-245 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) audi/lib/audi/tls/fleet_material.ex:109— audi/lib/audi/tls/fleet_material.ex:109-120 | marshall/lib/marshall/ingress/acme/material.ex:109-120 — before extracting anything, compare `audi/lib/audi/tls/fleet_material.ex` and `marshall/lib/marshall/ingress/acme/material.ex` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 (12 lines × 2) antithesis/workload/admission/scenarios.py:336— antithesis/workload/admission/scenarios.py:336-347 | antithesis/workload/admission/scenarios.py:358-369 — 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 `antithesis/workload/admission/scenarios.py:336` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) antithesis/workload/control/host_sessions.py:58— antithesis/workload/control/host_sessions.py:58-69 | antithesis/workload/control/scenarios.py:45-56 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) antithesis/workload/control/host_sessions.py:221— antithesis/workload/control/host_sessions.py:221-232 | antithesis/workload/control/host_sessions.py:357-368 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/control/host_sessions.py:221` 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 lines × 2) antithesis/workload/guest_lifecycle/operation.py:144— antithesis/workload/guest_lifecycle/operation.py:144-155 | antithesis/workload/satellite/operator.py:69-80 — 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 (12 lines × 2) antithesis/workload/satellite/scenarios.py:217— antithesis/workload/satellite/scenarios.py:217-228 | antithesis/workload/satellite/scenarios.py:250-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. 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) lilly/native/export-channel/src/bridge.rs:77— lilly/native/export-channel/src/bridge.rs:77-88 | lilly/native/export-channel/src/serve.rs:132-143 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/native/export-channel/src/bridge.rs:77` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) lilly/native/source-export/src/pin_sender.rs:13— lilly/native/source-export/src/pin_sender.rs:13-24 | lilly/native/transfer-stream/src/pin.rs:39-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/native/source-export/src/pin_sender.rs:13` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) mila/native/linux/src/route.rs:250— mila/native/linux/src/route.rs:250-261 | mila/rust/mila-model/src/route.rs:215-226 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12 lines × 2) nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:485— nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:485-496 | nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:497-508 — 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 `nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:485` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) nix/domains/system/observability-runtimes/src/fleet_exporter.rs:16— nix/domains/system/observability-runtimes/src/fleet_exporter.rs:16-27 | nix/domains/system/observability-runtimes/src/logging_health.rs:26-37 — 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 `nix/domains/system/observability-runtimes/src/fleet_exporter.rs:16` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) lyra/src/bin/overalls-ssh-authorize.rs:506— lyra/src/bin/overalls-ssh-authorize.rs:506-517 | lyra/src/guest/ssh_roster.rs:186-197 — before extracting anything, compare `lyra/src/bin/overalls-ssh-authorize.rs` and `lyra/src/guest/ssh_roster.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 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.
FunctionTooLong: mila_native_linux::pages::build_machines mila/native/linux/src/pages.rs:347— FunctionTooLong — mila_native_linux::pages::build_machines runs 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 411 over it, 5.11× 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: mila_native_linux::gtk_journey::page_steps mila/native/linux/src/gtk_journey.rs:478— FunctionTooLong — mila_native_linux::gtk_journey::page_steps runs 298 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 198 over it, 2.98× 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: mila_native_linux::views::build_terminal mila/native/linux/src/views.rs:475— FunctionTooLong — mila_native_linux::views::build_terminal runs 250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 150 over it, 2.50× 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: mila_native_linux::pages::build_threads mila/native/linux/src/pages.rs:1026— FunctionTooLong — mila_native_linux::pages::build_threads runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16× 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: mila_native_linux::journey::run_pages mila/native/linux/src/journey.rs:1214— FunctionTooLong — mila_native_linux::journey::run_pages runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99× 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: mila_native_linux::journey::run mila/native/linux/src/journey.rs:603— FunctionTooLong — mila_native_linux::journey::run runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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: lilly_hostd::transfer::plan lilly/native/hostd/src/transfer.rs:561— FunctionTooLong — lilly_hostd::transfer::plan runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85× 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: mila_protocol::grammar::validate_command mila/rust/mila-protocol/src/grammar.rs:174— FunctionTooLong — mila_protocol::grammar::validate_command runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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.
FunctionTooLong: probe.advance marshall/scripts/localization_browser/probe.ts:56— FunctionTooLong — advance runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× 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: lilly_hostd::protocol::encode_request lilly/native/hostd/src/protocol.rs:684— FunctionTooLong — lilly_hostd::protocol::encode_request runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48× 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: mila_native_linux::views::build_sign_in mila/native/linux/src/views.rs:1103— FunctionTooLong — mila_native_linux::views::build_sign_in runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× 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: lilly_zfs_namespace_unmount::sweep::sweep lilly/native/zfs-namespace-unmount/src/sweep.rs:137— FunctionTooLong — lilly_zfs_namespace_unmount::sweep::sweep runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× 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: mila_native_linux::views::build_deployments mila/native/linux/src/views.rs:121— FunctionTooLong — mila_native_linux::views::build_deployments runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× 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: lilly_terminald::log::encode nix/domains/artifacts/terminald/src/log.rs:106— FunctionTooLong — lilly_terminald::log::encode runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.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.
FunctionTooLong: overalls_vscode_web_broker::windows::account::account_token nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:255— FunctionTooLong — overalls_vscode_web_broker::windows::account::account_token runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11× 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: lilly_hostd::vm_launch::argv lilly/native/hostd/src/vm_launch.rs:92— FunctionTooLong — lilly_hostd::vm_launch::argv runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× 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: lilly_terminald::sys::conpty::s4u_token nix/domains/artifacts/terminald/src/sys/conpty.rs:376— FunctionTooLong — lilly_terminald::sys::conpty::s4u_token runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×17
Edited copy of a member (17 corresponding lines) nix/domains/system/otel-guest/receiver/src/slo.rs:392— nix/domains/system/otel-guest/receiver/src/slo.rs:392-409 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:171-188 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:257— mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:257-273 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:275-292 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) ziggy/lib/ziggy/http.ex:200— ziggy/lib/ziggy/http.ex:200-216 | ziggy/lib/ziggy/http.ex:229-245 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:155— mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:155-174 | mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:177-193 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) lilly/lib/lilly/observability.ex:113— lilly/lib/lilly/observability.ex:113-129 | porsche/lib/porsche/observability.ex:249-267 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) antithesis/lilly/lib/overalls_antithesis/lilly/integrated_health.ex:18— antithesis/lilly/lib/overalls_antithesis/lilly/integrated_health.ex:18-34 | antithesis/lilly/lib/overalls_antithesis/lilly/stub_storage_health.ex:21-37 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) mila/native/linux/src/route.rs:218— mila/native/linux/src/route.rs:218-237 | mila/rust/mila-model/src/route.rs:196-212 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) lyra/src/bin/overalls-ssh-authorize.rs:102— lyra/src/bin/overalls-ssh-authorize.rs:102-118 | lyra/src/guest/ssh_roster.rs:167-183 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) antithesis/emulation/recorder/bridge.py:43— antithesis/emulation/recorder/bridge.py:43-59 | nix/domains/system/backups/common.py:54-73 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) lilly/lib/lilly/vm/driver.ex:66— lilly/lib/lilly/vm/driver.ex:66-82 | lilly/lib/lilly/vm/driver.ex:120-136 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) lilly/lib/lilly/backup.ex:326— lilly/lib/lilly/backup.ex:326-348 | lilly/lib/lilly/transfer/clone_copy.ex:456-472 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) lilly/lib/lilly/ingress/backend.ex:12— lilly/lib/lilly/ingress/backend.ex:12-28 | lilly/lib/lilly/ingress/backend.ex:41-63 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) susan/lib/susan/provider/fcm.ex:16— susan/lib/susan/provider/fcm.ex:16-32 | susan/lib/susan/provider/wns.ex:21-42 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) marshall/lib/marshall/editor/authority.ex:536— marshall/lib/marshall/editor/authority.ex:536-559 | marshall/lib/marshall/ingress/web_streams.ex:374-390 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) mila/rust/mila-ffi/src/session.rs:1304— mila/rust/mila-ffi/src/session.rs:1304-1320 | mila/rust/mila-ffi/src/session.rs:1337-1356 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) mila/rust/mila-ffi/src/android/terminal.rs:213— mila/rust/mila-ffi/src/android/terminal.rs:213-229 | mila/rust/mila-ffi/src/android/watch.rs:10-32 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) mila/native/linux/src/session/commands.rs:381— mila/native/linux/src/session/commands.rs:381-399 | mila/native/linux/src/session/commands.rs:403-419 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (3 corresponding lines) · ×17
Edited copy of a member (3 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:295— mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:295-297 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:299-301 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) lilly/lib/lilly/host/zfs_dataset.ex:1363— lilly/lib/lilly/host/zfs_dataset.ex:1363-1365 | lilly/lib/lilly/host/image_template.ex:604-606 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) lilly/lib/lilly/vm/kernel_attestation.ex:30— lilly/lib/lilly/vm/kernel_attestation.ex:30-32 | lilly/lib/lilly/vm/readiness.ex:28-31 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:920— mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:920-922 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:371-373 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) protocol/lib/overalls_protocol/editor_login.ex:30— protocol/lib/overalls_protocol/editor_login.ex:30-32 | protocol/lib/overalls_protocol/web_login.ex:27-29 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) audi/lib/audi/http/proxy.ex:248— audi/lib/audi/http/proxy.ex:248-250 | audi/lib/audi/private/front.ex:311-313 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) marshall/lib/marshall/access/authorization.ex:21— marshall/lib/marshall/access/authorization.ex:21-23 | marshall/lib/marshall/threads/authorization.ex:16-18 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex:117— elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex:117-119 | elixir/diagnostics/lib/overalls/diagnostics/metrics.ex:288-290 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) marshall/lib/marshall/galileo/credentials.ex:78— marshall/lib/marshall/galileo/credentials.ex:78-80 | marshall/lib/marshall/peach/credentials.ex:78-80 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) nix/domains/artifacts/guest/windows/stage-winget.py:231— nix/domains/artifacts/guest/windows/stage-winget.py:231-233 | REDACTED:102-104 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) marshall/lib/marshall/accounts/scim_retirement.ex:302— marshall/lib/marshall/accounts/scim_retirement.ex:302-304 | marshall/lib/marshall/scim/retirement_worker.ex:51-53 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) audi/lib/audi/tls/fleet_certificate.ex:42— audi/lib/audi/tls/fleet_certificate.ex:42-44 | lilly/lib/lilly/execution/watch.ex:40-42 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) lilly/lib/lilly/execution/liveness.ex:90— lilly/lib/lilly/execution/liveness.ex:90-92 | protocol/lib/overalls_protocol/cadence.ex:44-46 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) protocol/lib/overalls_protocol/relocation_cleanup.ex:96— protocol/lib/overalls_protocol/relocation_cleanup.ex:96-98 | protocol/lib/overalls_protocol/relocation_readiness.ex:101-103 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) nix/domains/artifacts/host/cli.py:171— nix/domains/artifacts/host/cli.py:171-173 | nix/domains/system/secrets/prepare.py:261-263 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) marshall/lib/marshall/repo.ex:29— marshall/lib/marshall/repo.ex:29-31 | susan/lib/susan/repo.ex:17-19 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) scripts/egress_acceptance.py:40— scripts/egress_acceptance.py:40-42 | scripts/porsche_acceptance.py:66-68 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×16
Edited copy of a member (13 corresponding lines) marshall/lib/marshall/compute/relocation_cleanup.ex:113— marshall/lib/marshall/compute/relocation_cleanup.ex:113-125 | marshall/lib/marshall/compute/relocation_restoration.ex:225-240 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) lilly/lib/lilly/vm/executor.ex:135— lilly/lib/lilly/vm/executor.ex:135-147 | lilly/lib/lilly/vm/executor.ex:165-184 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) lyra/src/agent_cli.rs:189— lyra/src/agent_cli.rs:189-201 | lyra/src/platform/windows/boot_id.rs:32-47 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) antithesis/operator/guest_witness.ex:426— antithesis/operator/guest_witness.ex:426-438 | antithesis/operator/guest_witness.ex:731-746 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) marshall/lib/marshall/compute/relocation_coordinator.ex:255— marshall/lib/marshall/compute/relocation_coordinator.ex:255-267 | marshall/lib/marshall/compute/relocation_coordinator.ex:276-288 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) nix/domains/artifacts/terminald/src/session.rs:1237— nix/domains/artifacts/terminald/src/session.rs:1237-1249 | nix/domains/artifacts/terminald/src/session.rs:1271-1290 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) lilly/lib/lilly/host/limits.ex:81— lilly/lib/lilly/host/limits.ex:81-93 | lilly/lib/lilly/host/limits.ex:143-155 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) marshall/lib/marshall/notifications/device_actions.ex:120— marshall/lib/marshall/notifications/device_actions.ex:120-132 | marshall/lib/marshall/ssh/key_actions.ex:89-101 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) lyra/src/bin/overalls-native-bootstrap.rs:5— lyra/src/bin/overalls-native-bootstrap.rs:5-17 | lyra/src/bin/overalls-native-grow-root.rs:5-18 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) lilly/lib/lilly/observability.ex:35— lilly/lib/lilly/observability.ex:35-47 | marshall/lib/marshall/observability.ex:55-70 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) lyra/src/sys/socket.rs:147— lyra/src/sys/socket.rs:147-159 | lyra/src/sys/socket.rs:166-183 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) protocol/lib/overalls_protocol/web_socket/connection.ex:165— protocol/lib/overalls_protocol/web_socket/connection.ex:165-182 | protocol/lib/overalls_protocol/web_socket/connection.ex:186-198 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) marshall/lib/marshall_web/live/integrations_live.ex:115— marshall/lib/marshall_web/live/integrations_live.ex:115-127 | marshall/lib/marshall_web/live/integrations_live.ex:148-160 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) mila/rust/mila-ffi/src/validate/push.rs:140— mila/rust/mila-ffi/src/validate/push.rs:140-152 | mila/rust/mila-ffi/src/validate/trust.rs:18-30 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) nix/domains/system/fleet-addresses.py:37— nix/domains/system/fleet-addresses.py:37-49 | nix/domains/system/runtime-firewall.py:48-63 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) scripts/cargo_security_upgrades.exs:82— scripts/cargo_security_upgrades.exs:82-94 | scripts/mix_security_upgrades.exs:54-69 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×16
Edited copy of a member (12 corresponding lines) ziggy/lib/ziggy/bootstrap_release.ex:36— ziggy/lib/ziggy/bootstrap_release.ex:36-47 | ziggy/lib/ziggy/tool_release.ex:35-49 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) marshall/lib/marshall/ingress/acme/issuer.ex:16— marshall/lib/marshall/ingress/acme/issuer.ex:16-27 | marshall/lib/marshall/ingress/acme/issuer.ex:38-49 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:405— mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:405-421 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:423-434 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) mila/native/linux/src/device_key.rs:90— mila/native/linux/src/device_key.rs:90-101 | mila/native/linux/src/session/signer.rs:44-56 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) antithesis/emulation/guest/runner.py:194— antithesis/emulation/guest/runner.py:194-205 | antithesis/emulation/storage/bootstrap.py:40-52 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) nix/domains/system/auto-update/resources.py:412— nix/domains/system/auto-update/resources.py:412-424 | nix/domains/system/auto-update/runtime.py:318-329 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) marshall/lib/marshall/editor/authority.ex:191— marshall/lib/marshall/editor/authority.ex:191-207 | marshall/lib/marshall/ingress/web_streams.ex:106-117 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) lilly/lib/lilly/control/runtime.ex:414— lilly/lib/lilly/control/runtime.ex:414-426 | lilly/lib/lilly/control/runtime.ex:434-445 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) audi/lib/audi/slo.ex:176— audi/lib/audi/slo.ex:176-189 | marshall/lib/marshall/slo.ex:227-238 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) mila/rust/mila-transport/src/ssh.rs:565— mila/rust/mila-transport/src/ssh.rs:565-576 | mila/rust/mila-transport/src/ssh.rs:578-589 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) marshall/lib/marshall/enrico/worker.ex:139— marshall/lib/marshall/enrico/worker.ex:139-153 | marshall/lib/marshall/enrico/worker.ex:157-168 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) lilly/lib/lilly/vm/driver.ex:1411— lilly/lib/lilly/vm/driver.ex:1411-1422 | lilly/lib/lilly/vm/driver.ex:1570-1581 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) lilly/lib/lilly/vm/kernel_attestation.ex:63— lilly/lib/lilly/vm/kernel_attestation.ex:63-74 | lilly/lib/lilly/vm/readiness.ex:53-64 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) REDACTED:61— REDACTED:61-72 | nix/domains/artifacts/guest/native_git/extract_freebsd.py:70-81 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) lyra/src/agent/maintenance.rs:243— lyra/src/agent/maintenance.rs:243-255 | lyra/src/platform/mod.rs:84-95 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) lyra/src/platform/mod.rs:99— lyra/src/platform/mod.rs:99-110 | lyra/src/update.rs:133-144 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×15
Edited copy of a member (6 corresponding lines) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaMachineCreate.kt:27— mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaMachineCreate.kt:27-34 | mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaMachineCreate.kt:51-56 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) lilly/lib/lilly/transfer/permit_journal.ex:411— lilly/lib/lilly/transfer/permit_journal.ex:411-416 | lilly/lib/lilly/transfer/permit_journal.ex:433-439 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) lyra/src/bin/overalls-ssh-authorize.rs:71— lyra/src/bin/overalls-ssh-authorize.rs:71-76 | lyra/src/guest/ssh_roster.rs:104-109 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) lilly/lib/lilly/host/zfs.ex:966— lilly/lib/lilly/host/zfs.ex:966-972 | lilly/lib/lilly/host/zfs.ex:1235-1240 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) lyra/src/sys/socket.rs:251— lyra/src/sys/socket.rs:251-256 | lyra/src/sys/socket.rs:265-280 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) mila/windows-dotnet/Interop/WindowsNotifications.cs:36— mila/windows-dotnet/Interop/WindowsNotifications.cs:36-41 | mila/windows-dotnet/Interop/WindowsNotifications.cs:43-48 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) lilly/lib/lilly/transfer/clone_copy_journal.ex:44— lilly/lib/lilly/transfer/clone_copy_journal.ex:44-49 | lilly/lib/lilly/transfer/import_journal.ex:54-62 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) lyra/src/bin/overalls-trustd.rs:440— lyra/src/bin/overalls-trustd.rs:440-445 | lyra/src/guest/trust.rs:142-147 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) audi/lib/audi/private/dns.ex:74— audi/lib/audi/private/dns.ex:74-79 | audi/lib/audi/private/dns.ex:83-88 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) protocol/lib/overalls_protocol/execution.ex:197— protocol/lib/overalls_protocol/execution.ex:197-203 | protocol/lib/overalls_protocol/execution.ex:285-290 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex:58— marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex:58-71 | marshall/lib/marshall_web/live/machine_provisioning_live.ex:29-34 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) marshall/lib/marshall/compute/clone_dispatch.ex:10— marshall/lib/marshall/compute/clone_dispatch.ex:10-18 | marshall/lib/marshall/compute/relocation_advance.ex:9-14 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) protocol/lib/overalls_protocol/github_tools.ex:113— protocol/lib/overalls_protocol/github_tools.ex:113-120 | scripts/localization_catalog_migration.ex:470-475 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) lyra/src/config.rs:135— lyra/src/config.rs:135-142 | mila/native/linux/src/session/commands.rs:7-12 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) mila/native/linux/src/pages.rs:228— mila/native/linux/src/pages.rs:228-233 | mila/native/linux/src/views.rs:109-114 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×13
Edited copy of a member (18 corresponding lines) marshall/lib/marshall_web/admin_elevation.ex:32— marshall/lib/marshall_web/admin_elevation.ex:32-55 | marshall/lib/marshall_web/components/layouts.ex:438-455 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) marshall/lib/marshall_web/ingress_api.ex:51— marshall/lib/marshall_web/ingress_api.ex:51-76 | marshall/lib/marshall_web/ssh_api.ex:41-58 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) lyra/src/bin/overalls-ssh-authorize.rs:142— lyra/src/bin/overalls-ssh-authorize.rs:142-161 | lyra/src/bin/overalls-ssh-authorize.rs:163-180 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) mila/windows-dotnet/Interop/RustNativeLifecycle.cs:207— mila/windows-dotnet/Interop/RustNativeLifecycle.cs:207-232 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:348-365 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) lilly/lib/lilly/host/pool_snapshot.ex:80— lilly/lib/lilly/host/pool_snapshot.ex:80-102 | lilly/lib/lilly/host/pool_snapshot.ex:138-155 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) mila/native/linux/src/adapter.rs:389— mila/native/linux/src/adapter.rs:389-406 | mila/native/linux/src/adapter.rs:409-430 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) lyra/src/bin/overalls-trustd.rs:457— lyra/src/bin/overalls-trustd.rs:457-475 | lyra/src/bin/overalls-workspaced.rs:34-51 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) antithesis/workload/repository/client.py:54— antithesis/workload/repository/client.py:54-72 | antithesis/workload/repository/client.py:75-92 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) lilly/lib/lilly/transfer/checkpoint_transfer.ex:401— lilly/lib/lilly/transfer/checkpoint_transfer.ex:401-418 | lilly/lib/lilly/transfer/receiver.ex:138-158 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) marshall/lib/marshall/agents/attachment_tool.ex:69— marshall/lib/marshall/agents/attachment_tool.ex:69-86 | marshall/lib/marshall/agents/attachment_tool.ex:152-169 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) nix/domains/artifacts/guest/native-kernels/illumos/extract_listener_reset.py:9— nix/domains/artifacts/guest/native-kernels/illumos/extract_listener_reset.py:9-28 | nix/domains/artifacts/guest/native-kernels/illumos/extract_viosock_lifetime.py:9-26 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) lilly/lib/lilly/transfer/key_runtime.ex:143— lilly/lib/lilly/transfer/key_runtime.ex:143-160 | lilly/lib/lilly/transfer/source_runtime.ex:176-197 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) lyra/src/guest/ssh_platform.rs:134— lyra/src/guest/ssh_platform.rs:134-151 | lyra/src/guest/ssh_platform.rs:157-182 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (15 corresponding lines) · ×13
Edited copy of a member (15 corresponding lines) mila/native/linux/src/route.rs:438— mila/native/linux/src/route.rs:438-457 | mila/rust/mila-model/src/lib.rs:21-40 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) marshall/lib/marshall/threads.ex:107— marshall/lib/marshall/threads.ex:107-121 | marshall/lib/marshall/threads.ex:142-156 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) ziggy/lib/ziggy/http.ex:116— ziggy/lib/ziggy/http.ex:116-130 | ziggy/lib/ziggy/http.ex:160-176 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) marshall/lib/marshall/editor/retention.ex:11— marshall/lib/marshall/editor/retention.ex:11-25 | marshall/lib/marshall/ingress/web_retention.ex:16-31 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) antithesis/emulation/host/runner.py:164— antithesis/emulation/host/runner.py:164-178 | antithesis/emulation/storage/runner.py:163-177 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) audi/scripts/invalid_boot_probe.exs:86— audi/scripts/invalid_boot_probe.exs:86-102 | lilly/scripts/invalid_boot_probe.exs:79-93 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) ziggy/lib/ziggy/agent_worker.ex:193— ziggy/lib/ziggy/agent_worker.ex:193-207 | ziggy/lib/ziggy/http.ex:576-590 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) antithesis/workload/satellite/authority.py:14— antithesis/workload/satellite/authority.py:14-29 | antithesis/workload/terminal/oracle.py:114-128 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) marshall/lib/marshall/artifacts/blobs.ex:106— marshall/lib/marshall/artifacts/blobs.ex:106-120 | marshall/lib/marshall/artifacts/blobs.ex:125-143 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) mila/native/linux/src/session/signer.rs:77— mila/native/linux/src/session/signer.rs:77-95 | mila/rust/mila-journey/src/main.rs:222-236 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) lilly/native/image-copy/src/materialize.rs:24— lilly/native/image-copy/src/materialize.rs:24-38 | lilly/native/image-copy/src/materialize.rs:64-78 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) mila/rust/mila-runtime/src/push.rs:144— mila/rust/mila-runtime/src/push.rs:144-158 | mila/rust/mila-runtime/src/push.rs:318-335 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) marshall/lib/marshall/accounts/prune_security.ex:7— marshall/lib/marshall/accounts/prune_security.ex:7-21 | marshall/lib/marshall/terminal/reconciler.ex:244-269 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (1 corresponding lines) · ×13
Edited copy of a member (1 corresponding lines) marshall/lib/marshall/operations/git_hub_config.ex:48— marshall/lib/marshall/operations/git_hub_config.ex:48-48 | susan/lib/susan/keys.ex:126-126 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) lilly/lib/lilly/network/flow_lookup.ex:31— lilly/lib/lilly/network/flow_lookup.ex:31-33 | susan/lib/susan/config.ex:220-220 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) audi/lib/audi/dns/authority.ex:87— audi/lib/audi/dns/authority.ex:87-87 | audi/lib/audi/private/dns.ex:29-29 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) marshall/lib/marshall/artifacts/paths.ex:94— marshall/lib/marshall/artifacts/paths.ex:94-94 | susan/lib/susan/http.ex:118-121 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) audi/lib/audi/privacy.ex:68— audi/lib/audi/privacy.ex:68-68 | porsche/lib/porsche/privacy.ex:59-59 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) lilly/lib/lilly/transfer/snapshot_journal.ex:299— lilly/lib/lilly/transfer/snapshot_journal.ex:299-299 | protocol/lib/overalls_protocol/relocation_probe.ex:134-134 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) audi/lib/audi/dns/authority.ex:89— audi/lib/audi/dns/authority.ex:89-89 | audi/lib/audi/private/dns.ex:31-31 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) marshall/lib/marshall/editor/authority.ex:570— marshall/lib/marshall/editor/authority.ex:570-570 | marshall/lib/marshall/ingress/web_logins.ex:267-267 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:291— elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:291-291 | marshall/lib/marshall_web/live/threads_live.ex:832-833 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) marshall/lib/marshall/agents/context.ex:697— marshall/lib/marshall/agents/context.ex:697-697 | marshall/lib/marshall/agents/server_tool.ex:56-56 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) audi/lib/audi/privacy.ex:60— audi/lib/audi/privacy.ex:60-60 | porsche/lib/porsche/privacy.ex:51-51 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) marshall/lib/marshall/enrico/catalog.ex:126— marshall/lib/marshall/enrico/catalog.ex:126-126 | marshall/lib/marshall/galileo/ownership.ex:14-15 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) galileo/lib/galileo/github/http.ex:513— galileo/lib/galileo/github/http.ex:513-515 | marshall/lib/marshall_web/security_headers.ex:103-103 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
MethodTooLong: Script.step mila/native/linux/src/gtk_journey.rs:1436— MethodTooLong — step runs 294 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 194 over it, 2.94× 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: NativeState.ensure_window mila/native/linux/src/main.rs:425— MethodTooLong — ensure_window runs 249 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 149 over it, 2.49× 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: Driver.authenticated mila/rust/mila-journey/src/main.rs:568— MethodTooLong — authenticated runs 224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 124 over it, 2.24× 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: Program.Main REDACTED:17— MethodTooLong — Main runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.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.
MethodTooLong: Store.open elixir/diagnostics/native/spool/src/store.rs:80— MethodTooLong — open runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× 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: Session.handle lilly/native/hostd/src/session.rs:319— MethodTooLong — handle runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× 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: LiveSession.subscribe mila/native/linux/src/session/watch.rs:106— MethodTooLong — subscribe runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55× 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: Worker.launch nix/domains/artifacts/vscode-web-broker/src/windows/worker.rs:179— MethodTooLong — launch runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× 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: SettingsView.body mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:594— MethodTooLong — body runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17× 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: ApplicationSession.thread_action mila/rust/mila-session/src/threads.rs:12— MethodTooLong — thread_action runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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.
MethodTooLong: Daemon.attach nix/domains/artifacts/terminald/src/session.rs:605— MethodTooLong — attach runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TerminalScreen.decode_sixel mila/rust/mila-runtime/src/screen.rs:453— MethodTooLong — decode_sixel runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03× 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.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×12
Edited copy of a member (19 corresponding lines) lilly/lib/lilly/host/zfs.ex:567— lilly/lib/lilly/host/zfs.ex:567-585 | lilly/lib/lilly/host/zfs.ex:627-646 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:618— mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:618-638 | mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:859-877 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lyra/src/bin/overalls-host-certificate-windows.rs:106— lyra/src/bin/overalls-host-certificate-windows.rs:106-124 | lyra/src/bin/overalls-host-certificate.rs:91-113 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lilly/lib/lilly/vm/driver.ex:1911— lilly/lib/lilly/vm/driver.ex:1911-1929 | lilly/lib/lilly/vm/driver.ex:2063-2089 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) marshall/lib/marshall/compute/relocation_cleanup.ex:160— marshall/lib/marshall/compute/relocation_cleanup.ex:160-178 | marshall/lib/marshall/compute/relocation_imports.ex:57-81 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) marshall/lib/marshall/operations/executor_bootstrap.ex:61— marshall/lib/marshall/operations/executor_bootstrap.ex:61-79 | marshall/lib/marshall/operations/git_hub_tools.ex:61-80 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lyra/src/bin/overalls-winprobe.rs:51— lyra/src/bin/overalls-winprobe.rs:51-69 | lyra/src/platform/windows/log.rs:53-72 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lyra/src/sys/windows/iphlp.rs:28— lyra/src/sys/windows/iphlp.rs:28-46 | lyra/src/sys/windows/iphlp.rs:49-67 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) marshall/lib/marshall/ssh/commands.ex:1402— marshall/lib/marshall/ssh/commands.ex:1402-1420 | marshall/lib/marshall/ssh/commands.ex:1429-1453 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lyra/src/sys/windows/net_api.rs:83— lyra/src/sys/windows/net_api.rs:83-106 | nix/domains/artifacts/terminald/src/sys/conpty.rs:77-95 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) mila/native/linux/src/porsche_results.rs:113— mila/native/linux/src/porsche_results.rs:113-135 | mila/native/linux/src/porsche_results.rs:217-235 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) marshall/lib/marshall_web/gettext_interpolation.ex:13— marshall/lib/marshall_web/gettext_interpolation.ex:13-31 | porsche/lib/porsche/gettext_interpolation.ex:13-31 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (14 lines × 2) audi/lib/audi/config.ex:407— audi/lib/audi/config.ex:407-420 | porsche/lib/porsche/config.ex:121-134 — before extracting anything, compare `audi/lib/audi/config.ex` and `porsche/lib/porsche/config.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) audi/lib/audi/slo.ex:124— audi/lib/audi/slo.ex:124-137 | marshall/lib/marshall/slo.ex:172-185 — before extracting anything, compare `audi/lib/audi/slo.ex` and `marshall/lib/marshall/slo.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/slo.ex:124` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) lilly/lib/lilly/network/attribution_server.ex:42— lilly/lib/lilly/network/attribution_server.ex:42-55 | lilly/lib/lilly/private/server.ex:39-52 — before extracting anything, compare `lilly/lib/lilly/network/attribution_server.ex` and `lilly/lib/lilly/private/server.ex` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/network/attribution_server.ex:42` 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) marshall/lib/marshall/compute/relocation_revocations.ex:79— marshall/lib/marshall/compute/relocation_revocations.ex:79-92 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:84-97 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_revocations.ex` and `marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 58 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 `marshall/lib/marshall/compute/relocation_revocations.ex: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.
Duplicated block (14 lines × 2) audi/lib/audi/ssh/proof.ex:20— audi/lib/audi/ssh/proof.ex:20-33 | porsche/lib/porsche/ssh/proof.ex:12-25 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) marshall/lib/marshall/agents/model_calls.ex:816— marshall/lib/marshall/agents/model_calls.ex:816-829 | marshall/lib/marshall/agents/turn_coordinator.ex:106-123 — 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 (14 lines × 2) lilly/lib/lilly/transfer/key_runtime.ex:44— lilly/lib/lilly/transfer/key_runtime.ex:44-57 | lilly/lib/lilly/transfer/source_runtime.ex:59-72 — before extracting anything, compare `lilly/lib/lilly/transfer/key_runtime.ex` and `lilly/lib/lilly/transfer/source_runtime.ex` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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 (14 lines × 2) antithesis/verification/selection.py:141— antithesis/verification/selection.py:141-154 | antithesis/verification/selection.py:158-171 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) mila/native/linux/src/session/commands.rs:140— mila/native/linux/src/session/commands.rs:140-153 | mila/native/linux/src/session/commands.rs:176-189 — 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 `mila/native/linux/src/session/commands.rs:140` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) mila/rust/mila-journey/src/main.rs:596— mila/rust/mila-journey/src/main.rs:596-609 | mila/rust/mila-journey/src/main.rs:618-631 — 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 `mila/rust/mila-journey/src/main.rs:596` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:44— nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:44-57 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:166-179 — 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 `nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:44` 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 (14 lines × 2) antithesis/fixtures/origin/server.py:264— antithesis/fixtures/origin/server.py:264-277 | antithesis/fixtures/smtp/server.py:77-90 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `antithesis/fixtures/origin/server.py:278` calls `get`, `add` and `antithesis/fixtures/smtp/server.py:91` 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.
R4 · Test Coverage· No test reaches this file · ×12
No test reaches this file marshall/scripts/localization_browser/probe.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 nix/domains/artifacts/vscode-web/check-runtime.mts: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 nix/domains/artifacts/vscode-web/prepare-windows.mts: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 nix/domains/artifacts/vscode-web/check-bundled-updates.mts: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 nix/domains/artifacts/vscode-web/check-patches.mts: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 nix/domains/artifacts/vscode-web/check-extension.mts: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 nix/domains/artifacts/vscode-web/check-no-account.mts: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 nix/domains/artifacts/vscode-web/check-policy.mts: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 nix/domains/artifacts/vscode-web/maintenance-entry.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 buck/probes/esbuild/entry.mjs: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 marvin/common/background.mjs: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 buck/probes/esbuild/greeting.mjs: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.
lilly_hostd::transfer::plan (cognitive 47) lilly/native/hostd/src/transfer.rs:561— lilly_hostd::transfer::plan has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 7, loops 3 (6 pts), match/switch 4 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_hostd::run (cognitive 27) lilly/native/hostd/src/main.rs:27— lilly_hostd::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (4 pts), loops 2 (3 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.
lilly_hostd::nft_policy::host_rules (cognitive 26) lilly/native/hostd/src/nft_policy.rs:43— lilly_hostd::nft_policy::host_rules has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (10 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_hostd::parse_options (cognitive 25) lilly/native/hostd/src/lib.rs:61— lilly_hostd::parse_options has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 8, match/switch 3 (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.
lilly_hostd::exec::reap_forever (cognitive 21) lilly/native/hostd/src/exec.rs:84— lilly_hostd::exec::reap_forever has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_hostd::exec::run_inner (cognitive 19) lilly/native/hostd/src/exec.rs:443— lilly_hostd::exec::run_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_hostd::policy::check (cognitive 19) lilly/native/hostd/src/policy.rs:306— lilly_hostd::policy::check has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (14 pts), boolean chains 3, if/else 2 (nesting depth added 7). 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.
lilly_hostd::policy::ip (cognitive 18) lilly/native/hostd/src/policy.rs:124— lilly_hostd::policy::ip has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, if/else 1, loops 1, match/switch 1. 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.
lilly_hostd::files::empty (cognitive 17) lilly/native/hostd/src/files.rs:286— lilly_hostd::files::empty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_hostd::exec::child::pin (cognitive 16) lilly/native/hostd/src/exec.rs:332— lilly_hostd::exec::child::pin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, 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.
lilly_hostd::mounts::perform (cognitive 16) lilly/native/hostd/src/mounts.rs:82— lilly_hostd::mounts::perform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (4 pts) (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.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×11
Members sharing a duplicated core (4 members, 50+ identical tokens) audi/lib/audi/otp_reports.ex:18— audi/lib/audi/otp_reports.ex:18-35 | lilly/lib/lilly/otp_reports.ex:18-35 | marshall/lib/marshall/otp_reports.ex:18-35 | porsche/lib/porsche/otp_reports.ex:18-35 — 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) audi/lib/audi/relay/server.ex:66— audi/lib/audi/relay/server.ex:66-86 | lilly/lib/lilly/ingress/server.ex:114-134 | lilly/lib/lilly/network/attribution_server.ex:97-117 | lilly/lib/lilly/private/server.ex:97-117 — 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) audi/lib/audi/relay/server.ex:107— audi/lib/audi/relay/server.ex:107-128 | lilly/lib/lilly/ingress/server.ex:323-344 | lilly/lib/lilly/network/attribution_server.ex:151-172 | lilly/lib/lilly/private/server.ex:151-172 — 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) lilly/lib/lilly/transfer/clone_copy_journal.ex:167— lilly/lib/lilly/transfer/clone_copy_journal.ex:167-184 | lilly/lib/lilly/transfer/import_journal.ex:112-129 | lilly/lib/lilly/transfer/import_journal.ex:168-198 | lilly/lib/lilly/transfer/snapshot_journal.ex:166-183 — 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) marshall/lib/marshall/agents/cli_access.ex:138— marshall/lib/marshall/agents/cli_access.ex:138-168 | marshall/lib/marshall/inference/retention.ex:11-66 | marshall/lib/marshall/ingress/environment_stream_retention.ex:15-36 | marshall/lib/marshall/ingress/retention.ex:15-36 — 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) marshall/lib/marshall_web/live/admin/access_live.ex:24— marshall/lib/marshall_web/live/admin/access_live.ex:24-32 | marshall/lib/marshall_web/live/admin/access_live.ex:36-44 | marshall/lib/marshall_web/live/admin/access_live.ex:48-56 | marshall/lib/marshall_web/live/admin/workloads_live.ex:45-61 — 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) protocol/lib/overalls_protocol/relocation_destination_revocation.ex:35— protocol/lib/overalls_protocol/relocation_destination_revocation.ex:35-48 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:34-47 | protocol/lib/overalls_protocol/relocation_revocation.ex:34-47 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:37-50 — 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) antithesis/workload/control/delivery.py:131— antithesis/workload/control/delivery.py:131-150 | antithesis/workload/control/dispatch.py:35-54 | antithesis/workload/control/host_sessions.py:50-70 | antithesis/workload/control/scenarios.py:38-57 — 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) lyra/src/guest/mmds.rs:52— lyra/src/guest/mmds.rs:52-61 | lyra/src/guest/readiness.rs:44-53 | lyra/src/native_guest.rs:324-333 | lyra/src/platform/windows/boot_id.rs:20-29 — 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) mila/native/linux/src/pages.rs:347— mila/native/linux/src/pages.rs:347-1019 | mila/native/linux/src/pages.rs:1026-1299 | mila/native/linux/src/views.rs:126-274 | mila/native/linux/src/views.rs:1108-1268 — 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) mila/rust/mila-ffi/src/session.rs:276— mila/rust/mila-ffi/src/session.rs:276-332 | mila/rust/mila-ffi/src/session.rs:1411-1473 | mila/rust/mila-ffi/src/session.rs:1641-1683 | mila/rust/mila-ffi/src/session/watch.rs:44-60 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×11
Edited copy of a member (16 corresponding lines) protocol/lib/overalls_protocol/editor_stream.ex:46— protocol/lib/overalls_protocol/editor_stream.ex:46-62 | protocol/lib/overalls_protocol/web_stream.ex:52-67 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) lilly/lib/lilly/host/zfs.ex:480— lilly/lib/lilly/host/zfs.ex:480-495 | lilly/lib/lilly/host/zfs.ex:508-523 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) porsche/lib/porsche/ssh/onboarding.ex:28— porsche/lib/porsche/ssh/onboarding.ex:28-43 | protocol/lib/overalls_protocol/ssh_onboarding.ex:27-42 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:473— mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:473-488 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:673-689 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) antithesis/fixtures/origin/server.py:122— antithesis/fixtures/origin/server.py:122-141 | antithesis/verification/schema.py:84-99 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) mila/rust/mila-ffi/src/android/validation.rs:187— mila/rust/mila-ffi/src/android/validation.rs:187-202 | mila/rust/mila-ffi/src/android/validation.rs:211-226 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) lilly/lib/lilly/transfer/key_runtime.ex:14— lilly/lib/lilly/transfer/key_runtime.ex:14-29 | lilly/lib/lilly/transfer/source_runtime.ex:26-41 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) audi/lib/audi/privacy.ex:72— audi/lib/audi/privacy.ex:72-91 | porsche/lib/porsche/privacy.ex:63-78 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) lyra/src/telemetry.rs:113— lyra/src/telemetry.rs:113-128 | nix/domains/system/otel-guest/receiver/src/slo.rs:254-273 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) marshall/lib/marshall/compute/admission.ex:340— marshall/lib/marshall/compute/admission.ex:340-356 | marshall/lib/marshall/threads/coordinator.ex:419-434 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) mila/rust/mila-ffi/src/validate/terminal.rs:12— mila/rust/mila-ffi/src/validate/terminal.rs:12-27 | mila/rust/mila-ffi/src/validate/terminal.rs:39-54 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×11
Edited copy of a member (14 corresponding lines) antithesis/workload/control/delivery.py:185— antithesis/workload/control/delivery.py:185-199 | antithesis/workload/control/delivery.py:203-216 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) marshall/lib/marshall/operations/galileo.ex:15— marshall/lib/marshall/operations/galileo.ex:15-28 | marshall/lib/marshall/operations/peach.ex:15-28 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) nix/domains/system/backups/common.py:77— nix/domains/system/backups/common.py:77-90 | nix/domains/system/otel-guest/browser_journey.py:255-273 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) mila/rust/mila-ffi/src/session.rs:1887— mila/rust/mila-ffi/src/session.rs:1887-1902 | mila/rust/mila-ffi/src/session/watch.rs:304-317 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) lyra/src/bin/overalls-ssh-sync-windows.rs:262— lyra/src/bin/overalls-ssh-sync-windows.rs:262-275 | lyra/src/bin/overalls-ssh-sync-windows.rs:277-290 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) audi/lib/audi/ssh/proof.ex:64— audi/lib/audi/ssh/proof.ex:64-77 | porsche/lib/porsche/ssh/proof.ex:66-80 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) audi/lib/audi/status_server.ex:54— audi/lib/audi/status_server.ex:54-71 | porsche/lib/porsche/status_server.ex:42-55 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) mila/rust/mila-ffi/src/android/terminal.rs:367— mila/rust/mila-ffi/src/android/terminal.rs:367-386 | mila/rust/mila-ffi/src/android/terminal.rs:411-424 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) marshall/lib/marshall/accounts/scim_retirement.ex:88— marshall/lib/marshall/accounts/scim_retirement.ex:88-107 | marshall/lib/marshall/accounts/scim_retirement.ex:222-235 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) mila/native/linux/src/session/pty.rs:217— mila/native/linux/src/session/pty.rs:217-230 | mila/native/linux/src/session/pty.rs:232-245 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) nix/domains/artifacts/terminald/src/sys/windows.rs:113— nix/domains/artifacts/terminald/src/sys/windows.rs:113-129 | nix/domains/artifacts/terminald/src/sys/conpty.rs:169-182 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (9 lines × 3) antithesis/control_peer/runner.exs:92— antithesis/control_peer/runner.exs:92-100 | antithesis/control_peer/runner.exs:157-165 | antithesis/control_peer/runner.exs:203-211 — 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 (9 lines × 3) antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:89— antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:89-97 | lilly/lib/lilly/control/store.ex:158-166 | lilly/lib/lilly/host/ownership.ex:121-129 — before extracting anything, compare `antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex` and `lilly/lib/lilly/host/ownership.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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 × 3) marshall/lib/marshall/galileo/credentials.ex:131— marshall/lib/marshall/galileo/credentials.ex:131-139 | marshall/lib/marshall/inference/credentials.ex:205-213 | marshall/lib/marshall/peach/credentials.ex:131-139 — `marshall/lib/marshall/galileo/credentials.ex` and `marshall/lib/marshall/peach/credentials.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/galileo/credentials.ex:131` 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 × 3) audi/lib/audi/config.ex:367— audi/lib/audi/config.ex:367-375 | porsche/lib/porsche/config.ex:81-89 | susan/lib/susan/credentials.ex:26-34 — before extracting anything, compare `audi/lib/audi/config.ex` and `porsche/lib/porsche/config.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 46 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 × 3) antithesis/emulation/guest/runner.py:197— antithesis/emulation/guest/runner.py:197-205 | antithesis/emulation/storage/bootstrap.py:44-52 | antithesis/emulation/storage/runner.py:70-78 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (9 lines × 3) elixir/diagnostics/native/spool/src/schema.rs:23— elixir/diagnostics/native/spool/src/schema.rs:23-31 | lyra/src/agent.rs:481-489 | lyra/src/agent_cli.rs:204-212 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (9 lines × 3) lyra/src/bin/overalls-ssh-authorize.rs:89— lyra/src/bin/overalls-ssh-authorize.rs:89-97 | lyra/src/ssh_config.rs:33-41 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:35-43 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `lyra/src/bin/overalls-ssh-authorize.rs:89` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lyra/src/ssh_config.rs:30` calls `is_ascii_lowercase`, `is_ascii_digit` and `nix/domains/artifacts/vscode-web-broker/src/validate.rs:34` 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 (9 lines × 3) lyra/src/config.rs:146— lyra/src/config.rs:146-154 | lyra/src/ssh_certificate.rs:21-29 | mila/rust/mila-runtime/src/push.rs:302-310 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `lyra/src/config.rs:146` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 × 3) mila/native/linux/src/pages.rs:708— mila/native/linux/src/pages.rs:708-716 | mila/native/linux/src/pages.rs:732-740 | mila/native/linux/src/views.rs:755-763 — before extracting anything, compare `mila/native/linux/src/pages.rs` and `mila/native/linux/src/views.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 41 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 `mila/native/linux/src/pages.rs:708` 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 × 3) mila/native/linux/src/session/commands.rs:17— mila/native/linux/src/session/commands.rs:17-25 | mila/native/linux/src/session/commands.rs:463-471 | mila/native/linux/src/session/connection.rs:86-94 — 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.
Duplicated block (9 lines × 3) scripts/egress_acceptance.py:116— scripts/egress_acceptance.py:116-124 | scripts/galileo_acceptance.py:78-86 | scripts/porsche_acceptance.py:280-288 — 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.
mila_native_linux::pages::build_machines (cognitive 81) mila/native/linux/src/pages.rs:347— mila_native_linux::pages::build_machines has cognitive complexity 81 (threshold 15). Drivers by points: if/else 45 (61 pts), match/switch 10, loops 7 (8 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila_native_linux::pages::build_threads (cognitive 42) mila/native/linux/src/pages.rs:1026— mila_native_linux::pages::build_threads has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 5, loops 4, match/switch 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila_native_linux::views::display_terminal (cognitive 38) mila/native/linux/src/views.rs:315— mila_native_linux::views::display_terminal has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 7 (10 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila_native_linux::journey::run (cognitive 36) mila/native/linux/src/journey.rs:603— mila_native_linux::journey::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (25 pts), match/switch 4 (6 pts), boolean chains 5 (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.
mila_native_linux::views::build_terminal (cognitive 35) mila/native/linux/src/views.rs:475— mila_native_linux::views::build_terminal has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 7 (8 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
mila_native_linux::gtk_journey::page_steps (cognitive 34) mila/native/linux/src/gtk_journey.rs:478— mila_native_linux::gtk_journey::page_steps has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (27 pts), match/switch 4, loops 2, 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.
mila_native_linux::journey::run_pages (cognitive 30) mila/native/linux/src/journey.rs:1214— mila_native_linux::journey::run_pages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 7, loops 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila_native_linux::views::build_deployments (cognitive 18) mila/native/linux/src/views.rs:121— mila_native_linux::views::build_deployments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (4 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.
mila_native_linux::journey::sign_in (cognitive 16) mila/native/linux/src/journey.rs:959— mila_native_linux::journey::sign_in has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila_native_linux::journey::run_guest_terminal (cognitive 16) mila/native/linux/src/journey.rs:1622— mila_native_linux::journey::run_guest_terminal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 2, boolean chains 1, loops 1. Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
D4 · Code Duplication· Edited copies of one member (3 members, 4+ corresponding lines) · ×10
Edited copies of one member (3 members, 4+ corresponding lines) marshall/lib/marshall_web/ingress_api.ex:110— marshall/lib/marshall_web/ingress_api.ex:110-113 | marshall/lib/marshall_web/provisioner_api.ex:53-56 | marshall/lib/marshall_web/ssh_api.ex:82-85 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) lilly/lib/lilly/network.ex:328— lilly/lib/lilly/network.ex:328-331 | lilly/lib/lilly/vm/disk.ex:284-287 | lilly/lib/lilly/vm/driver.ex:2361-2364 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) marshall/lib/marshall/compute/clone_guard.ex:32— marshall/lib/marshall/compute/clone_guard.ex:32-38 | marshall/lib/marshall/compute/resize.ex:106-109 | marshall/lib/marshall/threads/feed_append_job.ex:85-92 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) galileo/lib/galileo/config.ex:45— galileo/lib/galileo/config.ex:45-48 | peach/lib/peach/config.ex:58-61 | ziggy/lib/ziggy/config.ex:125-128 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) protocol/lib/overalls_protocol/editor_stream.ex:15— protocol/lib/overalls_protocol/editor_stream.ex:15-19 | protocol/lib/overalls_protocol/nested_stream.ex:32-36 | protocol/lib/overalls_protocol/web_stream.ex:25-28 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) marshall/lib/marshall/control/services/galileo.ex:15— marshall/lib/marshall/control/services/galileo.ex:15-18 | marshall/lib/marshall/control/services/peach.ex:5-8 | marshall/lib/marshall/control/services/ziggy.ex:22-25 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) lilly/lib/lilly/clone/runtime.ex:99— lilly/lib/lilly/clone/runtime.ex:99-102 | lilly/lib/lilly/transfer/key_runtime.ex:93-96 | lilly/lib/lilly/transfer/source_runtime.ex:117-120 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) marshall/lib/marshall/galileo/credentials.ex:107— marshall/lib/marshall/galileo/credentials.ex:107-110 | marshall/lib/marshall/inference/credentials.ex:178-181 | marshall/lib/marshall/peach/credentials.ex:107-110 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) protocol/lib/overalls_protocol/execution.ex:465— protocol/lib/overalls_protocol/execution.ex:465-468 | protocol/lib/overalls_protocol/relocation.ex:198-201 | protocol/lib/overalls_protocol/terminal.ex:682-685 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) marshall/lib/marshall/mailer/log_filter.ex:29— marshall/lib/marshall/mailer/log_filter.ex:29-32 | marshall/lib/marshall/operations/privacy.ex:7-10 | marshall/lib/marshall_web/terminal_log_filter.ex:7-10 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
mila_native_linux::pages::build_machines (cyclomatic 60) mila/native/linux/src/pages.rs:347— mila_native_linux::pages::build_machines has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mila_native_linux::pages::build_threads (cyclomatic 31) mila/native/linux/src/pages.rs:1026— mila_native_linux::pages::build_threads 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.
mila_native_linux::journey::run (cyclomatic 30) mila/native/linux/src/journey.rs:603— mila_native_linux::journey::run has cyclomatic complexity 30 (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.
mila_native_linux::views::build_terminal (cyclomatic 30) mila/native/linux/src/views.rs:475— mila_native_linux::views::build_terminal has cyclomatic complexity 30 (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.
mila_native_linux::gtk_journey::page_steps (cyclomatic 26) mila/native/linux/src/gtk_journey.rs:478— mila_native_linux::gtk_journey::page_steps has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mila_native_linux::journey::run_pages (cyclomatic 26) mila/native/linux/src/journey.rs:1214— mila_native_linux::journey::run_pages has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
mila_native_linux::journey::run_guest_terminal (cyclomatic 19) mila/native/linux/src/journey.rs:1622— mila_native_linux::journey::run_guest_terminal has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function item 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.
mila_native_linux::views::display_terminal (cyclomatic 18) mila/native/linux/src/views.rs:315— mila_native_linux::views::display_terminal 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.
mila_native_linux::views::build_sign_in (cyclomatic 18) mila/native/linux/src/views.rs:1103— mila_native_linux::views::build_sign_in has cyclomatic complexity 18 (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.
TooManyMethods: RustNative mila/windows-dotnet/Interop/RustNative.cs— TooManyMethods — 874 significant lines (blank, comment-only and punctuation-only lines excluded), 119 methods, declared across 3 files: Interop/RustNative.cs (77), Interop/RustNativeLifecycle.cs (34), Interop/WatchStream.cs (8). The bar is 30 methods; this is 89 over it, 3.97× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: MilaRustFfi mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:330— TooManyMethods — 106 methods. The bar is 30 methods; this is 76 over it, 3.53× 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: MainWindow mila/windows-dotnet/MainWindow.xaml.cs— TooManyMethods — 883 significant lines (blank, comment-only and punctuation-only lines excluded), 93 methods. The bar is 30 methods; this is 63 over it, 3.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LinkedMilaFfiAdapter mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:763— TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. Most of these members implement nativeui.MilaFfiAdapter (36 of 47 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
TooManyMethods: LinkedMilaFFIAdapter mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:330— TooManyMethods — 50 methods. The bar is 30 methods; this is 20 over it, 1.67× the bar. Most of these members implement mila~native~apple~MilaNativeUI.MilaFFIAdapter (31 of 45 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
TooManyMethods: MilaLiveSession mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:143— TooManyMethods — 46 methods. The bar is 30 methods; this is 16 over it, 1.53× 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: MilaSessionHandle mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:510— 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: LiveSession mila/native/linux/src/session/mod.rs:69— TooManyMethods — 40 methods, declared across 5 files: session/commands.rs (18), session/connection.rs (10), session/pty.rs (10), session/mod.rs (1), +1 more file(s). The bar is 30 methods; this is 10 over it, 1.33× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: ApplicationSession mila/rust/mila-session/src/lib.rs:26— TooManyMethods — 38 methods, declared across 10 files: src/machines.rs (7), src/devices.rs (6), src/lib.rs (6), src/terminal.rs (6), +6 more file(s). The bar is 30 methods; this is 8 over it, 1.27× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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 (16 lines × 2) audi/lib/audi/http/listener.ex:56— audi/lib/audi/http/listener.ex:56-71 | audi/lib/audi/private/listener.ex:26-41 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/http/listener.ex:56` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16 lines × 2) marshall/lib/marshall/observability.ex:181— marshall/lib/marshall/observability.ex:181-196 | marshall/lib/marshall/observability.ex:198-213 — 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 `marshall/lib/marshall/observability.ex:181` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) marshall/lib/marshall_web/android_display_socket.ex:32— marshall/lib/marshall_web/android_display_socket.ex:32-47 | marshall/lib/marshall_web/terminal_socket.ex:28-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall_web/android_display_socket.ex:32` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) porsche/scripts/host_certificate_boot_probe.exs:162— porsche/scripts/host_certificate_boot_probe.exs:162-177 | porsche/scripts/invalid_boot_probe.exs:117-132 — before extracting anything, compare `porsche/scripts/host_certificate_boot_probe.exs` and `porsche/scripts/invalid_boot_probe.exs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) marshall/lib/marshall/operations/executor_bootstrap.ex:24— marshall/lib/marshall/operations/executor_bootstrap.ex:24-39 | marshall/lib/marshall/operations/git_hub_tools.ex:24-39 — before extracting anything, compare `marshall/lib/marshall/operations/executor_bootstrap.ex` and `marshall/lib/marshall/operations/git_hub_tools.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) antithesis/workload/repository/fixture.py:50— antithesis/workload/repository/fixture.py:50-65 | antithesis/workload/satellite/origin.py:70-85 — 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 (16 lines × 2) lyra/src/bin/overalls-trustd.rs:478— lyra/src/bin/overalls-trustd.rs:478-493 | lyra/src/bin/overalls-workspaced.rs:113-128 — 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 `lyra/src/bin/overalls-trustd.rs:478` 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 (16 lines × 2) mila/native/linux/src/route.rs:421— mila/native/linux/src/route.rs:421-436 | mila/rust/mila-model/src/source.rs:62-77 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (16 lines × 2) nix/domains/system/otel-guest/receiver/src/slo.rs:394— nix/domains/system/otel-guest/receiver/src/slo.rs:394-409 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:173-188 — before extracting anything, compare `nix/domains/system/otel-guest/receiver/src/slo.rs` and `nix/domains/system/otel-guest/receiver/src/underclass_probe.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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 `nix/domains/system/otel-guest/receiver/src/slo.rs:394` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) audi/scripts/invalid_boot_probe.exs:29— audi/scripts/invalid_boot_probe.exs:29-41 | marshall/scripts/invalid_runtime_boot_probe.exs:64-76 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) marshall/lib/marshall/ingress/routes.ex:49— marshall/lib/marshall/ingress/routes.ex:49-61 | marshall/lib/marshall/ingress/routes.ex:145-157 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marshall/lib/marshall/ingress/routes.ex:62` calls `compare` and `marshall/lib/marshall/ingress/routes.ex:158` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) nix/domains/artifacts/guest/native-promotion/test_verify.exs:422— nix/domains/artifacts/guest/native-promotion/test_verify.exs:422-434 | nix/domains/artifacts/guest/native-promotion/verify.ex:221-233 — 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 × 2) lilly/lib/lilly/transfer/clone_copy_journal.ex:172— lilly/lib/lilly/transfer/clone_copy_journal.ex:172-184 | lilly/lib/lilly/transfer/import_journal.ex:117-129 — before extracting anything, compare `lilly/lib/lilly/transfer/clone_copy_journal.ex` and `lilly/lib/lilly/transfer/import_journal.ex` as WHOLE FILES: this scan already matched 5 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.
Duplicated block (13 lines × 2) enrico/lib/enrico/slo.ex:9— enrico/lib/enrico/slo.ex:9-21 | porsche/lib/porsche/slo.ex:9-25 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) audi/lib/audi/http/editor_assets_probe.ex:140— audi/lib/audi/http/editor_assets_probe.ex:140-152 | audi/lib/audi/tls/probe.ex:67-79 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) mila/native/linux/src/pages.rs:711— mila/native/linux/src/pages.rs:711-723 | mila/native/linux/src/pages.rs:735-747 — 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 `mila/native/linux/src/pages.rs:711` 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 (13 lines × 2) mila/rust/mila-runtime/src/screen.rs:490— mila/rust/mila-runtime/src/screen.rs:490-502 | mila/rust/mila-runtime/src/screen.rs:511-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. Read the line range as the matched WINDOW rather than a finished unit: at `mila/rust/mila-runtime/src/screen.rs:490` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (13 lines × 2) mila/native/linux/src/route.rs:439— mila/native/linux/src/route.rs:439-451 | mila/rust/mila-model/src/lib.rs:22-34 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `mila/native/linux/src/route.rs:439` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
lyra::native_growth::gpt::read (cyclomatic 30) lyra/src/native_growth/gpt.rs:216— lyra::native_growth::gpt::read 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.
lyra::run (cyclomatic 22) lyra/src/main.rs:103— lyra::run has cyclomatic complexity 22 (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.
lyra::agent::web_fetch::html_content (cyclomatic 21) lyra/src/agent/web_fetch.rs:177— lyra::agent::web_fetch::html_content 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.
lyra::native_growth::illumos_vdev (cyclomatic 21) lyra/src/native_growth.rs:322— lyra::native_growth::illumos_vdev 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.
lyra::update::supervise (cyclomatic 18) lyra/src/update.rs:553— lyra::update::supervise 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.
lyra::agent::attachment::execute_transfer (cyclomatic 17) lyra/src/agent/attachment.rs:92— lyra::agent::attachment::execute_transfer 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.
lyra::bin::overalls-native-workspaced::main (cyclomatic 16) lyra/src/bin/overalls-native-workspaced.rs:9— lyra::bin::overalls-native-workspaced::main 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.
lyra::update::work (cyclomatic 16) lyra/src/update.rs:329— lyra::update::work 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.
overalls_vscode_web_broker::windows::files::descriptor_acl (cognitive 30) nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:104— overalls_vscode_web_broker::windows::files::descriptor_acl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 10, 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.
overalls_vscode_web_broker::mmds::response_head (cognitive 26) nix/domains/artifacts/vscode-web-broker/src/mmds.rs:103— overalls_vscode_web_broker::mmds::response_head has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, 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.
overalls_vscode_web_broker::windows_main::probe (cognitive 22) nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:267— overalls_vscode_web_broker::windows_main::probe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
overalls_vscode_web_broker::linux_main::unit_metadata (cognitive 19) nix/domains/artifacts/vscode-web-broker/src/linux_main.rs:333— overalls_vscode_web_broker::linux_main::unit_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
overalls_vscode_web_broker::linux_main::ensure_worker (cognitive 18) nix/domains/artifacts/vscode-web-broker/src/linux_main.rs:631— overalls_vscode_web_broker::linux_main::ensure_worker has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1, match/switch 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.
overalls_vscode_web_broker::windows_main::ensure_worker (cognitive 17) nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:330— overalls_vscode_web_broker::windows_main::ensure_worker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2, 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.
overalls_vscode_web_broker::mmds::exchange (cognitive 16) nix/domains/artifacts/vscode-web-broker/src/mmds.rs:191— overalls_vscode_web_broker::mmds::exchange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
overalls_vscode_web_broker::windows_model::command_line (cognitive 16) nix/domains/artifacts/vscode-web-broker/src/windows_model.rs:686— overalls_vscode_web_broker::windows_model::command_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 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.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×8
Edited copy of a member (22 corresponding lines) audi/lib/audi/tls/fleet_material.ex:150— audi/lib/audi/tls/fleet_material.ex:150-171 | marshall/lib/marshall/ingress/acme/material.ex:150-171 — 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.
Edited copy of a member (22 corresponding lines) marshall/lib/marshall/compute/service_levels.ex:68— marshall/lib/marshall/compute/service_levels.ex:68-89 | marshall/lib/marshall/compute/workflow_service_levels.ex:143-176 — 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.
Edited copy of a member (22 corresponding lines) audi/lib/audi/control/client.ex:389— audi/lib/audi/control/client.ex:389-411 | audi/lib/audi/control/client.ex:500-521 — 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.
Edited copy of a member (22 corresponding lines) nix/domains/system/observability-runtimes/src/fleet_exporter.rs:4— nix/domains/system/observability-runtimes/src/fleet_exporter.rs:4-27 | nix/domains/system/observability-runtimes/src/logging_health.rs:16-37 — 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.
Edited copy of a member (22 corresponding lines) mila/rust/mila-ffi/src/android/terminal.rs:21— mila/rust/mila-ffi/src/android/terminal.rs:21-42 | mila/rust/mila-ffi/src/android/terminal.rs:56-80 — 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.
Edited copy of a member (22 corresponding lines) marshall/lib/marshall/agents/executor_session.ex:611— marshall/lib/marshall/agents/executor_session.ex:611-633 | marshall/lib/marshall/agents/model_calls.ex:370-391 — 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.
Edited copy of a member (22 corresponding lines) audi/lib/audi/dns/server.ex:146— audi/lib/audi/dns/server.ex:146-167 | brady/lib/brady/listener.ex:96-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.
Edited copy of a member (22 corresponding lines) marshall/lib/marshall/agents/thread_delivery.ex:126— marshall/lib/marshall/agents/thread_delivery.ex:126-147 | marshall/lib/marshall/agents/turn_coordinator.ex:13-38 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (26 corresponding lines) · ×8
Edited copy of a member (26 corresponding lines) marshall/lib/marshall/compute/relocation_coordinator.ex:314— marshall/lib/marshall/compute/relocation_coordinator.ex:314-339 | marshall/lib/marshall/compute/relocation_readiness_state.ex:103-130 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) audi/lib/audi/http/browser.ex:18— audi/lib/audi/http/browser.ex:18-43 | audi/lib/audi/http/editor_browser.ex:18-43 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) antithesis/workload/repository/fixture.py:40— antithesis/workload/repository/fixture.py:40-65 | antithesis/workload/satellite/origin.py:60-85 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:302— nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:302-327 | nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:331-362 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) mila/rust/mila-ffi/src/android/terminal.rs:239— mila/rust/mila-ffi/src/android/terminal.rs:239-264 | mila/rust/mila-ffi/src/android/terminal.rs:275-306 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) nix/domains/artifacts/secrets/cli.py:292— nix/domains/artifacts/secrets/cli.py:292-317 | nix/domains/system/backups/restore.py:20-45 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) marshall/lib/marshall/agents/skills.ex:248— marshall/lib/marshall/agents/skills.ex:248-283 | marshall/lib/marshall/agents/skills.ex:288-313 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) marshall/lib/marshall_web/live/resize_live.ex:143— marshall/lib/marshall_web/live/resize_live.ex:143-168 | marshall/lib/marshall_web/live/resize_live.ex:172-197 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (15 lines × 2) audi/lib/audi/http/authority.ex:57— audi/lib/audi/http/authority.ex:57-71 | audi/lib/audi/inception/authority.ex:62-76 — `audi/lib/audi/http/authority.ex` and `audi/lib/audi/inception/authority.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 2 separate duplicated blocks between them, totalling at least 27 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/http/authority.ex:57` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) marshall/lib/marshall/compute/admission.ex:340— marshall/lib/marshall/compute/admission.ex:340-354 | marshall/lib/marshall/galileo/configurations.ex:394-408 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) marshall/lib/marshall/compute/relocation_destination_revocations.ex:19— marshall/lib/marshall/compute/relocation_destination_revocations.ex:19-33 | marshall/lib/marshall/compute/relocation_revocations.ex:19-33 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_destination_revocations.ex` and `marshall/lib/marshall/compute/relocation_revocations.ex` as WHOLE FILES: this scan already matched 5 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.
Duplicated block (15 lines × 2) marshall/lib/marshall/ssh/guest_access.ex:36— marshall/lib/marshall/ssh/guest_access.ex:36-50 | marshall/lib/marshall/ssh/guest_access.ex:86-100 — 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 `marshall/lib/marshall/ssh/guest_access.ex:36` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) audi/lib/audi/tls/fleet_material.ex:132— audi/lib/audi/tls/fleet_material.ex:132-146 | marshall/lib/marshall/ingress/acme/material.ex:132-146 — before extracting anything, compare `audi/lib/audi/tls/fleet_material.ex` and `marshall/lib/marshall/ingress/acme/material.ex` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 × 2) nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:109— nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:109-123 | REDACTED:270-284 — 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) lyra/src/sys/windows/iphlp.rs:32— lyra/src/sys/windows/iphlp.rs:32-46 | lyra/src/sys/windows/iphlp.rs:53-67 — 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 `lyra/src/sys/windows/iphlp.rs:32` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) nix/domains/artifacts/terminald/src/sys/conpty.rs:451— nix/domains/artifacts/terminald/src/sys/conpty.rs:451-466 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:307-321 — before extracting anything, compare `nix/domains/artifacts/terminald/src/sys/conpty.rs` and `nix/domains/artifacts/vscode-web-broker/src/windows/account.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `nix/domains/artifacts/terminald/src/sys/conpty.rs:451` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (8 lines × 3) antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex:29— antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex:29-36 | lilly/lib/lilly/host/mount_table.ex:45-52 | marshall/lib/marshall/compute/enrollment_request.ex:70-77 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex:29` 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) lilly/lib/lilly/transfer/checkpoint_transfer.ex:279— lilly/lib/lilly/transfer/checkpoint_transfer.ex:279-286 | lilly/lib/lilly/vm/checkpoint_storage.ex:380-387 | lilly/lib/lilly/vm/checkpoint_storage.ex:647-654 — 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 `lilly/lib/lilly/transfer/checkpoint_transfer.ex:279` 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) marshall/lib/marshall_web/browser_messages.ex:31— marshall/lib/marshall_web/browser_messages.ex:31-38 | marshall/lib/marshall_web/browser_messages.ex:44-62 | marshall/lib/marshall_web/browser_messages.ex:67-77 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall_web/browser_messages.ex:44` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marshall/lib/marshall_web/browser_messages.ex:30` calls `dgettext` and `marshall/lib/marshall_web/browser_messages.ex:66` 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 (8 lines × 3) lilly/lib/lilly/ingress/server.ex:93— lilly/lib/lilly/ingress/server.ex:93-100 | lilly/lib/lilly/network/attribution_server.ex:76-83 | lilly/lib/lilly/private/server.ex:73-80 — before extracting anything, compare `lilly/lib/lilly/ingress/server.ex` and `lilly/lib/lilly/network/attribution_server.ex` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/ingress/server.ex:93` 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) lilly/lib/lilly/observability.ex:140— lilly/lib/lilly/observability.ex:140-147 | marshall/lib/marshall/observability.ex:402-409 | porsche/lib/porsche/observability.ex:320-327 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/observability.ex:140` 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) marshall/lib/marshall/compute/probe_dispatch.ex:9— marshall/lib/marshall/compute/probe_dispatch.ex:9-16 | marshall/lib/marshall/compute/relocation_key_dispatch.ex:10-17 | marshall/lib/marshall/compute/source_permit_dispatch.ex:9-16 — 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 (8 lines × 3) mila/native/android/scripts/packaged_instrumentation.py:242— mila/native/android/scripts/packaged_instrumentation.py:242-249 | REDACTED:80-87 | nix/domains/system/otel-guest/browser_journey.py:244-251 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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 × 3) lyra/src/telemetry.rs:104— lyra/src/telemetry.rs:104-111 | nix/domains/system/otel-guest/receiver/src/slo.rs:411-418 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:190-197 — before extracting anything, compare `nix/domains/system/otel-guest/receiver/src/slo.rs` and `nix/domains/system/otel-guest/receiver/src/underclass_probe.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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 (5 lines × 3) mila/windows-dotnet/Interop/RustNative.cs:466— mila/windows-dotnet/Interop/RustNative.cs:466-470 | mila/windows-dotnet/Interop/RustNative.cs:488-492 | mila/windows-dotnet/Interop/RustNative.cs:537-541 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mila/windows-dotnet/Interop/RustNative.cs:466` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 3) marshall/lib/marshall/access/sharing.ex:123— marshall/lib/marshall/access/sharing.ex:123-129 | marshall/lib/marshall/compute/views.ex:147-151 | marshall/lib/marshall/threads/sharing.ex:122-126 — `marshall/lib/marshall/access/sharing.ex` and `marshall/lib/marshall/threads/sharing.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marshall/lib/marshall/compute/views.ex:153` calls `filter` and `marshall/lib/marshall/threads/sharing.ex:128` 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 (5 lines × 3) marshall/lib/marshall/redaction/coordinator.ex:89— marshall/lib/marshall/redaction/coordinator.ex:89-93 | marshall/lib/marshall/redaction/coordinator.ex:167-171 | marshall/lib/marshall/redaction/coordinator.ex:180-184 — 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 × 3) marshall/lib/marshall_web/components/layouts.ex:392— marshall/lib/marshall_web/components/layouts.ex:392-397 | marshall/lib/marshall_web/components/layouts.ex:399-403 | marshall/lib/marshall_web/components/layouts.ex:414-418 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall_web/components/layouts.ex:392` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 3) marshall/lib/marshall/editor/token.ex:13— marshall/lib/marshall/editor/token.ex:13-17 | marshall/lib/marshall/ingress/token.ex:23-27 | marshall/lib/marshall/ssh/token.ex:11-15 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marshall/lib/marshall/ingress/token.ex:35` calls `digest` and `marshall/lib/marshall/editor/token.ex: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 (5 lines × 3) marshall/lib/marshall/operations/galileo.ex:33— marshall/lib/marshall/operations/galileo.ex:33-37 | marshall/lib/marshall/operations/inference.ex:45-49 | marshall/lib/marshall/operations/peach.ex:33-37 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/operations/galileo.ex:33` 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 × 3) nix/domains/artifacts/guest/inception/control_tls.py:167— nix/domains/artifacts/guest/inception/control_tls.py:167-171 | nix/domains/artifacts/guest/inception/observations.py:217-221 | nix/domains/artifacts/guest/inception/runtime.py:62-66 — 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 (5 lines × 3) antithesis/emulation/host/runner.py:59— antithesis/emulation/host/runner.py:59-63 | antithesis/emulation/recorder/runner.py:59-63 | antithesis/emulation/storage/runner.py:59-63 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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.
lilly_hostd::transfer::plan (cyclomatic 35) lilly/native/hostd/src/transfer.rs:561— lilly_hostd::transfer::plan 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.
lilly_hostd::policy::ip (cyclomatic 33) lilly/native/hostd/src/policy.rs:124— lilly_hostd::policy::ip has cyclomatic complexity 33 (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.
lilly_hostd::parse_options (cyclomatic 32) lilly/native/hostd/src/lib.rs:61— lilly_hostd::parse_options has cyclomatic complexity 32 (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.
lilly_hostd::protocol::encode_request (cyclomatic 32) lilly/native/hostd/src/protocol.rs:684— lilly_hostd::protocol::encode_request has cyclomatic complexity 32 (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.
lilly_hostd::policy::check (cyclomatic 24) lilly/native/hostd/src/policy.rs:306— lilly_hostd::policy::check has cyclomatic complexity 24 (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.
lilly_hostd::run (cyclomatic 21) lilly/native/hostd/src/main.rs:27— lilly_hostd::run 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.
lilly_hostd::files::perform (cyclomatic 17) lilly/native/hostd/src/files.rs:68— lilly_hostd::files::perform 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.
overalls_otel_guest_receiver::sanitize::sanitize_metrics (cognitive 44) nix/domains/system/otel-guest/receiver/src/sanitize.rs:84— overalls_otel_guest_receiver::sanitize::sanitize_metrics has cognitive complexity 44 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 5 (18 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 31). 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.
overalls_otel_guest_receiver::handle (cognitive 29) nix/domains/system/otel-guest/receiver/src/main.rs:178— overalls_otel_guest_receiver::handle has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (21 pts), if/else 4 (8 pts) (nesting depth added 19). 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.
overalls_otel_guest_receiver::slo::run_with_custody (cognitive 26) nix/domains/system/otel-guest/receiver/src/slo.rs:467— overalls_otel_guest_receiver::slo::run_with_custody has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
overalls_otel_guest_receiver::request_recorder::run (cognitive 23) nix/domains/system/otel-guest/receiver/src/request_recorder.rs:568— overalls_otel_guest_receiver::request_recorder::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (10 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
overalls_otel_guest_receiver::sanitize::sanitize_traces (cognitive 19) nix/domains/system/otel-guest/receiver/src/sanitize.rs:147— overalls_otel_guest_receiver::sanitize::sanitize_traces has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 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.
overalls_otel_guest_receiver::read_request (cognitive 18) nix/domains/system/otel-guest/receiver/src/main.rs:61— overalls_otel_guest_receiver::read_request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 2, 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.
overalls_otel_guest_receiver::underclass_probe::valid_response (cognitive 16) nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:40— overalls_otel_guest_receiver::underclass_probe::valid_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ClassTooLong: Daemon nix/domains/artifacts/terminald/src/session.rs:154— ClassTooLong — 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 27 methods, 2 blocks, lines 154-1069. The bar is 400 significant lines; this is 230 over it, 1.58× 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: Session lilly/native/hostd/src/session.rs:127— ClassTooLong — 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 16 methods, 2 blocks, lines 127-1180. The bar is 400 significant lines; this is 224 over it, 1.56× 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: Driver mila/rust/mila-journey/src/main.rs:238— ClassTooLong — 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 15 methods, 2 blocks, lines 238-996. The bar is 400 significant lines; this is 141 over it, 1.35× 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: Script mila/native/linux/src/gtk_journey.rs:1075— ClassTooLong — 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 11 methods, 2 blocks, lines 1075-1814. The bar is 400 significant lines; this is 136 over it, 1.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: LifecycleSmoke REDACTED— ClassTooLong — 527 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 127 over it, 1.32× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
ClassTooLong: NativeState mila/native/linux/src/main.rs:47— ClassTooLong — 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 24 methods, 2 blocks, lines 47-761. The bar is 400 significant lines; this is 119 over it, 1.30× 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: TerminalScreen mila/rust/mila-runtime/src/screen.rs:97— ClassTooLong — 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 13 methods, 2 blocks, lines 97-673. The bar is 400 significant lines; this is 45 over it, 1.11× 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.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×7
Edited copy of a member (25 corresponding lines) marshall/lib/marshall/access/sharing.ex:120— marshall/lib/marshall/access/sharing.ex:120-148 | marshall/lib/marshall/threads/sharing.ex:119-143 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) galileo/lib/galileo/config.ex:5— galileo/lib/galileo/config.ex:5-39 | peach/lib/peach/config.ex:14-38 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) nix/domains/artifacts/guest/inception/control_tls.py:151— nix/domains/artifacts/guest/inception/control_tls.py:151-182 | nix/domains/artifacts/guest/inception/observations.py:208-232 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) mila/rust/mila-ffi/src/session.rs:152— mila/rust/mila-ffi/src/session.rs:152-183 | mila/rust/mila-ffi/src/session/watch.rs:62-86 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) marshall/lib/marshall/compute/clone_coordinator.ex:294— marshall/lib/marshall/compute/clone_coordinator.ex:294-318 | marshall/lib/marshall/compute/clone_coordinator.ex:458-486 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) marshall/lib/marshall_web/live/admin/audit_live.ex:58— marshall/lib/marshall_web/live/admin/audit_live.ex:58-84 | marshall/lib/marshall_web/live/admin/audit_live.ex:130-154 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) elixir/diagnostics/native/spool/src/sys.rs:26— elixir/diagnostics/native/spool/src/sys.rs:26-50 | nix/domains/system/otel-guest/receiver/src/main.rs:18-44 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (28 corresponding lines) · ×7
Edited copy of a member (28 corresponding lines) mila/native/linux/src/route.rs:19— mila/native/linux/src/route.rs:19-47 | mila/rust/mila-model/src/route.rs:141-168 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) marshall/lib/marshall_web/android_display_socket.ex:15— marshall/lib/marshall_web/android_display_socket.ex:15-47 | marshall/lib/marshall_web/terminal_socket.ex:16-43 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:18— antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:18-45 | lilly/lib/lilly/host/ownership.ex:20-48 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) audi/lib/audi/inception/client_hello.ex:18— audi/lib/audi/inception/client_hello.ex:18-47 | brady/lib/brady/tls/hello.ex:12-39 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) nix/domains/system/brady/storage.py:81— nix/domains/system/brady/storage.py:81-108 | nix/domains/system/fleet-exporter/runtime.py:147-176 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) lyra/src/bin/overalls-readinessd.rs:94— lyra/src/bin/overalls-readinessd.rs:94-121 | lyra/src/native_guest.rs:23-50 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) protocol/lib/overalls_protocol/workload_bundle.ex:237— protocol/lib/overalls_protocol/workload_bundle.ex:237-264 | protocol/lib/overalls_protocol/workload_bundle.ex:281-308 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 12+ corresponding lines) · ×7
Edited copies of one member (3 members, 12+ corresponding lines) mila/windows-dotnet/Interop/RustNative.cs:453— mila/windows-dotnet/Interop/RustNative.cs:453-471 | mila/windows-dotnet/Interop/RustNative.cs:482-493 | mila/windows-dotnet/Interop/RustNative.cs:684-700 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 12+ corresponding lines) lilly/lib/lilly/transfer/clone_copy_journal.ex:192— lilly/lib/lilly/transfer/clone_copy_journal.ex:192-210 | lilly/lib/lilly/transfer/import_journal.ex:202-213 | lilly/lib/lilly/transfer/snapshot_journal.ex:215-231 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 12+ corresponding lines) audi/lib/audi/privacy.ex:40— audi/lib/audi/privacy.ex:40-51 | porsche/lib/porsche/privacy.ex:37-48 | ziggy/lib/ziggy/privacy.ex:35-46 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 12+ corresponding lines) antithesis/workload/control/oracle.py:106— antithesis/workload/control/oracle.py:106-120 | antithesis/workload/satellite/editor.py:166-178 | antithesis/workload/terminal/oracle.py:100-111 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 12+ corresponding lines) lilly/lib/lilly/control/runtime.ex:1304— lilly/lib/lilly/control/runtime.ex:1304-1315 | lilly/lib/lilly/control/runtime.ex:1325-1337 | lilly/lib/lilly/control/runtime.ex:1351-1364 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 12+ corresponding lines) mila/native/linux/src/journey_checks.rs:340— mila/native/linux/src/journey_checks.rs:340-355 | mila/native/linux/src/journey_checks.rs:378-395 | mila/native/linux/src/journey_checks.rs:398-409 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 12+ corresponding lines) scripts/dependency_pins.ex:226— scripts/dependency_pins.ex:226-240 | scripts/dependency_pins.ex:440-456 | scripts/dependency_pins.ex:528-539 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (17 lines × 2) lilly/lib/lilly/inception/runtime.ex:151— lilly/lib/lilly/inception/runtime.ex:151-167 | lilly/lib/lilly/inception/runtime.ex:178-194 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) marshall/lib/marshall/access/sharing.ex:100— marshall/lib/marshall/access/sharing.ex:100-116 | marshall/lib/marshall/threads/sharing.ex:98-114 — `marshall/lib/marshall/access/sharing.ex` and `marshall/lib/marshall/threads/sharing.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marshall/lib/marshall/threads/sharing.ex:117` calls `list`, `t` and `marshall/lib/marshall/access/sharing.ex:119` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17 lines × 2) marshall/lib/marshall/operations/executor_bootstrap.ex:63— marshall/lib/marshall/operations/executor_bootstrap.ex:63-79 | marshall/lib/marshall/operations/git_hub_tools.ex:64-80 — before extracting anything, compare `marshall/lib/marshall/operations/executor_bootstrap.ex` and `marshall/lib/marshall/operations/git_hub_tools.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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, `marshall/lib/marshall/operations/git_hub_tools.ex:63` calls `flatten` and `marshall/lib/marshall/operations/executor_bootstrap.ex:62` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17 lines × 2) lyra/src/bin/overalls-ssh-authorize.rs:520— lyra/src/bin/overalls-ssh-authorize.rs:520-536 | lyra/src/guest/ssh_roster.rs:273-289 — before extracting anything, compare `lyra/src/bin/overalls-ssh-authorize.rs` and `lyra/src/guest/ssh_roster.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (17 lines × 2) lyra/src/bin/overalls-trustd.rs:459— lyra/src/bin/overalls-trustd.rs:459-475 | lyra/src/bin/overalls-workspaced.rs:35-51 — 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 `lyra/src/bin/overalls-trustd.rs:459` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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) mila/rust/mila-ffi/src/commands.rs:32— mila/rust/mila-ffi/src/commands.rs:32-48 | mila/rust/mila-ffi/src/commands.rs:112-128 — 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 `mila/rust/mila-ffi/src/commands.rs:32` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `mila/rust/mila-ffi/src/commands.rs:31` calls `format` and `mila/rust/mila-ffi/src/commands.rs:111` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17 lines × 2) scripts/egress_acceptance.py:478— scripts/egress_acceptance.py:478-494 | scripts/egress_acceptance.py:663-679 — 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 `scripts/egress_acceptance.py:478` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `scripts/egress_acceptance.py:496` calls `fixture` and `scripts/egress_acceptance.py:680` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 3) mila/windows-dotnet/Interop/RustNative.cs:807— mila/windows-dotnet/Interop/RustNative.cs:807-813 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:186-192 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:423-429 — 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 `mila/windows-dotnet/Interop/RustNative.cs:807` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 3) lilly/lib/lilly/transfer/clone_copy_journal.ex:168— lilly/lib/lilly/transfer/clone_copy_journal.ex:168-174 | lilly/lib/lilly/transfer/import_journal.ex:113-119 | lilly/lib/lilly/transfer/snapshot_journal.ex:167-173 — before extracting anything, compare `lilly/lib/lilly/transfer/clone_copy_journal.ex` and `lilly/lib/lilly/transfer/import_journal.ex` as WHOLE FILES: this scan already matched 5 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 `lilly/lib/lilly/transfer/clone_copy_journal.ex:168` 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) protocol/lib/overalls_protocol/relocation_cleanup.ex:79— protocol/lib/overalls_protocol/relocation_cleanup.ex:79-85 | protocol/lib/overalls_protocol/relocation_readiness.ex:92-98 | protocol/lib/overalls_protocol/relocation_receive.ex:79-85 — 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 before the matched lines, `protocol/lib/overalls_protocol/relocation_receive.ex:76` calls `results`, `term`, `result` and `protocol/lib/overalls_protocol/relocation_cleanup.ex:77` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 3) mila/native/linux/src/pages.rs:711— mila/native/linux/src/pages.rs:711-717 | mila/native/linux/src/pages.rs:735-741 | mila/native/linux/src/views.rs:737-743 — before extracting anything, compare `mila/native/linux/src/pages.rs` and `mila/native/linux/src/views.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 41 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 `mila/native/linux/src/pages.rs:711` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `mila/native/linux/src/views.rs:735` calls `with_label`, `text` and `mila/native/linux/src/pages.rs:709` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 3) mila/native/linux/src/route.rs:253— mila/native/linux/src/route.rs:253-259 | mila/rust/mila-model/src/route.rs:218-224 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:46-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 3) mila/rust/mila-ffi/src/session.rs:766— mila/rust/mila-ffi/src/session.rs:766-772 | mila/rust/mila-ffi/src/session.rs:800-806 | mila/rust/mila-ffi/src/session.rs:833-839 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mila/rust/mila-ffi/src/session.rs:766` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) nix/domains/system/otel-guest/receiver/src/slo.rs:315— nix/domains/system/otel-guest/receiver/src/slo.rs:315-322 | nix/domains/system/otel-guest/receiver/src/slo.rs:352-361 | nix/domains/system/otel-guest/receiver/src/slo.rs:373-379 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `nix/domains/system/otel-guest/receiver/src/slo.rs:315` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication· Edited copy of a member (30 corresponding lines) · ×6
Edited copy of a member (30 corresponding lines) antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:67— antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:67-97 | lilly/lib/lilly/host/ownership.ex:100-129 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) marshall/lib/marshall_web/controllers/audi_login_controller.ex:12— marshall/lib/marshall_web/controllers/audi_login_controller.ex:12-45 | marshall/lib/marshall_web/controllers/editor_controller.ex:40-69 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) marshall/lib/marshall/ssh/guest_access.ex:21— marshall/lib/marshall/ssh/guest_access.ex:21-50 | marshall/lib/marshall/ssh/guest_access.ex:62-100 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) marshall/lib/marshall/teams/coordinator.ex:249— marshall/lib/marshall/teams/coordinator.ex:249-278 | marshall/lib/marshall/teams/coordinator.ex:286-319 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) lilly/native/boot-log/src/cli.rs:23— lilly/native/boot-log/src/cli.rs:23-52 | lilly/native/launch-guard/src/lib.rs:86-119 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) mila/native/linux/src/session/commands.rs:59— mila/native/linux/src/session/commands.rs:59-88 | mila/native/linux/src/session/commands.rs:429-459 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 10+ corresponding lines) · ×6
Edited copies of one member (3 members, 10+ corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:231— mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:231-240 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:294-304 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:491-502 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 10+ corresponding lines) lilly/lib/lilly/terminal/vsock.ex:189— lilly/lib/lilly/terminal/vsock.ex:189-198 | lilly/lib/lilly/terminal/vsock.ex:219-229 | lilly/lib/lilly/terminal/vsock.ex:261-270 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 10+ corresponding lines) galileo/lib/galileo/github/response.ex:82— galileo/lib/galileo/github/response.ex:82-91 | marshall/lib/marshall/agents/context_manifest.ex:144-153 | marshall/lib/marshall/agents/context_manifest.ex:189-198 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 10+ corresponding lines) mila/native/linux/src/journey_checks.rs:210— mila/native/linux/src/journey_checks.rs:210-219 | mila/native/linux/src/journey_checks.rs:303-314 | mila/native/linux/src/journey_checks.rs:323-337 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 10+ corresponding lines) lilly/lib/lilly/transfer/checkpoint_transfer.ex:422— lilly/lib/lilly/transfer/checkpoint_transfer.ex:422-431 | lilly/lib/lilly/transfer/importer.ex:107-120 | lilly/lib/lilly/transfer/receiver.ex:215-228 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 10+ corresponding lines) lilly/native/export-channel/src/posix.rs:2— lilly/native/export-channel/src/posix.rs:2-14 | nix/domains/system/otel-guest/receiver/src/main.rs:229-238 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:200-213 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 4+ corresponding lines) · ×6
Edited copies of one member (5 members, 4+ corresponding lines) audi/lib/audi/config.ex:388— audi/lib/audi/config.ex:388-394 | lilly/lib/lilly/host/image.ex:356-359 | marshall/lib/marshall/operations/private_files.ex:89-92 | porsche/lib/porsche/config.ex:102-108 | susan/lib/susan/credentials.ex:84-90 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
Edited copies of one member (5 members, 4+ corresponding lines) audi/lib/audi/http/headers.ex:172— audi/lib/audi/http/headers.ex:172-178 | audi/lib/audi/inception/client_hello.ex:94-98 | marshall/lib/marshall/ingress/publications.ex:308-313 | protocol/lib/overalls_protocol/editor_connect.ex:116-119 | protocol/lib/overalls_protocol/inception_parent.ex:31-36 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
Edited copies of one member (5 members, 4+ corresponding lines) antithesis/emulation/host/bootstrap.py:43— antithesis/emulation/host/bootstrap.py:43-46 | antithesis/emulation/host/runner.py:87-90 | antithesis/emulation/storage/bootstrap.py:33-36 | REDACTED:63-66 | antithesis/emulation/storage/runner.py:104-107 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
Edited copies of one member (5 members, 4+ corresponding lines) marshall/lib/marshall/editor/authority.ex:507— marshall/lib/marshall/editor/authority.ex:507-510 | marshall/lib/marshall/ingress/execution.ex:206-209 | marshall/lib/marshall/ingress/relays.ex:282-287 | marshall/lib/marshall/ingress/routes.ex:182-185 | marshall/lib/marshall/ingress/sessions.ex:229-232 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
Edited copies of one member (5 members, 4+ corresponding lines) lilly/lib/lilly/vm/credentials.ex:135— lilly/lib/lilly/vm/credentials.ex:135-138 | lilly/lib/lilly/vm/inception_exchange.ex:110-113 | lilly/lib/lilly/vm/kernel_attestation.ex:112-115 | lilly/lib/lilly/vm/readiness.ex:95-98 | lilly/lib/lilly/vm/workspace_source.ex:284-287 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
Edited copies of one member (5 members, 4+ corresponding lines) lilly/lib/lilly/host/limits.ex:159— lilly/lib/lilly/host/limits.ex:159-162 | lilly/lib/lilly/host/pool.ex:380-383 | lilly/lib/lilly/host/usage.ex:138-141 | marshall/lib/marshall_web/terminal_gateway_api.ex:119-122 | marshall/lib/marshall_web/terminal_socket.ex:54-57 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 2+ corresponding lines) · ×6
Edited copies of one member (3 members, 2+ corresponding lines) marshall/lib/marshall_web/live/admin/access_live.ex:12— marshall/lib/marshall_web/live/admin/access_live.ex:12-13 | marshall/lib/marshall_web/live/admin/operations_live.ex:12-13 | marshall/lib/marshall_web/live/admin/workloads_live.ex:12-13 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 2+ corresponding lines) protocol/lib/overalls_protocol/disk_transfer.ex:107— protocol/lib/overalls_protocol/disk_transfer.ex:107-108 | protocol/lib/overalls_protocol/relocation.ex:204-205 | protocol/lib/overalls_protocol/terminal.ex:726-727 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 2+ corresponding lines) marshall/lib/marshall/control/services/lilly.ex:43— marshall/lib/marshall/control/services/lilly.ex:43-45 | marshall/lib/marshall/control/services/peach.ex:13-14 | marshall/lib/marshall/control/services/ziggy.ex:34-36 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 2+ corresponding lines) marshall/lib/marshall/compute/drains.ex:313— marshall/lib/marshall/compute/drains.ex:313-314 | marshall/lib/marshall/compute/evacuations.ex:437-438 | marshall/lib/marshall/compute/relocation_guard.ex:63-64 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 2+ corresponding lines) audi/lib/audi/config.ex:382— audi/lib/audi/config.ex:382-383 | porsche/lib/porsche/config.ex:96-97 | susan/lib/susan/credentials.ex:78-79 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 2+ corresponding lines) lilly/lib/lilly/ingress/server.ex:163— lilly/lib/lilly/ingress/server.ex:163-164 | lilly/lib/lilly/network/attribution_server.ex:123-124 | lilly/lib/lilly/private/server.ex:123-124 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (10 lines × 3) audi/lib/audi/privacy.ex:40— audi/lib/audi/privacy.ex:40-49 | porsche/lib/porsche/privacy.ex:37-46 | ziggy/lib/ziggy/privacy.ex:35-44 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/privacy.ex:40` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) lilly/lib/lilly/ingress/server.ex:307— lilly/lib/lilly/ingress/server.ex:307-316 | lilly/lib/lilly/network/attribution_server.ex:135-144 | lilly/lib/lilly/private/server.ex:135-144 — before extracting anything, compare `lilly/lib/lilly/ingress/server.ex` and `lilly/lib/lilly/network/attribution_server.ex` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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 × 3) audi/lib/audi/http/authority.ex:78— audi/lib/audi/http/authority.ex:78-87 | audi/lib/audi/http/editor.ex:105-114 | audi/lib/audi/http/editor.ex:120-129 — 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.
Duplicated block (10 lines × 3) antithesis/emulation/host/bootstrap.py:58— antithesis/emulation/host/bootstrap.py:58-67 | antithesis/emulation/host/private_bootstrap.py:62-71 | antithesis/emulation/host/runner.py:74-83 — 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 (10 lines × 3) antithesis/workload/control/delivery.py:136— antithesis/workload/control/delivery.py:136-145 | antithesis/workload/control/dispatch.py:40-49 | antithesis/workload/control/scenarios.py:44-53 — 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 (10 lines × 3) lyra/src/bin/overalls-trustd.rs:70— lyra/src/bin/overalls-trustd.rs:70-79 | lyra/src/open_cli.rs:41-50 | lyra/src/workspace_receiver.rs:47-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Off the main sequence: mila-model — mila-model: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: overalls_antithesis_sdk — overalls_antithesis_sdk: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 8 project(s), so it's rigid to change.
Off the main sequence: overalls_diagnostics — overalls_diagnostics: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 10 project(s), so it's rigid to change.
Off the main sequence: overalls_request_accounting — overalls_request_accounting: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 7 project(s), so it's rigid to change.
Off the main sequence: overalls_protocol — overalls_protocol: abstractness 0.01, instability 0.00, distance 0.99 — zone of pain — concrete and depended on by 10 project(s), so it's rigid to change.
Off the main sequence: mila-protocol — mila-protocol: abstractness 0.00, instability 0.17, distance 0.83 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
Repeated repair: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt:12— mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is MilaSessionListing.boundedDisplay at line 12), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(mila-android): decode the Rust session listing as JSON”; “fix(android): cap machine listing projections”; “fix(mila): repair native listing build errors”; “fix(mila): stabilize native listing projections”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: marshall/lib/marshall/compute/ledger.ex marshall/lib/marshall/compute/ledger.ex:36— marshall/lib/marshall/compute/ledger.ex changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is Ledger.commit_scope at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(native): retain lost-candidate promotions as exact verified outputs”; “fix(marshall): guest-credential host reads take FOR KEY SHARE, fenced by FOR UPDATE writers”; “fix(marshall): end compute_hosts lock convoy; stamp telemetry with deployment revision”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- marshall/lib/marshall/compute/ledger.ex`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lilly/lib/lilly/terminal/stream.ex lilly/lib/lilly/terminal/stream.ex:706— lilly/lib/lilly/terminal/stream.ex changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is Stream.control at line 706), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix Android display relay connections”; “Fix Android display stream cleanup”; “Fix host boot-log access and OmniOS growth operand”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- lilly/lib/lilly/terminal/stream.ex`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: nix/domains/artifacts/guest/inception/control_proofs.py nix/domains/artifacts/guest/inception/control_proofs.py:161— nix/domains/artifacts/guest/inception/control_proofs.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is control_proofs.update at line 161), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: complete nested Inception bootstrap and validation”; “nix: give BEAM proxy sockets the full start budget; fix ty gate”; “fix: complete inception publication and certificate bootstrap”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- nix/domains/artifacts/guest/inception/control_proofs.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: marshall/lib/marshall_web/live/admin/scim_live.ex marshall/lib/marshall_web/live/admin/scim_live.ex:136— marshall/lib/marshall_web/live/admin/scim_live.ex changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is ScimLive.oidc_form at line 136), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(scim): keep admin status page available on count errors”; “fix(scim): give SCIM configuration its own elevation grammar”; “fix(scim): real OIDC code flow, SCIM sign-in page and split admin operations”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 05:08:28 +00:00' --until='2026-11-16 05:08:28 +00:00' --full-history --no-merges -- marshall/lib/marshall_web/live/admin/scim_live.ex`: 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.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×5
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
D4 · Code Duplication· Edited copy of a member (24 corresponding lines) · ×5
Edited copy of a member (24 corresponding lines) lilly/lib/lilly/transfer/key_runtime.ex:110— lilly/lib/lilly/transfer/key_runtime.ex:110-133 | lilly/lib/lilly/transfer/source_runtime.ex:132-156 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) marshall/lib/marshall/ingress/web_streams.ex:43— marshall/lib/marshall/ingress/web_streams.ex:43-91 | marshall/lib/marshall/ingress/web_streams.ex:123-146 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) porsche/scripts/host_certificate_boot_probe.exs:150— porsche/scripts/host_certificate_boot_probe.exs:150-177 | porsche/scripts/invalid_boot_probe.exs:109-132 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) mila/rust/mila-ffi/src/actions.rs:27— mila/rust/mila-ffi/src/actions.rs:27-50 | mila/rust/mila-ffi/src/validate/snapshot.rs:31-60 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) marshall/lib/marshall/compute/host_reports.ex:23— marshall/lib/marshall/compute/host_reports.ex:23-46 | marshall/lib/marshall/compute/host_reports.ex:51-79 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 9+ corresponding lines) · ×5
Edited copies of one member (3 members, 9+ corresponding lines) nix/verification/hegel/python/hegel/generators.py:328— nix/verification/hegel/python/hegel/generators.py:328-336 | nix/verification/hegel/python/hegel/generators.py:340-348 | nix/verification/hegel/python/hegel/generators.py:352-360 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 9+ corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:323— mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:323-331 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:505-513 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:516-524 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 9+ corresponding lines) mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:222— mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:222-230 | mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:243-251 | mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:304-319 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 9+ corresponding lines) marshall/lib/marshall/accounts/security.ex:447— marshall/lib/marshall/accounts/security.ex:447-455 | marshall/lib/marshall/compute/cloning.ex:127-135 | marshall/lib/marshall/threads/controls.ex:173-182 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 9+ corresponding lines) marshall/lib/marshall_web/live/admin/git_live.ex:14— marshall/lib/marshall_web/live/admin/git_live.ex:14-26 | marshall/lib/marshall_web/live/admin/git_live.ex:46-54 | marshall/lib/marshall_web/live/admin/users_live.ex:94-113 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
TerminalScreen::csi (cyclomatic 38) mila/rust/mila-runtime/src/screen.rs:335— TerminalScreen::csi has cyclomatic complexity 38 (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.
TerminalScreen::decode_sixel (cyclomatic 34) mila/rust/mila-runtime/src/screen.rs:453— TerminalScreen::decode_sixel has cyclomatic complexity 34 (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.
TerminalScreen::feed (cyclomatic 32) mila/rust/mila-runtime/src/screen.rs:156— TerminalScreen::feed has cyclomatic complexity 32 (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.
TerminalScreen::sgr (cyclomatic 23) mila/rust/mila-runtime/src/screen.rs:585— TerminalScreen::sgr 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.
Dead code: TryClassifyMachineCommand mila/windows-dotnet/Interop/RustNative.cs:774— Method TryClassifyMachineCommand — Roslyn's SymbolFinder walked every project the solution loads, including Mila.Windows, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: TrySessionTerminalPoll mila/windows-dotnet/Interop/RustNative.cs:794— Method TrySessionTerminalPoll — Roslyn's SymbolFinder walked every project the solution loads, including Mila.Windows, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: TryValidatePushPoke mila/windows-dotnet/Interop/RustNative.cs:851— Method TryValidatePushPoke — Roslyn's SymbolFinder walked every project the solution loads, including Mila.Windows, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: MilaUnavailablePokeKeySource mila/windows-dotnet/Interop/WindowsPushRegistration.cs:23— NamedType MilaUnavailablePokeKeySource — Roslyn's SymbolFinder walked every project the solution loads, including Mila.Windows, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
TerminalScreen::decode_sixel (cognitive 65) mila/rust/mila-runtime/src/screen.rs:453— TerminalScreen::decode_sixel has cognitive complexity 65 (threshold 15). Drivers by points: loops 9 (27 pts), if/else 8 (26 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TerminalScreen::feed (cognitive 27) mila/rust/mila-runtime/src/screen.rs:156— TerminalScreen::feed has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 5 (9 pts), loops 1 (nesting depth added 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TerminalScreen::csi (cognitive 27) mila/rust/mila-runtime/src/screen.rs:335— TerminalScreen::csi has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TerminalScreen::sgr (cognitive 26) mila/rust/mila-runtime/src/screen.rs:585— TerminalScreen::sgr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_terminald::control_message (cognitive 26) nix/domains/artifacts/terminald/src/main.rs:219— lilly_terminald::control_message has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 12 (24 pts), loops 1 (2 pts) (nesting depth added 13). 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.
lilly_terminald::pty::spawn (cognitive 18) nix/domains/artifacts/terminald/src/pty.rs:251— lilly_terminald::pty::spawn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 2 (3 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.
lilly_terminald::sys::pty::run_child (cognitive 18) nix/domains/artifacts/terminald/src/sys/pty.rs:243— lilly_terminald::sys::pty::run_child has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, loops 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.
lilly_terminald::observer::handle (cognitive 16) nix/domains/artifacts/terminald/src/observer.rs:117— lilly_terminald::observer::handle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (4 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.
TooManyFunctions: lyra::update lyra/src/update.rs:40— TooManyFunctions — 36 free functions. The bar is 30 free functions; 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.
TooManyFunctions: Checkpoint lilly/lib/lilly/vm/checkpoint.ex:1— TooManyFunctions — 35 functions. The bar is 30 functions; this is 5 over it, 1.17× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: Network lilly/lib/lilly/network.ex:1— TooManyFunctions — 34 functions. The bar is 30 functions; this is 4 over it, 1.13× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
TooManyFunctions: Authority marshall/lib/marshall/terminal/authority.ex:1— TooManyFunctions — 33 functions. The bar is 30 functions; this is 3 over it, 1.10× the bar. The counted members are a module's functions — a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility.
D4 · Code Duplication· Edited copy of a member (27 corresponding lines) · ×4
Edited copy of a member (27 corresponding lines) mila/windows-dotnet/MainWindow.xaml.cs:422— mila/windows-dotnet/MainWindow.xaml.cs:422-451 | mila/windows-dotnet/MainWindow.xaml.cs:481-507 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (27 corresponding lines) lilly/lib/lilly/transfer/key_runtime.ex:63— lilly/lib/lilly/transfer/key_runtime.ex:63-89 | lilly/lib/lilly/transfer/source_runtime.ex:78-113 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (27 corresponding lines) mila/native/linux/src/session/commands.rs:127— mila/native/linux/src/session/commands.rs:127-153 | mila/native/linux/src/session/commands.rs:163-189 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (27 corresponding lines) mila/rust/mila-ffi/src/session.rs:1084— mila/rust/mila-ffi/src/session.rs:1084-1110 | mila/rust/mila-ffi/src/session.rs:1157-1184 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (20 corresponding lines) · ×4
Edited copy of a member (20 corresponding lines) lyra/src/ssh_config.rs:22— lyra/src/ssh_config.rs:22-41 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:24-43 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) mila/native/linux/src/device_key.rs:49— mila/native/linux/src/device_key.rs:49-76 | mila/rust/mila-journey/src/main.rs:200-219 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) audi/lib/audi/http/authority.ex:14— audi/lib/audi/http/authority.ex:14-33 | audi/lib/audi/inception/authority.ex:14-38 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) marshall/lib/marshall/access/sharing.ex:97— marshall/lib/marshall/access/sharing.ex:97-116 | marshall/lib/marshall/threads/sharing.ex:95-114 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 17+ corresponding lines) · ×4
Edited copies of one member (3 members, 17+ corresponding lines) antithesis/emulation/host/bootstrap.py:50— antithesis/emulation/host/bootstrap.py:50-67 | antithesis/emulation/host/private_bootstrap.py:55-71 | antithesis/emulation/host/runner.py:67-83 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 17+ corresponding lines) lilly/scripts/smoke_guest.exs:153— lilly/scripts/smoke_guest.exs:153-174 | lilly/scripts/smoke_jailed.exs:469-488 | marshall/scripts/smoke_execution.exs:613-629 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 17+ corresponding lines) audi/lib/audi/slo.ex:121— audi/lib/audi/slo.ex:121-137 | elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:151-167 | marshall/lib/marshall/slo.ex:169-185 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 17+ corresponding lines) marshall/lib/marshall/galileo/credentials.ex:53— marshall/lib/marshall/galileo/credentials.ex:53-69 | marshall/lib/marshall/inference/credentials.ex:104-126 | marshall/lib/marshall/peach/credentials.ex:53-69 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 8+ corresponding lines) · ×4
Edited copies of one member (3 members, 8+ corresponding lines) marshall/lib/marshall/operations/galileo.ex:33— marshall/lib/marshall/operations/galileo.ex:33-40 | marshall/lib/marshall/operations/inference.ex:45-52 | marshall/lib/marshall/operations/peach.ex:33-40 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) marshall/lib/marshall/redaction/coordinator.ex:205— marshall/lib/marshall/redaction/coordinator.ex:205-212 | marshall/lib/marshall/redaction/coordinator.ex:216-223 | marshall/lib/marshall/redaction/coordinator.ex:227-235 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) marshall/lib/marshall/notifications/device_actions.ex:26— marshall/lib/marshall/notifications/device_actions.ex:26-33 | marshall/lib/marshall/ssh/authority.ex:16-26 | marshall/lib/marshall/ssh/key_actions.ex:13-20 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) lilly/lib/lilly/host/inventory.ex:115— lilly/lib/lilly/host/inventory.ex:115-123 | marshall/lib/marshall_web/live/git_live.ex:108-115 | marshall/lib/marshall_web/live/git_live.ex:119-126 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 2+ corresponding lines) · ×4
Edited copies of one member (4 members, 2+ corresponding lines) enrico/lib/enrico/http.ex:123— enrico/lib/enrico/http.ex:123-128 | enrico/lib/enrico/manager.ex:259-265 | protocol/lib/overalls_protocol.ex:164-165 | ziggy/lib/ziggy/request_id.ex:20-25 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 2+ corresponding lines) marshall/lib/marshall/agents/context_policy.ex:145— marshall/lib/marshall/agents/context_policy.ex:145-146 | marshall/lib/marshall/agents/model_protocol.ex:705-708 | protocol/lib/overalls_protocol/inference.ex:59-60 | ziggy/lib/ziggy/route.ex:47-48 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 2+ corresponding lines) marshall/lib/marshall/agents/cli_access.ex:194— marshall/lib/marshall/agents/cli_access.ex:194-195 | protocol/lib/overalls_protocol/editor_name.ex:31-32 | protocol/lib/overalls_protocol/image_manifest.ex:671-672 | protocol/lib/overalls_protocol/kernel_attestation.ex:105-106 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 2+ corresponding lines) audi/lib/audi/authority/stream_guard.ex:85— audi/lib/audi/authority/stream_guard.ex:85-86 | marshall/lib/marshall/terminal/peer_socket.ex:144-145 | marshall/lib/marshall/terminal/remote.ex:144-145 | ziggy/lib/ziggy/lease.ex:71-72 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 1+ corresponding lines) · ×4
Edited copies of one member (3 members, 1+ corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:910— mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:910-910 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:917-919 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:75-78 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 1+ corresponding lines) marshall/lib/marshall/agents/executor_rpc.ex:304— marshall/lib/marshall/agents/executor_rpc.ex:304-305 | nix/domains/artifacts/guest/native-promotion/verify.ex:312-312 | protocol/lib/overalls_protocol/github_tools.ex:19-19 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 1+ corresponding lines) marshall/lib/marshall/compute/cloning.ex:55— marshall/lib/marshall/compute/cloning.ex:55-55 | marshall/lib/marshall/compute/lifecycle.ex:334-334 | marshall/lib/marshall/compute/relocation_admission.ex:103-103 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 1+ corresponding lines) marshall/lib/marshall/ingress/control_requests.ex:93— marshall/lib/marshall/ingress/control_requests.ex:93-93 | marshall/lib/marshall/ssh/control_requests.ex:52-53 | marshall/lib/marshall_web/ingress_api.ex:121-122 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (19 lines × 2) antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:27— antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:27-45 | lilly/lib/lilly/host/ownership.ex:30-48 — before extracting anything, compare `antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex` and `lilly/lib/lilly/host/ownership.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex: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 (19 lines × 2) protocol/lib/overalls_protocol/workload_bundle.ex:237— protocol/lib/overalls_protocol/workload_bundle.ex:237-255 | protocol/lib/overalls_protocol/workload_bundle.ex:281-299 — 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 `protocol/lib/overalls_protocol/workload_bundle.ex:237` 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 (19 lines × 2) antithesis/workload/control/delivery.py:131— antithesis/workload/control/delivery.py:131-149 | antithesis/workload/control/dispatch.py:35-53 — 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) nix/domains/artifacts/guest/inception/control_tls.py:164— nix/domains/artifacts/guest/inception/control_tls.py:164-182 | nix/domains/artifacts/guest/inception/observations.py:214-232 — 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 `nix/domains/artifacts/guest/inception/control_tls.py:164` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) audi/lib/audi/slo.ex:62— audi/lib/audi/slo.ex:62-79 | marshall/lib/marshall/slo.ex:107-124 — before extracting anything, compare `audi/lib/audi/slo.ex` and `marshall/lib/marshall/slo.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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 (18 lines × 2) audi/lib/audi/tls/fleet_material.ex:150— audi/lib/audi/tls/fleet_material.ex:150-167 | marshall/lib/marshall/ingress/acme/material.ex:150-167 — before extracting anything, compare `audi/lib/audi/tls/fleet_material.ex` and `marshall/lib/marshall/ingress/acme/material.ex` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 (18 lines × 2) marshall/lib/marshall/compute/lifecycle.ex:243— marshall/lib/marshall/compute/lifecycle.ex:243-260 | marshall/lib/marshall/compute/relocation_admission.ex:83-100 — 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 `marshall/lib/marshall/compute/lifecycle.ex:243` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) marshall/lib/marshall/terminal/peer_socket.ex:196— marshall/lib/marshall/terminal/peer_socket.ex:196-213 | marshall/lib/marshall/terminal/remote.ex:297-314 — 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 (6 lines × 4) lilly/lib/lilly/transfer/clone_copy_journal.ex:168— lilly/lib/lilly/transfer/clone_copy_journal.ex:168-173 | lilly/lib/lilly/transfer/import_journal.ex:113-118 | lilly/lib/lilly/transfer/import_journal.ex:174-179 | lilly/lib/lilly/transfer/snapshot_journal.ex:167-172 — before extracting anything, compare `lilly/lib/lilly/transfer/clone_copy_journal.ex` and `lilly/lib/lilly/transfer/import_journal.ex` as WHOLE FILES: this scan already matched 5 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 `lilly/lib/lilly/transfer/clone_copy_journal.ex:168` 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 × 4) mila/native/linux/src/pages.rs:712— mila/native/linux/src/pages.rs:712-717 | mila/native/linux/src/pages.rs:736-741 | mila/native/linux/src/views.rs:245-250 | mila/native/linux/src/views.rs:738-743 — before extracting anything, compare `mila/native/linux/src/pages.rs` and `mila/native/linux/src/views.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 41 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 `mila/native/linux/src/pages.rs:712` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `mila/native/linux/src/views.rs:737` calls `clone` and `mila/native/linux/src/views.rs:244` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 4) lilly/native/hostd/src/nft_policy.rs:16— lilly/native/hostd/src/nft_policy.rs:16-21 | lyra/src/agent/context.rs:120-125 | lyra/src/agent/maintenance.rs:96-101 | lyra/src/agent/managed_skills/validate.rs:56-61 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (6 lines × 4) lyra/src/guest/mmds.rs:45— lyra/src/guest/mmds.rs:45-50 | lyra/src/guest/readiness.rs:37-42 | lyra/src/workspace_receiver.rs:40-45 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:6-11 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lyra/src/workspace_receiver.rs:37` calls `bytes`, `all`, `is_ascii_hexdigit` and `lyra/src/guest/mmds.rs:45` 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.
mila_protocol::grammar::validate_command (cyclomatic 87) mila/rust/mila-protocol/src/grammar.rs:174— mila_protocol::grammar::validate_command has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mila_protocol::terminal::decode_attach_header (cyclomatic 22) mila/rust/mila-protocol/src/terminal.rs:87— mila_protocol::terminal::decode_attach_header has cyclomatic complexity 22 (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.
mila_protocol::lex::lex (cyclomatic 16) mila/rust/mila-protocol/src/lex.rs:3— mila_protocol::lex::lex 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.
Session::handle (cyclomatic 28) lilly/native/hostd/src/session.rs:319— Session::handle has cyclomatic complexity 28 (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.
Session::run (cyclomatic 16) lilly/native/hostd/src/session.rs:659— Session::run 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.
Session::transfer_stream (cyclomatic 16) lilly/native/hostd/src/session.rs:784— Session::transfer_stream has cyclomatic complexity 16 (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.
overalls_trace_spool::forward (cyclomatic 25) elixir/diagnostics/native/spool/src/main.rs:159— overalls_trace_spool::forward 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.
overalls_trace_spool::run (cyclomatic 23) elixir/diagnostics/native/spool/src/main.rs:343— overalls_trace_spool::run 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.
overalls_trace_spool::request (cyclomatic 20) elixir/diagnostics/native/spool/src/main.rs:87— overalls_trace_spool::request 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.
overalls_vscode_web_broker::windows::files::descriptor_acl (cyclomatic 25) nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:104— overalls_vscode_web_broker::windows::files::descriptor_acl 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.
overalls_vscode_web_broker::mmds::response_head (cyclomatic 18) nix/domains/artifacts/vscode-web-broker/src/mmds.rs:103— overalls_vscode_web_broker::mmds::response_head 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.
overalls_vscode_web_broker::windows_main::probe (cyclomatic 17) nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:267— overalls_vscode_web_broker::windows_main::probe 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.
overalls_trace_spool::forward (cognitive 33) elixir/diagnostics/native/spool/src/main.rs:159— overalls_trace_spool::forward has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 8, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
overalls_trace_spool::request (cognitive 28) elixir/diagnostics/native/spool/src/main.rs:87— overalls_trace_spool::request has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 3, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
overalls_trace_spool::run (cognitive 23) elixir/diagnostics/native/spool/src/main.rs:343— overalls_trace_spool::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (6 pts), boolean chains 5, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Daemon::pump_loop (cognitive 19) nix/domains/artifacts/terminald/src/session.rs:910— Daemon::pump_loop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), match/switch 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.
Daemon::attach (cognitive 16) nix/domains/artifacts/terminald/src/session.rs:605— Daemon::attach has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Daemon::writer_loop (cognitive 16) nix/domains/artifacts/terminald/src/session.rs:781— Daemon::writer_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×3
Edited copy of a member (21 corresponding lines) lilly/lib/lilly/transfer/received_dataset.ex:255— lilly/lib/lilly/transfer/received_dataset.ex:255-284 | lilly/lib/lilly/transfer/received_dataset.ex:302-322 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) marshall/lib/marshall_web/live/machines_live.ex:352— marshall/lib/marshall_web/live/machines_live.ex:352-372 | marshall/lib/marshall_web/live/machines_live.ex:376-404 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) marshall/lib/marshall/access/sharing.ex:12— marshall/lib/marshall/access/sharing.ex:12-32 | marshall/lib/marshall/threads/sharing.ex:14-37 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 20+ corresponding lines) · ×3
Edited copies of one member (3 members, 20+ corresponding lines) mila/windows-dotnet/Interop/RustNative.cs:795— mila/windows-dotnet/Interop/RustNative.cs:795-815 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:81-104 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:412-431 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 20+ corresponding lines) susan/lib/susan/operator.ex:69— susan/lib/susan/operator.ex:69-88 | susan/lib/susan/operator.ex:93-114 | susan/lib/susan/operator.ex:119-141 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 20+ corresponding lines) marshall/lib/marshall_web/live/account_live.ex:160— marshall/lib/marshall_web/live/account_live.ex:160-180 | marshall/lib/marshall_web/live/admin/users_live.ex:32-55 | marshall/lib/marshall_web/live/admin/users_live.ex:59-78 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×3
Edited copy of a member (23 corresponding lines) audi/lib/audi/control/client.ex:44— audi/lib/audi/control/client.ex:44-73 | porsche/lib/porsche/client.ex:129-151 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) antithesis/workload/access/mail.py:73— antithesis/workload/access/mail.py:73-101 | antithesis/workload/access/mail.py:104-126 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) nix/domains/artifacts/vscode-web-broker/src/linux_main.rs:237— nix/domains/artifacts/vscode-web-broker/src/linux_main.rs:237-259 | nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:144-167 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 21+ corresponding lines) · ×3
Edited copies of one member (3 members, 21+ corresponding lines) enrico/scripts/invalid_boot_probe.exs:86— enrico/scripts/invalid_boot_probe.exs:86-109 | galileo/scripts/invalid_boot_probe.exs:87-110 | ziggy/scripts/invalid_boot_probe.exs:88-108 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 21+ corresponding lines) mila/native/linux/src/session/commands.rs:28— mila/native/linux/src/session/commands.rs:28-50 | mila/native/linux/src/session/commands.rs:473-493 | mila/native/linux/src/session/commands.rs:500-521 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 21+ corresponding lines) antithesis/emulation/host/runner.py:33— antithesis/emulation/host/runner.py:33-55 | antithesis/emulation/recorder/runner.py:32-55 | antithesis/emulation/storage/runner.py:35-55 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 11+ corresponding lines) · ×3
Edited copies of one member (3 members, 11+ corresponding lines) nix/domains/artifacts/vscode-web-broker/src/boot.rs:13— nix/domains/artifacts/vscode-web-broker/src/boot.rs:13-23 | nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs:182-193 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:272-288 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 11+ corresponding lines) mila/rust/mila-ffi/src/session.rs:1520— mila/rust/mila-ffi/src/session.rs:1520-1530 | mila/rust/mila-ffi/src/session.rs:1542-1553 | mila/rust/mila-ffi/src/session.rs:1612-1628 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 11+ corresponding lines) nix/verification/hegel/python/hegel/generators.py:399— nix/verification/hegel/python/hegel/generators.py:399-412 | nix/verification/hegel/python/hegel/generators.py:438-448 | nix/verification/hegel/python/hegel/generators.py:452-462 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 9+ corresponding lines) · ×3
Edited copies of one member (4 members, 9+ corresponding lines) mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:221— mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:221-229 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:334-345 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:375-384 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:390-399 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 9+ corresponding lines) lilly/native/ingress-bridge/src/cli.rs:22— lilly/native/ingress-bridge/src/cli.rs:22-32 | lilly/native/launch-guard/src/lib.rs:71-81 | lilly/native/source-export/src/cli.rs:15-23 | lilly/native/transfer-stream/src/cli.rs:21-32 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 9+ corresponding lines) lilly/lib/lilly/control/runtime.ex:1619— lilly/lib/lilly/control/runtime.ex:1619-1627 | lilly/lib/lilly/control/runtime.ex:1647-1656 | lilly/lib/lilly/control/runtime.ex:1677-1687 | lilly/lib/lilly/control/runtime.ex:1708-1718 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 6+ corresponding lines) · ×3
Edited copies of one member (3 members, 6+ corresponding lines) galileo/lib/galileo/github/response.ex:95— galileo/lib/galileo/github/response.ex:95-100 | lilly/lib/lilly/transfer/import_journal.ex:269-278 | protocol/lib/overalls_protocol/github_tools.ex:59-64 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 6+ corresponding lines) nix/domains/artifacts/guest/inception/git_identity.py:125— nix/domains/artifacts/guest/inception/git_identity.py:125-134 | nix/domains/artifacts/guest/inception/private_pki.py:82-88 | nix/domains/artifacts/guest/inception/runtime.py:30-35 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 6+ corresponding lines) nix/domains/artifacts/guest/inception/control_tls.py:129— nix/domains/artifacts/guest/inception/control_tls.py:129-135 | nix/domains/artifacts/host/enrollment.py:90-95 | nix/domains/system/acme/publish.py:106-111 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 5+ corresponding lines) · ×3
Edited copies of one member (3 members, 5+ corresponding lines) protocol/lib/overalls_protocol/relocation_cleanup.ex:34— protocol/lib/overalls_protocol/relocation_cleanup.ex:34-47 | protocol/lib/overalls_protocol/relocation_readiness.ex:37-49 | protocol/lib/overalls_protocol/relocation_readiness.ex:58-62 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 5+ corresponding lines) antithesis/emulation/guest/runner.py:229— antithesis/emulation/guest/runner.py:229-233 | nix/domains/artifacts/guest/windows/stage-editor.py:35-40 | tools/buck2_no_nix.py:89-93 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 5+ corresponding lines) lilly/lib/lilly/vm/disk.ex:522— lilly/lib/lilly/vm/disk.ex:522-526 | lilly/lib/lilly/vm/driver.ex:2376-2380 | lilly/lib/lilly/vm/workload_bundle.ex:248-252 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 4+ corresponding lines) · ×3
Edited copies of one member (4 members, 4+ corresponding lines) protocol/lib/overalls_protocol/clone_control.ex:84— protocol/lib/overalls_protocol/clone_control.ex:84-87 | protocol/lib/overalls_protocol/relocation_cleanup.ex:68-71 | protocol/lib/overalls_protocol/relocation_readiness.ex:71-74 | protocol/lib/overalls_protocol/relocation_receive.ex:35-41 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 4+ corresponding lines) antithesis/lilly/lib/overalls_antithesis/lilly/guest_rpc.ex:75— antithesis/lilly/lib/overalls_antithesis/lilly/guest_rpc.ex:75-78 | audi/lib/audi/config.ex:397-400 | porsche/lib/porsche/config.ex:111-114 | susan/lib/susan/credentials.ex:59-62 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 4+ corresponding lines) audi/lib/audi/control/client.ex:797— audi/lib/audi/control/client.ex:797-800 | lilly/lib/lilly/control/client.ex:939-942 | porsche/lib/porsche/client.ex:264-267 | ziggy/lib/ziggy/control.ex:114-117 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Duplicated block (6–7 lines × 2) mila/windows-dotnet/Interop/RustNative.cs:465— mila/windows-dotnet/Interop/RustNative.cs:465-471 | mila/windows-dotnet/Interop/RustNative.cs:488-493 — 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 `mila/windows-dotnet/Interop/RustNative.cs:465` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 (6–7 lines × 2) lilly/lib/lilly/transfer/key.ex:161— lilly/lib/lilly/transfer/key.ex:161-167 | lilly/lib/lilly/vm/checkpoint_storage.ex:272-277 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/transfer/key.ex:161` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6–7 lines × 2) marshall/lib/marshall/compute/relocation_cleanup.ex:119— marshall/lib/marshall/compute/relocation_cleanup.ex:119-125 | marshall/lib/marshall/compute/relocation_deletion.ex:135-140 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Script::step (cyclomatic 69) mila/native/linux/src/gtk_journey.rs:1436— Script::step has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Script::guest_tick (cyclomatic 23) mila/native/linux/src/gtk_journey.rs:1192— Script::guest_tick 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.
lilly_zfs_namespace_unmount::sweep::sweep (cyclomatic 46) lilly/native/zfs-namespace-unmount/src/sweep.rs:137— lilly_zfs_namespace_unmount::sweep::sweep has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
lilly_zfs_namespace_unmount::plan::classify_line (cyclomatic 17) lilly/native/zfs-namespace-unmount/src/plan.rs:109— lilly_zfs_namespace_unmount::plan::classify_line 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.
WatchChannel::decode (cyclomatic 23) mila/rust/mila-transport/src/watch_channel.rs:156— WatchChannel::decode 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.
WatchChannel::read_within (cyclomatic 17) mila/rust/mila-transport/src/watch_channel.rs:97— WatchChannel::read_within 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.
lilly_terminald::control_message (cyclomatic 23) nix/domains/artifacts/terminald/src/main.rs:219— lilly_terminald::control_message has cyclomatic complexity 23 (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.
lilly_terminald::sys::pty::run_child (cyclomatic 17) nix/domains/artifacts/terminald/src/sys/pty.rs:243— lilly_terminald::sys::pty::run_child 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.
overalls_otel_guest_receiver::read_request (cyclomatic 20) nix/domains/system/otel-guest/receiver/src/main.rs:61— overalls_otel_guest_receiver::read_request 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.
overalls_otel_guest_receiver::sanitize::sanitize_metrics (cyclomatic 16) nix/domains/system/otel-guest/receiver/src/sanitize.rs:84— overalls_otel_guest_receiver::sanitize::sanitize_metrics 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.
lilly_ingress_bridge::run::bridge (cyclomatic 18) lilly/native/ingress-bridge/src/run.rs:130— lilly_ingress_bridge::run::bridge 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.
lilly_ingress_bridge::run::run (cyclomatic 17) lilly/native/ingress-bridge/src/run.rs:19— lilly_ingress_bridge::run::run 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.
Script::step (cognitive 104) mila/native/linux/src/gtk_journey.rs:1436— Script::step has cognitive complexity 104 (threshold 15). Drivers by points: if/else 41 (79 pts), boolean chains 15, match/switch 4 (10 pts) (nesting depth added 44). 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.
Script::guest_tick (cognitive 33) mila/native/linux/src/gtk_journey.rs:1192— Script::guest_tick has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila_protocol::grammar::validate_command (cognitive 86) mila/rust/mila-protocol/src/grammar.rs:174— mila_protocol::grammar::validate_command has cognitive complexity 86 (threshold 15). Drivers by points: if/else 38 (52 pts), boolean chains 32, loops 1, match/switch 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.
mila_protocol::lex::lex (cognitive 21) mila/rust/mila-protocol/src/lex.rs:3— mila_protocol::lex::lex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_zfs_namespace_unmount::sweep::sweep (cognitive 71) lilly/native/zfs-namespace-unmount/src/sweep.rs:137— lilly_zfs_namespace_unmount::sweep::sweep has cognitive complexity 71 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 8 (20 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_zfs_namespace_unmount::plan::classify_line (cognitive 18) lilly/native/zfs-namespace-unmount/src/plan.rs:109— lilly_zfs_namespace_unmount::plan::classify_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
lilly_source_export::run::run_sender (cognitive 57) lilly/native/source-export/src/run.rs:134— lilly_source_export::run::run_sender has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 6 (19 pts), loops 3 (8 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_source_export::run::run (cognitive 16) lilly/native/source-export/src/run.rs:78— lilly_source_export::run::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LiveSession::subscribe (cognitive 54) mila/native/linux/src/session/watch.rs:106— LiveSession::subscribe has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 7 (11 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LiveSession::thread_action (cognitive 16) mila/native/linux/src/session/commands.rs:240— LiveSession::thread_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 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.
lilly_ingress_bridge::run::bridge (cognitive 35) lilly/native/ingress-bridge/src/run.rs:130— lilly_ingress_bridge::run::bridge has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_ingress_bridge::run::run (cognitive 21) lilly/native/ingress-bridge/src/run.rs:19— lilly_ingress_bridge::run::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, match/switch 2 (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.
Session::handle (cognitive 31) lilly/native/hostd/src/session.rs:319— Session::handle has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 6 (11 pts) (nesting depth added 15). 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.
Session::run (cognitive 17) lilly/native/hostd/src/session.rs:659— Session::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Store::open (cognitive 24) elixir/diagnostics/native/spool/src/store.rs:80— Store::open has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, loops 2, match/switch 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.
Store::open (cognitive 16) nix/domains/system/otel-guest/receiver/src/durable_slo.rs:410— Store::open has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WatchChannel::read_within (cognitive 24) mila/rust/mila-transport/src/watch_channel.rs:97— WatchChannel::read_within has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WatchChannel::decode (cognitive 23) mila/rust/mila-transport/src/watch_channel.rs:156— WatchChannel::decode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, match/switch 2 (4 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.
mila_ffi::validate::trust::mila_trust_document_reconcile (cognitive 19) mila/rust/mila-ffi/src/validate/trust.rs:51— mila_ffi::validate::trust::mila_trust_document_reconcile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mila_ffi::commands::mila_session_command_format (cognitive 16) mila/rust/mila-ffi/src/commands.rs:57— mila_ffi::commands::mila_session_command_format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (5 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.
D4 · Code Duplication· Members sharing a duplicated core (10 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (10 members, 50+ identical tokens) marshall/lib/marshall/compute/relocation_cleanup.ex:135— marshall/lib/marshall/compute/relocation_cleanup.ex:135-156 | marshall/lib/marshall/compute/relocation_destination_cleanups.ex:23-49 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:16-43 | marshall/lib/marshall/compute/relocation_imports.ex:27-53 | marshall/lib/marshall/compute/relocation_key_retirement.ex:15-41 | marshall/lib/marshall/compute/relocation_keys.ex:18-60 | marshall/lib/marshall/compute/relocation_probes.ex:28-56 | marshall/lib/marshall/compute/relocation_readiness.ex:27-52 | marshall/lib/marshall/compute/relocation_revocations.ex:16-43 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:16-44 — These 10 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 10 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 10 times.
Members sharing a duplicated core (10 members, 50+ identical tokens) mila/rust/mila-ffi/src/session.rs:336— mila/rust/mila-ffi/src/session.rs:336-356 | mila/rust/mila-ffi/src/session.rs:373-402 | mila/rust/mila-ffi/src/session.rs:419-449 | mila/rust/mila-ffi/src/session.rs:465-487 | mila/rust/mila-ffi/src/session.rs:503-524 | mila/rust/mila-ffi/src/session.rs:543-581 | mila/rust/mila-ffi/src/session.rs:729-750 | mila/rust/mila-ffi/src/session.rs:867-891 | mila/rust/mila-ffi/src/session.rs:1124-1145 | mila/rust/mila-ffi/src/session.rs:1197-1221 — These 10 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 10 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 10 times.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (6 members, 50+ identical tokens) lilly/lib/lilly/vm/credentials.ex:107— lilly/lib/lilly/vm/credentials.ex:107-131 | lilly/lib/lilly/vm/flush.ex:11-42 | lilly/lib/lilly/vm/guest_trust.ex:67-92 | lilly/lib/lilly/vm/inception_exchange.ex:77-106 | lilly/lib/lilly/vm/kernel_attestation.ex:78-108 | lilly/lib/lilly/vm/readiness.ex:68-91 — 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) lilly/native/boot-log/src/main.rs:6— lilly/native/boot-log/src/main.rs:6-14 | lilly/native/ingress-bridge/src/main.rs:6-14 | lilly/native/launch-guard/src/main.rs:6-14 | lilly/native/resume-token/src/main.rs:6-14 | lilly/native/source-export/src/main.rs:6-14 | lilly/native/transfer-stream/src/main.rs:6-14 — 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.
D4 · Code Duplication· Edited copy of a member (40 corresponding lines) · ×2
Edited copy of a member (40 corresponding lines) audi/lib/audi/http/browser.ex:48— audi/lib/audi/http/browser.ex:48-87 | audi/lib/audi/http/editor_browser.ex:48-87 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (40 corresponding lines) lilly/lib/lilly/transfer/permit_journal.ex:34— lilly/lib/lilly/transfer/permit_journal.ex:34-73 | lilly/lib/lilly/transfer/permit_journal.ex:108-158 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (36 corresponding lines) · ×2
Edited copy of a member (36 corresponding lines) lyra/src/bin/overalls-trustd.rs:128— lyra/src/bin/overalls-trustd.rs:128-163 | lyra/src/guest/trust.rs:67-103 — These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (36 corresponding lines) marshall/lib/marshall/access/admin_actions.ex:35— marshall/lib/marshall/access/admin_actions.ex:35-70 | marshall/lib/marshall/ssh/admin_actions.ex:98-137 — These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (32 corresponding lines) · ×2
Edited copy of a member (32 corresponding lines) mila/windows-dotnet/Interop/RustNative.cs:320— mila/windows-dotnet/Interop/RustNative.cs:320-351 | mila/windows-dotnet/Interop/RustNative.cs:415-448 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (32 corresponding lines) lyra/src/bin/overalls-workspaced-windows.rs:96— lyra/src/bin/overalls-workspaced-windows.rs:96-136 | lyra/src/bin/overalls-workspaced.rs:68-99 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (44 corresponding lines) · ×2
Edited copy of a member (44 corresponding lines) marshall/lib/marshall/ingress/services.ex:34— marshall/lib/marshall/ingress/services.ex:34-77 | marshall/lib/marshall/ingress/services.ex:81-139 — These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (44 corresponding lines) lilly/lib/lilly/network/ingress.ex:21— lilly/lib/lilly/network/ingress.ex:21-66 | lilly/lib/lilly/network/ingress.ex:86-129 — These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (37 corresponding lines) · ×2
Edited copy of a member (37 corresponding lines) marshall/lib/marshall/galileo/authorizations.ex:191— marshall/lib/marshall/galileo/authorizations.ex:191-227 | marshall/lib/marshall/inference/requests.ex:195-231 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (37 corresponding lines) mila/rust/mila-ffi/src/android/session_bridge.rs:332— mila/rust/mila-ffi/src/android/session_bridge.rs:332-368 | mila/rust/mila-ffi/src/android/session_bridge.rs:385-424 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (34 corresponding lines) · ×2
Edited copy of a member (34 corresponding lines) lyra/src/bin/overalls-trustd.rs:81— lyra/src/bin/overalls-trustd.rs:81-123 | lyra/src/workspace_receiver.rs:61-94 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (34 corresponding lines) nix/domains/artifacts/guest/readiness.py:101— nix/domains/artifacts/guest/readiness.py:101-135 | nix/domains/artifacts/guest/readiness.py:139-172 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (31 corresponding lines) · ×2
Edited copy of a member (31 corresponding lines) marshall/lib/marshall/github.ex:631— marshall/lib/marshall/github.ex:631-669 | marshall/lib/marshall/github.ex:675-705 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (31 corresponding lines) mila/rust/mila-ffi/src/android/terminal.rs:91— mila/rust/mila-ffi/src/android/terminal.rs:91-121 | mila/rust/mila-ffi/src/android/terminal.rs:165-197 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 20+ corresponding lines) · ×2
Edited copies of one member (4 members, 20+ corresponding lines) marshall/lib/marshall/compute/relocation_destination_cleanups.ex:53— marshall/lib/marshall/compute/relocation_destination_cleanups.ex:53-74 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:47-68 | marshall/lib/marshall/compute/relocation_revocations.ex:47-66 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:48-70 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 20+ corresponding lines) marshall/lib/marshall/compute/relocation_destination_revocations.ex:72— marshall/lib/marshall/compute/relocation_destination_revocations.ex:72-94 | marshall/lib/marshall/compute/relocation_key_retirement.ex:70-89 | marshall/lib/marshall/compute/relocation_revocations.ex:70-92 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:74-97 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 15+ corresponding lines) · ×2
Edited copies of one member (3 members, 15+ corresponding lines) lilly/lib/lilly/ingress/server.ex:296— lilly/lib/lilly/ingress/server.ex:296-316 | lilly/lib/lilly/network/attribution_server.ex:130-144 | lilly/lib/lilly/private/server.ex:130-144 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 15+ corresponding lines) mila/rust/mila-ffi/src/session.rs:676— mila/rust/mila-ffi/src/session.rs:676-690 | mila/rust/mila-ffi/src/session.rs:703-717 | mila/rust/mila-ffi/src/session.rs:903-917 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 13+ corresponding lines) · ×2
Edited copies of one member (4 members, 13+ corresponding lines) antithesis/workload/access/oracle.py:108— antithesis/workload/access/oracle.py:108-120 | antithesis/workload/access/oracle.py:138-153 | antithesis/workload/access/oracle.py:156-171 | antithesis/workload/admission/capacity.py:126-138 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 13+ corresponding lines) marshall/lib/marshall_web/live/admin/workloads_live.ex:25— marshall/lib/marshall_web/live/admin/workloads_live.ex:25-41 | marshall/lib/marshall_web/live/machines_live.ex:247-259 | marshall/lib/marshall_web/live/machines_live.ex:332-348 | marshall/lib/marshall_web/live/machines_live.ex:412-430 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 13+ corresponding lines) · ×2
Edited copies of one member (3 members, 13+ corresponding lines) audi/lib/audi/slo.ex:156— audi/lib/audi/slo.ex:156-168 | porsche/lib/porsche/observability.ex:275-292 | ziggy/lib/ziggy/spool.ex:236-248 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 13+ corresponding lines) audi/lib/audi/privacy.ex:6— audi/lib/audi/privacy.ex:6-18 | porsche/lib/porsche/privacy.ex:7-19 | ziggy/lib/ziggy/privacy.ex:7-19 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (8 members, 4+ corresponding lines) · ×2
Edited copies of one member (8 members, 4+ corresponding lines) protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:56— protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:56-59 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:75-78 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:74-77 | protocol/lib/overalls_protocol/relocation_keys.ex:83-86 | protocol/lib/overalls_protocol/relocation_receive.ex:65-68 | protocol/lib/overalls_protocol/relocation_revocation.ex:74-77 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:77-80 | protocol/lib/overalls_protocol/relocation_source.ex:89-92 — These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart.
Edited copies of one member (8 members, 4+ corresponding lines) audi/lib/audi/dns/replica.ex:120— audi/lib/audi/dns/replica.ex:120-123 | audi/lib/audi/http/editor_assets_publisher.ex:79-82 | audi/lib/audi/ssh/key_publisher.ex:77-80 | audi/lib/audi/status_server.ex:80-83 | audi/lib/audi/tls/fleet_worker.ex:101-104 | audi/lib/audi/tls/readiness.ex:116-119 | protocol/lib/overalls_protocol/control/client.ex:111-114 | susan/lib/susan/source_address.ex:61-64 — These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 7+ corresponding lines) · ×2
Edited copies of one member (3 members, 7+ corresponding lines) brady/lib/brady/metrics.ex:241— brady/lib/brady/metrics.ex:241-247 | porsche/lib/porsche/observability.ex:301-309 | ziggy/lib/ziggy/spool.ex:436-444 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 7+ corresponding lines) marshall/lib/marshall/compute/advance_drain.ex:7— marshall/lib/marshall/compute/advance_drain.ex:7-13 | marshall/lib/marshall/compute/advance_evacuation.ex:11-17 | marshall/lib/marshall/compute/lifecycle.ex:43-54 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (7 members, 1+ corresponding lines) · ×2
Edited copies of one member (7 members, 1+ corresponding lines) elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:300— elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:300-301 | lilly/lib/lilly/host/backup_snapshot.ex:220-220 | lilly/lib/lilly/lifecycle/image_template.ex:45-46 | lilly/lib/lilly/lifecycle/provisioning.ex:89-89 | lilly/lib/lilly/transfer/clone_copy_journal.ex:285-285 | lilly/lib/lilly/vm/workspace_source.ex:311-311 | marshall/lib/marshall/agents/skills.ex:771-771 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
Edited copies of one member (7 members, 1+ corresponding lines) protocol/lib/overalls_protocol/checkpoint.ex:62— protocol/lib/overalls_protocol/checkpoint.ex:62-63 | protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:81-81 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:93-93 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:92-92 | protocol/lib/overalls_protocol/relocation_keys.ex:101-101 | protocol/lib/overalls_protocol/relocation_revocation.ex:92-92 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:95-95 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
Duplicated block (26 lines × 2) porsche/scripts/host_certificate_boot_probe.exs:51— porsche/scripts/host_certificate_boot_probe.exs:51-76 | porsche/scripts/invalid_boot_probe.exs:42-67 — before extracting anything, compare `porsche/scripts/host_certificate_boot_probe.exs` and `porsche/scripts/invalid_boot_probe.exs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 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 `porsche/scripts/host_certificate_boot_probe.exs:51` 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 (26 lines × 2) protocol/lib/overalls_protocol/image_manifest.ex:498— protocol/lib/overalls_protocol/image_manifest.ex:498-523 | protocol/lib/overalls_protocol/image_manifest.ex:557-582 — 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 `protocol/lib/overalls_protocol/image_manifest.ex:498` 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 (24 lines × 2) antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:69— antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:69-92 | lilly/lib/lilly/host/ownership.ex:101-124 — before extracting anything, compare `antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex` and `lilly/lib/lilly/host/ownership.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:69` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (24 lines × 2) lyra/src/bin/overalls-trustd.rs:83— lyra/src/bin/overalls-trustd.rs:83-106 | lyra/src/workspace_receiver.rs:62-85 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (18 lines × 4) audi/lib/audi/otp_reports.ex:18— audi/lib/audi/otp_reports.ex:18-35 | lilly/lib/lilly/otp_reports.ex:18-35 | marshall/lib/marshall/otp_reports.ex:18-35 | porsche/lib/porsche/otp_reports.ex:18-35 — before extracting anything, compare `audi/lib/audi/otp_reports.ex` and `lilly/lib/lilly/otp_reports.ex` as WHOLE FILES: 93% 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.
Duplicated block (18 lines × 4) audi/lib/audi/relay/server.ex:69— audi/lib/audi/relay/server.ex:69-86 | lilly/lib/lilly/ingress/server.ex:117-134 | lilly/lib/lilly/network/attribution_server.ex:100-117 | lilly/lib/lilly/private/server.ex:100-117 — before extracting anything, compare `lilly/lib/lilly/ingress/server.ex` and `lilly/lib/lilly/network/attribution_server.ex` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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–17 lines × 2) lilly/lib/lilly/control/runtime.ex:277— lilly/lib/lilly/control/runtime.ex:277-292 | lilly/lib/lilly/control/runtime.ex:1063-1079 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16–17 lines × 2) antithesis/emulation/host/runner.py:33— antithesis/emulation/host/runner.py:33-48 | antithesis/emulation/recorder/runner.py:32-48 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12–13 lines × 2) lilly/lib/lilly/vm/executor.ex:424— lilly/lib/lilly/vm/executor.ex:424-435 | lilly/lib/lilly/vm/executor.ex:494-506 — 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 `lilly/lib/lilly/vm/executor.ex: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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12–13 lines × 2) lyra/src/bin/overalls-host-certificate-windows.rs:107— lyra/src/bin/overalls-host-certificate-windows.rs:107-119 | lyra/src/bin/overalls-host-certificate.rs:93-104 — before extracting anything, compare `lyra/src/bin/overalls-host-certificate-windows.rs` and `lyra/src/bin/overalls-host-certificate.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 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 `lyra/src/bin/overalls-host-certificate-windows.rs:107` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11–12 lines × 3) lilly/lib/lilly/transfer/checkpoint_transfer.ex:246— lilly/lib/lilly/transfer/checkpoint_transfer.ex:246-256 | lilly/lib/lilly/vm/checkpoint_storage.ex:351-361 | lilly/lib/lilly/vm/checkpoint_storage.ex:574-585 — 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.
Duplicated block (11–12 lines × 3) antithesis/workload/terminal/scenarios.py:329— antithesis/workload/terminal/scenarios.py:329-340 | antithesis/workload/terminal/scenarios.py:370-380 | antithesis/workload/terminal/scenarios.py:413-424 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10–12 lines × 2) audi/lib/audi/http/authority.ex:17— audi/lib/audi/http/authority.ex:17-26 | audi/lib/audi/inception/authority.ex:17-28 — `audi/lib/audi/http/authority.ex` and `audi/lib/audi/inception/authority.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 2 separate duplicated blocks between them, totalling at least 27 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/http/authority.ex:17` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10–12 lines × 2) antithesis/emulation/storage/origin.py:42— antithesis/emulation/storage/origin.py:42-51 | antithesis/emulation/storage/origin.py:68-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. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/emulation/storage/origin.py:42` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11–12 lines × 2) galileo/lib/galileo/config.ex:11— galileo/lib/galileo/config.ex:11-21 | ziggy/lib/ziggy/config.ex:26-37 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `ziggy/lib/ziggy/config.ex: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 (11–12 lines × 2) protocol/lib/overalls_protocol/editor_stream.ex:51— protocol/lib/overalls_protocol/editor_stream.ex:51-62 | protocol/lib/overalls_protocol/web_stream.ex:57-67 — 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 × 3) lilly/lib/lilly/ingress/server.ex:407— lilly/lib/lilly/ingress/server.ex:407-417 | lilly/lib/lilly/network/attribution_server.ex:209-219 | lilly/lib/lilly/private/server.ex:261-271 — before extracting anything, compare `lilly/lib/lilly/ingress/server.ex` and `lilly/lib/lilly/network/attribution_server.ex` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/ingress/server.ex:407` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lilly/lib/lilly/private/server.ex:256` calls `send_frame`, `send`, `wire` and `lilly/lib/lilly/ingress/server.ex:404` 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 (11 lines × 3) galileo/lib/galileo/credential.ex:11— galileo/lib/galileo/credential.ex:11-21 | peach/lib/peach/credential.ex:11-21 | ziggy/lib/ziggy/credential.ex:11-21 — before extracting anything, compare `galileo/lib/galileo/credential.ex` and `ziggy/lib/ziggy/credential.ex` as WHOLE FILES: 95% 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.
Duplicated block (10–11 lines × 3) lilly/lib/lilly/network/ingress.ex:22— lilly/lib/lilly/network/ingress.ex:22-31 | lilly/lib/lilly/network/ingress.ex:87-96 | lilly/lib/lilly/network/ingress.ex:192-202 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10–11 lines × 3) lyra/src/bin/overalls-readinessd.rs:151— lyra/src/bin/overalls-readinessd.rs:151-161 | lyra/src/bin/overalls-trustd-windows.rs:128-137 | lyra/src/bin/overalls-workspaced-windows.rs:188-197 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `lyra/src/bin/overalls-readinessd.rs:151` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9–10 lines × 2) lilly/lib/lilly/transfer/permit_journal.ex:200— lilly/lib/lilly/transfer/permit_journal.ex:200-208 | lilly/lib/lilly/transfer/permit_journal.ex:227-236 — 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–10 lines × 2) antithesis/workload/satellite/scenarios.py:177— antithesis/workload/satellite/scenarios.py:177-186 | antithesis/workload/satellite/scenarios.py:237-245 — 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 `antithesis/workload/satellite/scenarios.py:177` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8–9 lines × 2) antithesis/control_peer/runner.exs:152— antithesis/control_peer/runner.exs:152-159 | antithesis/control_peer/runner.exs:190-198 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `antithesis/control_peer/runner.exs:188` calls `barrier` and `antithesis/control_peer/runner.exs:151` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8–9 lines × 2) marshall/lib/marshall/ingress/catalog.ex:38— marshall/lib/marshall/ingress/catalog.ex:38-46 | marshall/lib/marshall/ingress/editor_assets.ex:21-28 — 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 (19 lines × 3) lilly/lib/lilly/ingress/server.ex:21— lilly/lib/lilly/ingress/server.ex:21-39 | lilly/lib/lilly/network/attribution_server.ex:15-33 | lilly/lib/lilly/private/server.ex:14-32 — before extracting anything, compare `lilly/lib/lilly/ingress/server.ex` and `lilly/lib/lilly/network/attribution_server.ex` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/ingress/server.ex: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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `lilly/lib/lilly/ingress/server.ex:40` calls `maximum` and `lilly/lib/lilly/private/server.ex:33` 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 (19 lines × 3) antithesis/emulation/host/runner.py:182— antithesis/emulation/host/runner.py:182-200 | antithesis/emulation/recorder/runner.py:152-170 | antithesis/emulation/storage/runner.py:181-199 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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 (4–7 lines × 3) lilly/lib/lilly/host/zfs.ex:460— lilly/lib/lilly/host/zfs.ex:460-463 | lilly/lib/lilly/host/zfs.ex:482-488 | lilly/lib/lilly/host/zfs.ex:510-516 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/host/zfs.ex:482` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (4–7 lines × 3) marshall/lib/marshall/access/admin_actions.ex:39— marshall/lib/marshall/access/admin_actions.ex:39-43 | marshall/lib/marshall/ssh/admin_actions.ex:46-52 | marshall/lib/marshall/ssh/admin_actions.ex:103-106 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marshall/lib/marshall/ssh/admin_actions.ex:106` calls `compute` and `marshall/lib/marshall/ssh/admin_actions.ex:52` 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 (5 lines × 5) mila/windows-dotnet/Interop/RustNative.cs:308— mila/windows-dotnet/Interop/RustNative.cs:308-312 | mila/windows-dotnet/Interop/RustNative.cs:373-377 | mila/windows-dotnet/Interop/RustNative.cs:401-405 | mila/windows-dotnet/Interop/RustNative.cs:550-554 | mila/windows-dotnet/Interop/RustNative.cs:769-773 — 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 `mila/windows-dotnet/Interop/RustNative.cs:308` 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 (5 lines × 5) mila/windows-dotnet/Interop/RustNative.cs:371— mila/windows-dotnet/Interop/RustNative.cs:371-376 | mila/windows-dotnet/Interop/RustNative.cs:399-404 | mila/windows-dotnet/Interop/RustNative.cs:549-553 | mila/windows-dotnet/Interop/RustNative.cs:767-772 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:188-195 — there are 5 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `mila/windows-dotnet/Interop/RustNative.cs:371` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (21 lines × 2) marshall/lib/marshall_web/gettext_plural.ex:14— marshall/lib/marshall_web/gettext_plural.ex:14-34 | porsche/lib/porsche/gettext_plural.ex:14-34 — before extracting anything, compare `marshall/lib/marshall_web/gettext_plural.ex` and `porsche/lib/porsche/gettext_plural.ex` as WHOLE FILES: 96% 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.
Duplicated block (21 lines × 2) lilly/native/hostd/src/session.rs:420— lilly/native/hostd/src/session.rs:420-440 | lilly/native/hostd/src/session.rs:449-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 `lilly/native/hostd/src/session.rs:420` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (7 lines × 4) marshall/lib/marshall/accounts/administrators.ex:73— marshall/lib/marshall/accounts/administrators.ex:73-79 | marshall/lib/marshall/compute/clone_coordinator.ex:86-92 | marshall/lib/marshall/compute/clone_coordinator.ex:109-115 | marshall/lib/marshall/ingress/sessions.ex:282-288 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marshall/lib/marshall/ingress/sessions.ex:290` calls `emit_event`, `emit` and `marshall/lib/marshall/accounts/administrators.ex:81` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 4) mila/rust/mila-ffi/src/session.rs:317— mila/rust/mila-ffi/src/session.rs:317-326 | mila/rust/mila-ffi/src/session.rs:1455-1461 | mila/rust/mila-ffi/src/session.rs:1665-1671 | mila/rust/mila-ffi/src/session/watch.rs:46-52 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `mila/rust/mila-ffi/src/session.rs:1455` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 6) lilly/lib/lilly/control/client.ex:582— lilly/lib/lilly/control/client.ex:582-587 | lilly/lib/lilly/control/client.ex:638-643 | lilly/lib/lilly/control/client.ex:690-695 | lilly/lib/lilly/control/client.ex:738-743 | lilly/lib/lilly/control/client.ex:788-793 | lilly/lib/lilly/control/client.ex:838-843 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/control/client.ex:582` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 6) lilly/native/boot-log/src/main.rs:9— lilly/native/boot-log/src/main.rs:9-14 | lilly/native/ingress-bridge/src/main.rs:9-14 | lilly/native/launch-guard/src/main.rs:9-14 | lilly/native/resume-token/src/main.rs:9-14 | lilly/native/source-export/src/main.rs:9-14 | lilly/native/transfer-stream/src/main.rs:9-14 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (15–17 lines × 2) antithesis/verification/campaign.py:389— antithesis/verification/campaign.py:389-405 | antithesis/verification/campaign.py:415-429 — 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–17 lines × 2) nix/domains/system/proxy-address.py:18— nix/domains/system/proxy-address.py:18-34 | nix/domains/system/runtime-socket.py:22-36 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. 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 × 3) antithesis/workload/access/oracle.py:124— antithesis/workload/access/oracle.py:124-135 | antithesis/workload/access/oracle.py:142-153 | antithesis/workload/access/oracle.py:160-171 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/workload/access/oracle.py:124` 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 (12 lines × 3) nix/domains/artifacts/guest/inception/control_proofs.py:62— nix/domains/artifacts/guest/inception/control_proofs.py:62-73 | nix/domains/artifacts/guest/inception/private_pki.py:100-111 | nix/domains/artifacts/guest/inception/private_runtime.py:81-92 — 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 (19–21 lines × 2) nix/domains/artifacts/terminald/src/sys/conpty.rs:495— nix/domains/artifacts/terminald/src/sys/conpty.rs:495-513 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:347-367 — before extracting anything, compare `nix/domains/artifacts/terminald/src/sys/conpty.rs` and `nix/domains/artifacts/vscode-web-broker/src/windows/account.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `nix/domains/artifacts/terminald/src/sys/conpty.rs:495` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (19–21 lines × 2) nix/domains/system/otel-guest/receiver/src/main.rs:21— nix/domains/system/otel-guest/receiver/src/main.rs:21-39 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:229-249 — 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 `nix/domains/system/otel-guest/receiver/src/main.rs:21` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 4) lyra/src/guest/mmds.rs:53— lyra/src/guest/mmds.rs:53-61 | lyra/src/guest/readiness.rs:45-53 | lyra/src/native_guest.rs:325-333 | lyra/src/platform/windows/boot_id.rs:21-29 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (9 lines × 4) mila/rust/mila-ffi/src/session.rs:284— mila/rust/mila-ffi/src/session.rs:284-292 | mila/rust/mila-ffi/src/session.rs:546-554 | mila/rust/mila-ffi/src/session.rs:870-878 | mila/rust/mila-ffi/src/session.rs:1200-1208 — 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 `mila/rust/mila-ffi/src/session.rs:284` 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.
Dead file (~4 LoC) buck/probes/esbuild/entry.mjs— no import path from any entry point (38 application, 2 tooling, 16 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 (~4 LoC) marvin/common/background.mjs— no import path from any entry point (38 application, 2 tooling, 16 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
AX2 · Stateful singletons· Process-global static state · ×1
Process-global static state: MilaStrings mila/windows-dotnet/MilaStrings.cs:7— `MilaStrings` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Catalog; e.g. `Catalog` at line 22). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
probe.advance (cyclomatic 114) marshall/scripts/localization_browser/probe.ts:56— probe.advance has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mounted (cyclomatic 83) marshall/assets/js/terminals.js:664— mounted has cyclomatic complexity 83 (threshold 15). Most of this is not in the body itself: 4 of the 83 points are its own statements and the rest belongs to 17 function items inside it that branch (a function literal at line 730, a function literal at line 802, a function literal at line 682, …). 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.
collectFindingSemanticErrors (cyclomatic 71) REDACTED:485— collectFindingSemanticErrors has cyclomatic complexity 71 (threshold 15). Most of this is not in the body itself: 2 of the 71 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 491, 510, 521). 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.
preflightJsonText (cyclomatic 58) .agents/skills/security-audit/validate-coverage-ledger.cjs:141— preflightJsonText has cyclomatic complexity 58 (threshold 15). Of this number, 25 points are the body's own statements and 33 belong to 9 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.
scenarios.run_named_integration (cyclomatic 56) antithesis/workload/satellite/scenarios.py:100— scenarios.run_named_integration has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
validate (cyclomatic 51) REDACTED:361— validate has cyclomatic complexity 51 (threshold 15). Of this number, 48 points are the body's own statements and 3 belong to 7 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.
mounted (cyclomatic 49) marshall/assets/js/thread_composer.js:183— mounted has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 1 of the 49 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 217, 194, 209, …). 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.
collectSchemaErrors::check (cyclomatic 49) REDACTED:250— collectSchemaErrors::check has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scenarios.run_traces (cyclomatic 47) antithesis/workload/recorder/scenarios.py:465— scenarios.run_traces 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.
preparation._prepare (cyclomatic 46) nix/domains/artifacts/host/preparation.py:422— preparation._prepare has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Program.Main (cyclomatic 43) REDACTED:17— Program.Main has cyclomatic complexity 43 (threshold 15). Of this number, 42 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
SettingsView.body (cyclomatic 41) mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:594— SettingsView.body has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
campaign.transition (cyclomatic 40) antithesis/verification/campaign.py:355— campaign.transition has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
identity.verify_image_copy (cyclomatic 40) antithesis/verification/identity.py:601— identity.verify_image_copy has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MilaNativeUiKt.MilaNativeRoot (cyclomatic 39) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:83— MilaNativeUiKt.MilaNativeRoot has cyclomatic complexity 39 (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.
server.inventory (cyclomatic 38) antithesis/emulation/guest/server.py:350— server.inventory has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
enrollment.rebind_empty_lilly (cyclomatic 38) nix/domains/artifacts/host/enrollment.py:381— enrollment.rebind_empty_lilly has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Outcomes.record! (cyclomatic 37) marshall/lib/marshall/compute/outcomes.ex:79— Outcomes.record! 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.
scenarios._physical_pressure (cyclomatic 37) antithesis/workload/recorder/scenarios.py:334— scenarios._physical_pressure has cyclomatic complexity 37 (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.
scenarios._published_head_effect (cyclomatic 37) antithesis/workload/repository/scenarios.py:70— scenarios._published_head_effect 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.
selection.validate_compose (cyclomatic 37) antithesis/verification/selection.py:331— selection.validate_compose 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.
MilaRouteParser.parse (cyclomatic 37) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:26— MilaRouteParser.parse has cyclomatic complexity 37 (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.
Config.load (cyclomatic 36) ziggy/lib/ziggy/config.ex:7— Config.load has cyclomatic complexity 36 (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.
ModelCalls.queue (cyclomatic 35) marshall/lib/marshall/agents/model_calls.ex:29— ModelCalls.queue has cyclomatic complexity 35 (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.
scenarios.run_native_admission_after_restart (cyclomatic 35) antithesis/workload/repository/scenarios.py:348— scenarios.run_native_admission_after_restart 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.
Config.load (cyclomatic 34) lilly/lib/lilly/control/config.ex:41— Config.load has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
loadingFinished (cyclomatic 34) REDACTED:821— loadingFinished has cyclomatic complexity 34 (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.
MilaTerminalFrame.Decode (cyclomatic 33) mila/windows-dotnet/Interop/TerminalSession.cs:42— MilaTerminalFrame.Decode has cyclomatic complexity 33 (threshold 15). Of this number, 25 points are the body's own statements and 8 belong to one function literal inside it that branches. 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.
Checkpoint.valid_transition? (cyclomatic 33) lilly/lib/lilly/lifecycle/checkpoint.ex:25— Checkpoint.valid_transition? has cyclomatic complexity 33 (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.
scenarios.run_key_survives_archive (cyclomatic 33) antithesis/workload/admission/scenarios.py:305— scenarios.run_key_survives_archive 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.
runtime.load_case (cyclomatic 33) antithesis/workload/terminal/runtime.py:56— runtime.load_case 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.
fetch_git.assemble (cyclomatic 33) nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:36— fetch_git.assemble 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.
install.run (cyclomatic 33) nix/domains/artifacts/guest/windows/install.py:598— install.run 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.
MilaRouteParser.Parse (cyclomatic 32) mila/windows-dotnet/Interop/RustNative.cs:23— MilaRouteParser.Parse has cyclomatic complexity 32 (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.
profile_readiness.recorder_host_ready (cyclomatic 32) antithesis/workload/core/profile_readiness.py:224— profile_readiness.recorder_host_ready 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.
editor.run_login_code_reply_loss (cyclomatic 32) antithesis/workload/satellite/editor.py:204— editor.run_login_code_reply_loss has cyclomatic complexity 32 (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.
MilaWhoamiDecoder.Decode (cyclomatic 31) mila/windows-dotnet/Interop/SignInCoordinator.cs:29— MilaWhoamiDecoder.Decode has cyclomatic complexity 31 (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.
MilaTerminalStream.AttachGeneration (cyclomatic 31) mila/windows-dotnet/Interop/TerminalStream.cs:377— MilaTerminalStream.AttachGeneration 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.
cli.policy (cyclomatic 31) nix/domains/artifacts/secrets/cli.py:79— cli.policy 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.
collectUnitErrors (cyclomatic 31) .agents/skills/security-audit/validate-coverage-ledger.cjs:646— collectUnitErrors has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body's own statements and 2 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.
Config.decode (cyclomatic 30) audi/lib/audi/config.ex:97— Config.decode has cyclomatic complexity 30 (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.
ClonePlacement.reserve! (cyclomatic 30) marshall/lib/marshall/compute/clone_placement.ex:24— ClonePlacement.reserve! has cyclomatic complexity 30 (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.
scenarios.run_input_probe (cyclomatic 30) antithesis/workload/terminal/scenarios.py:141— scenarios.run_input_probe 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.
control.effect (cyclomatic 30) REDACTED:69— control.effect 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.
campaign.initialize (cyclomatic 30) antithesis/verification/campaign.py:110— campaign.initialize 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.
MilaRootContent.body (cyclomatic 30) mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:149— MilaRootContent.body has cyclomatic complexity 30 (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.
ApplicationSession::thread_action (cyclomatic 30) mila/rust/mila-session/src/threads.rs:12— ApplicationSession::thread_action has cyclomatic complexity 30 (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.
validateAttempts (cyclomatic 30) .agents/skills/security-audit/validate-coverage-ledger.cjs:568— validateAttempts has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 6 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 578, 616, 634). 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.
MilaTerminalStream.PollRead (cyclomatic 29) mila/windows-dotnet/Interop/TerminalStream.cs:210— MilaTerminalStream.PollRead 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.
Driver.resume (cyclomatic 29) lilly/lib/lilly/vm/driver.ex:574— Driver.resume 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.
Prompt.admit! (cyclomatic 29) marshall/lib/marshall/agents/prompt.ex:78— Prompt.admit! 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.
RelocationCapacity.prepare! (cyclomatic 29) marshall/lib/marshall/compute/relocation_capacity.ex:86— RelocationCapacity.prepare! has cyclomatic complexity 29 (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.
RelocationCoordinator.stop_confirmed? (cyclomatic 29) marshall/lib/marshall/compute/relocation_coordinator.ex:313— RelocationCoordinator.stop_confirmed? has cyclomatic complexity 29 (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.
browser.run_magic_preview (cyclomatic 29) antithesis/workload/access/browser.py:106— browser.run_magic_preview has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
verify_runtime.verify (cyclomatic 29) nix/domains/artifacts/guest/native_git/verify_runtime.py:161— verify_runtime.verify 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.
serial_session.run (cyclomatic 29) nix/domains/artifacts/guest/omnios/serial_session.py:97— serial_session.run 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.
cli.validate (cyclomatic 29) nix/domains/artifacts/host/cli.py:260— cli.validate has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Deployment.preflight (cyclomatic 29) nix/domains/system/auto-update/runtime.py:773— Deployment.preflight 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.
scenarios.run_capacity (cyclomatic 28) antithesis/workload/recorder/scenarios.py:105— scenarios.run_capacity has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
assertions.python_calls (cyclomatic 28) antithesis/verification/assertions.py:51— assertions.python_calls 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.
packaged_instrumentation.run_suite (cyclomatic 28) mila/native/android/scripts/packaged_instrumentation.py:468— packaged_instrumentation.run_suite has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
rust_cell.generate (cyclomatic 28) nix/buck/rust_cell.py:265— rust_cell.generate 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.
runtime.collect (cyclomatic 28) nix/domains/system/fleet-exporter/runtime.py:560— runtime.collect 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.
enrico_git_owner::stream (cyclomatic 28) enrico/native/git-owner/src/main.rs:207— enrico_git_owner::stream has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
LiveSession::subscribe (cyclomatic 28) mila/native/linux/src/session/watch.rs:106— LiveSession::subscribe 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.
RelocationReadinessState.activation (cyclomatic 27) marshall/lib/marshall/compute/relocation_readiness_state.ex:102— RelocationReadinessState.activation has cyclomatic complexity 27 (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.
Execution.current! (cyclomatic 27) marshall/lib/marshall/ingress/execution.ex:30— Execution.current! has cyclomatic complexity 27 (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.
bootstrap.probe (cyclomatic 27) antithesis/workload/core/bootstrap.py:35— bootstrap.probe has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
campaign.reserve (cyclomatic 27) antithesis/verification/campaign.py:247— campaign.reserve has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Snapshot.render (cyclomatic 27) nix/domains/system/fleet-exporter/exporter.py:126— Snapshot.render has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
JourneyDescriptor::parse (cyclomatic 27) mila/native/linux/src/journey.rs:132— JourneyDescriptor::parse has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
sectionReadiness (cyclomatic 27) REDACTED:908— sectionReadiness has cyclomatic complexity 27 (threshold 15). Of this number, 22 points are the body's own statements and 5 belong to one function item inside it that branches. 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.
MilaWindowsPushRegistration.RegisterAsync (cyclomatic 26) mila/windows-dotnet/Interop/WindowsPushRegistration.cs:125— MilaWindowsPushRegistration.RegisterAsync has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
GuestWitness.current_replay_binding (cyclomatic 26) antithesis/operator/guest_witness.ex:267— GuestWitness.current_replay_binding has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CheckpointStorage.native (cyclomatic 26) lilly/lib/lilly/vm/checkpoint_storage.ex:347— CheckpointStorage.native has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
browser.run_remembered_revocation (cyclomatic 26) antithesis/workload/access/browser.py:231— browser.run_remembered_revocation has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
spool.read_slots (cyclomatic 26) antithesis/workload/satellite/spool.py:26— spool.read_slots has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rust_parity.main (cyclomatic 26) buck/rust_parity.py:179— rust_parity.main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
lilly_source_export::run::run_sender (cyclomatic 26) lilly/native/source-export/src/run.rs:134— lilly_source_export::run::run_sender has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mounted (cyclomatic 26) marshall/assets/js/workspace.js:10— mounted has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to 8 function items inside it that branch (key, click, setOpen, …). 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.
parseRunRow (cyclomatic 26) REDACTED:651— parseRunRow has cyclomatic complexity 26 (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.
ZFS.policy_shape? (cyclomatic 25) lilly/lib/lilly/host/zfs.ex:1188— ZFS.policy_shape? has cyclomatic complexity 25 (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.
CheckpointTransfer.received_native (cyclomatic 25) lilly/lib/lilly/transfer/checkpoint_transfer.ex:241— CheckpointTransfer.received_native 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.
Config.new (cyclomatic 25) lilly/lib/lilly/vm/config.ex:56— Config.new 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.
ThreadsLive.load (cyclomatic 25) marshall/lib/marshall_web/live/threads_live.ex:905— ThreadsLive.load has cyclomatic complexity 25 (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.
SSHHostCertificate.parse (cyclomatic 25) protocol/lib/overalls_protocol/ssh_host_certificate.ex:27— SSHHostCertificate.parse 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.
dispatch.run_legacy_request (cyclomatic 25) antithesis/workload/control/dispatch.py:281— dispatch.run_legacy_request 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.
scenarios.run_recovery (cyclomatic 25) antithesis/workload/recorder/scenarios.py:203— scenarios.run_recovery 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.
scenarios.run_neighbor_progress (cyclomatic 25) antithesis/workload/terminal/scenarios.py:328— scenarios.run_neighbor_progress 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.
scenarios.run_kill_under_input_stall (cyclomatic 25) antithesis/workload/terminal/scenarios.py:412— scenarios.run_kill_under_input_stall 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.
cli.main (cyclomatic 25) nix/domains/artifacts/secrets/cli.py:389— cli.main 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.
collector.main (cyclomatic 25) nix/domains/system/firecracker-logging/collector.py:143— collector.main 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.
overalls.Route (cyclomatic 25) nix/domains/artifacts/guest/github/transport/transport.go:140— overalls.Route 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.
lilly_transfer_stream::run::sweep (cyclomatic 25) lilly/native/transfer-stream/src/run.rs:300— lilly_transfer_stream::run::sweep 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.
check-extension.main (cyclomatic 25) nix/domains/artifacts/vscode-web/check-extension.mts:37— check-extension.main 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.
ExecutorSession.with_attachment_command (cyclomatic 24) marshall/lib/marshall/agents/executor_session.ex:218— ExecutorSession.with_attachment_command has cyclomatic complexity 24 (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.
RelocationSources.prepare_request! (cyclomatic 24) marshall/lib/marshall/compute/relocation_sources.ex:138— RelocationSources.prepare_request! 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.
ServiceLevels.ready_at (cyclomatic 24) marshall/lib/marshall/compute/service_levels.ex:161— ServiceLevels.ready_at has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
StartupHolds.settle_locked! (cyclomatic 24) marshall/lib/marshall/compute/startup_holds.ex:15— StartupHolds.settle_locked! has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Publications.snapshot! (cyclomatic 24) marshall/lib/marshall/ingress/publications.ex:26— Publications.snapshot! 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.
Sharing.set (cyclomatic 24) marshall/lib/marshall/terminal/sharing.ex:34— Sharing.set has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
envelope.decode (cyclomatic 24) antithesis/workload/control/envelope.py:38— envelope.decode 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.
scenarios.run_credential_revalidation (cyclomatic 24) antithesis/workload/control/scenarios.py:163— scenarios.run_credential_revalidation 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.
scenarios.run_replay_cap (cyclomatic 24) antithesis/workload/repository/scenarios.py:242— scenarios.run_replay_cap has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
runner.stop (cyclomatic 24) antithesis/emulation/guest/runner.py:755— runner.stop 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.
server.dispatch (cyclomatic 24) antithesis/emulation/guest/server.py:1050— server.dispatch 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.
publication.records (cyclomatic 24) REDACTED:219— publication.records 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.
Deployment.healthy (cyclomatic 24) nix/domains/system/auto-update/runtime.py:1100— Deployment.healthy 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.
runtime.main (cyclomatic 24) nix/domains/system/backups/runtime.py:254— runtime.main 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.
metrics.cgroup_metrics (cyclomatic 24) nix/domains/system/fleet-exporter/metrics.py:421— metrics.cgroup_metrics 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.
Driver::authenticated (cyclomatic 24) mila/rust/mila-journey/src/main.rs:568— Driver::authenticated has cyclomatic complexity 24 (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.
MilaJourneyDescriptor.Parse (cyclomatic 23) mila/windows-dotnet-smoke/JourneySmoke.cs:37— MilaJourneyDescriptor.Parse has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: JourneySmoke.RunAsync (cyclomatic 29) 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.
GuestWitness.main (cyclomatic 23) antithesis/operator/guest_witness.ex:62— GuestWitness.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.
Client.new (cyclomatic 23) lilly/lib/lilly/control/client.ex:63— Client.new has cyclomatic complexity 23 (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.
ZFSDataset.resize (cyclomatic 23) lilly/lib/lilly/host/zfs_dataset.ex:999— ZFSDataset.resize has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Driver.pause (cyclomatic 23) lilly/lib/lilly/vm/driver.ex:484— Driver.pause 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.
Context.lock_preparation! (cyclomatic 23) marshall/lib/marshall/agents/context.ex:289— Context.lock_preparation! has cyclomatic complexity 23 (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.
Maintenance.transition_locked! (cyclomatic 23) marshall/lib/marshall/agents/maintenance.ex:89— Maintenance.transition_locked! 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.
RestartCapacity.check_source_restoration (cyclomatic 23) marshall/lib/marshall/compute/restart_capacity.ex:41— RestartCapacity.check_source_restoration has cyclomatic complexity 23 (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.
dispatch._negative (cyclomatic 23) antithesis/workload/control/dispatch.py:132— dispatch._negative has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
witness.parse_witness (cyclomatic 23) antithesis/workload/guest_lifecycle/witness.py:122— witness.parse_witness has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
monospace_browser_probe.check_thread_collaborators (cyclomatic 23) marshall/scripts/monospace_browser_probe.py:873— monospace_browser_probe.check_thread_collaborators 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.
public_settings.validate (cyclomatic 23) nix/domains/artifacts/guest/inception/public_settings.py:25— public_settings.validate 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.
check_assembly.check (cyclomatic 23) nix/domains/artifacts/guest/omnios/check_assembly.py:176— check_assembly.check 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.
runtime.prepare (cyclomatic 23) REDACTED:113— runtime.prepare 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.
MilaApprovalDecoder.decode (cyclomatic 23) mila/native/apple/Sources/MilaNativeUI/MilaApproval.swift:26— MilaApprovalDecoder.decode has cyclomatic complexity 23 (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.
artifact_frame.parseRequest (cyclomatic 23) REDACTED:25— artifact_frame.parseRequest has cyclomatic complexity 23 (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.
probe.presentation (cyclomatic 23) marshall/scripts/localization_browser/probe.ts:8— probe.presentation has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body's own statements and 11 belong to 5 function literals 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.
Client.new (cyclomatic 22) audi/lib/audi/control/client.ex:43— Client.new has cyclomatic complexity 22 (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.
ZFSDataset.delete_owned (cyclomatic 22) lilly/lib/lilly/host/zfs_dataset.ex:1454— ZFSDataset.delete_owned 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.
Runtime.poll_once (cyclomatic 22) lilly/lib/lilly/inception/runtime.ex:147— Runtime.poll_once 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.
Source.execute (cyclomatic 22) lilly/lib/lilly/transfer/source.ex:33— Source.execute 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.
Outcomes.apply! (cyclomatic 22) marshall/lib/marshall/compute/outcomes.ex:198— Outcomes.apply! 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.
WebStreams.peer_authority! (cyclomatic 22) marshall/lib/marshall/ingress/web_streams.ex:306— WebStreams.peer_authority! has cyclomatic complexity 22 (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.
Config.load (cyclomatic 22) porsche/lib/porsche/config.ex:15— Config.load has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
browser.run_stale_admin (cyclomatic 22) antithesis/workload/access/browser.py:353— browser.run_stale_admin has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
scenarios.run_physical_boot_cycle (cyclomatic 22) antithesis/workload/guest_lifecycle/scenarios.py:232— scenarios.run_physical_boot_cycle has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
observer.read_snapshot (cyclomatic 22) antithesis/workload/repository/observer.py:36— observer.read_snapshot 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.
runner._run_registered (cyclomatic 22) nix/verification/hegel/python/hegel/runner.py:74— runner._run_registered 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.
smoke.main (cyclomatic 22) antithesis/emulation/storage/smoke.py:99— smoke.main has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
selection.module_dependencies (cyclomatic 22) antithesis/verification/selection.py:116— selection.module_dependencies 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.
run.main (cyclomatic 22) marshall/scripts/localization_browser/run.py:72— run.main 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.
fetch_sdk.parse_manifest (cyclomatic 22) REDACTED:120— fetch_sdk.parse_manifest 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.
Runner.capture (cyclomatic 22) nix/domains/system/backups/runtime.py:94— Runner.capture 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.
MilaSignInCoordinator.AuthenticateAsync (cyclomatic 21) mila/windows-dotnet/Interop/SignInCoordinator.cs:208— MilaSignInCoordinator.AuthenticateAsync 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.
CheckpointStorage.cleanup_observation? (cyclomatic 21) lilly/lib/lilly/vm/checkpoint_storage.ex:627— CheckpointStorage.cleanup_observation? 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.
Executor.reconcile (cyclomatic 21) lilly/lib/lilly/vm/executor.ex:249— Executor.reconcile has cyclomatic complexity 21 (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.
Config.load (cyclomatic 21) susan/lib/susan/config.ex:74— Config.load 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.
MilaFfiAdapterKt.parseMilaRoute (cyclomatic 21) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:24— MilaFfiAdapterKt.parseMilaRoute has cyclomatic complexity 21 (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.
host_sessions.run_credential_rotation (cyclomatic 21) antithesis/workload/control/host_sessions.py:283— host_sessions.run_credential_rotation 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.
InferenceOracle.snapshot (cyclomatic 21) antithesis/workload/satellite/oracle.py:64— InferenceOracle.snapshot 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.
runner.observe (cyclomatic 21) antithesis/emulation/guest/runner.py:691— runner.observe has cyclomatic complexity 21 (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.
identity.verify_image_selection (cyclomatic 21) antithesis/verification/identity.py:889— identity.verify_image_selection 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.
selection.selected_files (cyclomatic 21) antithesis/verification/selection.py:190— selection.selected_files 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.
packaged_instrumentation.parse_instrumentation (cyclomatic 21) mila/native/android/scripts/packaged_instrumentation.py:171— packaged_instrumentation.parse_instrumentation 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.
Deployment.activate (cyclomatic 21) nix/domains/system/auto-update/runtime.py:922— Deployment.activate 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.
Store::open (cyclomatic 21) elixir/diagnostics/native/spool/src/store.rs:80— Store::open 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.
PtyTextDecoder::decode (cyclomatic 21) mila/native/linux/src/terminal_text.rs:43— PtyTextDecoder::decode has cyclomatic complexity 21 (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. This is NOT this file's highest cyclomatic complexity: mila_native_linux::terminal_text::encode_key (cyclomatic 23) 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 function is counted neither in this dimension's figures nor in its score.
enforceJsonTextLimits (cyclomatic 21) REDACTED:651— enforceJsonTextLimits has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body's own statements and 4 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.
MilaWebEndpointDecoder.DecodeCore (cyclomatic 20) mila/windows-dotnet/Interop/WebEndpoint.cs:33— MilaWebEndpointDecoder.DecodeCore has cyclomatic complexity 20 (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.
Checkpoint.phase_valid? (cyclomatic 20) lilly/lib/lilly/vm/checkpoint.ex:512— Checkpoint.phase_valid? has cyclomatic complexity 20 (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.
CheckpointStorage.verify (cyclomatic 20) lilly/lib/lilly/vm/checkpoint_storage.ex:316— CheckpointStorage.verify has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Admission.allocate (cyclomatic 20) marshall/lib/marshall/compute/admission.ex:153— Admission.allocate 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.
Evacuations.advance (cyclomatic 20) marshall/lib/marshall/compute/evacuations.ex:255— Evacuations.advance 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.
RelocationReceives.valid_source? (cyclomatic 20) marshall/lib/marshall/compute/relocation_receives.ex:201— RelocationReceives.valid_source? has cyclomatic complexity 20 (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.
WorkflowServiceLevels.activation_evidence (cyclomatic 20) marshall/lib/marshall/compute/workflow_service_levels.ex:241— WorkflowServiceLevels.activation_evidence 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.
Authorizations.current_vm! (cyclomatic 20) marshall/lib/marshall/galileo/authorizations.ex:190— Authorizations.current_vm! has cyclomatic complexity 20 (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.
Requests.current! (cyclomatic 20) marshall/lib/marshall/inference/requests.ex:194— Requests.current! has cyclomatic complexity 20 (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.
Client.new (cyclomatic 20) porsche/lib/porsche/client.ex:128— Client.new has cyclomatic complexity 20 (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.
CloneControl.command (cyclomatic 20) protocol/lib/overalls_protocol/clone_control.ex:29— CloneControl.command has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Reflection.validate_guest (cyclomatic 20) protocol/lib/overalls_protocol/reflection.ex:79— Reflection.validate_guest has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
host_sessions.run_session_successor (cyclomatic 20) antithesis/workload/control/host_sessions.py:203— host_sessions.run_session_successor has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
scenarios.run_replay (cyclomatic 20) antithesis/workload/repository/scenarios.py:168— scenarios.run_replay has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
runtime.prepare_vm (cyclomatic 20) antithesis/workload/satellite/runtime.py:35— runtime.prepare_vm 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.
scenarios.run_ring_budget (cyclomatic 20) antithesis/workload/terminal/scenarios.py:256— scenarios.run_ring_budget 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.
resources.policy (cyclomatic 20) nix/domains/system/auto-update/resources.py:66— resources.policy has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
resources.compatible (cyclomatic 20) nix/domains/system/auto-update/resources.py:175— resources.compatible 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.
Schema::sanitize (cyclomatic 20) elixir/diagnostics/native/spool/src/schema.rs:61— Schema::sanitize 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.
NativeState::ensure_window (cyclomatic 20) mila/native/linux/src/main.rs:425— NativeState::ensure_window 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.
SignInFlow::apply (cyclomatic 20) mila/native/linux/src/session/signin.rs:232— SignInFlow::apply has cyclomatic complexity 20 (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.
validateChecks (cyclomatic 20) .agents/skills/security-audit/validate-coverage-ledger.cjs:421— validateChecks has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 427). 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.
validateDocument (cyclomatic 20) .agents/skills/security-audit/validate-coverage-ledger.cjs:761— validateDocument 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.
GuestExecutor.current_boot (cyclomatic 19) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:485— GuestExecutor.current_boot has cyclomatic complexity 19 (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.
Hostd.reply (cyclomatic 19) lilly/lib/lilly/host/hostd.ex:840— Hostd.reply has cyclomatic complexity 19 (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.
ImportCleanup.cleanup (cyclomatic 19) lilly/lib/lilly/transfer/import_cleanup.ex:62— ImportCleanup.cleanup 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.
Checkpoint.valid_record? (cyclomatic 19) lilly/lib/lilly/vm/checkpoint.ex:362— Checkpoint.valid_record? has cyclomatic complexity 19 (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.
CheckpointStorage.mounts_valid? (cyclomatic 19) lilly/lib/lilly/vm/checkpoint_storage.ex:730— CheckpointStorage.mounts_valid? has cyclomatic complexity 19 (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.
ModelCalls.claim (cyclomatic 19) marshall/lib/marshall/agents/model_calls.ex:241— ModelCalls.claim has cyclomatic complexity 19 (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.
RelocationDeletion.advance_locked! (cyclomatic 19) marshall/lib/marshall/compute/relocation_deletion.ex:82— RelocationDeletion.advance_locked! 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.
Wake.request_locked! (cyclomatic 19) marshall/lib/marshall/compute/wake.ex:51— Wake.request_locked! 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.
Creation.reserve (cyclomatic 19) marshall/lib/marshall/terminal/creation.ex:10— Creation.reserve has cyclomatic complexity 19 (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.
MilaNativeUiKt.TerminalControls (cyclomatic 19) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:529— MilaNativeUiKt.TerminalControls has cyclomatic complexity 19 (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.
scenarios.run_completion (cyclomatic 19) antithesis/workload/satellite/scenarios.py:33— scenarios.run_completion 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.
scenarios.run_create_replay (cyclomatic 19) antithesis/workload/terminal/scenarios.py:62— scenarios.run_create_replay 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.
mila-tailnet-peers.watch (cyclomatic 19) .github/scripts/mila-tailnet-peers.py:210— mila-tailnet-peers.watch 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.
runner.status (cyclomatic 19) antithesis/emulation/recorder/runner.py:241— runner.status 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.
affected.select (cyclomatic 19) buck/affected.py:235— affected.select 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.
packaged_instrumentation.load_journey (cyclomatic 19) mila/native/android/scripts/packaged_instrumentation.py:281— packaged_instrumentation.load_journey 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.
storage.prepare (cyclomatic 19) nix/domains/artifacts/guest/inception/storage.py:65— storage.prepare 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.
native_candidate.install (cyclomatic 19) nix/domains/artifacts/guest/native-kernels/illumos/native_candidate.py:347— native_candidate.install 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.
MilaMachineWorkflow.submit (cyclomatic 19) mila/native/apple/Sources/MilaNativeUI/MilaMachineWorkflow.swift:34— MilaMachineWorkflow.submit 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.
MilaWatchController.update (cyclomatic 19) mila/native/apple/Sources/MilaNativeUI/MilaWatch.swift:58— MilaWatchController.update 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.
AppLock::apply (cyclomatic 19) mila/rust/mila-runtime/src/lock.rs:82— AppLock::apply 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.
Pane.attach (cyclomatic 19) marshall/assets/js/terminals.js:451— Pane.attach has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 489, a function literal at line 502, lost, …). 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.
mounted::verify (cyclomatic 19) marshall/assets/js/admin_elevation.js:117— mounted::verify 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.
MilaWatchStream.Run (cyclomatic 18) mila/windows-dotnet/Interop/WatchStream.cs:66— MilaWatchStream.Run 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.
Front.call_traced (cyclomatic 18) audi/lib/audi/http/front.ex:25— Front.call_traced has cyclomatic complexity 18 (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.
WebSocketUpgrade.handshake (cyclomatic 18) audi/lib/audi/http/web_socket_upgrade.ex:42— WebSocketUpgrade.handshake has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Store.handle_call (cyclomatic 18) brady/lib/brady/cache/store.ex:159— Store.handle_call has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Pool.new (cyclomatic 18) lilly/lib/lilly/host/pool.ex:49— Pool.new has cyclomatic complexity 18 (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.
Propagation.query (cyclomatic 18) lilly/lib/lilly/inception/propagation.ex:86— Propagation.query 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.
Receiver.pull_disk (cyclomatic 18) lilly/lib/lilly/transfer/receiver.ex:44— Receiver.pull_disk 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.
Checkpoint.valid_leaf? (cyclomatic 18) lilly/lib/lilly/vm/checkpoint.ex:455— Checkpoint.valid_leaf? has cyclomatic complexity 18 (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.
Driver.retire_transfer_destination (cyclomatic 18) lilly/lib/lilly/vm/driver.ex:316— Driver.retire_transfer_destination has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Journal.read (cyclomatic 18) lilly/lib/lilly/vm/journal.ex:158— Journal.read has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Administrators.run (cyclomatic 18) marshall/lib/marshall/accounts/administrators.ex:15— Administrators.run 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.
CloneEffects.accept! (cyclomatic 18) marshall/lib/marshall/compute/clone_effects.ex:86— CloneEffects.accept! 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.
RelocationReceives.commands! (cyclomatic 18) marshall/lib/marshall/compute/relocation_receives.ex:135— RelocationReceives.commands! has cyclomatic complexity 18 (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.
RelocationRestoration.confirmed? (cyclomatic 18) marshall/lib/marshall/compute/relocation_restoration.ex:224— RelocationRestoration.confirmed? has cyclomatic complexity 18 (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.
Request.restore (cyclomatic 18) marshall/lib/marshall/ingress/acme/request.ex:71— Request.restore has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SLOCheckpoint.decode (cyclomatic 18) ziggy/lib/ziggy/slo_checkpoint.ex:52— SLOCheckpoint.decode has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MilaNativeUiKt.MachineDetail (cyclomatic 18) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:689— MilaNativeUiKt.MachineDetail has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: MilaNativeUiKt.ThreadDetail (cyclomatic 19) 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.
SatelliteOrigin.receipts_after (cyclomatic 18) antithesis/workload/satellite/origin.py:105— SatelliteOrigin.receipts_after 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.
guest._snapshot (cyclomatic 18) antithesis/workload/terminal/guest.py:129— guest._snapshot 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.
TerminalOracle.create_history (cyclomatic 18) antithesis/workload/terminal/oracle.py:130— TerminalOracle.create_history 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.
campaign.main (cyclomatic 18) antithesis/verification/campaign.py:574— campaign.main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
identity.context_record (cyclomatic 18) antithesis/verification/identity.py:381— identity.context_record 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.
control_worker.process_category (cyclomatic 18) nix/domains/artifacts/guest/inception/control_worker.py:38— control_worker.process_category has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
control_worker.supervise (cyclomatic 18) nix/domains/artifacts/guest/inception/control_worker.py:275— control_worker.supervise 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.
publication.collect (cyclomatic 18) REDACTED:326— publication.collect has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
native_image.check_effective_trust (cyclomatic 18) REDACTED:233— native_image.check_effective_trust has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
extract_freebsd.extract_member (cyclomatic 18) nix/domains/artifacts/guest/native_git/extract_freebsd.py:156— extract_freebsd.extract_member has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
lookup.configuration (cyclomatic 18) nix/domains/system/acme/lookup.py:49— lookup.configuration 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.
common.run (cyclomatic 18) nix/domains/system/backups/common.py:116— common.run 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.
backup_status.backup_status (cyclomatic 18) nix/domains/system/fleet-exporter/backup_status.py:49— backup_status.backup_status 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.
metrics.device_metrics (cyclomatic 18) nix/domains/system/fleet-exporter/metrics.py:261— metrics.device_metrics 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.
mila_transport::cert::parse_host_certificate_blob (cyclomatic 18) mila/rust/mila-transport/src/cert.rs:79— mila_transport::cert::parse_host_certificate_blob has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
admin_elevation.verificationChallenge (cyclomatic 18) marshall/assets/js/admin_elevation.js:29— admin_elevation.verificationChallenge has cyclomatic complexity 18 (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.
MilaThreadListing.Decode (cyclomatic 17) mila/windows-dotnet/Interop/ThreadListing.cs:16— MilaThreadListing.Decode has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file's highest cyclomatic complexity: MilaThreadController.SubmitLive (cyclomatic 20) 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.
GuestBoot.decode (cyclomatic 17) antithesis/lilly/lib/overalls_antithesis/lilly/guest_boot.ex:153— GuestBoot.decode 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.
GuestExecutor.decode_observation (cyclomatic 17) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:404— GuestExecutor.decode_observation 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.
GuestWitness.sanitize (cyclomatic 17) antithesis/operator/guest_witness.ex:749— GuestWitness.sanitize 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.
Observed.ready? (cyclomatic 17) audi/lib/audi/acme/observed.ex:45— Observed.ready? 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.
Config.decode (cyclomatic 17) audi/lib/audi/config.ex:169— Config.decode 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.
EditorAssetsProbe.check (cyclomatic 17) audi/lib/audi/http/editor_assets_probe.ex:18— EditorAssetsProbe.check 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.
FleetWorker.fetch_if_due (cyclomatic 17) audi/lib/audi/tls/fleet_worker.ex:114— FleetWorker.fetch_if_due 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.
Pressure.validate (cyclomatic 17) brady/lib/brady/cache/pressure.ex:38— Pressure.validate 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.
Proxy.exchange (cyclomatic 17) brady/lib/brady/proxy.ex:86— Proxy.exchange 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.
Aggregate.validate_duration (cyclomatic 17) elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:265— Aggregate.validate_duration 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.
ZFS.parse_status (cyclomatic 17) lilly/lib/lilly/host/zfs.ex:1110— ZFS.parse_status 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.
Server.init (cyclomatic 17) lilly/lib/lilly/ingress/server.ex:17— Server.init 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.
AttributionServer.init (cyclomatic 17) lilly/lib/lilly/network/attribution_server.ex:11— AttributionServer.init 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.
PermitJournal.grant (cyclomatic 17) lilly/lib/lilly/transfer/permit_journal.ex:107— PermitJournal.grant has cyclomatic complexity 17 (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.
ReceivedDataset.verify (cyclomatic 17) lilly/lib/lilly/transfer/received_dataset.ex:251— ReceivedDataset.verify 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.
Actor.handle_call (cyclomatic 17) lilly/lib/lilly/vm/actor.ex:130— Actor.handle_call 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.
CheckpointStorage.cleanup_native (cyclomatic 17) lilly/lib/lilly/vm/checkpoint_storage.ex:566— CheckpointStorage.cleanup_native 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.
CheckpointStorage.audit (cyclomatic 17) lilly/lib/lilly/vm/checkpoint_storage.ex:673— CheckpointStorage.audit 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.
HostReports.ingest_with_events_locked! (cyclomatic 17) marshall/lib/marshall/compute/host_reports.ex:132— HostReports.ingest_with_events_locked! 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.
RelocationReadiness.accept! (cyclomatic 17) marshall/lib/marshall/compute/relocation_readiness.ex:55— RelocationReadiness.accept! 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.
Resize.outcome_locked! (cyclomatic 17) marshall/lib/marshall/compute/resize.ex:305— Resize.outcome_locked! 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.
EnvironmentPublications.exchange (cyclomatic 17) marshall/lib/marshall/ingress/environment_publications.ex:27— EnvironmentPublications.exchange has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Execution.discover! (cyclomatic 17) marshall/lib/marshall/ingress/execution.ex:111— Execution.discover! has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
ImageManifest.validate (cyclomatic 17) protocol/lib/overalls_protocol/image_manifest.ex:143— ImageManifest.validate 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.
NestedStream.response (cyclomatic 17) protocol/lib/overalls_protocol/nested_stream.ex:56— NestedStream.response 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.
OverallsProtocol.pool (cyclomatic 17) protocol/lib/overalls_protocol.ex:218— OverallsProtocol.pool has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
MilaThreadDetailController.submit (cyclomatic 17) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaThreadDetail.kt:89— MilaThreadDetailController.submit has cyclomatic complexity 17 (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.
MilaWatchKt.runMilaWatch (cyclomatic 17) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaWatch.kt:38— MilaWatchKt.runMilaWatch has cyclomatic complexity 17 (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.
ComputeOperator._call (cyclomatic 17) antithesis/workload/admission/client.py:90— ComputeOperator._call 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.
physical_scenario.run_measured_physical_capacity (cyclomatic 17) antithesis/workload/admission/physical_scenario.py:24— physical_scenario.run_measured_physical_capacity 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.
credential.read_lilly_credential (cyclomatic 17) antithesis/workload/control/credential.py:20— credential.read_lilly_credential 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.
profile_readiness.repository_origin_ready (cyclomatic 17) antithesis/workload/core/profile_readiness.py:84— profile_readiness.repository_origin_ready 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.
domain.operation_view (cyclomatic 17) antithesis/workload/guest_lifecycle/domain.py:109— domain.operation_view 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.
server.image_identity (cyclomatic 17) antithesis/emulation/guest/server.py:242— server.image_identity 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.
bootstrap.activate (cyclomatic 17) antithesis/emulation/host/bootstrap.py:208— bootstrap.activate 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.
bridge.dispatch (cyclomatic 17) antithesis/emulation/recorder/bridge.py:203— bridge.dispatch has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
authority.issue (cyclomatic 17) audi/priv/private_pki/authority.py:134— authority.issue 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.
monospace_browser_probe.run (cyclomatic 17) marshall/scripts/monospace_browser_probe.py:1060— monospace_browser_probe.run 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.
verify_runtime.prune_illumos (cyclomatic 17) nix/domains/artifacts/guest/native_git/verify_runtime.py:114— verify_runtime.prune_illumos 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.
remote.storage (cyclomatic 17) nix/domains/artifacts/host/remote.py:271— remote.storage 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.
cli.metadata (cyclomatic 17) nix/domains/artifacts/secrets/cli.py:189— cli.metadata 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.
MachineDetailView.body (cyclomatic 17) mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:353— MachineDetailView.body 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.
lilly_export_channel::serve::serve (cyclomatic 17) lilly/native/export-channel/src/serve.rs:26— lilly_export_channel::serve::serve 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.
mila_ffi::validate::trust::mila_trust_document_reconcile (cyclomatic 17) mila/rust/mila-ffi/src/validate/trust.rs:51— mila_ffi::validate::trust::mila_trust_document_reconcile 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.
MilaWindowsNotificationDevicesController.DecodeListing (cyclomatic 16) mila/windows-dotnet/Interop/WindowsNotifications.cs:55— MilaWindowsNotificationDevicesController.DecodeListing 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.
MainWindow.RefreshMachines (cyclomatic 16) mila/windows-dotnet/MainWindow.xaml.cs:958— MainWindow.RefreshMachines 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.
GuestExecutor.start (cyclomatic 16) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:106— GuestExecutor.start 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.
GuestWitness.sanitize (cyclomatic 16) antithesis/operator/guest_witness.ex:773— GuestWitness.sanitize 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.
Config.tls (cyclomatic 16) audi/lib/audi/config.ex:289— Config.tls 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.
Pressure.read (cyclomatic 16) brady/lib/brady/cache/pressure.ex:7— Pressure.read 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.
Config.load (cyclomatic 16) enrico/lib/enrico/config.ex:20— Config.load 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.
Git.refresh (cyclomatic 16) enrico/lib/enrico/git.ex:64— Git.refresh 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.
BackupSnapshot.create (cyclomatic 16) lilly/lib/lilly/host/backup_snapshot.ex:70— BackupSnapshot.create 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.
BackupSnapshot.valid? (cyclomatic 16) lilly/lib/lilly/host/backup_snapshot.ex:204— BackupSnapshot.valid? 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.
ZFS.classify_accounting (cyclomatic 16) lilly/lib/lilly/host/zfs.ex:761— ZFS.classify_accounting 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.
Server.init (cyclomatic 16) lilly/lib/lilly/private/server.ex:10— Server.init has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CheckpointTransfer.finish (cyclomatic 16) lilly/lib/lilly/transfer/checkpoint_transfer.ex:205— CheckpointTransfer.finish 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.
ImportJournal.for_intent (cyclomatic 16) lilly/lib/lilly/transfer/import_journal.ex:167— ImportJournal.for_intent 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.
ReceivedDataset.resume_token (cyclomatic 16) lilly/lib/lilly/transfer/received_dataset.ex:298— ReceivedDataset.resume_token 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.
SourceCleanup.snapshots (cyclomatic 16) lilly/lib/lilly/transfer/source_cleanup.ex:126— SourceCleanup.snapshots 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.
SourceSnapshotCleanup.authorized (cyclomatic 16) lilly/lib/lilly/transfer/source_snapshot_cleanup.ex:35— SourceSnapshotCleanup.authorized 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.
SourceSnapshots.remove (cyclomatic 16) lilly/lib/lilly/transfer/source_snapshots.ex:367— SourceSnapshots.remove 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.
Driver.retire_transfer_source (cyclomatic 16) lilly/lib/lilly/vm/driver.ex:158— Driver.retire_transfer_source 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.
Loop.next_step (cyclomatic 16) marshall/lib/marshall/agents/loop.ex:195— Loop.next_step has cyclomatic complexity 16 (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.
ModelCalls.apply_response! (cyclomatic 16) marshall/lib/marshall/agents/model_calls.ex:429— ModelCalls.apply_response! has cyclomatic complexity 16 (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.
Skills.verify_result (cyclomatic 16) marshall/lib/marshall/agents/skills.ex:522— Skills.verify_result 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.
ThreadToolDispatch.claim_candidate (cyclomatic 16) marshall/lib/marshall/agents/thread_tool_dispatch.ex:37— ThreadToolDispatch.claim_candidate 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.
EvacuationViews.inspect_node (cyclomatic 16) marshall/lib/marshall/compute/evacuation_views.ex:119— EvacuationViews.inspect_node 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.
RelocationCleanup.advance_locked! (cyclomatic 16) marshall/lib/marshall/compute/relocation_cleanup.ex:29— RelocationCleanup.advance_locked! 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.
RelocationCleanup.deletion_confirmed? (cyclomatic 16) marshall/lib/marshall/compute/relocation_cleanup.ex:112— RelocationCleanup.deletion_confirmed? 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.
Wake.admit_execution! (cyclomatic 16) marshall/lib/marshall/compute/wake.ex:252— Wake.admit_execution! has cyclomatic complexity 16 (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.
Relays.connection! (cyclomatic 16) marshall/lib/marshall/ingress/relays.ex:188— Relays.connection! 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.
RuntimeConfig.database (cyclomatic 16) marshall/lib/marshall/operations/runtime_config.ex:172— RuntimeConfig.database 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.
Authority.open_on_vm (cyclomatic 16) marshall/lib/marshall/terminal/authority.ex:148— Authority.open_on_vm 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.
Coordinator.execute (cyclomatic 16) marshall/lib/marshall/threads/coordinator.ex:26— Coordinator.execute 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.
EditorStream.response (cyclomatic 16) protocol/lib/overalls_protocol/editor_stream.ex:44— EditorStream.response 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.
InceptionParent.validate (cyclomatic 16) protocol/lib/overalls_protocol/inception_parent.ex:11— InceptionParent.validate 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.
AgentStream.recognized_pre_output? (cyclomatic 16) ziggy/lib/ziggy/agent_stream.ex:174— AgentStream.recognized_pre_output? 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.
verdict.measured_capacity_verdict (cyclomatic 16) antithesis/workload/admission/verdict.py:13— verdict.measured_capacity_verdict 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.
statemachine.execute_state_machine (cyclomatic 16) nix/verification/hegel/python/hegel/statemachine.py:233— statemachine.execute_state_machine 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.
mila_platform.parse (cyclomatic 16) buck/mila_platform.py:68— mila_platform.parse 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.
boot_report.report (cyclomatic 16) nix/domains/artifacts/guest/boot_report.py:162— boot_report.report 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.
enrollment.finish_completed_lilly_rebind (cyclomatic 16) nix/domains/artifacts/host/enrollment.py:294— enrollment.finish_completed_lilly_rebind 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.
extensions.archive_entries (cyclomatic 16) REDACTED:283— extensions.archive_entries 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.
Transition.prepare (cyclomatic 16) nix/domains/system/auto-update/resources.py:258— Transition.prepare 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.
Deployment.run (cyclomatic 16) nix/domains/system/auto-update/runtime.py:1296— Deployment.run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
runtime.main (cyclomatic 16) nix/domains/system/auto-update/runtime.py:1446— runtime.main 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.
storage.prepare (cyclomatic 16) nix/domains/system/brady/storage.py:143— storage.prepare 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.
metrics.host_metrics (cyclomatic 16) nix/domains/system/fleet-exporter/metrics.py:206— metrics.host_metrics 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.
LinkedMilaFFIAdapter.createMachine (cyclomatic 16) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:713— LinkedMilaFFIAdapter.createMachine 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.
MilaTerminalFrame.decode (cyclomatic 16) mila/native/apple/Sources/MilaNativeUI/MilaTerminalFrame.swift:30— MilaTerminalFrame.decode 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.
Command::parse (cyclomatic 16) mila/rust/mila-protocol/src/command.rs:40— Command::parse 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.
Daemon::attach (cyclomatic 16) nix/domains/artifacts/terminald/src/session.rs:605— Daemon::attach 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.
thread_composer.refreshCommandAvailability (cyclomatic 16) marshall/assets/js/thread_composer.js:17— thread_composer.refreshCommandAvailability has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 19). 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.
buildQuery (cyclomatic 16) .agents/skills/antithesis-query-logs/assets/antithesis-query-logs.js:149— buildQuery has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body's own statements and 5 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.
collectDataLimitErrors (cyclomatic 16) REDACTED:207— collectDataLimitErrors 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.
Retired release: earmark — `:earmark` is pinned to 1.4.49 in the committed REDACTED, and the publisher deprecated it on hex.pm — "Earmark is no longer maintained. Migrate to a replacement, for example MDEx (https://hex.pm/packages/mdex).". A retired release is one the publisher has asked you to stop using. Move off it and commit the updated lockfile.
Unbounded dependency requirement: postgrex — Runtime dependency `:postgrex` is declared `">= 0.0.0"` in marshall/mix.exs, which has no upper bound — every future MAJOR release of `:postgrex` satisfies it, so the next unlocked resolve can pull a breaking change. Use `~>` (e.g. `"~> 1.0"`) to bound the requirement to a compatible range.
probe.advance (cognitive 168) marshall/scripts/localization_browser/probe.ts:56— probe.advance has cognitive complexity 168 (threshold 15). Drivers by points: if/else 59 (123 pts), boolean chains 37, ternaries 4 (8 pts) (nesting depth added 68). 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.
mounted (cognitive 115) marshall/assets/js/terminals.js:664— mounted has cognitive complexity 115 (threshold 15). Drivers by points: if/else 45 (73 pts), boolean chains 23, ternaries 6 (14 pts), error handling 1 (3 pts), loops 2 (nesting depth added 38). Most of this is not in the body itself: 4 of the 115 points are its own statements and the rest belongs to 17 function items inside it that branch (a function literal at line 730, a function literal at line 802, a function literal at line 682, …). 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.
collectFindingSemanticErrors (cognitive 96) REDACTED:485— collectFindingSemanticErrors has cognitive complexity 96 (threshold 15). Drivers by points: if/else 30 (53 pts), boolean chains 34, loops 5 (9 pts) (nesting depth added 27). Most of this is not in the body itself: 1 of the 96 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 491, 510, 521). 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.
validate (cognitive 81) REDACTED:361— validate has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (49 pts), boolean chains 16, loops 3 (7 pts), ternaries 2 (5 pts), error handling 1 (4 pts) (nesting depth added 34). Of this number, 77 points are the body's own statements and 4 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Driver.resume (cognitive 78) lilly/lib/lilly/vm/driver.ex:574— Driver.resume has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (69 pts), match/switch 4 (9 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
campaign.transition (cognitive 74) antithesis/verification/campaign.py:355— campaign.transition has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (58 pts), ternaries 4 (10 pts), boolean chains 6 (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.
collector.main (cognitive 73) nix/domains/system/firecracker-logging/collector.py:143— collector.main has cognitive complexity 73 (threshold 15). Drivers by points: if/else 10 (37 pts), error handling 4 (16 pts), loops 6 (16 pts), boolean chains 4 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
collectSchemaErrors::check (cognitive 72) REDACTED:250— collectSchemaErrors::check has cognitive complexity 72 (threshold 15). Drivers by points: if/else 29 (40 pts), boolean chains 17, loops 4 (8 pts), error handling 2 (7 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.
SourceSnapshots.remove (cognitive 66) lilly/lib/lilly/transfer/source_snapshots.ex:367— SourceSnapshots.remove has cognitive complexity 66 (threshold 15). Drivers by points: if/else 11 (45 pts), match/switch 6 (20 pts), boolean chains 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scenarios.run_named_integration (cognitive 66) antithesis/workload/satellite/scenarios.py:100— scenarios.run_named_integration has cognitive complexity 66 (threshold 15). Drivers by points: if/else 26 (37 pts), boolean chains 27, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scenarios.run_traces (cognitive 65) antithesis/workload/recorder/scenarios.py:465— scenarios.run_traces has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 20, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server.inventory (cognitive 64) antithesis/emulation/guest/server.py:350— server.inventory has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (38 pts), boolean chains 15, ternaries 3 (10 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch_git.assemble (cognitive 64) nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:36— fetch_git.assemble has cognitive complexity 64 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 11 (17 pts), boolean chains 7 (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.
monospace_browser_probe.check_thread_collaborators (cognitive 63) marshall/scripts/monospace_browser_probe.py:873— monospace_browser_probe.check_thread_collaborators has cognitive complexity 63 (threshold 15). Drivers by points: if/else 5 (22 pts), loops 8 (22 pts), ternaries 2 (11 pts), boolean chains 8 (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.
Driver.pause (cognitive 59) lilly/lib/lilly/vm/driver.ex:484— Driver.pause has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (50 pts), match/switch 4 (9 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust_cell.generate (cognitive 58) nix/buck/rust_cell.py:265— rust_cell.generate has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 11 (18 pts), ternaries 5 (12 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ZFSDataset.delete_owned (cognitive 57) lilly/lib/lilly/host/zfs_dataset.ex:1454— ZFSDataset.delete_owned has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (50 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Outcomes.record! (cognitive 57) marshall/lib/marshall/compute/outcomes.ex:79— Outcomes.record! has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 14, match/switch 4 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
selection.module_dependencies (cognitive 57) antithesis/verification/selection.py:116— selection.module_dependencies has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preparation._prepare (cognitive 56) nix/domains/artifacts/host/preparation.py:422— preparation._prepare has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 12, ternaries 4 (7 pts), loops 4 (6 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.
identity.verify_image_copy (cognitive 55) antithesis/verification/identity.py:601— identity.verify_image_copy has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 12, ternaries 7 (10 pts), loops 4 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Runtime.poll_once (cognitive 54) lilly/lib/lilly/inception/runtime.ex:147— Runtime.poll_once has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (46 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
mounted (cognitive 53) marshall/assets/js/thread_composer.js:183— mounted has cognitive complexity 53 (threshold 15). Drivers by points: if/else 27 (32 pts), boolean chains 16, ternaries 3 (5 pts) (nesting depth added 7). None of this is in the body itself: all 53 points belong to 11 function literals inside it that branch (lines 217, 194, 209, …). 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.
scenarios._published_head_effect (cognitive 52) antithesis/workload/repository/scenarios.py:70— scenarios._published_head_effect has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 14, loops 3 (5 pts), ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
selection.validate_compose (cognitive 52) antithesis/verification/selection.py:331— selection.validate_compose has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 6 (10 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
enrollment.rebind_empty_lilly (cognitive 52) nix/domains/artifacts/host/enrollment.py:381— enrollment.rebind_empty_lilly has cognitive complexity 52 (threshold 15). Drivers by points: if/else 27 (40 pts), boolean chains 6, loops 4 (5 pts), error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RelocationSources.prepare_request! (cognitive 51) marshall/lib/marshall/compute/relocation_sources.ex:138— RelocationSources.prepare_request! has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 9, match/switch 2 (5 pts) (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.
enrico_git_owner::stream (cognitive 51) enrico/native/git-owner/src/main.rs:207— enrico_git_owner::stream has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 4 (11 pts), boolean chains 3, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_transfer_stream::run::sweep (cognitive 51) lilly/native/transfer-stream/src/run.rs:300— lilly_transfer_stream::run::sweep has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 6 (20 pts), loops 3 (6 pts), boolean chains 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.
Git.refresh (cognitive 50) enrico/lib/enrico/git.ex:64— Git.refresh has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (44 pts), match/switch 2 (6 pts) (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.
SettingsView.body (cognitive 50) mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:594— SettingsView.body has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 9, ternaries 7 (9 pts), error handling 1 (2 pts), match/switch 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.
ZFSDataset.recover_delete_mount (cognitive 49) lilly/lib/lilly/host/zfs_dataset.ex:785— ZFSDataset.recover_delete_mount has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (33 pts), match/switch 5 (15 pts), boolean chains 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.
install.run (cognitive 49) nix/domains/artifacts/guest/windows/install.py:598— install.run has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (33 pts), ternaries 2 (6 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
run.main (cognitive 48) marshall/scripts/localization_browser/run.py:72— run.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (37 pts), boolean chains 5, loops 2 (5 pts), ternaries 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify_runtime.verify (cognitive 48) nix/domains/artifacts/guest/native_git/verify_runtime.py:161— verify_runtime.verify has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (27 pts), ternaries 6 (10 pts), loops 5 (6 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
serial_session.run (cognitive 47) nix/domains/artifacts/guest/omnios/serial_session.py:97— serial_session.run has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 7, error handling 1 (3 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scenarios.run_key_survives_archive (cognitive 46) antithesis/workload/admission/scenarios.py:305— scenarios.run_key_survives_archive has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 7, ternaries 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
publication.records (cognitive 46) REDACTED:219— publication.records has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 8, loops 3 (7 pts), ternaries 2 (6 pts) (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.
MilaTerminalStream.AttachGeneration (cognitive 45) mila/windows-dotnet/Interop/TerminalStream.cs:377— MilaTerminalStream.AttachGeneration has cognitive complexity 45 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
runner._run_registered (cognitive 45) nix/verification/hegel/python/hegel/runner.py:74— runner._run_registered has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (11 pts), error handling 3 (7 pts), ternaries 1 (3 pts), boolean chains 2 (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.
Deployment.preflight (cognitive 45) nix/domains/system/auto-update/runtime.py:773— Deployment.preflight has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 7, loops 2 (4 pts), ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaSignInCoordinator.AuthenticateAsync (cognitive 44) mila/windows-dotnet/Interop/SignInCoordinator.cs:208— MilaSignInCoordinator.AuthenticateAsync has cognitive complexity 44 (threshold 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.
Driver.provisioned (cognitive 44) lilly/lib/lilly/vm/driver.ex:1071— Driver.provisioned has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 6 (15 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli.policy (cognitive 44) nix/domains/artifacts/secrets/cli.py:79— cli.policy has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 11, loops 4 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
metrics.cgroup_metrics (cognitive 44) nix/domains/system/fleet-exporter/metrics.py:421— metrics.cgroup_metrics has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaRouteParser.parse (cognitive 44) mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:26— MilaRouteParser.parse has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 22, if/else 9 (13 pts), ternaries 3 (8 pts), match/switch 1 (nesting depth added 9). 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.
Schema::sanitize (cognitive 44) elixir/diagnostics/native/spool/src/schema.rs:61— Schema::sanitize has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (10 pts), match/switch 1 (5 pts), boolean chains 2 (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.
MilaTerminalStream.PollRead (cognitive 43) mila/windows-dotnet/Interop/TerminalStream.cs:210— MilaTerminalStream.PollRead has cognitive complexity 43 (threshold 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.
Propagation.query (cognitive 43) lilly/lib/lilly/inception/propagation.ex:86— Propagation.query has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 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.
scenarios.run_native_admission_after_restart (cognitive 43) antithesis/workload/repository/scenarios.py:348— scenarios.run_native_admission_after_restart has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 11, loops 4 (5 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Program.Main (cognitive 42) REDACTED:17— Program.Main has cognitive complexity 42 (threshold 15). Of this number, 41 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
Backup.execute (cognitive 42) lilly/lib/lilly/backup.ex:138— Backup.execute has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 4 (12 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ImageTemplate.create (cognitive 42) lilly/lib/lilly/host/image_template.ex:325— ImageTemplate.create has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 4 (9 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
assertions.python_calls (cognitive 42) antithesis/verification/assertions.py:51— assertions.python_calls has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 10, loops 2, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GuestWitness.main (cognitive 41) antithesis/operator/guest_witness.ex:62— GuestWitness.main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 6 (10 pts) (nesting depth added 19). 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.
MilaNativeUiKt.MilaNativeRoot (cognitive 41) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:83— MilaNativeUiKt.MilaNativeRoot has cognitive complexity 41 (threshold 15). Drivers by points: if/else 27 (32 pts), boolean chains 4, match/switch 4, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
control.effect (cognitive 41) REDACTED:69— control.effect has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 10, ternaries 5 (10 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.
validateAttempts (cognitive 41) .agents/skills/security-audit/validate-coverage-ledger.cjs:568— validateAttempts has cognitive complexity 41 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 6, loops 1 (nesting depth added 10). Most of this is not in the body itself: 5 of the 41 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 578, 616, 634). 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.
collectUnitErrors (cognitive 41) .agents/skills/security-audit/validate-coverage-ledger.cjs:646— collectUnitErrors has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 7, loops 3 (4 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). Of this number, 38 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch_sdk.parse_manifest (cognitive 40) REDACTED:120— fetch_sdk.parse_manifest has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli.main (cognitive 40) nix/domains/artifacts/secrets/cli.py:389— cli.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), ternaries 3 (6 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runtime.main (cognitive 40) nix/domains/system/backups/runtime.py:254— runtime.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (28 pts), ternaries 2 (5 pts), loops 1 (3 pts), boolean chains 2, error handling 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scenarios._physical_pressure (cognitive 39) antithesis/workload/recorder/scenarios.py:334— scenarios._physical_pressure has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 16, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
runtime.load_case (cognitive 39) antithesis/workload/terminal/runtime.py:56— runtime.load_case has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 12, loops 3 (4 pts), error handling 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scenarios.run_input_probe (cognitive 39) antithesis/workload/terminal/scenarios.py:141— scenarios.run_input_probe has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 6, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
control_worker.supervise (cognitive 39) nix/domains/artifacts/guest/inception/control_worker.py:275— control_worker.supervise has cognitive complexity 39 (threshold 15). Drivers by points: error handling 3 (13 pts), if/else 5 (13 pts), boolean chains 6, ternaries 1 (6 pts), loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
common.run (cognitive 39) nix/domains/system/backups/common.py:116— common.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (5 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backup_status.backup_status (cognitive 39) nix/domains/system/fleet-exporter/backup_status.py:49— backup_status.backup_status has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 6, error handling 2 (5 pts), loops 1 (3 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Snapshot.render (cognitive 39) nix/domains/system/fleet-exporter/exporter.py:126— Snapshot.render has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 6 (10 pts), boolean chains 8, 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.
Prompt.admit! (cognitive 38) marshall/lib/marshall/agents/prompt.ex:78— Prompt.admit! has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 13, match/switch 3 (4 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.
InferenceOracle.snapshot (cognitive 38) antithesis/workload/satellite/oracle.py:64— InferenceOracle.snapshot has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
monospace_browser_probe.run (cognitive 38) marshall/scripts/monospace_browser_probe.py:1060— monospace_browser_probe.run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Runner.capture (cognitive 38) nix/domains/system/backups/runtime.py:94— Runner.capture has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 5 (11 pts), error handling 6 (10 pts), 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.
Config.decode (cognitive 37) audi/lib/audi/config.ex:97— Config.decode has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26 (29 pts), boolean chains 7, match/switch 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.
Source.execute (cognitive 37) lilly/lib/lilly/transfer/source.ex:33— Source.execute has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ModelCalls.queue (cognitive 37) marshall/lib/marshall/agents/model_calls.ex:29— ModelCalls.queue has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 12, match/switch 4 (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.
profile_readiness.recorder_host_ready (cognitive 37) antithesis/workload/core/profile_readiness.py:224— profile_readiness.recorder_host_ready has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 7, error handling 6 (7 pts), loops 3, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila-tailnet-peers.watch (cognitive 37) .github/scripts/mila-tailnet-peers.py:210— mila-tailnet-peers.watch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 3 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runtime.collect (cognitive 37) nix/domains/system/fleet-exporter/runtime.py:560— runtime.collect has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (25 pts), error handling 4 (6 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preflightJsonText (cognitive 37) .agents/skills/security-audit/validate-coverage-ledger.cjs:141— preflightJsonText has cognitive complexity 37 (threshold 15). Drivers by points: if/else 32 (46 pts), boolean chains 11, ternaries 5 (10 pts), loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pool.device_extent (cognitive 36) lilly/lib/lilly/host/pool.ex:335— Pool.device_extent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (7 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.
Network.detach (cognitive 36) lilly/lib/lilly/network.ex:119— Network.detach has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 4 (10 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Receiver.pull_disk (cognitive 36) lilly/lib/lilly/transfer/receiver.ex:44— Receiver.pull_disk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (10 pts), boolean chains 5, error handling 1 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GitLive.handle_params (cognitive 36) marshall/lib/marshall_web/live/git_live.ex:26— GitLive.handle_params has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 2 (5 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.
Config.load (cognitive 36) ziggy/lib/ziggy/config.ex:7— Config.load has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26, boolean chains 9, match/switch 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.
spool.read_slots (cognitive 36) antithesis/workload/satellite/spool.py:26— spool.read_slots has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 8, error handling 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server.dispatch (cognitive 36) antithesis/emulation/guest/server.py:1050— server.dispatch has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 6, 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.
campaign.initialize (cognitive 36) antithesis/verification/campaign.py:110— campaign.initialize has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 9, ternaries 3, 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.
rust_parity.main (cognitive 36) buck/rust_parity.py:179— rust_parity.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 6 (9 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EditorAssetsProbe.check (cognitive 35) audi/lib/audi/http/editor_assets_probe.ex:18— EditorAssetsProbe.check has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 2 (4 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.
Stream.chunks (cognitive 35) brady/lib/brady/http/stream.ex:63— Stream.chunks has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (7 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CheckpointStorage.recycle_other (cognitive 35) lilly/lib/lilly/vm/checkpoint_storage.ex:468— CheckpointStorage.recycle_other has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (26 pts), match/switch 4 (9 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.
Executor.reconcile (cognitive 35) lilly/lib/lilly/vm/executor.ex:249— Executor.reconcile has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 8 (22 pts), if/else 9 (13 pts) (nesting depth added 18). 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.
GuestTrust.exchange (cognitive 35) lilly/lib/lilly/vm/guest_trust.ex:66— GuestTrust.exchange has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 2 (4 pts) (nesting depth added 22). 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.
Deployment.healthy (cognitive 35) nix/domains/system/auto-update/runtime.py:1100— Deployment.healthy has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 4 (6 pts), boolean chains 4, error handling 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.
Observed.ready? (cognitive 34) audi/lib/audi/acme/observed.ex:45— Observed.ready? has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Config.load (cognitive 34) lilly/lib/lilly/control/config.ex:41— Config.load has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20, boolean chains 13, match/switch 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.
CheckpointTransfer.prepare (cognitive 34) lilly/lib/lilly/transfer/checkpoint_transfer.ex:114— CheckpointTransfer.prepare has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 5 (13 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Authority.open_on_vm (cognitive 34) marshall/lib/marshall/terminal/authority.ex:148— Authority.open_on_vm has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 4 (12 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FleetWorker.fetch_if_due (cognitive 33) audi/lib/audi/tls/fleet_worker.ex:114— FleetWorker.fetch_if_due has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.exchange (cognitive 33) brady/lib/brady/proxy.ex:86— Proxy.exchange has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Credentials.exchange (cognitive 33) lilly/lib/lilly/vm/credentials.ex:106— Credentials.exchange has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 20). 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.
scenarios.run_ring_budget (cognitive 33) antithesis/workload/terminal/scenarios.py:256— scenarios.run_ring_budget has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
selection.selected_files (cognitive 33) antithesis/verification/selection.py:190— selection.selected_files has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runtime.prepare (cognitive 33) REDACTED:113— runtime.prepare has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (5 pts), boolean chains 4, error handling 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaWatchController.update (cognitive 33) mila/native/apple/Sources/MilaNativeUI/MilaWatch.swift:58— MilaWatchController.update has cognitive complexity 33 (threshold 15). Drivers by points: error handling 4 (12 pts), if/else 5 (8 pts), loops 3 (8 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Server.serve (cognitive 32) audi/lib/audi/relay/server.ex:132— Server.serve has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 2 (6 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.
ImageTemplate.with_image (cognitive 32) lilly/lib/lilly/host/image_template.ex:30— ImageTemplate.with_image has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 6 (15 pts) (nesting depth added 18). 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.
ImportJournal.for_intent (cognitive 32) lilly/lib/lilly/transfer/import_journal.ex:167— ImportJournal.for_intent has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Flush.request (cognitive 32) lilly/lib/lilly/vm/flush.ex:10— Flush.request has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 2 (4 pts) (nesting depth added 20). 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.
InceptionExchange.exchange (cognitive 32) lilly/lib/lilly/vm/inception_exchange.ex:76— InceptionExchange.exchange has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 2 (4 pts) (nesting depth added 20). 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.
KernelAttestation.probe (cognitive 32) lilly/lib/lilly/vm/kernel_attestation.ex:77— KernelAttestation.probe has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 20). 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.
ExecutorSession.with_attachment_command (cognitive 32) marshall/lib/marshall/agents/executor_session.ex:218— ExecutorSession.with_attachment_command has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 10, match/switch 4 (8 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.
WorkflowServiceLevels.activation_evidence (cognitive 32) marshall/lib/marshall/compute/workflow_service_levels.ex:241— WorkflowServiceLevels.activation_evidence has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 10, match/switch 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.
browser.run_magic_preview (cognitive 32) antithesis/workload/access/browser.py:106— browser.run_magic_preview has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 7, ternaries 2 (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.
runtime.prepare_vm (cognitive 32) antithesis/workload/satellite/runtime.py:35— runtime.prepare_vm has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 8, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
packaged_instrumentation.parse_instrumentation (cognitive 32) mila/native/android/scripts/packaged_instrumentation.py:171— packaged_instrumentation.parse_instrumentation has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 4, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaRootContent.body (cognitive 32) mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:149— MilaRootContent.body has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 6, match/switch 3, ternaries 3 (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.
collectDataLimitErrors (cognitive 32) REDACTED:207— collectDataLimitErrors has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (7 pts), boolean chains 4, ternaries 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.
BackupSnapshot.cleanup (cognitive 31) lilly/lib/lilly/host/backup_snapshot.ex:141— BackupSnapshot.cleanup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ClonePlacement.reserve! (cognitive 31) marshall/lib/marshall/compute/clone_placement.ex:24— ClonePlacement.reserve! has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 11, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
scenarios.run_capacity (cognitive 31) antithesis/workload/recorder/scenarios.py:105— scenarios.run_capacity has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 11, loops 3, ternaries 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.
scenarios.run_recovery (cognitive 31) antithesis/workload/recorder/scenarios.py:203— scenarios.run_recovery has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, loops 2 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
editor.run_login_code_reply_loss (cognitive 31) antithesis/workload/satellite/editor.py:204— editor.run_login_code_reply_loss has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 15, if/else 12, error handling 2, loops 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
storage.prepare (cognitive 31) nix/domains/artifacts/guest/inception/storage.py:65— storage.prepare has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 2 (4 pts), error handling 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.
Effects.run (cognitive 30) lilly/lib/lilly/clone/effects.ex:129— Effects.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 5 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CloneCopy.copy (cognitive 30) lilly/lib/lilly/transfer/clone_copy.ex:45— CloneCopy.copy has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (9 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Key.ensure (cognitive 30) lilly/lib/lilly/transfer/key.ex:15— Key.ensure has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 5 (10 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CheckpointStorage.prepare_slot (cognitive 30) lilly/lib/lilly/vm/checkpoint_storage.ex:63— CheckpointStorage.prepare_slot has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 5 (9 pts) (nesting depth added 14). 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.
EvacuationViews.inspect_node (cognitive 30) marshall/lib/marshall/compute/evacuation_views.ex:119— EvacuationViews.inspect_node has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 5, match/switch 1 (nesting depth added 9). 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.
dispatch.run_legacy_request (cognitive 30) antithesis/workload/control/dispatch.py:281— dispatch.run_legacy_request has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 13, 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.
scenarios.run_kill_under_input_stall (cognitive 30) antithesis/workload/terminal/scenarios.py:412— scenarios.run_kill_under_input_stall has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NativeState::ensure_window (cognitive 30) mila/native/linux/src/main.rs:425— NativeState::ensure_window has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 5 (7 pts), loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Command::parse (cognitive 30) mila/rust/mila-protocol/src/command.rs:40— Command::parse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, match/switch 1 (4 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaTerminalView.Render (cognitive 29) mila/windows-dotnet/MilaTerminalView.cs:21— MilaTerminalView.Render has cognitive complexity 29 (threshold 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.
ImageTemplate.reserve (cognitive 29) lilly/lib/lilly/host/image_template.ex:181— ImageTemplate.reserve has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Checkpoint.valid_transition? (cognitive 29) lilly/lib/lilly/lifecycle/checkpoint.ex:25— Checkpoint.valid_transition? has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 27, if/else 1, match/switch 1. 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.
Driver.maybe_deliver_trust (cognitive 29) lilly/lib/lilly/vm/driver.ex:1195— Driver.maybe_deliver_trust has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (12 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Readiness.probe (cognitive 29) lilly/lib/lilly/vm/readiness.ex:67— Readiness.probe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 18). 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.
RelocationCapacity.prepare! (cognitive 29) marshall/lib/marshall/compute/relocation_capacity.ex:86— RelocationCapacity.prepare! has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, if/else 14, match/switch 1. 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.
RelocationCoordinator.stop_confirmed? (cognitive 29) marshall/lib/marshall/compute/relocation_coordinator.ex:313— RelocationCoordinator.stop_confirmed? has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 20, if/else 8, match/switch 1. 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.
bootstrap.probe (cognitive 29) antithesis/workload/core/bootstrap.py:35— bootstrap.probe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 11, loops 2, 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.
identity.walk_inputs (cognitive 29) antithesis/verification/identity.py:178— identity.walk_inputs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (8 pts), boolean chains 6 (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.
packaged_instrumentation.run_suite (cognitive 29) mila/native/android/scripts/packaged_instrumentation.py:468— packaged_instrumentation.run_suite has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 8, ternaries 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
cli.validate (cognitive 29) nix/domains/artifacts/host/cli.py:260— cli.validate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 11, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
enforceJsonTextLimits (cognitive 29) REDACTED:651— enforceJsonTextLimits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 10). Of this number, 26 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.
ZFSDataset.import_claim (cognitive 28) lilly/lib/lilly/host/zfs_dataset.ex:166— ZFSDataset.import_claim has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 12). 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.
Execution.current! (cognitive 28) marshall/lib/marshall/ingress/execution.ex:30— Execution.current! has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 20, if/else 7 (8 pts) (nesting depth added 1). 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.
Publications.snapshot! (cognitive 28) marshall/lib/marshall/ingress/publications.ex:26— Publications.snapshot! has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 10, match/switch 2 (3 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.
ThreadsLive.load (cognitive 28) marshall/lib/marshall_web/live/threads_live.ex:905— ThreadsLive.load has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 13, match/switch 1. 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.
ComputeOperator._call (cognitive 28) antithesis/workload/admission/client.py:90— ComputeOperator._call has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 3 (5 pts), boolean chains 3, 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.
scenarios.run_credential_revalidation (cognitive 28) antithesis/workload/control/scenarios.py:163— scenarios.run_credential_revalidation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 10 (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.
SatelliteOrigin.receipts_after (cognitive 28) antithesis/workload/satellite/origin.py:105— SatelliteOrigin.receipts_after has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scenarios.run_completion (cognitive 28) antithesis/workload/satellite/scenarios.py:33— scenarios.run_completion has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
campaign.reserve (cognitive 28) antithesis/verification/campaign.py:247— campaign.reserve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 7, ternaries 3 (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.
identity.docker_copies (cognitive 28) antithesis/verification/identity.py:504— identity.docker_copies has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Proxy.deliver (cognitive 27) brady/lib/brady/proxy.ex:220— Proxy.deliver has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CheckpointTransfer.received_native (cognitive 27) lilly/lib/lilly/transfer/checkpoint_transfer.ex:241— CheckpointTransfer.received_native has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 8, match/switch 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.
PermitJournal.mutate (cognitive 27) lilly/lib/lilly/transfer/permit_journal.ex:254— PermitJournal.mutate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CheckpointStorage.native (cognitive 27) lilly/lib/lilly/vm/checkpoint_storage.ex:347— CheckpointStorage.native has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, boolean chains 9, match/switch 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.
Driver.launch (cognitive 27) lilly/lib/lilly/vm/driver.ex:729— Driver.launch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 4 (9 pts) (nesting depth added 15). 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.
Driver.begin_launch (cognitive 27) lilly/lib/lilly/vm/driver.ex:766— Driver.begin_launch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 4 (9 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.
Intent.set (cognitive 27) lilly/lib/lilly/vm/intent.ex:31— Intent.set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (9 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Administrators.run (cognitive 27) marshall/lib/marshall/accounts/administrators.ex:15— Administrators.run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 6, match/switch 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.
RelocationReadinessState.activation (cognitive 27) marshall/lib/marshall/compute/relocation_readiness_state.ex:102— RelocationReadinessState.activation has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 20, if/else 6, match/switch 1. 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.
Wake.request_locked! (cognitive 27) marshall/lib/marshall/compute/wake.ex:51— Wake.request_locked! has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, match/switch 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
observer.read_snapshot (cognitive 27) antithesis/workload/repository/observer.py:36— observer.read_snapshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 8, error handling 2 (3 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scenarios.run_replay_cap (cognitive 27) antithesis/workload/repository/scenarios.py:242— scenarios.run_replay_cap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, 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.
scenarios.run_neighbor_progress (cognitive 27) antithesis/workload/terminal/scenarios.py:328— scenarios.run_neighbor_progress has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 7, ternaries 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
runner.stop (cognitive 27) antithesis/emulation/guest/runner.py:755— runner.stop has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, 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.
affected.select (cognitive 27) buck/affected.py:235— affected.select has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 6, 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.
check_assembly.check (cognitive 27) nix/domains/artifacts/guest/omnios/check_assembly.py:176— check_assembly.check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, loops 5, 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.
Transition.prepare (cognitive 27) nix/domains/system/auto-update/resources.py:258— Transition.prepare has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
metrics.device_metrics (cognitive 27) nix/domains/system/fleet-exporter/metrics.py:261— metrics.device_metrics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (6 pts), boolean chains 5, loops 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.
validateDocument (cognitive 27) .agents/skills/security-audit/validate-coverage-ledger.cjs:761— validateDocument has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, ternaries 2 (5 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.
GuestWitness.current_replay_binding (cognitive 26) antithesis/operator/guest_witness.ex:267— GuestWitness.current_replay_binding has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 6, match/switch 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.
GuestWitness.publish_exclusive_arm (cognitive 26) antithesis/operator/guest_witness.ex:347— GuestWitness.publish_exclusive_arm has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Front.forward (cognitive 26) audi/lib/audi/private/front.ex:200— Front.forward has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 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.
Head.parse (cognitive 26) brady/lib/brady/http/head.ex:21— Head.parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). 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.
Proxy.forward (cognitive 26) brady/lib/brady/proxy.ex:175— Proxy.forward has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (4 pts) (nesting depth added 16). 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.
Effects.stream_disk (cognitive 26) lilly/lib/lilly/clone/effects.ex:354— Effects.stream_disk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (8 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CheckpointStorage.claim_files (cognitive 26) lilly/lib/lilly/vm/checkpoint_storage.ex:228— CheckpointStorage.claim_files has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 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.
WorkspaceSource.connect (cognitive 26) lilly/lib/lilly/vm/workspace_source.ex:146— WorkspaceSource.connect has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (4 pts) (nesting depth added 16). 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.
RelocationDeletion.advance_locked! (cognitive 26) marshall/lib/marshall/compute/relocation_deletion.ex:82— RelocationDeletion.advance_locked! has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 11, match/switch 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.
OverallsProtocol.pool (cognitive 26) protocol/lib/overalls_protocol.ex:218— OverallsProtocol.pool has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (9 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
MilaTerminalRenderer.append (cognitive 26) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaMachineControls.kt:32— MilaTerminalRenderer.append has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 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.
statemachine.execute_state_machine (cognitive 26) nix/verification/hegel/python/hegel/statemachine.py:233— statemachine.execute_state_machine has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 9 (13 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.
packaged_instrumentation.journey_run (cognitive 26) mila/native/android/scripts/packaged_instrumentation.py:362— packaged_instrumentation.journey_run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
public_settings.validate (cognitive 26) nix/domains/artifacts/guest/inception/public_settings.py:25— public_settings.validate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 8, loops 2, error handling 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.
verify_runtime.prune_illumos (cognitive 26) nix/domains/artifacts/guest/native_git/verify_runtime.py:114— verify_runtime.prune_illumos has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Deployment.activate (cognitive 26) nix/domains/system/auto-update/runtime.py:922— Deployment.activate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
Deployment.stop_units (cognitive 26) nix/domains/system/auto-update/runtime.py:1051— Deployment.stop_units has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HostCapture.prepare (cognitive 26) nix/domains/system/backups/host.py:166— HostCapture.prepare has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 3, loops 3, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaTerminalController.startReceiving (cognitive 26) mila/native/apple/Sources/MilaNativeUI/MilaTerminal.swift:358— MilaTerminalController.startReceiving has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 6, loops 1 (2 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaTerminalFrame.attributed (cognitive 26) mila/native/apple/Sources/MilaNativeUI/MilaTerminalFrame.swift:50— MilaTerminalFrame.attributed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 3 (9 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
JourneyDescriptor::parse (cognitive 26) mila/native/linux/src/journey.rs:132— JourneyDescriptor::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, 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.
Front.call_traced (cognitive 25) audi/lib/audi/http/front.ex:25— Front.call_traced has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 5 (11 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.
ZFS.vdev (cognitive 25) lilly/lib/lilly/host/zfs.ex:1257— ZFS.vdev has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (10 pts), boolean chains 5 (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.
ZFSDataset.resize (cognitive 25) lilly/lib/lilly/host/zfs_dataset.ex:999— ZFSDataset.resize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, match/switch 2 (3 pts), boolean chains 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.
CheckpointTransfer.pull_memory (cognitive 25) lilly/lib/lilly/transfer/checkpoint_transfer.ex:53— CheckpointTransfer.pull_memory has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ImportCleanup.cleanup_intent (cognitive 25) lilly/lib/lilly/transfer/import_cleanup.ex:18— ImportCleanup.cleanup_intent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (6 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.
ImportCleanup.destroy (cognitive 25) lilly/lib/lilly/transfer/import_cleanup.ex:178— ImportCleanup.destroy has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SourceCleanup.snapshots (cognitive 25) lilly/lib/lilly/transfer/source_cleanup.ex:126— SourceCleanup.snapshots has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Config.new (cognitive 25) lilly/lib/lilly/vm/config.ex:56— Config.new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, boolean chains 5, match/switch 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.
Disk.materialize (cognitive 25) lilly/lib/lilly/vm/disk.ex:296— Disk.materialize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (3 pts) (nesting depth added 11). 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.
Evacuations.advance (cognitive 25) marshall/lib/marshall/compute/evacuations.ex:255— Evacuations.advance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, match/switch 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RelocationReadiness.accept! (cognitive 25) marshall/lib/marshall/compute/relocation_readiness.ex:55— RelocationReadiness.accept! has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, match/switch 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.
Sharing.set (cognitive 25) marshall/lib/marshall/terminal/sharing.ex:34— Sharing.set has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (9 pts), match/switch 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Config.load (cognitive 25) porsche/lib/porsche/config.ex:15— Config.load has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (21 pts), boolean chains 3, match/switch 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.
SSHHostCertificate.parse (cognitive 25) protocol/lib/overalls_protocol/ssh_host_certificate.ex:27— SSHHostCertificate.parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 23, boolean chains 1, match/switch 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.
MilaTerminalFrame.annotated (cognitive 25) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaTerminalFrame.kt:29— MilaTerminalFrame.annotated has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
browser.run_remembered_revocation (cognitive 25) antithesis/workload/access/browser.py:231— browser.run_remembered_revocation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, boolean chains 12. 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.
identity.verify_image_selection (cognitive 25) antithesis/verification/identity.py:889— identity.verify_image_selection has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 5 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PtyTextDecoder::decode (cognitive 25) mila/native/linux/src/terminal_text.rs:43— PtyTextDecoder::decode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (10 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseRunRow (cognitive 25) REDACTED:651— parseRunRow has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 21, ternaries 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Headers.request (cognitive 24) audi/lib/audi/http/headers.ex:14— Headers.request has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, match/switch 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.
Proxy.forward (cognitive 24) audi/lib/audi/http/proxy.ex:105— Proxy.forward has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Store.handle_call (cognitive 24) brady/lib/brady/cache/store.ex:159— Store.handle_call has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Store.read (cognitive 24) lilly/lib/lilly/control/store.ex:103— Store.read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (5 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.
Image.load_cached (cognitive 24) lilly/lib/lilly/host/image.ex:76— Image.load_cached has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (8 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Server.serve_bound (cognitive 24) lilly/lib/lilly/ingress/server.ex:375— Server.serve_bound has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 2 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ReceivedDataset.prepare_native (cognitive 24) lilly/lib/lilly/transfer/received_dataset.ex:213— ReceivedDataset.prepare_native has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 12). 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.
SourceExport.register (cognitive 24) lilly/lib/lilly/transfer/source_export.ex:32— SourceExport.register has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BootLog.read_inode (cognitive 24) lilly/lib/lilly/vm/boot_log.ex:91— BootLog.read_inode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 14). 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.
AttachmentTool.resolve_download_locked (cognitive 24) marshall/lib/marshall/agents/attachment_tool.ex:180— AttachmentTool.resolve_download_locked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 9). 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.
Maintenance.transition_locked! (cognitive 24) marshall/lib/marshall/agents/maintenance.ex:89— Maintenance.transition_locked! has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, match/switch 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.
Tool.file (cognitive 24) marshall/lib/marshall/artifacts/tool.ex:195— Tool.file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (9 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.
Outcomes.apply! (cognitive 24) marshall/lib/marshall/compute/outcomes.ex:198— Outcomes.apply! has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ServiceLevels.ready_at (cognitive 24) marshall/lib/marshall/compute/service_levels.ex:161— ServiceLevels.ready_at has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 20, if/else 3, match/switch 1. 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.
StartupHolds.settle_locked! (cognitive 24) marshall/lib/marshall/compute/startup_holds.ex:15— StartupHolds.settle_locked! has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 19, if/else 4, match/switch 1. 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.
CloneControl.command (cognitive 24) protocol/lib/overalls_protocol/clone_control.ex:29— CloneControl.command has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
NestedStream.response (cognitive 24) protocol/lib/overalls_protocol/nested_stream.ex:56— NestedStream.response has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 4, match/switch 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.
envelope.decode (cognitive 24) antithesis/workload/control/envelope.py:38— envelope.decode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 10, error handling 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.
guest._snapshot (cognitive 24) antithesis/workload/terminal/guest.py:129— guest._snapshot has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, 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.
campaign.modify (cognitive 24) antithesis/verification/campaign.py:490— campaign.modify has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, 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.
cli.main (cognitive 24) nix/domains/artifacts/host/cli.py:829— cli.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 2 (3 pts), loops 2 (3 pts), 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.
runtime.main (cognitive 24) nix/domains/system/auto-update/runtime.py:1446— runtime.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 4 (5 pts), loops 3 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaApprovalDecoder.decode (cognitive 24) mila/native/apple/Sources/MilaNativeUI/MilaApproval.swift:26— MilaApprovalDecoder.decode has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (8 pts), match/switch 2 (3 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Client.open (cognitive 23) audi/lib/audi/relay/client.ex:11— Client.open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Store.handle_call (cognitive 23) brady/lib/brady/cache/store.ex:250— Store.handle_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). 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.
Client.new (cognitive 23) lilly/lib/lilly/control/client.ex:63— Client.new has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 9, match/switch 1. 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.
ZFSDataset.finish_import_cleanup (cognitive 23) lilly/lib/lilly/host/zfs_dataset.ex:64— ZFSDataset.finish_import_cleanup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (4 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.
SourceSnapshotCleanup.authorized (cognitive 23) lilly/lib/lilly/transfer/source_snapshot_cleanup.ex:35— SourceSnapshotCleanup.authorized has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 2 (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.
Boot.continuation (cognitive 23) lilly/lib/lilly/vm/boot.ex:182— Boot.continuation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). 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.
Driver.begin_workspace_source (cognitive 23) lilly/lib/lilly/vm/driver.ex:1519— Driver.begin_workspace_source has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (9 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.
Bootstrap.claim_locked! (cognitive 23) marshall/lib/marshall/agents/bootstrap.ex:21— Bootstrap.claim_locked! has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ThreadDelivery.register (cognitive 23) marshall/lib/marshall/agents/thread_delivery.ex:44— ThreadDelivery.register has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ThreadToolDispatch.claim_candidate (cognitive 23) marshall/lib/marshall/agents/thread_tool_dispatch.ex:37— ThreadToolDispatch.claim_candidate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, match/switch 2 (3 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.
CloneEffects.accept! (cognitive 23) marshall/lib/marshall/compute/clone_effects.ex:86— CloneEffects.accept! has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, match/switch 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.
RestartCapacity.check_source_restoration (cognitive 23) marshall/lib/marshall/compute/restart_capacity.ex:41— RestartCapacity.check_source_restoration has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 21, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
GitHub.stage_refresh (cognitive 23) marshall/lib/marshall/github.ex:946— GitHub.stage_refresh has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, match/switch 2 (nesting depth added 8). 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.
InceptionControl.offer (cognitive 23) protocol/lib/overalls_protocol/inception_control.ex:43— InceptionControl.offer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, match/switch 1 (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.
dispatch._negative (cognitive 23) antithesis/workload/control/dispatch.py:132— dispatch._negative has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 7, ternaries 1 (3 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.
TerminalOracle.create_history (cognitive 23) antithesis/workload/terminal/oracle.py:130— TerminalOracle.create_history has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, 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.
identity.context_record (cognitive 23) antithesis/verification/identity.py:381— identity.context_record has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prepare.prepare_source (cognitive 23) REDACTED:134— prepare.prepare_source has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native_candidate.install (cognitive 23) nix/domains/artifacts/guest/native-kernels/illumos/native_candidate.py:347— native_candidate.install has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5, boolean chains 4, 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.
runtime.main (cognitive 23) nix/domains/system/crash-dumps/runtime.py:20— runtime.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 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.
MilaSignInController.poll (cognitive 23) mila/native/apple/Sources/MilaNativeUI/MilaApproval.swift:163— MilaSignInController.poll has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 3 (6 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mounted::verify (cognitive 23) marshall/assets/js/admin_elevation.js:117— mounted::verify has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 2 (6 pts), boolean chains 4, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mounted (cognitive 23) marshall/assets/js/workspace.js:10— mounted has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 9, ternaries 1. Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 8 function items inside it that branch (key, click, setOpen, …). 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.
preflightDocument (cognitive 23) .agents/skills/security-audit/validate-coverage-ledger.cjs:277— preflightDocument has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaJourneyDescriptor.Parse (cognitive 22) mila/windows-dotnet-smoke/JourneySmoke.cs:37— MilaJourneyDescriptor.Parse has cognitive complexity 22 (threshold 15). 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.
GuestWitness.query_socket (cognitive 22) antithesis/operator/guest_witness.ex:641— GuestWitness.query_socket has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Client.new (cognitive 22) audi/lib/audi/control/client.ex:43— Client.new has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 7, match/switch 1. 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.
WebSocketUpgrade.handshake (cognitive 22) audi/lib/audi/http/web_socket_upgrade.ex:42— WebSocketUpgrade.handshake has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 3, match/switch 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.
Store.handle_call (cognitive 22) brady/lib/brady/cache/store.ex:207— Store.handle_call has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts), match/switch 2 (4 pts) (nesting depth added 4). 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.
Effects.run (cognitive 22) lilly/lib/lilly/clone/effects.ex:221— Effects.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Usage.memory_limit (cognitive 22) lilly/lib/lilly/host/usage.ex:122— Usage.memory_limit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ZFS.policy_shape? (cognitive 22) lilly/lib/lilly/host/zfs.ex:1188— ZFS.policy_shape? has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 18, if/else 2, match/switch 2. 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.
Server.init (cognitive 22) lilly/lib/lilly/ingress/server.ex:17— Server.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
AttributionServer.init (cognitive 22) lilly/lib/lilly/network/attribution_server.ex:11— AttributionServer.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, match/switch 3 (5 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Network.ensure_link (cognitive 22) lilly/lib/lilly/network.ex:342— Network.ensure_link has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Vsock.attach (cognitive 22) lilly/lib/lilly/terminal/vsock.ex:281— Vsock.attach has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ImportCleanup.remove (cognitive 22) lilly/lib/lilly/transfer/import_cleanup.ex:147— ImportCleanup.remove has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (6 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.
SnapshotIndex.pointer (cognitive 22) lilly/lib/lilly/transfer/snapshot_index.ex:114— SnapshotIndex.pointer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 8). 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.
Checkpoint.begin_capture (cognitive 22) lilly/lib/lilly/vm/checkpoint.ex:104— Checkpoint.begin_capture has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Checkpoint.phase_valid? (cognitive 22) lilly/lib/lilly/vm/checkpoint.ex:512— Checkpoint.phase_valid? has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 17, if/else 4 (5 pts) (nesting depth added 1). 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.
Executable.static_x86_64? (cognitive 22) lilly/lib/lilly/vm/executable.ex:9— Executable.static_x86_64? has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WorkloadBundle.materialize (cognitive 22) lilly/lib/lilly/vm/workload_bundle.ex:36— WorkloadBundle.materialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 9). 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.
Context.lock_preparation! (cognitive 22) marshall/lib/marshall/agents/context.ex:289— Context.lock_preparation! has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 17, if/else 5. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Resize.outcome_locked! (cognitive 22) marshall/lib/marshall/compute/resize.ex:305— Resize.outcome_locked! has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 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.
GitHub.restore_marker (cognitive 22) marshall/lib/marshall/github.ex:528— GitHub.restore_marker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (8 pts) (nesting depth added 11). 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.
EditorStream.response (cognitive 22) protocol/lib/overalls_protocol/editor_stream.ex:44— EditorStream.response has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, match/switch 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.
ImageManifest.validate (cognitive 22) protocol/lib/overalls_protocol/image_manifest.ex:143— ImageManifest.validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, match/switch 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.
Spool.persist (cognitive 22) ziggy/lib/ziggy/spool.ex:281— Spool.persist has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (4 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.
witness.parse_witness (cognitive 22) antithesis/workload/guest_lifecycle/witness.py:122— witness.parse_witness has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 9, ternaries 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.
assertions.scan_calls (cognitive 22) antithesis/verification/assertions.py:162— assertions.scan_calls has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), ternaries 2 (5 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.
resources.policy (cognitive 22) nix/domains/system/auto-update/resources.py:66— resources.policy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
resources.compatible (cognitive 22) nix/domains/system/auto-update/resources.py:175— resources.compatible has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, 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.
storage.prepare (cognitive 22) nix/domains/system/brady/storage.py:143— storage.prepare has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Rates.apply (cognitive 22) nix/domains/system/fleet-exporter/metrics.py:556— Rates.apply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
metrics.host_metrics (cognitive 22) nix/domains/system/fleet-exporter/metrics.py:206— metrics.host_metrics has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
overalls.Route (cognitive 22) nix/domains/artifacts/guest/github/transport/transport.go:140— overalls.Route has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Scan::skills (cognitive 22) lyra/src/agent/context.rs:340— Scan::skills has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (5 pts), boolean chains 2, match/switch 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.
ApplicationSession::thread_action (cognitive 22) mila/rust/mila-session/src/threads.rs:12— ApplicationSession::thread_action has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 6, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
validateChecks (cognitive 22) .agents/skills/security-audit/validate-coverage-ledger.cjs:421— validateChecks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 427). 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.
MilaWatchStream.Run (cognitive 21) mila/windows-dotnet/Interop/WatchStream.cs:66— MilaWatchStream.Run has cognitive complexity 21 (threshold 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.
MilaWindowsPushRegistration.RegisterAsync (cognitive 21) mila/windows-dotnet/Interop/WindowsPushRegistration.cs:125— MilaWindowsPushRegistration.RegisterAsync has cognitive complexity 21 (threshold 15). 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.
GuestExecutor.start_or_crash (cognitive 21) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:64— GuestExecutor.start_or_crash has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 10). 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.
Client.grant_response (cognitive 21) audi/lib/audi/control/client.ex:833— Client.grant_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, match/switch 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.
Upstream.send_request (cognitive 21) galileo/lib/galileo/upstream.ex:251— Upstream.send_request has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (7 pts) (nesting depth added 11). 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.
Network.ensure_tap (cognitive 21) lilly/lib/lilly/network.ex:480— Network.ensure_tap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (5 pts), boolean chains 3 (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.
PermitJournal.grant (cognitive 21) lilly/lib/lilly/transfer/permit_journal.ex:107— PermitJournal.grant has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, match/switch 3 (6 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.
ReceivedDataset.owned_staging (cognitive 21) lilly/lib/lilly/transfer/received_dataset.ex:57— ReceivedDataset.owned_staging has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, match/switch 3 (6 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.
Actor.finish (cognitive 21) lilly/lib/lilly/vm/actor.ex:571— Actor.finish has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). 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.
Boot.read (cognitive 21) lilly/lib/lilly/vm/boot.ex:37— Boot.read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 10). 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.
CheckpointStorage.cleanup_observation? (cognitive 21) lilly/lib/lilly/vm/checkpoint_storage.ex:627— CheckpointStorage.cleanup_observation? has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 9, match/switch 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.
DeleteUserMachines.advance (cognitive 21) marshall/lib/marshall/accounts/delete_user_machines.ex:42— DeleteUserMachines.advance has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, match/switch 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.
HostReports.ingest_with_events_locked! (cognitive 21) marshall/lib/marshall/compute/host_reports.ex:132— HostReports.ingest_with_events_locked! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
RelocationCleanup.advance_locked! (cognitive 21) marshall/lib/marshall/compute/relocation_cleanup.ex:29— RelocationCleanup.advance_locked! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 5, match/switch 1 (nesting depth added 9). 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.
CertificateAuthority.pending (cognitive 21) marshall/lib/marshall/ingress/certificate_authority.ex:227— CertificateAuthority.pending has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (6 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.
WebStreams.peer_authority! (cognitive 21) marshall/lib/marshall/ingress/web_streams.ex:306— WebStreams.peer_authority! has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 20, if/else 1. 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.
Config.load (cognitive 21) susan/lib/susan/config.ex:74— Config.load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 3, match/switch 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.
browser.run_stale_admin (cognitive 21) antithesis/workload/access/browser.py:353— browser.run_stale_admin has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 6, ternaries 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.
MailLinks.wait_link (cognitive 21) antithesis/workload/access/mail.py:128— MailLinks.wait_link has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
host_sessions.run_session_successor (cognitive 21) antithesis/workload/control/host_sessions.py:203— host_sessions.run_session_successor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7 (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.
scenarios.run_physical_boot_cycle (cognitive 21) antithesis/workload/guest_lifecycle/scenarios.py:232— scenarios.run_physical_boot_cycle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 3, error handling 2, ternaries 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.
server.image_identity (cognitive 21) antithesis/emulation/guest/server.py:242— server.image_identity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, 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.
smoke.main (cognitive 21) antithesis/emulation/storage/smoke.py:99— smoke.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 8. 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.
identity._archive_members (cognitive 21) antithesis/verification/identity.py:282— identity._archive_members has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
selection.manifest (cognitive 21) antithesis/verification/selection.py:261— selection.manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 2 (4 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.
mila_platform.parse (cognitive 21) buck/mila_platform.py:68— mila_platform.parse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract_freebsd.extract (cognitive 21) nix/domains/artifacts/guest/native_git/extract_freebsd.py:104— extract_freebsd.extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract_freebsd.extract_member (cognitive 21) nix/domains/artifacts/guest/native_git/extract_freebsd.py:156— extract_freebsd.extract_member has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, 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.
transport.wait (cognitive 21) nix/domains/artifacts/guest/nesting-probe/transport.py:86— transport.wait has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaMachineWorkflow.submit (cognitive 21) mila/native/apple/Sources/MilaNativeUI/MilaMachineWorkflow.swift:34— MilaMachineWorkflow.submit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 9, error handling 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MilaMachinesController.load (cognitive 21) mila/native/apple/Sources/MilaNativeUI/MilaMachines.swift:87— MilaMachinesController.load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check-extension.main (cognitive 21) nix/domains/artifacts/vscode-web/check-extension.mts:37— check-extension.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LoopbackTrustListener.ServerName (cognitive 20) mila/windows-dotnet-uia/LoopbackTrustListener.cs:113— LoopbackTrustListener.ServerName has cognitive complexity 20 (threshold 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.
GuestRPC.call (cognitive 20) antithesis/lilly/lib/overalls_antithesis/lilly/guest_rpc.ex:17— GuestRPC.call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
QualityMarker.staged_write (cognitive 20) elixir/request_accounting/lib/overalls/request_accounting/quality_marker.ex:90— QualityMarker.staged_write has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (5 pts) (nesting depth added 9). 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.
Backup.main (cognitive 20) lilly/lib/lilly/backup.ex:13— Backup.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ZFSDataset.parent_claim (cognitive 20) lilly/lib/lilly/host/zfs_dataset.ex:1163— ZFSDataset.parent_claim has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (5 pts) (nesting depth added 9). 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.
Persist.persist (cognitive 20) lilly/lib/lilly/lifecycle/persist.ex:18— Persist.persist has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 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.
Network.refresh_labels (cognitive 20) lilly/lib/lilly/network.ex:78— Network.refresh_labels has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 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.
Network.destroy (cognitive 20) lilly/lib/lilly/network.ex:174— Network.destroy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 pts) (nesting depth added 9). 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.
Server.serve (cognitive 20) lilly/lib/lilly/private/server.ex:175— Server.serve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2, match/switch 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.
Importer.adopt (cognitive 20) lilly/lib/lilly/transfer/importer.ex:23— Importer.adopt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (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.
Key.load (cognitive 20) lilly/lib/lilly/transfer/key.ex:208— Key.load has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 8). 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.
Actor.schedule (cognitive 20) lilly/lib/lilly/vm/actor.ex:423— Actor.schedule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, error handling 1 (4 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CheckpointStorage.verify (cognitive 20) lilly/lib/lilly/vm/checkpoint_storage.ex:316— CheckpointStorage.verify has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, match/switch 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.
CheckpointStorage.cleanup_native (cognitive 20) lilly/lib/lilly/vm/checkpoint_storage.ex:566— CheckpointStorage.cleanup_native has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Disk.materialize_empty (cognitive 20) lilly/lib/lilly/vm/disk.ex:408— Disk.materialize_empty has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 pts) (nesting depth added 9). 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.
Enrollment.verify (cognitive 20) marshall/lib/marshall/compute/enrollment.ex:96— Enrollment.verify has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RelocationReceives.valid_source? (cognitive 20) marshall/lib/marshall/compute/relocation_receives.ex:201— RelocationReceives.valid_source? has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 7, match/switch 1. 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.
GitHub.cleanup_authorization (cognitive 20) marshall/lib/marshall/github.ex:630— GitHub.cleanup_authorization has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Authority.session_for (cognitive 20) marshall/lib/marshall/terminal/authority.ex:307— Authority.session_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 2 (3 pts) (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.
Creation.reserve (cognitive 20) marshall/lib/marshall/terminal/creation.ex:10— Creation.reserve has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Termination.observe_absent (cognitive 20) marshall/lib/marshall/terminal/termination.ex:85— Termination.observe_absent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (nesting depth added 8). 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.
Client.new (cognitive 20) porsche/lib/porsche/client.ex:128— Client.new has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 7, match/switch 1. 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.
Reflection.validate_guest (cognitive 20) protocol/lib/overalls_protocol/reflection.ex:79— Reflection.validate_guest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 4, match/switch 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.
SSHKey.parse (cognitive 20) protocol/lib/overalls_protocol/ssh_key.ex:11— SSHKey.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WebStream.response (cognitive 20) protocol/lib/overalls_protocol/web_stream.ex:50— WebStream.response has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, match/switch 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.
MilaWatchKt.runMilaWatch (cognitive 20) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaWatch.kt:38— MilaWatchKt.runMilaWatch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 3, match/switch 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.
LiveView._collect_events (cognitive 20) antithesis/workload/access/liveview.py:78— LiveView._collect_events has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ControlSession.exchange (cognitive 20) antithesis/workload/control/client.py:166— ControlSession.exchange has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (4 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.
ControlOracle.credential_authority (cognitive 20) antithesis/workload/control/oracle.py:122— ControlOracle.credential_authority has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 pts), boolean chains 3, 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.
scenarios.run_bind_before_effects (cognitive 20) antithesis/workload/control/scenarios.py:109— scenarios.run_bind_before_effects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 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.
scenarios.run_replay (cognitive 20) antithesis/workload/repository/scenarios.py:168— scenarios.run_replay has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, loops 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.
GuestProbe.open (cognitive 20) antithesis/workload/satellite/guest.py:40— GuestProbe.open has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, 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.
mila-tailnet-join.main (cognitive 20) .github/scripts/mila-tailnet-join.py:180— mila-tailnet-join.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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.
bootstrap.activate (cognitive 20) antithesis/emulation/host/bootstrap.py:208— bootstrap.activate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
campaign.main (cognitive 20) antithesis/verification/campaign.py:574— campaign.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
mila_platform.run (cognitive 20) buck/mila_platform.py:136— mila_platform.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3, 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.
publication.collect (cognitive 20) REDACTED:326— publication.collect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 6 (7 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.
native_image.check_installed (cognitive 20) REDACTED:178— native_image.check_installed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, 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.
native_image.check_effective_trust (cognitive 20) REDACTED:233— native_image.check_effective_trust has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
extensions.archive_entries (cognitive 20) REDACTED:283— extensions.archive_entries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extensions.stable_candidates (cognitive 20) REDACTED:537— extensions.stable_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, 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.
lookup.configuration (cognitive 20) nix/domains/system/acme/lookup.py:49— lookup.configuration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, 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.
metrics.pressure (cognitive 20) nix/domains/system/fleet-exporter/metrics.py:166— metrics.pressure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
grid.adjustMediaPadding (cognitive 20) marshall/assets/js/grid.js:68— grid.adjustMediaPadding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). Of this number, 12 points are the body's own statements and 8 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.
prepare-windows.prepare (cognitive 20) nix/domains/artifacts/vscode-web/prepare-windows.mts:17— prepare-windows.prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (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.
GuestExecutor.current_boot (cognitive 19) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:485— GuestExecutor.current_boot has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 9, match/switch 1. 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.
GuestWitness.sanitize (cognitive 19) antithesis/operator/guest_witness.ex:749— GuestWitness.sanitize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 1, match/switch 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.
Probe.check (cognitive 19) audi/lib/audi/tls/probe.ex:14— Probe.check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pressure.validate (cognitive 19) brady/lib/brady/cache/pressure.ex:38— Pressure.validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, match/switch 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.
HTTP.proxy (cognitive 19) galileo/lib/galileo/http.ex:104— HTTP.proxy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, match/switch 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.
ImageTemplate.verify_hashed (cognitive 19) lilly/lib/lilly/host/image_template.ex:292— ImageTemplate.verify_hashed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts) (nesting depth added 11). 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.
PrivateFiles.write (cognitive 19) lilly/lib/lilly/host/private_files.ex:46— PrivateFiles.write has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Propagation.observe (cognitive 19) lilly/lib/lilly/inception/propagation.ex:19— Propagation.observe has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (3 pts), boolean chains 2 (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.
AttributionServer.serve (cognitive 19) lilly/lib/lilly/network/attribution_server.ex:175— AttributionServer.serve has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 5 (8 pts), error handling 2 (nesting depth added 9). 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.
CloneCopy.stage (cognitive 19) lilly/lib/lilly/transfer/clone_copy.ex:214— CloneCopy.stage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 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.
DestinationCleanup.authorized (cognitive 19) lilly/lib/lilly/transfer/destination_cleanup.ex:30— DestinationCleanup.authorized has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 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.
ImportCleanup.cleanup (cognitive 19) lilly/lib/lilly/transfer/import_cleanup.ex:62— ImportCleanup.cleanup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, match/switch 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.
Key.locked (cognitive 19) lilly/lib/lilly/transfer/key.ex:174— Key.locked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (8 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.
CheckpointStorage.audit (cognitive 19) lilly/lib/lilly/vm/checkpoint_storage.ex:673— CheckpointStorage.audit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, match/switch 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.
ModelCalls.claim (cognitive 19) marshall/lib/marshall/agents/model_calls.ex:241— ModelCalls.claim has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 3). 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.
Admission.allocate (cognitive 19) marshall/lib/marshall/compute/admission.ex:153— Admission.allocate has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts), match/switch 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
LifecycleAudit.record! (cognitive 19) marshall/lib/marshall/compute/lifecycle_audit.ex:32— LifecycleAudit.record! has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 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.
RelocationReceives.commands! (cognitive 19) marshall/lib/marshall/compute/relocation_receives.ex:135— RelocationReceives.commands! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, if/else 3 (4 pts) (nesting depth added 1). 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.
Authorizations.current_vm! (cognitive 19) marshall/lib/marshall/galileo/authorizations.ex:190— Authorizations.current_vm! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 17, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Requests.current! (cognitive 19) marshall/lib/marshall/inference/requests.ex:194— Requests.current! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 17, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Coordinator.execute (cognitive 19) marshall/lib/marshall/threads/coordinator.ex:26— Coordinator.execute has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (7 pts), match/switch 2 (3 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Channel.subscribe_watch (cognitive 19) porsche/lib/porsche/ssh/channel.ex:506— Channel.subscribe_watch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (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.
Poke.effect (cognitive 19) susan/lib/susan/poke.ex:126— Poke.effect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts) (nesting depth added 10). 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.
host_sessions.run_credential_rotation (cognitive 19) antithesis/workload/control/host_sessions.py:283— host_sessions.run_credential_rotation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 6. 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.
RotationCoordinator.rotate (cognitive 19) antithesis/workload/control/rotation.py:27— RotationCoordinator.rotate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 4 (7 pts), boolean chains 3, 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.
standin.serve (cognitive 19) antithesis/workload/satellite/standin.py:233— standin.serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila-tailnet-join.read_status (cognitive 19) .github/scripts/mila-tailnet-join.py:92— mila-tailnet-join.read_status has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (3 pts), loops 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runner.status (cognitive 19) antithesis/emulation/recorder/runner.py:241— runner.status has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, error handling 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
bootstrap.setup_mirror (cognitive 19) antithesis/emulation/storage/bootstrap.py:118— bootstrap.setup_mirror has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 1 (2 pts), loops 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.
oracle.nft_counters (cognitive 19) antithesis/emulation/storage/oracle.py:102— oracle.nft_counters 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.
packaged_instrumentation.load_journey (cognitive 19) mila/native/android/scripts/packaged_instrumentation.py:281— packaged_instrumentation.load_journey has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, error handling 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
boot_report.report (cognitive 19) nix/domains/artifacts/guest/boot_report.py:162— boot_report.report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 2, 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.
stage-winget.stage_vs_layout (cognitive 19) nix/domains/artifacts/guest/windows/stage-winget.py:175— stage-winget.stage_vs_layout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3, 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.
cli.metadata (cognitive 19) nix/domains/artifacts/secrets/cli.py:189— cli.metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, error handling 1, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
extensions.validate_artifacts (cognitive 19) REDACTED:380— extensions.validate_artifacts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (3 pts), error handling 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
manage.reconcile (cognitive 19) nix/domains/system/cloudwatch/manage.py:77— manage.reconcile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), error handling 1 (2 pts), 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.
MachineDetailView.body (cognitive 19) mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:353— MachineDetailView.body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 3 (5 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
lilly_export_channel::serve::serve (cognitive 19) lilly/native/export-channel/src/serve.rs:26— lilly_export_channel::serve::serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
Leases::acquire (cognitive 19) lilly/native/hostd/src/leases.rs:173— Leases::acquire has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mila_transport::cert::parse_host_certificate_blob (cognitive 19) mila/rust/mila-transport/src/cert.rs:79— mila_transport::cert::parse_host_certificate_blob has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
artifact_frame.parseRequest (cognitive 19) REDACTED:25— artifact_frame.parseRequest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9 (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.
Pane.writeOutput (cognitive 19) marshall/assets/js/terminals.js:570— Pane.writeOutput has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 585, finished). 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.
attach (cognitive 19) marshall/assets/js/terminals.js:451— attach has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 6, ternaries 1. Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 489, onmessage, a function literal at line 474, …). 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.
renderSessions (cognitive 19) marshall/assets/js/terminals.js:996— renderSessions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, 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.
loadingFinished (cognitive 19) REDACTED:821— loadingFinished has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, ternaries 3, if/else 1. 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.
MilaTerminalFrame.Decode (cognitive 18) mila/windows-dotnet/Interop/TerminalSession.cs:42— MilaTerminalFrame.Decode has cognitive complexity 18 (threshold 15). 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.
MilaWindowsNotificationDevicesController.DecodeListing (cognitive 18) mila/windows-dotnet/Interop/WindowsNotifications.cs:55— MilaWindowsNotificationDevicesController.DecodeListing has cognitive complexity 18 (threshold 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.
JourneySmoke.RunAsync (cognitive 18) mila/windows-dotnet-smoke/JourneySmoke.cs:208— JourneySmoke.RunAsync has cognitive complexity 18 (threshold 15). 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, 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.
Attribution.request (cognitive 18) brady/lib/brady/attribution.ex:16— Attribution.request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Metrics.request (cognitive 18) brady/lib/brady/metrics.ex:21— Metrics.request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 5). 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.
Hello.records (cognitive 18) brady/lib/brady/tls/hello.ex:11— Hello.records has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 6). 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.
Pool.new (cognitive 18) lilly/lib/lilly/host/pool.ex:49— Pool.new has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8, match/switch 1. 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.
ZFSDataset.claim (cognitive 18) lilly/lib/lilly/host/zfs_dataset.ex:1193— ZFSDataset.claim has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts) (nesting depth added 8). 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.
Server.init (cognitive 18) lilly/lib/lilly/private/server.ex:10— Server.init has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CloneCopy.adopt (cognitive 18) lilly/lib/lilly/transfer/clone_copy.ex:87— CloneCopy.adopt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 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.
PermitJournal.authentication (cognitive 18) lilly/lib/lilly/transfer/permit_journal.ex:221— PermitJournal.authentication has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), boolean chains 2 (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.
SourceCleanup.execute (cognitive 18) lilly/lib/lilly/transfer/source_cleanup.ex:23— SourceCleanup.execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
Checkpoint.valid_record? (cognitive 18) lilly/lib/lilly/vm/checkpoint.ex:362— Checkpoint.valid_record? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 18. 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.
CheckpointStorage.mounts_valid? (cognitive 18) lilly/lib/lilly/vm/checkpoint_storage.ex:730— CheckpointStorage.mounts_valid? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 18. 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.
Driver.retire_transfer_destination (cognitive 18) lilly/lib/lilly/vm/driver.ex:316— Driver.retire_transfer_destination has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 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.
Driver.ready_boot (cognitive 18) lilly/lib/lilly/vm/driver.ex:1637— Driver.ready_boot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 2 (3 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.
Executor.start (cognitive 18) lilly/lib/lilly/vm/executor.ex:423— Executor.start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (5 pts) (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.
Journal.read (cognitive 18) lilly/lib/lilly/vm/journal.ex:158— Journal.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 8, match/switch 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.
Provisioning.begin (cognitive 18) lilly/lib/lilly/vm/provisioning.ex:213— Provisioning.begin has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 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.
RelocationRestoration.confirmed? (cognitive 18) marshall/lib/marshall/compute/relocation_restoration.ex:224— RelocationRestoration.confirmed? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 5, match/switch 1. 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.
ServiceLevelPublisher.publish (cognitive 18) marshall/lib/marshall/compute/service_level_publisher.ex:63— ServiceLevelPublisher.publish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, error handling 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Configurations.validated! (cognitive 18) marshall/lib/marshall/galileo/configurations.ex:331— Configurations.validated! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (5 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.
GitHub.revoke_connection (cognitive 18) marshall/lib/marshall/github.ex:591— GitHub.revoke_connection has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (7 pts), boolean chains 2 (nesting depth added 6). 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.
Request.restore (cognitive 18) marshall/lib/marshall/ingress/acme/request.ex:71— Request.restore has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, match/switch 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.
CertificateAuthority.request (cognitive 18) marshall/lib/marshall/ingress/certificate_authority.ex:157— CertificateAuthority.request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WebLogins.perform (cognitive 18) marshall/lib/marshall/ingress/web_logins.ex:123— WebLogins.perform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 3 (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.
HostCertificates.issue! (cognitive 18) marshall/lib/marshall/ssh/host_certificates.ex:33— HostCertificates.issue! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), match/switch 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
MachinesLive.handle_params (cognitive 18) marshall/lib/marshall_web/live/machines_live.ex:59— MachinesLive.handle_params has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
LocaleCatalogCheck.count (cognitive 18) marshall/scripts/check_locale_catalogs.exs:138— LocaleCatalogCheck.count has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 4, match/switch 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.
AgentStream.recognized_pre_output? (cognitive 18) ziggy/lib/ziggy/agent_stream.ex:174— AgentStream.recognized_pre_output? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, match/switch 3 (5 pts), if/else 3 (nesting depth added 2). 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.
SLOCheckpoint.decode (cognitive 18) ziggy/lib/ziggy/slo_checkpoint.ex:52— SLOCheckpoint.decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 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.
domain.operation_view (cognitive 18) antithesis/workload/guest_lifecycle/domain.py:109— domain.operation_view has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7 (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.
scenarios._sample (cognitive 18) antithesis/workload/guest_lifecycle/scenarios.py:84— scenarios._sample has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scenarios.run_create_replay (cognitive 18) antithesis/workload/terminal/scenarios.py:62— scenarios.run_create_replay has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 6, loops 1, ternaries 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.
runner.observe (cognitive 18) antithesis/emulation/guest/runner.py:691— runner.observe has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, ternaries 6, if/else 1. 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.
server.parse_terminal_snapshot (cognitive 18) antithesis/emulation/guest/server.py:951— server.parse_terminal_snapshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (3 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.
monospace_browser_probe.check_thread_views (cognitive 18) marshall/scripts/monospace_browser_probe.py:761— monospace_browser_probe.check_thread_views has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 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.
fetch_sdk.assemble (cognitive 18) REDACTED:240— fetch_sdk.assemble has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (7 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.
native_image.check_symlink (cognitive 18) REDACTED:80— native_image.check_symlink has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalize_nix_db.normalize (cognitive 18) nix/domains/artifacts/guest/ubuntu/normalize_nix_db.py:9— normalize_nix_db.normalize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, 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.
remote.inventory (cognitive 18) nix/domains/artifacts/host/remote.py:165— remote.inventory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check-browser.cleanup_children (cognitive 18) nix/domains/artifacts/vscode-web/check-browser.py:34— check-browser.cleanup_children has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (9 pts), loops 4 (7 pts), if/else 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.
Deployment.run (cognitive 18) nix/domains/system/auto-update/runtime.py:1296— Deployment.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 1 (2 pts), 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.
metrics.zfs_metrics (cognitive 18) nix/domains/system/fleet-exporter/metrics.py:338— metrics.zfs_metrics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pipe::operation (cognitive 18) nix/domains/artifacts/vscode-web-broker/src/windows_pipe.rs:254— Pipe::operation has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 5 (7 pts), loops 1 (2 pts) (nesting depth added 7). 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.
Pane.handleControl (cognitive 18) marshall/assets/js/terminals.js:534— Pane.handleControl 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.
build.build (cognitive 18) marvin/scripts/build.mjs:56— build.build has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), ternaries 3 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
retryOpening (cognitive 18) marshall/assets/js/terminals.js:922— retryOpening has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 927, 926). 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.
sectionReadiness (cognitive 18) REDACTED:908— sectionReadiness has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 3, ternaries 3. Of this number, 14 points are the body's own statements and 4 belong to one function item inside it that branches. 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.
MainWindow.RefreshMachines (cognitive 17) mila/windows-dotnet/MainWindow.xaml.cs:958— MainWindow.RefreshMachines has cognitive complexity 17 (threshold 15). 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.
GuestBoot.decode (cognitive 17) antithesis/lilly/lib/overalls_antithesis/lilly/guest_boot.ex:153— GuestBoot.decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 6, match/switch 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.
GuestExecutor.process_proof (cognitive 17) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:366— GuestExecutor.process_proof has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1, match/switch 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.
GuestExecutor.decode_observation (cognitive 17) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:404— GuestExecutor.decode_observation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 6, match/switch 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.
GuestWitness.write_fault_request (cognitive 17) antithesis/operator/guest_witness.ex:529— GuestWitness.write_fault_request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Config.decode (cognitive 17) audi/lib/audi/config.ex:169— Config.decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 4, match/switch 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.
Snapshot.decode (cognitive 17) audi/lib/audi/dns/snapshot.ex:21— Snapshot.decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ClientHello.records (cognitive 17) audi/lib/audi/inception/client_hello.ex:17— ClientHello.records has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (7 pts) (nesting depth added 6). 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.
Wake.wait (cognitive 17) audi/lib/audi/wake.ex:37— Wake.wait has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Aggregate.validate_duration (cognitive 17) elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:265— Aggregate.validate_duration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 3, match/switch 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.
Runtime.receive_commands (cognitive 17) lilly/lib/lilly/control/runtime.ex:945— Runtime.receive_commands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 6). 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.
ZFS.child_mount_state (cognitive 17) lilly/lib/lilly/host/zfs.ex:429— ZFS.child_mount_state has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, match/switch 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.
ZFS.classify_accounting (cognitive 17) lilly/lib/lilly/host/zfs.ex:761— ZFS.classify_accounting has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, match/switch 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.
ZFS.parse_status (cognitive 17) lilly/lib/lilly/host/zfs.ex:1110— ZFS.parse_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 4, match/switch 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.
ZFSDataset.resize_record (cognitive 17) lilly/lib/lilly/host/zfs_dataset.ex:1064— ZFSDataset.resize_record has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 5). 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.
Journal.write (cognitive 17) lilly/lib/lilly/lifecycle/journal.ex:11— Journal.write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 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.
Network.claim (cognitive 17) lilly/lib/lilly/network.ex:297— Network.claim has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), boolean chains 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.
CloneCopy.durable_copy (cognitive 17) lilly/lib/lilly/transfer/clone_copy.ex:314— CloneCopy.durable_copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (8 pts) (nesting depth added 8). 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.
CloneCopyJournal.read (cognitive 17) lilly/lib/lilly/transfer/clone_copy_journal.ex:166— CloneCopyJournal.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ImportJournal.read (cognitive 17) lilly/lib/lilly/transfer/import_journal.ex:111— ImportJournal.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ReceivedDataset.verify (cognitive 17) lilly/lib/lilly/transfer/received_dataset.ex:251— ReceivedDataset.verify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, match/switch 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.
SnapshotJournal.read (cognitive 17) lilly/lib/lilly/transfer/snapshot_journal.ex:165— SnapshotJournal.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SnapshotOwnership.placement_expectations (cognitive 17) lilly/lib/lilly/transfer/snapshot_ownership.ex:60— SnapshotOwnership.placement_expectations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), boolean chains 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.
SourceSnapshots.cleanup (cognitive 17) lilly/lib/lilly/transfer/source_snapshots.ex:220— SourceSnapshots.cleanup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Actor.handle_call (cognitive 17) lilly/lib/lilly/vm/actor.ex:130— Actor.handle_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 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.
API.parse (cognitive 17) lilly/lib/lilly/vm/api.ex:138— API.parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts) (nesting depth added 8). 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.
Config.resolve_executable (cognitive 17) lilly/lib/lilly/vm/config.ex:172— Config.resolve_executable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 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.
AccountLifecycle.perform (cognitive 17) marshall/lib/marshall/accounts/account_lifecycle.ex:114— AccountLifecycle.perform has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExecutorSession.transition (cognitive 17) marshall/lib/marshall/agents/executor_session.ex:450— ExecutorSession.transition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EnrollmentPreparation.prepare_file (cognitive 17) marshall/lib/marshall/compute/enrollment_preparation.ex:25— EnrollmentPreparation.prepare_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 2 (3 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.
Evacuations.control (cognitive 17) marshall/lib/marshall/compute/evacuations.ex:97— Evacuations.control has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RelocationProbes.accept! (cognitive 17) marshall/lib/marshall/compute/relocation_probes.ex:105— RelocationProbes.accept! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 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.
RelocationSources.accept! (cognitive 17) marshall/lib/marshall/compute/relocation_sources.ex:94— RelocationSources.accept! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, match/switch 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.
EnvironmentPublications.exchange (cognitive 17) marshall/lib/marshall/ingress/environment_publications.ex:27— EnvironmentPublications.exchange has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
PrivateFiles.with_new (cognitive 17) marshall/lib/marshall/operations/private_files.ex:38— PrivateFiles.with_new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (7 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.
Viewer.attach (cognitive 17) marshall/lib/marshall/terminal/viewer.ex:92— Viewer.attach has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InceptionParent.validate (cognitive 17) protocol/lib/overalls_protocol/inception_parent.ex:11— InceptionParent.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 7, match/switch 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.
Catalog.pages (cognitive 17) ziggy/lib/ziggy/catalog.ex:112— Catalog.pages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, match/switch 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.
MilaFfiAdapterKt.parseMilaRoute (cognitive 17) mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:24— MilaFfiAdapterKt.parseMilaRoute has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 6, match/switch 1. 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.
physical_scenario.run_measured_physical_capacity (cognitive 17) antithesis/workload/admission/physical_scenario.py:24— physical_scenario.run_measured_physical_capacity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ComputeLifecycleOperator._result (cognitive 17) antithesis/workload/guest_lifecycle/operation.py:138— ComputeLifecycleOperator._result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, error handling 2 (4 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.
bridge.main (cognitive 17) antithesis/emulation/recorder/bridge.py:369— bridge.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
witness_worker.validate (cognitive 17) antithesis/integration/witness_worker.py:17— witness_worker.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, 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.
rust_parity.compare_bytes (cognitive 17) buck/rust_parity.py:143— rust_parity.compare_bytes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate_catalogs.validate (cognitive 17) mila/localization/generate_catalogs.py:106— generate_catalogs.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
control_worker.process_category (cognitive 17) nix/domains/artifacts/guest/inception/control_worker.py:38— control_worker.process_category has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 8, ternaries 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.
native_image.check_kit (cognitive 17) REDACTED:347— native_image.check_kit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 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.
cli.discover (cognitive 17) nix/domains/artifacts/host/cli.py:484— cli.discover has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4, boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
enrollment.finish_completed_lilly_rebind (cognitive 17) nix/domains/artifacts/host/enrollment.py:294— enrollment.finish_completed_lilly_rebind has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, error handling 1, loops 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.
remote.storage (cognitive 17) nix/domains/artifacts/host/remote.py:271— remote.storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5, boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
HostCapture.release (cognitive 17) nix/domains/system/backups/host.py:125— HostCapture.release has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (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.
collector.write_record (cognitive 17) nix/domains/system/firecracker-logging/collector.py:109— collector.write_record has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (4 pts), ternaries 2 (4 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.
terminal_metrics.decode (cognitive 17) nix/domains/system/fleet-exporter/terminal_metrics.py:35— terminal_metrics.decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
health.settings (cognitive 17) nix/domains/system/logging/health.py:50— health.settings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 3 (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.
mila_runtime::push::parse_utc_timestamp (cognitive 17) mila/rust/mila-runtime/src/push.rs:192— mila_runtime::push::parse_utc_timestamp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. 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.
probe.presentation (cognitive 17) marshall/scripts/localization_browser/probe.ts:8— probe.presentation has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, ternaries 5. Of this number, 11 points are the body's own statements and 6 belong to 5 function literals 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.
t (cognitive 17) marshall/assets/js/localization.js:8— t has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (nesting depth added 8). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
select (cognitive 17) marshall/assets/js/terminals.js:1064— select has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 4). Of this number, 16 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.
getRecentRuns (cognitive 17) REDACTED:1385— getRecentRuns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 15 points are the body's own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
buildQuery (cognitive 17) .agents/skills/antithesis-query-logs/assets/antithesis-query-logs.js:149— buildQuery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (nesting depth added 2). Of this number, 12 points are the body's own statements and 5 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.
readResults (cognitive 17) .agents/skills/antithesis-query-logs/assets/antithesis-query-logs.js:389— readResults has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preflightJsonText::beginValue (cognitive 17) .agents/skills/security-audit/validate-coverage-ledger.cjs:163— preflightJsonText::beginValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
validateReviewedPathOwnership (cognitive 17) .agents/skills/security-audit/validate-coverage-ledger.cjs:453— validateReviewedPathOwnership has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LifecycleSmoke.DeploymentPickerController (cognitive 16) REDACTED:75— LifecycleSmoke.DeploymentPickerController has cognitive 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.
GuestExecutor.start (cognitive 16) antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:106— GuestExecutor.start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, match/switch 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.
GuestWitness.sanitize (cognitive 16) antithesis/operator/guest_witness.ex:773— GuestWitness.sanitize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, match/switch 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.
Config.tls (cognitive 16) audi/lib/audi/config.ex:289— Config.tls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, match/switch 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.
Snapshot.records (cognitive 16) audi/lib/audi/dns/snapshot.ex:58— Snapshot.records has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, match/switch 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.
Front.handle_connection (cognitive 16) audi/lib/audi/inception/front.ex:28— Front.handle_connection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 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.
Front.upload (cognitive 16) audi/lib/audi/private/front.ex:271— Front.upload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts) (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.
Pressure.read (cognitive 16) brady/lib/brady/cache/pressure.ex:7— Pressure.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, match/switch 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.
Connection.https (cognitive 16) brady/lib/brady/connection.ex:76— Connection.https has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 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.
Metrics.handle_info (cognitive 16) brady/lib/brady/metrics.ex:128— Metrics.handle_info has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (7 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.
Config.load (cognitive 16) enrico/lib/enrico/config.ex:20— Config.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, match/switch 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.
Upstream.forward_pulled (cognitive 16) galileo/lib/galileo/upstream.ex:344— Upstream.forward_pulled has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 pts) (nesting depth added 9). 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.
Client.exchange_relocation_probe (cognitive 16) lilly/lib/lilly/control/client.ex:606— Client.exchange_relocation_probe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, match/switch 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.
BackupSnapshot.create (cognitive 16) lilly/lib/lilly/host/backup_snapshot.ex:70— BackupSnapshot.create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, match/switch 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.
ImageTemplate.records (cognitive 16) lilly/lib/lilly/host/image_template.ex:806— ImageTemplate.records has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts) (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.
Limits.read (cognitive 16) lilly/lib/lilly/host/limits.ex:19— Limits.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, match/switch 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.
ZFSDataset.cleanup_claim (cognitive 16) lilly/lib/lilly/host/zfs_dataset.ex:89— ZFSDataset.cleanup_claim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (7 pts) (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.
ZFSDataset.audit_child (cognitive 16) lilly/lib/lilly/host/zfs_dataset.ex:1399— ZFSDataset.audit_child has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BackupHistory.expire (cognitive 16) lilly/lib/lilly/lifecycle/backup_history.ex:59— BackupHistory.expire has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 6 (nesting depth added 5). 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.
Journal.load (cognitive 16) lilly/lib/lilly/lifecycle/journal.ex:49— Journal.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts) (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.
Network.guest_claim (cognitive 16) lilly/lib/lilly/network.ex:519— Network.guest_claim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts) (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.
CheckpointTransfer.finish (cognitive 16) lilly/lib/lilly/transfer/checkpoint_transfer.ex:205— CheckpointTransfer.finish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, match/switch 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.
Key.connection (cognitive 16) lilly/lib/lilly/transfer/key.ex:103— Key.connection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (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.
ReceivedDataset.resume_token (cognitive 16) lilly/lib/lilly/transfer/received_dataset.ex:298— ReceivedDataset.resume_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, match/switch 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.
CheckpointStorage.retire (cognitive 16) lilly/lib/lilly/vm/checkpoint_storage.ex:512— CheckpointStorage.retire has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts) (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.
Driver.retire_transfer_source (cognitive 16) lilly/lib/lilly/vm/driver.ex:158— Driver.retire_transfer_source has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, match/switch 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.
Driver.skip_trust (cognitive 16) lilly/lib/lilly/vm/driver.ex:1148— Driver.skip_trust has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Jail.prepare (cognitive 16) lilly/lib/lilly/vm/jail.ex:30— Jail.prepare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 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.
Context.collect_inventory! (cognitive 16) marshall/lib/marshall/agents/context.ex:367— Context.collect_inventory! has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 7). 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.
ExecutorSession.register (cognitive 16) marshall/lib/marshall/agents/executor_session.ex:60— ExecutorSession.register has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 2 (3 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.
ServerToolJob.finish (cognitive 16) marshall/lib/marshall/agents/server_tool_job.ex:210— ServerToolJob.finish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (6 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Skills.verify_result (cognitive 16) marshall/lib/marshall/agents/skills.ex:522— Skills.verify_result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 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.
Sharing.apply_change! (cognitive 16) marshall/lib/marshall/artifacts/sharing.ex:68— Sharing.apply_change! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Admission.run (cognitive 16) marshall/lib/marshall/compute/admission.ex:44— Admission.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, match/switch 2 (nesting depth added 5). 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.
Drains.close (cognitive 16) marshall/lib/marshall/compute/drains.ex:203— Drains.close has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Lifecycle.resume_for_scim (cognitive 16) marshall/lib/marshall/compute/lifecycle.ex:107— Lifecycle.resume_for_scim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (7 pts), boolean chains 2 (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.
LifecycleHistory.run (cognitive 16) marshall/lib/marshall/compute/lifecycle_history.ex:12— LifecycleHistory.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RelocationCleanup.deletion_confirmed? (cognitive 16) marshall/lib/marshall/compute/relocation_cleanup.ex:112— RelocationCleanup.deletion_confirmed? has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 5, match/switch 1. 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.
RelocationStatus.downtime (cognitive 16) marshall/lib/marshall/compute/relocation_status.ex:107— RelocationStatus.downtime has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
RestartCapacity.physical_capacity (cognitive 16) marshall/lib/marshall/compute/restart_capacity.ex:63— RestartCapacity.physical_capacity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, match/switch 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.
GitHub.validate_refresh (cognitive 16) marshall/lib/marshall/github.ex:994— GitHub.validate_refresh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (3 pts), boolean chains 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.
Credentials.ensure (cognitive 16) marshall/lib/marshall/inference/credentials.ex:60— Credentials.ensure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Requests.authorize_update (cognitive 16) marshall/lib/marshall/inference/requests.ex:76— Requests.authorize_update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 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.
Execution.discover! (cognitive 16) marshall/lib/marshall/ingress/execution.ex:111— Execution.discover! has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 15, if/else 1. 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.
Relays.connection! (cognitive 16) marshall/lib/marshall/ingress/relays.ex:188— Relays.connection! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, match/switch 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent 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.remote (cognitive 16) marshall/lib/marshall/mailer/config.ex:41— Config.remote has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MessageBoards.authorize_post (cognitive 16) marshall/lib/marshall/message_boards.ex:216— MessageBoards.authorize_post has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, match/switch 4 (6 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RuntimeConfig.database (cognitive 16) marshall/lib/marshall/operations/runtime_config.ex:172— RuntimeConfig.database has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, match/switch 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.
MachinesLive.load (cognitive 16) marshall/lib/marshall_web/live/machines_live.ex:562— MachinesLive.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 4). 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.
Pricing.token_cost (cognitive 16) ziggy/lib/ziggy/pricing.ex:30— Pricing.token_cost has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 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.
credential.read_lilly_credential (cognitive 16) antithesis/workload/control/credential.py:20— credential.read_lilly_credential has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, error handling 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.
profile_readiness.repository_origin_ready (cognitive 16) antithesis/workload/core/profile_readiness.py:84— profile_readiness.repository_origin_ready has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, error handling 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.
bridge.dispatch (cognitive 16) antithesis/emulation/recorder/bridge.py:203— bridge.dispatch has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. 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.
authority.issue (cognitive 16) audi/priv/private_pki/authority.py:134— authority.issue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. 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.
mila_windows_dll.check_abi (cognitive 16) buck/mila_windows_dll.py:188— mila_windows_dll.check_abi has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 6 (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.
packaged_instrumentation.run_bounded (cognitive 16) mila/native/android/scripts/packaged_instrumentation.py:133— packaged_instrumentation.run_bounded has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (3 pts), error handling 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.
ingress.public_environment (cognitive 16) nix/domains/artifacts/guest/inception/ingress.py:202— ingress.public_environment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), error handling 2 (4 pts), ternaries 3 (4 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
enrollment.main (cognitive 16) nix/domains/artifacts/host/enrollment.py:539— enrollment.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 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.
cli.reconcile (cognitive 16) nix/domains/artifacts/secrets/cli.py:320— cli.reconcile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 3, loops 3, 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.
Repository.retain (cognitive 16) nix/domains/system/backups/restic.py:256— Repository.retain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
browser_journey.load_fixture (cognitive 16) nix/domains/system/otel-guest/browser_journey.py:299— browser_journey.load_fixture has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, loops 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.
ThreadDetailView.body (cognitive 16) mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift:533— ThreadDetailView.body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lilly_resume_token::lineage::matches (cognitive 16) lilly/native/resume-token/src/lineage.rs:70— lilly_resume_token::lineage::matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AppLock::apply (cognitive 16) mila/rust/mila-runtime/src/lock.rs:82— AppLock::apply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 4). 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.
WatchSession::read_within (cognitive 16) mila/rust/mila-transport/src/watch_channel.rs:322— WatchSession::read_within has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Journal::publish_with_group (cognitive 16) nix/domains/artifacts/underclass/slo.rs:314— Journal::publish_with_group has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
canonicalKey (cognitive 16) REDACTED:160— canonicalKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 2 (4 pts) (nesting depth added 4). None of this is in the body itself: all 16 points belong to 4 function items inside it that branch (encode, append, a function literal at line 184, …). 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.
Near-duplicate member pair (43 shared lines) nix/domains/artifacts/terminald/src/sys/conpty.rs:376— nix/domains/artifacts/terminald/src/sys/conpty.rs:376-525 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:255-410 — These two members are variants of one another: 43 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 (25 shared lines) marshall/lib/marshall/redaction/coordinator.ex:53— marshall/lib/marshall/redaction/coordinator.ex:53-144 | marshall/lib/marshall/redaction/coordinator.ex:148-191 — These two members are variants of one another: 25 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Members sharing a duplicated core (13 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (13 members, 50+ identical tokens) lilly/lib/lilly/control/client.ex:136— lilly/lib/lilly/control/client.ex:136-163 | lilly/lib/lilly/control/client.ex:263-291 | lilly/lib/lilly/control/client.ex:313-341 | lilly/lib/lilly/control/client.ex:363-391 | lilly/lib/lilly/control/client.ex:413-441 | lilly/lib/lilly/control/client.ex:463-491 | lilly/lib/lilly/control/client.ex:511-539 | lilly/lib/lilly/control/client.ex:559-587 | lilly/lib/lilly/control/client.ex:607-643 | lilly/lib/lilly/control/client.ex:667-695 | lilly/lib/lilly/control/client.ex:715-743 | lilly/lib/lilly/control/client.ex:765-793 | lilly/lib/lilly/control/client.ex:815-843 — These 13 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 13 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 13 times.
D4 · Code Duplication· Members sharing a duplicated core (12 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (12 members, 50+ identical tokens) protocol/lib/overalls_protocol/relocation_cleanup.ex:102— protocol/lib/overalls_protocol/relocation_cleanup.ex:102-116 | protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:84-98 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:96-110 | protocol/lib/overalls_protocol/relocation_import.ex:38-52 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:95-109 | protocol/lib/overalls_protocol/relocation_keys.ex:104-118 | protocol/lib/overalls_protocol/relocation_readiness.ex:107-121 | protocol/lib/overalls_protocol/relocation_receive.ex:96-110 | protocol/lib/overalls_protocol/relocation_revocation.ex:95-109 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:98-112 | protocol/lib/overalls_protocol/relocation_source.ex:115-129 | protocol/lib/overalls_protocol/terminal.ex:690-704 — These 12 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 12 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 12 times.
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (7 members, 50+ identical tokens) mila/rust/mila-ffi/src/android/session_bridge.rs:159— mila/rust/mila-ffi/src/android/session_bridge.rs:159-185 | mila/rust/mila-ffi/src/android/session_bridge.rs:197-220 | mila/rust/mila-ffi/src/android/session_bridge.rs:237-263 | mila/rust/mila-ffi/src/android/session_bridge.rs:279-316 | mila/rust/mila-ffi/src/android/session_bridge.rs:474-503 | mila/rust/mila-ffi/src/android/session_bridge.rs:696-715 | mila/rust/mila-ffi/src/android/session_bridge.rs:748-768 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
D4 · Code Duplication· Edited copy of a member (43 corresponding lines) · ×1
Edited copy of a member (43 corresponding lines) nix/domains/artifacts/guest/native-promotion/test_verify.exs:392— nix/domains/artifacts/guest/native-promotion/test_verify.exs:392-434 | nix/domains/artifacts/guest/native-promotion/verify.ex:185-233 — These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 54+ corresponding lines) · ×1
Edited copies of one member (3 members, 54+ corresponding lines) lilly/lib/lilly/ingress/server.ex:18— lilly/lib/lilly/ingress/server.ex:18-84 | lilly/lib/lilly/network/attribution_server.ex:12-67 | lilly/lib/lilly/private/server.ex:11-64 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (64 corresponding lines) · ×1
Edited copy of a member (64 corresponding lines) antithesis/workload/control/rotation.py:28— antithesis/workload/control/rotation.py:28-96 | antithesis/workload/repository/restart.py:27-90 — These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (57 corresponding lines) · ×1
Edited copy of a member (57 corresponding lines) nix/domains/system/fleet-exporter/runtime.py:295— nix/domains/system/fleet-exporter/runtime.py:295-355 | nix/domains/system/fleet-exporter/runtime.py:359-415 — These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 57+ corresponding lines) · ×1
Edited copies of one member (5 members, 57+ corresponding lines) audi/scripts/invalid_boot_probe.exs:17— audi/scripts/invalid_boot_probe.exs:17-73 | enrico/scripts/invalid_boot_probe.exs:11-73 | galileo/scripts/invalid_boot_probe.exs:11-74 | porsche/scripts/invalid_boot_probe.exs:25-90 | ziggy/scripts/invalid_boot_probe.exs:11-75 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 57 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (62 corresponding lines) · ×1
Edited copy of a member (62 corresponding lines) lilly/lib/lilly/vm/executor.ex:424— lilly/lib/lilly/vm/executor.ex:424-490 | lilly/lib/lilly/vm/executor.ex:494-555 — These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (50 corresponding lines) · ×1
Edited copy of a member (50 corresponding lines) antithesis/workload/admission/client.py:241— antithesis/workload/admission/client.py:241-290 | antithesis/workload/admission/client.py:294-351 — These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 52+ corresponding lines) · ×1
Edited copies of one member (3 members, 52+ corresponding lines) mila/rust/mila-ffi/src/session.rs:605— mila/rust/mila-ffi/src/session.rs:605-665 | mila/rust/mila-ffi/src/session.rs:942-993 | mila/rust/mila-ffi/src/session.rs:1018-1073 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 52 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (42 corresponding lines) · ×1
Edited copy of a member (42 corresponding lines) marshall/lib/marshall/access/sharing.ex:52— marshall/lib/marshall/access/sharing.ex:52-93 | marshall/lib/marshall/threads/sharing.ex:49-90 — These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (47 corresponding lines) · ×1
Edited copy of a member (47 corresponding lines) antithesis/workload/repository/operator.py:17— antithesis/workload/repository/operator.py:17-63 | antithesis/workload/satellite/operator.py:36-82 — These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (33 corresponding lines) · ×1
Edited copy of a member (33 corresponding lines) lyra/src/bin/overalls-host-certificate-windows.rs:63— lyra/src/bin/overalls-host-certificate-windows.rs:63-104 | lyra/src/bin/overalls-host-certificate.rs:58-90 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (39 corresponding lines) · ×1
Edited copy of a member (39 corresponding lines) marshall/lib/marshall/compute/relocation_cancellation.ex:13— marshall/lib/marshall/compute/relocation_cancellation.ex:13-60 | marshall/lib/marshall/compute/relocation_retry_admission.ex:20-58 — These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 19+ corresponding lines) · ×1
Edited copies of one member (3 members, 19+ corresponding lines) antithesis/emulation/host/runner.py:94— antithesis/emulation/host/runner.py:94-112 | antithesis/emulation/recorder/runner.py:67-89 | antithesis/emulation/storage/runner.py:82-100 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (38 corresponding lines) · ×1
Edited copy of a member (38 corresponding lines) antithesis/emulation/host/runner.py:116— antithesis/emulation/host/runner.py:116-153 | antithesis/emulation/storage/runner.py:111-154 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 38+ corresponding lines) · ×1
Edited copies of one member (4 members, 38+ corresponding lines) protocol/lib/overalls_protocol/image_manifest.ex:224— protocol/lib/overalls_protocol/image_manifest.ex:224-261 | protocol/lib/overalls_protocol/image_manifest.ex:286-325 | protocol/lib/overalls_protocol/image_manifest.ex:498-537 | protocol/lib/overalls_protocol/image_manifest.ex:557-596 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 38 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 33+ corresponding lines) · ×1
Edited copies of one member (4 members, 33+ corresponding lines) marshall/lib/marshall/compute/credentials.ex:30— marshall/lib/marshall/compute/credentials.ex:30-69 | marshall/lib/marshall/galileo/credentials.ex:14-46 | marshall/lib/marshall/inference/credentials.ex:15-47 | marshall/lib/marshall/peach/credentials.ex:14-46 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (29 corresponding lines) · ×1
Edited copy of a member (29 corresponding lines) marshall/lib/marshall/galileo/configurations.ex:12— marshall/lib/marshall/galileo/configurations.ex:12-46 | marshall/lib/marshall/teams/coordinator.ex:31-59 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 22+ corresponding lines) · ×1
Edited copies of one member (3 members, 22+ corresponding lines) marshall/lib/marshall/ssh/host_certificate_retention.ex:16— marshall/lib/marshall/ssh/host_certificate_retention.ex:16-41 | marshall/lib/marshall/ssh/retention.ex:16-42 | marshall/lib/marshall/terminal/ticket_retention.ex:20-41 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 14+ corresponding lines) · ×1
Edited copies of one member (3 members, 14+ corresponding lines) mila/windows-dotnet/Interop/RustNative.cs:356— mila/windows-dotnet/Interop/RustNative.cs:356-379 | mila/windows-dotnet/Interop/RustNative.cs:388-406 | mila/windows-dotnet/Interop/RustNative.cs:760-773 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 15+ corresponding lines) · ×1
Edited copies of one member (4 members, 15+ corresponding lines) mila/rust/mila-ffi/src/session.rs:765— mila/rust/mila-ffi/src/session.rs:765-785 | mila/rust/mila-ffi/src/session.rs:799-819 | mila/rust/mila-ffi/src/session.rs:832-852 | mila/rust/mila-ffi/src/session.rs:1249-1263 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 10+ corresponding lines) · ×1
Edited copies of one member (4 members, 10+ corresponding lines) marshall/lib/marshall/operations/executor_bootstrap.ex:44— marshall/lib/marshall/operations/executor_bootstrap.ex:44-53 | marshall/lib/marshall/operations/git_hub_tools.ex:44-53 | ziggy/lib/ziggy/bootstrap_release.ex:13-23 | ziggy/lib/ziggy/tool_release.ex:14-24 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 13+ corresponding lines) · ×1
Edited copies of one member (5 members, 13+ corresponding lines) antithesis/workload/admission/oracle.py:68— antithesis/workload/admission/oracle.py:68-84 | antithesis/workload/control/oracle.py:45-57 | antithesis/workload/control/oracle.py:60-79 | antithesis/workload/control/oracle.py:156-171 | antithesis/workload/terminal/oracle.py:80-97 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 9+ corresponding lines) · ×1
Edited copies of one member (5 members, 9+ corresponding lines) mila/native/linux/src/connection_profile.rs:62— mila/native/linux/src/connection_profile.rs:62-70 | mila/native/linux/src/deployments.rs:233-241 | mila/native/linux/src/device_key.rs:38-46 | mila/native/linux/src/notifications.rs:42-50 | mila/native/linux/src/persistence.rs:126-134 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 10+ corresponding lines) · ×1
Edited copies of one member (5 members, 10+ corresponding lines) antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex:27— antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex:27-36 | lilly/lib/lilly/host/counters.ex:32-41 | lilly/lib/lilly/host/mount_table.ex:40-55 | marshall/lib/marshall/compute/enrollment_request.ex:68-77 | protocol/lib/overalls_protocol/integration.ex:267-276 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 8+ corresponding lines) · ×1
Edited copies of one member (4 members, 8+ corresponding lines) audi/lib/audi/http/editor_assets.ex:22— audi/lib/audi/http/editor_assets.ex:22-33 | galileo/lib/galileo/github/lfs.ex:66-73 | marshall/lib/marshall/editor/releases.ex:21-29 | protocol/lib/overalls_protocol/terminal.ex:638-645 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 12+ corresponding lines) · ×1
Edited copies of one member (4 members, 12+ corresponding lines) antithesis/emulation/storage/runner.py:67— antithesis/emulation/storage/runner.py:67-78 | scripts/egress_acceptance.py:113-124 | scripts/galileo_acceptance.py:75-86 | scripts/porsche_acceptance.py:276-288 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 10+ corresponding lines) · ×1
Edited copies of one member (6 members, 10+ corresponding lines) lilly/lib/lilly/control/runtime.ex:1387— lilly/lib/lilly/control/runtime.ex:1387-1401 | lilly/lib/lilly/control/runtime.ex:1447-1456 | lilly/lib/lilly/control/runtime.ex:1480-1490 | lilly/lib/lilly/control/runtime.ex:1514-1524 | lilly/lib/lilly/control/runtime.ex:1548-1559 | lilly/lib/lilly/control/runtime.ex:1583-1595 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 3+ corresponding lines) · ×1
Edited copies of one member (5 members, 3+ corresponding lines) marshall/lib/marshall/ingress/acme/propagation.ex:151— marshall/lib/marshall/ingress/acme/propagation.ex:151-157 | protocol/lib/overalls_protocol/fleet_certificate.ex:97-100 | protocol/lib/overalls_protocol/inception_name.ex:132-135 | protocol/lib/overalls_protocol/inception_public.ex:60-62 | protocol/lib/overalls_protocol/transfer_ssh.ex:52-56 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 12+ corresponding lines) · ×1
Edited copies of one member (5 members, 12+ corresponding lines) audi/lib/audi/control/link.ex:16— audi/lib/audi/control/link.ex:16-28 | lilly/lib/lilly/control/link.ex:15-28 | peach/lib/peach/control.ex:33-44 | porsche/lib/porsche/control/link.ex:16-28 | ziggy/lib/ziggy/control/link.ex:16-28 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 4+ corresponding lines) · ×1
Edited copies of one member (6 members, 4+ corresponding lines) protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:43— protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:43-46 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:62-65 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:61-64 | protocol/lib/overalls_protocol/relocation_keys.ex:70-73 | protocol/lib/overalls_protocol/relocation_revocation.ex:61-64 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:64-67 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 3+ corresponding lines) · ×1
Edited copies of one member (6 members, 3+ corresponding lines) marshall/scripts/localization_browser/run.py:61— marshall/scripts/localization_browser/run.py:61-63 | nix/domains/artifacts/guest/omnios/check_assembly.py:79-81 | scripts/egress_acceptance.py:34-36 | scripts/galileo_acceptance.py:28-30 | scripts/porsche_acceptance.py:60-62 | scripts/provisioning_benchmark.py:236-239 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 2+ corresponding lines) · ×1
Edited copies of one member (5 members, 2+ corresponding lines) lilly/lib/lilly/control/runtime.ex:460— lilly/lib/lilly/control/runtime.ex:460-461 | lilly/lib/lilly/ingress/server.ex:110-111 | lilly/lib/lilly/network/attribution_server.ex:93-94 | lilly/lib/lilly/private/server.ex:93-94 | lilly/lib/lilly/vm/actor.ex:239-240 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 3+ corresponding lines) · ×1
Edited copies of one member (4 members, 3+ corresponding lines) marshall/lib/marshall/editor/authority.ex:491— marshall/lib/marshall/editor/authority.ex:491-495 | marshall/lib/marshall/ingress/environment_streams.ex:130-132 | marshall/lib/marshall/ingress/sessions.ex:253-255 | marshall/lib/marshall/ingress/web_streams.ex:276-278 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 3+ corresponding lines) · ×1
Edited copies of one member (3 members, 3+ corresponding lines) lilly/lib/lilly/transfer/probe_request.ex:11— lilly/lib/lilly/transfer/probe_request.ex:11-13 | lilly/lib/lilly/vm/disk.ex:384-386 | protocol/lib/overalls_protocol/github.ex:245-247 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (7 members, 2+ corresponding lines) · ×1
Edited copies of one member (7 members, 2+ corresponding lines) audi/lib/audi/dns/server.ex:126— audi/lib/audi/dns/server.ex:126-127 | audi/lib/audi/relay/server.ex:89-90 | audi/lib/audi/tls/readiness.ex:105-106 | brady/lib/brady/listener.ex:81-82 | lilly/lib/lilly/inception/runtime.ex:89-90 | lilly/lib/lilly/network/attribution_server.ex:120-121 | lilly/lib/lilly/private/server.ex:120-121 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
Duplicated block (55 lines × 2) marshall/lib/marshall/compute/relocation_receives.ex:31— marshall/lib/marshall/compute/relocation_receives.ex:31-85 | marshall/lib/marshall/compute/relocation_sources.ex:30-84 — 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 (40 lines × 2) lilly/lib/lilly/vm/executor.ex:451— lilly/lib/lilly/vm/executor.ex:451-490 | lilly/lib/lilly/vm/executor.ex:516-555 — 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 (36 lines × 2) marshall/lib/marshall/ingress/services.ex:34— marshall/lib/marshall/ingress/services.ex:34-69 | marshall/lib/marshall/ingress/services.ex:81-116 — 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 × 2) audi/lib/audi/http/browser.ex:55— audi/lib/audi/http/browser.ex:55-87 | audi/lib/audi/http/editor_browser.ex:55-87 — before extracting anything, compare `audi/lib/audi/http/browser.ex` and `audi/lib/audi/http/editor_browser.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 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 (29 lines × 3) marshall/lib/marshall/galileo/credentials.ex:18— marshall/lib/marshall/galileo/credentials.ex:18-46 | marshall/lib/marshall/inference/credentials.ex:19-47 | marshall/lib/marshall/peach/credentials.ex:18-46 — `marshall/lib/marshall/galileo/credentials.ex` and `marshall/lib/marshall/peach/credentials.ex` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/galileo/credentials.ex:18` 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 (26–27 lines × 2) marshall/lib/marshall/galileo/authorizations.ex:201— marshall/lib/marshall/galileo/authorizations.ex:201-227 | marshall/lib/marshall/inference/requests.ex:206-231 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/galileo/authorizations.ex:201` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24–25 lines × 3) enrico/scripts/invalid_boot_probe.exs:24— enrico/scripts/invalid_boot_probe.exs:24-47 | galileo/scripts/invalid_boot_probe.exs:24-48 | ziggy/scripts/invalid_boot_probe.exs:25-48 — before extracting anything, compare `enrico/scripts/invalid_boot_probe.exs` and `galileo/scripts/invalid_boot_probe.exs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `galileo/scripts/invalid_boot_probe.exs:24` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (24–25 lines × 2) marshall/lib/marshall_web/controllers/audi_login_controller.ex:21— marshall/lib/marshall_web/controllers/audi_login_controller.ex:21-45 | marshall/lib/marshall_web/controllers/editor_controller.ex:46-69 — 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 `marshall/lib/marshall_web/controllers/audi_login_controller.ex:21` 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 (22–23 lines × 3) brady/scripts/invalid_boot_probe.exs:45— brady/scripts/invalid_boot_probe.exs:45-66 | porsche/scripts/host_certificate_boot_probe.exs:53-75 | porsche/scripts/invalid_boot_probe.exs:44-66 — before extracting anything, compare `porsche/scripts/host_certificate_boot_probe.exs` and `porsche/scripts/invalid_boot_probe.exs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 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 `porsche/scripts/host_certificate_boot_probe.exs:53` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (22 lines × 4) audi/lib/audi/relay/server.ex:107— audi/lib/audi/relay/server.ex:107-128 | lilly/lib/lilly/ingress/server.ex:323-344 | lilly/lib/lilly/network/attribution_server.ex:151-172 | lilly/lib/lilly/private/server.ex:151-172 — before extracting anything, compare `lilly/lib/lilly/ingress/server.ex` and `lilly/lib/lilly/network/attribution_server.ex` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/relay/server.ex:107` 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 (22 lines × 2) audi/lib/audi/http/browser.ex:22— audi/lib/audi/http/browser.ex:22-43 | audi/lib/audi/http/editor_browser.ex:22-43 — before extracting anything, compare `audi/lib/audi/http/browser.ex` and `audi/lib/audi/http/editor_browser.ex` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 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 (20–21 lines × 2) mila/windows-dotnet/MainWindow.xaml.cs:424— mila/windows-dotnet/MainWindow.xaml.cs:424-444 | mila/windows-dotnet/MainWindow.xaml.cs:482-501 — 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 `mila/windows-dotnet/MainWindow.xaml.cs:424` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `mila/windows-dotnet/MainWindow.xaml.cs:445` calls `BindWebNavigationFence` and `mila/windows-dotnet/MainWindow.xaml.cs:502` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17–19 lines × 2) lilly/lib/lilly/control/runtime.ex:875— lilly/lib/lilly/control/runtime.ex:875-891 | lilly/lib/lilly/control/runtime.ex:1034-1052 — 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 `lilly/lib/lilly/control/runtime.ex:1034` 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–19 lines × 2) marshall/lib/marshall_web/live/admin/users_live.ex:37— marshall/lib/marshall_web/live/admin/users_live.ex:37-55 | marshall/lib/marshall_web/live/admin/users_live.ex:64-78 — 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 `marshall/lib/marshall_web/live/admin/users_live.ex:37` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18–19 lines × 2) nix/domains/artifacts/guest/native-promotion/test_verify.exs:403— nix/domains/artifacts/guest/native-promotion/test_verify.exs:403-420 | nix/domains/artifacts/guest/native-promotion/verify.ex:201-219 — 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 `nix/domains/artifacts/guest/native-promotion/test_verify.exs:403` 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–18 lines × 3) marshall/lib/marshall_web/browser_messages.ex:44— marshall/lib/marshall_web/browser_messages.ex:44-61 | marshall/lib/marshall_web/browser_messages.ex:64-72 | marshall/lib/marshall_web/browser_messages.ex:79-85 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall_web/browser_messages.ex:44` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16–18 lines × 2) marshall/lib/marshall/ingress/web_streams.ex:47— marshall/lib/marshall/ingress/web_streams.ex:47-64 | marshall/lib/marshall/ingress/web_streams.ex:128-143 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11–17 lines × 2) marshall/lib/marshall_web/live/threads_live.ex:415— marshall/lib/marshall_web/live/threads_live.ex:415-431 | marshall/lib/marshall_web/live/threads_live.ex:436-446 — 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 `marshall/lib/marshall_web/live/threads_live.ex:415` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15–16 lines × 12) lilly/lib/lilly/control/client.ex:270— lilly/lib/lilly/control/client.ex:270-284 | lilly/lib/lilly/control/client.ex:320-334 | lilly/lib/lilly/control/client.ex:370-384 | lilly/lib/lilly/control/client.ex:420-434 | lilly/lib/lilly/control/client.ex:470-484 | lilly/lib/lilly/control/client.ex:518-532 | lilly/lib/lilly/control/client.ex:566-580 | lilly/lib/lilly/control/client.ex:614-629 | lilly/lib/lilly/control/client.ex:674-688 | lilly/lib/lilly/control/client.ex:722-736 | lilly/lib/lilly/control/client.ex:772-786 | lilly/lib/lilly/control/client.ex:822-836 — all 12 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 `lilly/lib/lilly/control/client.ex:270` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8–16 lines × 4) marshall/lib/marshall_web/live/admin/access_live.ex:25— marshall/lib/marshall_web/live/admin/access_live.ex:25-32 | marshall/lib/marshall_web/live/admin/access_live.ex:37-44 | marshall/lib/marshall_web/live/admin/access_live.ex:49-56 | marshall/lib/marshall_web/live/admin/workloads_live.ex:46-61 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall_web/live/admin/workloads_live.ex:46` 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–16 lines × 3) enrico/scripts/invalid_boot_probe.exs:97— enrico/scripts/invalid_boot_probe.exs:97-109 | galileo/scripts/invalid_boot_probe.exs:98-110 | ziggy/scripts/invalid_boot_probe.exs:93-108 — before extracting anything, compare `enrico/scripts/invalid_boot_probe.exs` and `galileo/scripts/invalid_boot_probe.exs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ziggy/scripts/invalid_boot_probe.exs:93` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20 lines × 3) audi/lib/audi/status_server.ex:105— audi/lib/audi/status_server.ex:105-124 | lilly/lib/lilly/control/status_server.ex:98-117 | porsche/lib/porsche/status_server.ex:67-86 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/status_server.ex:105` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–15 lines × 2) audi/lib/audi/ssh/listener.ex:69— audi/lib/audi/ssh/listener.ex:69-83 | porsche/lib/porsche/listener.ex:84-97 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/ssh/listener.ex:69` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12–15 lines × 2) marshall/lib/marshall_web/live/machines_live.ex:361— marshall/lib/marshall_web/live/machines_live.ex:361-372 | marshall/lib/marshall_web/live/machines_live.ex:390-404 — 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 `marshall/lib/marshall_web/live/machines_live.ex:361` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marshall/lib/marshall_web/live/machines_live.ex:389` calls `assign`, `generate` and `marshall/lib/marshall_web/live/machines_live.ex:360` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (14 lines × 4) protocol/lib/overalls_protocol/relocation_destination_revocation.ex:35— protocol/lib/overalls_protocol/relocation_destination_revocation.ex:35-48 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:34-47 | protocol/lib/overalls_protocol/relocation_revocation.ex:34-47 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:37-50 — before extracting anything, compare `protocol/lib/overalls_protocol/relocation_destination_revocation.ex` and `protocol/lib/overalls_protocol/relocation_key_retirement.ex` as WHOLE FILES: 93% 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9–14 lines × 2) marshall/lib/marshall_web/live/machines_live.ex:268— marshall/lib/marshall_web/live/machines_live.ex:268-276 | marshall/lib/marshall_web/live/machines_live.ex:356-369 — 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 `marshall/lib/marshall_web/live/machines_live.ex: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 (13 lines × 7) marshall/lib/marshall/compute/relocation_destination_cleanups.ex:37— marshall/lib/marshall/compute/relocation_destination_cleanups.ex:37-49 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:31-43 | marshall/lib/marshall/compute/relocation_imports.ex:41-53 | marshall/lib/marshall/compute/relocation_key_retirement.ex:29-41 | marshall/lib/marshall/compute/relocation_readiness.ex:40-52 | marshall/lib/marshall/compute/relocation_revocations.ex:31-43 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:32-44 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_destination_cleanups.ex` and `marshall/lib/marshall/compute/relocation_destination_revocations.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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 `marshall/lib/marshall/compute/relocation_destination_cleanups.ex:37` 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) audi/lib/audi/tls/fleet_material.ex:49— audi/lib/audi/tls/fleet_material.ex:49-73 | marshall/lib/marshall/ingress/acme/material.ex:49-73 — before extracting anything, compare `audi/lib/audi/tls/fleet_material.ex` and `marshall/lib/marshall/ingress/acme/material.ex` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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–13 lines × 2) lilly/lib/lilly/transfer/checkpoint_transfer.ex:403— lilly/lib/lilly/transfer/checkpoint_transfer.ex:403-413 | lilly/lib/lilly/transfer/receiver.ex:140-152 — 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 `lilly/lib/lilly/transfer/checkpoint_transfer.ex:403` 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–13 lines × 2) marshall/lib/marshall_web/live/account_live.ex:186— marshall/lib/marshall_web/live/account_live.ex:186-198 | marshall/lib/marshall_web/live/account_live.ex:203-212 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–12 lines × 3) marshall/lib/marshall_web/live/integrations_live.ex:70— marshall/lib/marshall_web/live/integrations_live.ex:70-79 | marshall/lib/marshall_web/live/integrations_live.ex:84-95 | marshall/lib/marshall_web/live/integrations_live.ex:100-111 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall_web/live/integrations_live.ex:84` 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–12 lines × 2) mila/windows-dotnet/Interop/ThreadListing.cs:99— mila/windows-dotnet/Interop/ThreadListing.cs:99-110 | mila/windows-dotnet/Interop/ThreadListing.cs:135-143 — 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 `mila/windows-dotnet/Interop/ThreadListing.cs:135` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11 lines × 13) lilly/lib/lilly/control/client.ex:144— lilly/lib/lilly/control/client.ex:144-154 | lilly/lib/lilly/control/client.ex:273-283 | lilly/lib/lilly/control/client.ex:323-333 | lilly/lib/lilly/control/client.ex:373-383 | lilly/lib/lilly/control/client.ex:423-433 | lilly/lib/lilly/control/client.ex:473-483 | lilly/lib/lilly/control/client.ex:521-531 | lilly/lib/lilly/control/client.ex:569-579 | lilly/lib/lilly/control/client.ex:617-627 | lilly/lib/lilly/control/client.ex:677-687 | lilly/lib/lilly/control/client.ex:725-735 | lilly/lib/lilly/control/client.ex:775-785 | lilly/lib/lilly/control/client.ex:825-835 — all 13 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 (11 lines × 12) protocol/lib/overalls_protocol/relocation_cleanup.ex:106— protocol/lib/overalls_protocol/relocation_cleanup.ex:106-116 | protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:88-98 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:100-110 | protocol/lib/overalls_protocol/relocation_import.ex:42-52 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:99-109 | protocol/lib/overalls_protocol/relocation_keys.ex:108-118 | protocol/lib/overalls_protocol/relocation_readiness.ex:111-121 | protocol/lib/overalls_protocol/relocation_receive.ex:100-110 | protocol/lib/overalls_protocol/relocation_revocation.ex:99-109 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:102-112 | protocol/lib/overalls_protocol/relocation_source.ex:119-129 | protocol/lib/overalls_protocol/terminal.ex:694-704 — before extracting anything, compare `protocol/lib/overalls_protocol/relocation_destination_revocation.ex` and `protocol/lib/overalls_protocol/relocation_key_retirement.ex` as WHOLE FILES: 93% 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. 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 `protocol/lib/overalls_protocol/relocation_cleanup.ex:106` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7–11 lines × 3) marshall/lib/marshall_web/browser_messages.ex:21— marshall/lib/marshall_web/browser_messages.ex:21-28 | marshall/lib/marshall_web/browser_messages.ex:65-75 | marshall/lib/marshall_web/browser_messages.ex:80-86 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall_web/browser_messages.ex:65` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marshall/lib/marshall_web/browser_messages.ex:29` calls `dgettext` and `marshall/lib/marshall_web/browser_messages.ex:86` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 2) marshall/lib/marshall/agents/thread_delivery.ex:53— marshall/lib/marshall/agents/thread_delivery.ex:53-63 | marshall/lib/marshall/agents/thread_delivery.ex:91-100 — 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 `marshall/lib/marshall/agents/thread_delivery.ex:53` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9–10 lines × 4) marshall/lib/marshall/redaction/coordinator.ex:53— marshall/lib/marshall/redaction/coordinator.ex:53-62 | marshall/lib/marshall/redaction/coordinator.ex:70-78 | marshall/lib/marshall/redaction/coordinator.ex:148-156 | marshall/lib/marshall/redaction/coordinator.ex:163-171 — 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 `marshall/lib/marshall/redaction/coordinator.ex:53` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8–9 lines × 7) marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25— marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25-32 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:18-26 | marshall/lib/marshall/compute/relocation_imports.ex:29-36 | marshall/lib/marshall/compute/relocation_keys.ex:20-27 | marshall/lib/marshall/compute/relocation_readiness.ex:29-36 | marshall/lib/marshall/compute/relocation_revocations.ex:18-26 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:18-25 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_destination_cleanups.ex` and `marshall/lib/marshall/compute/relocation_destination_revocations.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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 `marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 × 8) marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25— marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25-32 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:18-25 | marshall/lib/marshall/compute/relocation_imports.ex:29-36 | marshall/lib/marshall/compute/relocation_keys.ex:20-27 | marshall/lib/marshall/compute/relocation_probes.ex:30-37 | marshall/lib/marshall/compute/relocation_readiness.ex:29-36 | marshall/lib/marshall/compute/relocation_revocations.ex:18-25 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:18-25 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_destination_cleanups.ex` and `marshall/lib/marshall/compute/relocation_destination_revocations.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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 `marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6–8 lines × 6) lilly/lib/lilly/vm/credentials.ex:109— lilly/lib/lilly/vm/credentials.ex:109-114 | lilly/lib/lilly/vm/flush.ex:21-26 | lilly/lib/lilly/vm/guest_trust.ex:69-74 | lilly/lib/lilly/vm/inception_exchange.ex:79-84 | lilly/lib/lilly/vm/kernel_attestation.ex:84-91 | lilly/lib/lilly/vm/readiness.ex:70-75 — 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 6 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `lilly/lib/lilly/vm/credentials.ex:109` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `lilly/lib/lilly/vm/credentials.ex:116` calls `setopts`, `remaining`, `send` and `lilly/lib/lilly/vm/readiness.ex:77` 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–8 lines × 3) enrico/scripts/invalid_boot_probe.exs:11— enrico/scripts/invalid_boot_probe.exs:11-17 | galileo/scripts/invalid_boot_probe.exs:11-17 | ziggy/scripts/invalid_boot_probe.exs:11-18 — before extracting anything, compare `enrico/scripts/invalid_boot_probe.exs` and `galileo/scripts/invalid_boot_probe.exs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 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 (7 lines × 10) marshall/lib/marshall/compute/relocation_cleanup.ex:136— marshall/lib/marshall/compute/relocation_cleanup.ex:136-142 | marshall/lib/marshall/compute/relocation_destination_cleanups.ex:24-30 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:17-23 | marshall/lib/marshall/compute/relocation_imports.ex:28-34 | marshall/lib/marshall/compute/relocation_key_retirement.ex:16-22 | marshall/lib/marshall/compute/relocation_keys.ex:19-25 | marshall/lib/marshall/compute/relocation_probes.ex:29-35 | marshall/lib/marshall/compute/relocation_readiness.ex:28-34 | marshall/lib/marshall/compute/relocation_revocations.ex:17-23 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:17-23 — before extracting anything, compare `marshall/lib/marshall/compute/relocation_destination_cleanups.ex` and `marshall/lib/marshall/compute/relocation_destination_revocations.ex` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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 (5–7 lines × 2) marshall/lib/marshall/ssh/host_certificate_retention.ex:24— marshall/lib/marshall/ssh/host_certificate_retention.ex:24-28 | marshall/lib/marshall/terminal/ticket_retention.ex:26-32 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/ssh/host_certificate_retention.ex: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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 3) marshall/lib/marshall/operations/galileo.ex:15— marshall/lib/marshall/operations/galileo.ex:15-20 | marshall/lib/marshall/operations/inference.ex:15-20 | marshall/lib/marshall/operations/peach.ex:15-20 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `marshall/lib/marshall/operations/galileo.ex:15` 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 (2–6 lines × 3) marshall/lib/marshall/operations/private_files.ex:89— marshall/lib/marshall/operations/private_files.ex:89-90 | porsche/lib/porsche/config.ex:103-108 | susan/lib/susan/credentials.ex:85-90 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `porsche/lib/porsche/config.ex:103` calls `uid` and `marshall/lib/marshall/operations/private_files.ex:89` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (4–5 lines × 5) marshall/lib/marshall/agents/cli_access.ex:143— marshall/lib/marshall/agents/cli_access.ex:143-146 | marshall/lib/marshall/inference/retention.ex:21-24 | marshall/lib/marshall/inference/retention.ex:46-50 | marshall/lib/marshall/ingress/environment_stream_retention.ex:22-26 | marshall/lib/marshall/ingress/retention.ex:22-26 — there are 5 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marshall/lib/marshall/inference/retention.ex:45` calls `sort`, `limit` and `marshall/lib/marshall/agents/cli_access.ex:143` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 7) audi/lib/audi/control/client.ex:884— audi/lib/audi/control/client.ex:884-890 | audi/lib/audi/dns/challenge.ex:62-68 | porsche/lib/porsche/client.ex:201-207 | protocol/lib/overalls_protocol/inception_exchange.ex:128-134 | protocol/lib/overalls_protocol/inception_observation.ex:33-39 | protocol/lib/overalls_protocol/ingress_relay.ex:63-69 | protocol/lib/overalls_protocol/web_login.ex:56-62 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times. Read the line range as the matched WINDOW rather than a finished unit: at `audi/lib/audi/control/client.ex:884` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `protocol/lib/overalls_protocol/web_login.ex:52` calls `response`, `term`, `boolean` and `audi/lib/audi/dns/challenge.ex:59` 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 (5 lines × 6) lilly/lib/lilly/control/client.ex:287— lilly/lib/lilly/control/client.ex:287-291 | lilly/lib/lilly/control/client.ex:337-341 | lilly/lib/lilly/control/client.ex:387-391 | lilly/lib/lilly/control/client.ex:437-441 | lilly/lib/lilly/control/client.ex:487-491 | lilly/lib/lilly/control/client.ex:535-539 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (34 lines × 2) nix/domains/system/fleet-exporter/runtime.py:295— nix/domains/system/fleet-exporter/runtime.py:295-328 | nix/domains/system/fleet-exporter/runtime.py:359-392 — 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 `nix/domains/system/fleet-exporter/runtime.py:295` 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 (23–25 lines × 2) antithesis/workload/control/dispatch.py:207— antithesis/workload/control/dispatch.py:207-231 | antithesis/workload/control/dispatch.py:291-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 (20–22 lines × 2) antithesis/workload/control/rotation.py:56— antithesis/workload/control/rotation.py:56-75 | antithesis/workload/repository/restart.py:49-70 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (18–20 lines × 2) nix/domains/artifacts/guest/inception/private_pki.py:92— nix/domains/artifacts/guest/inception/private_pki.py:92-111 | nix/domains/artifacts/guest/inception/private_runtime.py:75-92 — 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 (20 lines × 2) nix/domains/system/fleet-exporter/runtime.py:336— nix/domains/system/fleet-exporter/runtime.py:336-355 | nix/domains/system/fleet-exporter/runtime.py:396-415 — 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 `nix/domains/system/fleet-exporter/runtime.py:336` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15–18 lines × 2) antithesis/workload/control/host_sessions.py:204— antithesis/workload/control/host_sessions.py:204-218 | antithesis/workload/control/host_sessions.py:285-302 — 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 `antithesis/workload/control/host_sessions.py:204` 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 (4–15 lines × 3) antithesis/emulation/host/runner.py:95— antithesis/emulation/host/runner.py:95-109 | antithesis/emulation/recorder/runner.py:78-81 | antithesis/emulation/storage/runner.py:83-97 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13–14 lines × 2) antithesis/workload/admission/client.py:247— antithesis/workload/admission/client.py:247-260 | antithesis/workload/admission/client.py:297-309 — 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 `antithesis/workload/admission/client.py:247` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `antithesis/workload/admission/client.py:310` calls `get` and `antithesis/workload/admission/client.py:261` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 3) antithesis/workload/repository/operator.py:38— antithesis/workload/repository/operator.py:38-50 | antithesis/workload/repository/restart.py:43-55 | antithesis/workload/satellite/operator.py:63-75 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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) antithesis/workload/access/browser.py:317— antithesis/workload/access/browser.py:317-328 | antithesis/workload/admission/client.py:113-124 | antithesis/workload/control/rotation.py:42-53 | antithesis/workload/guest_lifecycle/operation.py:121-132 | antithesis/workload/repository/operator.py:30-41 | antithesis/workload/repository/restart.py:35-46 | antithesis/workload/satellite/operator.py:55-66 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times.
Duplicated block (8–9 lines × 4) antithesis/emulation/guest/runner.py:643— antithesis/emulation/guest/runner.py:643-650 | antithesis/emulation/guest/runner.py:776-783 | antithesis/emulation/guest/runner.py:828-835 | antithesis/emulation/guest/server.py:799-807 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `antithesis/emulation/guest/runner.py:643` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `antithesis/emulation/guest/server.py:808` calls `record_matches`, `get` and `antithesis/emulation/guest/runner.py:784` 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–8 lines × 2) antithesis/emulation/guest/runner.py:343— antithesis/emulation/guest/runner.py:343-349 | antithesis/emulation/guest/server.py:470-477 — 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 `antithesis/emulation/guest/runner.py:343` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (30–35 lines × 2) mila/rust/mila-ffi/src/session.rs:944— mila/rust/mila-ffi/src/session.rs:944-978 | mila/rust/mila-ffi/src/session.rs:1025-1054 — 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) mila/rust/mila-ffi/src/session.rs:1451— mila/rust/mila-ffi/src/session.rs:1451-1473 | mila/rust/mila-ffi/src/session.rs:1661-1683 — 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 `mila/rust/mila-ffi/src/session.rs:1451` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 (21–22 lines × 2) mila/native/linux/src/gtk_journey.rs:609— mila/native/linux/src/gtk_journey.rs:609-630 | mila/native/linux/src/gtk_journey.rs:714-734 — 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 `mila/native/linux/src/gtk_journey.rs:609` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16–21 lines × 3) mila/rust/mila-ffi/src/session.rs:422— mila/rust/mila-ffi/src/session.rs:422-437 | mila/rust/mila-ffi/src/session.rs:554-569 | mila/rust/mila-ffi/src/session.rs:610-630 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mila/rust/mila-ffi/src/session.rs:610` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (18 lines × 3) nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:260— nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:260-277 | nix/domains/artifacts/vscode-web-broker/src/windows/job.rs:43-60 | nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs:70-87 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (13–14 lines × 3) elixir/diagnostics/native/spool/src/sys.rs:35— elixir/diagnostics/native/spool/src/sys.rs:35-48 | nix/domains/system/otel-guest/receiver/src/main.rs:27-39 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:235-247 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `elixir/diagnostics/native/spool/src/sys.rs:35` 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 `stream` to `&impl AsRawFd` in one and `&UnixStream` 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 (12–14 lines × 3) mila/rust/mila-ffi/src/session.rs:641— mila/rust/mila-ffi/src/session.rs:641-653 | mila/rust/mila-ffi/src/session.rs:967-980 | mila/rust/mila-ffi/src/session.rs:1045-1056 — 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 (19–20 lines × 2) lyra/src/bin/overalls-trustd.rs:129— lyra/src/bin/overalls-trustd.rs:129-147 | lyra/src/guest/trust.rs:68-87 — before extracting anything, compare `lyra/src/bin/overalls-trustd.rs` and `lyra/src/guest/trust.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `lyra/src/bin/overalls-trustd.rs:129` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `lyra/src/bin/overalls-trustd.rs:148` calls `from_pem`, `as_bytes`, `is_err` and `lyra/src/guest/trust.rs:88` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7–10 lines × 2) mila/native/linux/src/adapter.rs:326— mila/native/linux/src/adapter.rs:326-332 | mila/native/linux/src/adapter.rs:359-368 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mila/native/linux/src/adapter.rs:359` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6–10 lines × 2) nix/domains/system/otel-guest/receiver/src/main.rs:142— nix/domains/system/otel-guest/receiver/src/main.rs:142-151 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:173-178 — 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 `nix/domains/system/otel-guest/receiver/src/main.rs:142` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8–9 lines × 5) mila/rust/mila-ffi/src/session.rs:374— mila/rust/mila-ffi/src/session.rs:374-382 | mila/rust/mila-ffi/src/session.rs:466-474 | mila/rust/mila-ffi/src/session.rs:504-511 | mila/rust/mila-ffi/src/session.rs:730-737 | mila/rust/mila-ffi/src/session.rs:1125-1132 — 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 `mila/rust/mila-ffi/src/session.rs:374` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `mila/rust/mila-ffi/src/session.rs:388` calls `from_utf8`, `bytes`, `map_err` and `mila/rust/mila-ffi/src/session.rs:476` 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 (8 lines × 7) mila/rust/mila-ffi/src/android/session_bridge.rs:160— mila/rust/mila-ffi/src/android/session_bridge.rs:160-167 | mila/rust/mila-ffi/src/android/session_bridge.rs:198-205 | mila/rust/mila-ffi/src/android/session_bridge.rs:241-248 | mila/rust/mila-ffi/src/android/session_bridge.rs:280-287 | mila/rust/mila-ffi/src/android/session_bridge.rs:481-488 | mila/rust/mila-ffi/src/android/session_bridge.rs:697-704 | mila/rust/mila-ffi/src/android/session_bridge.rs:749-756 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `mila/rust/mila-ffi/src/android/session_bridge.rs:478` calls `Ok`, `try_from` and `mila/rust/mila-ffi/src/android/session_bridge.rs:240` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 5) mila/native/linux/src/pages.rs:785— mila/native/linux/src/pages.rs:785-790 | mila/native/linux/src/pages.rs:828-833 | mila/native/linux/src/pages.rs:1063-1068 | mila/native/linux/src/views.rs:136-141 | mila/native/linux/src/views.rs:1135-1140 — before extracting anything, compare `mila/native/linux/src/pages.rs` and `mila/native/linux/src/views.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 41 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 `mila/native/linux/src/pages.rs:785` 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 × 10) mila/rust/mila-ffi/src/session.rs:341— mila/rust/mila-ffi/src/session.rs:341-345 | mila/rust/mila-ffi/src/session.rs:390-394 | mila/rust/mila-ffi/src/session.rs:438-442 | mila/rust/mila-ffi/src/session.rs:476-480 | mila/rust/mila-ffi/src/session.rs:513-517 | mila/rust/mila-ffi/src/session.rs:570-574 | mila/rust/mila-ffi/src/session.rs:739-743 | mila/rust/mila-ffi/src/session.rs:880-884 | mila/rust/mila-ffi/src/session.rs:1134-1138 | mila/rust/mila-ffi/src/session.rs:1210-1214 — all 10 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 × 9) mila/rust/mila-ffi/src/session.rs:286— mila/rust/mila-ffi/src/session.rs:286-292 | mila/rust/mila-ffi/src/session.rs:378-382 | mila/rust/mila-ffi/src/session.rs:467-474 | mila/rust/mila-ffi/src/session.rs:507-511 | mila/rust/mila-ffi/src/session.rs:550-554 | mila/rust/mila-ffi/src/session.rs:731-737 | mila/rust/mila-ffi/src/session.rs:874-878 | mila/rust/mila-ffi/src/session.rs:1128-1132 | mila/rust/mila-ffi/src/session.rs:1204-1208 — all 9 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `mila/rust/mila-ffi/src/session.rs:388` calls `from_utf8`, `bytes`, `map_err` and `mila/rust/mila-ffi/src/session.rs:476` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Low cohesion: FakeTerminal (LCOM4 4) REDACTED:321— FakeTerminal'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.
Anemic entity: Runtime nix/domains/system/otel-guest/receiver/src/request_recorder.rs:306— `Runtime` is an aggregate/entity with 3 data propert(ies) but no state-changing behaviour (only data and queries) — the business logic lives in a service.
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.
Type Safety — 33 typed · 17 plain JS — the untyped files are buck/probes/esbuild/entry.mjs, buck/probes/esbuild/greeting.mjs, marshall/assets/js/android_display.js, marshall/assets/js/android_display_hook.js, marshall/assets/js/app.js, marshall/assets/js/dashboard.js (+11 more).
R10 · Code Duplication· Duplicated block with local edits (10 matched lines × 2 locations) · ×1
Duplicated block with local edits (10 matched lines × 2 locations) marvin/scripts/build.mjs:14— marvin/scripts/build.mjs:14 · marvin/scripts/package.mjs:53 — the two spans are one implementation copied and then locally edited — 80 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 (10 lines × 2 locations) scripts/check_contracts.mjs:116— scripts/check_contracts.mjs:116 · scripts/check_contracts.mjs:126 — 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 (8 matched lines × 2 locations) · ×1
Duplicated block with local edits (8 matched lines × 2 locations) marvin/scripts/chromium-smoke.mjs:65— marvin/scripts/chromium-smoke.mjs:65 · marvin/scripts/chromium-smoke.mjs:90 — the two spans are one implementation copied and then locally edited — 150 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.
Complex function (anonymous) (cyclomatic 114, cognitive 187) marshall/scripts/localization_browser/probe.ts:56— (anonymous) has cyclomatic complexity 114 and cognitive complexity 187; 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 29, cognitive 45) marshall/assets/js/terminals.js:730— (anonymous) has cyclomatic complexity 29 and cognitive complexity 45; 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 29, cognitive 37) marshall/assets/js/terminals.js:802— (anonymous) has cyclomatic complexity 29 and cognitive complexity 37; 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 29, cognitive 32) marshall/assets/js/thread_composer.js:217— (anonymous) has cyclomatic complexity 29 and cognitive complexity 32; 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.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 25, cognitive 23) · ×1
Complex function main (cyclomatic 25, cognitive 23) nix/domains/artifacts/vscode-web/check-extension.mts:37— main has cyclomatic complexity 25 and cognitive complexity 23; 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 parseInputs (cyclomatic 25, cognitive 17) nix/domains/artifacts/vscode-web/check-patches.mts:21— parseInputs has cyclomatic complexity 25 and cognitive complexity 17; 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 parseRequest (cyclomatic 23, cognitive 19) REDACTED:25— parseRequest has cyclomatic complexity 23 and cognitive complexity 19; 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 verify (cyclomatic 19, cognitive 23) marshall/assets/js/admin_elevation.js:117— verify has cyclomatic complexity 19 and cognitive complexity 23; 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 verificationChallenge (cyclomatic 18, cognitive 12) marshall/assets/js/admin_elevation.js:29— verificationChallenge has cyclomatic complexity 18 and cognitive complexity 12; 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.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 16, cognitive 18) · ×1
Complex function main (cyclomatic 16, cognitive 18) scripts/check_contracts.mjs:331— main has cyclomatic complexity 16 and cognitive complexity 18; 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 16, cognitive 12) marshall/assets/js/thread_composer.js:19— (anonymous) has cyclomatic complexity 16 and cognitive complexity 12; 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 checkFiles (cyclomatic 15, cognitive 24) scripts/check_contracts.mjs:173— checkFiles has cyclomatic complexity 15 and cognitive complexity 24; 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 renderSessions (cyclomatic 15, cognitive 19) marshall/assets/js/terminals.js:996— renderSessions has cyclomatic complexity 15 and cognitive complexity 19; 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 captureRepositoryLaunch (cyclomatic 15, cognitive 15) marshall/assets/js/repository_launch.js:42— captureRepositoryLaunch has cyclomatic complexity 15 and cognitive complexity 15; 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 extractNativeNotes (cyclomatic 14, cognitive 26) scripts/check_contracts.mjs:105— extractNativeNotes has cyclomatic complexity 14 and cognitive complexity 26; 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 isAccountService (cyclomatic 14, cognitive 13) nix/domains/artifacts/vscode-web/check-no-account.mts:13— isAccountService has cyclomatic complexity 14 and cognitive complexity 13; 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 prepare (cyclomatic 13, cognitive 20) nix/domains/artifacts/vscode-web/prepare-windows.mts:17— prepare has cyclomatic complexity 13 and cognitive complexity 20; 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 handleControl (cyclomatic 13, cognitive 18) marshall/assets/js/terminals.js:534— handleControl has cyclomatic complexity 13 and cognitive complexity 18; 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 select (cyclomatic 13, cognitive 16) marshall/assets/js/terminals.js:1064— select has cyclomatic complexity 13 and cognitive complexity 16; 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 13, cognitive 10) nix/verification/tests/machines/windows-editor/extension.ts:40— (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; 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 offGridElements (cyclomatic 12, cognitive 15) marshall/assets/js/grid.js:41— offGridElements has cyclomatic complexity 12 and cognitive complexity 15; 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 12, cognitive 11) marshall/scripts/localization_browser/probe.ts:8— (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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 (anonymous) (cyclomatic 11, cognitive 16) marshall/assets/js/terminals.js:927— (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; 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 click (cyclomatic 11, cognitive 12) marshall/assets/js/passkey.js:13— click has cyclomatic complexity 11 and cognitive complexity 12; 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 readClipboard (cyclomatic 11, cognitive 10) marshall/assets/js/terminals.js:400— readClipboard has cyclomatic complexity 11 and cognitive complexity 10; 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.
R3 · Large Files· marshall/assets/js/terminals.js · ×1
marshall/assets/js/terminals.js: 1178 lines of code marshall/assets/js/terminals.js:1— marshall/assets/js/terminals.js has 1178 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
Dead file (~82 LoC) nix/domains/artifacts/vscode-web/prepare-windows.mts— no import path from any entry point (38 application, 2 tooling, 16 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) nix/domains/artifacts/vscode-web/check-extension.mts— no import path from any entry point (38 application, 2 tooling, 16 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 (~16 LoC) nix/domains/artifacts/vscode-web/maintenance-entry.ts— no import path from any entry point (38 application, 2 tooling, 16 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 (~3 LoC) buck/probes/esbuild/greeting.mjs— no import path from any entry point (38 application, 2 tooling, 16 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (buck/probes/esbuild/entry.mjs) — 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
Minor — 237 finding(s)
D25 · ADR Conformance· ADR accepted but its delivery is incomplete · ×122
ADR accepted but its delivery is incomplete docs/architecture/decisions/0002-elixir-ash-and-types.md:6— `docs/architecture/decisions/0002-elixir-ash-and-types.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0003-control-plane-coordination.md:6— `docs/architecture/decisions/0003-control-plane-coordination.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0004-lilly-and-vm-actors.md:6— `docs/architecture/decisions/0004-lilly-and-vm-actors.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0011-nixos-guest-and-console.md:6— `docs/architecture/decisions/0011-nixos-guest-and-console.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0017-durable-vm-actors-and-host-ownership.md:6— `docs/architecture/decisions/0017-durable-vm-actors-and-host-ownership.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0042-host-observability.md:6— `docs/architecture/decisions/0042-host-observability.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0068-nix-built-ubuntu-guests.md:6— `docs/architecture/decisions/0068-nix-built-ubuntu-guests.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0071-required-lilly-transfer.md:6— `docs/architecture/decisions/0071-required-lilly-transfer.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0073-bounded-nix-store-reclamation.md:6— `docs/architecture/decisions/0073-bounded-nix-store-reclamation.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0075-fleet-overlay-and-source-access.md:6— `docs/architecture/decisions/0075-fleet-overlay-and-source-access.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0077-teams-and-shared-resources.md:6— `docs/architecture/decisions/0077-teams-and-shared-resources.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0079-peer-vm-vm-attestation.md:6— `docs/architecture/decisions/0079-peer-vm-vm-attestation.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0080-named-edge-integrations.md:6— `docs/architecture/decisions/0080-named-edge-integrations.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0082-guest-terminal-multiplexer.md:6— `docs/architecture/decisions/0082-guest-terminal-multiplexer.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0090-second-audi-dns-replica-on-worker.md:6— `docs/architecture/decisions/0090-second-audi-dns-replica-on-worker.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0091-fleet-perimeter-public-listeners.md:6— `docs/architecture/decisions/0091-fleet-perimeter-public-listeners.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0092-portable-workload-bundles.md:6— `docs/architecture/decisions/0092-portable-workload-bundles.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0097-enrico-git-mirrors.md:6— `docs/architecture/decisions/0097-enrico-git-mirrors.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0101-browser-approved-agent-cli.md:6— `docs/architecture/decisions/0101-browser-approved-agent-cli.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0104-private-guest-cli-updates.md:6— `docs/architecture/decisions/0104-private-guest-cli-updates.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0106-inception-child-audi-wildcard.md:6— `docs/architecture/decisions/0106-inception-child-audi-wildcard.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0107-marshall-owned-agent-web-search.md:6— `docs/architecture/decisions/0107-marshall-owned-agent-web-search.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0108-guest-agent-web-fetch.md:6— `docs/architecture/decisions/0108-guest-agent-web-fetch.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0111-private-service-tls-names.md:6— `docs/architecture/decisions/0111-private-service-tls-names.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
ADR accepted but its delivery is incomplete docs/architecture/decisions/0113-guest-trust-at-boot.md:6— `docs/architecture/decisions/0113-guest-trust-at-boot.md:6` records the decision as `Status: accepted` and its delivery as `Implementation: partial`: by the record's own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository's own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope).
Duplicated predicate mila/windows-dotnet/Interop/RustNativeLifecycle.cs:119— `!result.Succeeded || result.Data is not { } bytes` appears character-identically in 3 files — mila/windows-dotnet/Interop/RustNativeLifecycle.cs, mila/windows-dotnet/Interop/SessionListing.cs, mila/windows-dotnet/MainWindow.xaml.cs. 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 mila/windows-dotnet/Interop/RustNativeLifecycle.cs:376— `!result.Succeeded || result.Data is null` appears character-identically in 2 files — mila/windows-dotnet/Interop/RustNativeLifecycle.cs, mila/windows-dotnet/MainWindow.xaml.cs. 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 mila/windows-dotnet/Interop/RustNative.cs:165— `Status == MilaNativeStatus.Ok && Data is not null` appears character-identically in 2 files — mila/windows-dotnet/Interop/RustNative.cs, mila/windows-dotnet/Interop/RustNativeLifecycle.cs. 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 mila/windows-dotnet/Interop/RustNative.cs:870— `channelUri.Contains('\0') || appId.Contains('\0') || deployment.Contains('\0')` appears character-identically in 2 files — mila/windows-dotnet/Interop/RustNative.cs, mila/windows-dotnet/Interop/RustNativeLifecycle.cs. 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 mila/windows-dotnet/Interop/RustNative.cs:497— `char.IsAsciiLetterOrDigit(c) || c is '-' or '_'` appears character-identically in 2 files — mila/windows-dotnet/Interop/RustNative.cs, mila/windows-dotnet/MainWindow.xaml.cs. 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 marshall/lib/marshall/accounts/administrators.ex:28— `(user && is_nil(user.deleted_at)) and user.active` appears character-identically in 2 files — marshall/lib/marshall/accounts/administrators.ex, marshall/lib/marshall/accounts/security.ex. 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 lilly/lib/lilly/inception/propagation.ex:120— `:inet_dns.dns_query(question, :domain) == String.to_charlist(owner) and :inet_dns.dns_query(question, :type) == :txt and :inet_dns.dns_query…` appears character-identically in 2 files — lilly/lib/lilly/inception/propagation.ex, marshall/lib/marshall/ingress/acme/propagation.ex. 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 marshall/lib/marshall/access/authorization.ex:72— `Ash.read_one!(query, actor: SystemActor.compute()) || Ledger.rollback(:forbidden)` appears character-identically in 3 files — marshall/lib/marshall/access/authorization.ex, marshall/lib/marshall/compute/lifecycle.ex, marshall/lib/marshall/compute/resize.ex. 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 audi/lib/audi/http/authority.ex:117— `Audi.Authority.Renewal.inconclusive?(result) and grant.expires_at > now()` appears character-identically in 2 files — audi/lib/audi/http/authority.ex, audi/lib/audi/inception/authority.ex. 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 marshall/lib/marshall/access/authorization.ex:30— `DecisionSnapshot.active?() and vms != []` appears character-identically in 2 files — marshall/lib/marshall/access/authorization.ex, marshall/lib/marshall/compute/views.ex. 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 scripts/cargo_security_upgrades.exs:32— `File.exists?(Path.join(root, "flake.nix")) || fail("run from the repository root")` appears character-identically in 3 files — scripts/cargo_security_upgrades.exs, scripts/fetch_pins.exs, scripts/mix_security_upgrades.exs. 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 elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex:117— `Keyword.keyword?(values) and length(values) == length(Enum.uniq(Keyword.keys(values)))` appears character-identically in 2 files — elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex, elixir/diagnostics/lib/overalls/diagnostics/metrics.ex. 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 marshall/lib/marshall/accounts/account_lifecycle.ex:49— `Ledger.lock!(AdminBootstrap, "installation") || Ledger.rollback(:forbidden)` appears character-identically in 3 files — marshall/lib/marshall/accounts/account_lifecycle.ex, marshall/lib/marshall/accounts/admin_users.ex, marshall/lib/marshall/accounts/administrators.ex. 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 marshall/lib/marshall/artifacts/sharing.ex:25— `Ledger.lock!(Artifact, artifact_id) || Ledger.rollback(:not_found)` appears character-identically in 2 files — marshall/lib/marshall/artifacts/sharing.ex, marshall/lib/marshall/artifacts/storage.ex. 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 marshall/lib/marshall/agents/context.ex:291— `Ledger.lock!(Thread, turn.thread_id) || Ledger.rollback(:not_found)` appears character-identically in 4 files — marshall/lib/marshall/agents/context.ex, marshall/lib/marshall/agents/model_calls.ex, marshall/lib/marshall/agents/skill_maintenance.ex, marshall/lib/marshall/agents/turn_coordinator.ex. 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 marshall/lib/marshall/agents/context.ex:290— `Ledger.lock!(Turn, turn_id) || Ledger.rollback(:not_found)` appears character-identically in 4 files — marshall/lib/marshall/agents/context.ex, marshall/lib/marshall/agents/model_calls.ex, marshall/lib/marshall/agents/skill_maintenance.ex, marshall/lib/marshall/agents/turn_coordinator.ex. 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 marshall/lib/marshall/editor/authority.ex:41— `Ledger.lock!(VirtualMachine, request.vm_id) || deny!()` appears character-identically in 2 files — marshall/lib/marshall/editor/authority.ex, marshall/lib/marshall/ingress/execution.ex. 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 marshall/lib/marshall/agents/context.ex:293— `Ledger.lock!(VirtualMachine, root.vm_id) || Ledger.rollback(:machine_unavailable)` appears character-identically in 3 files — marshall/lib/marshall/agents/context.ex, marshall/lib/marshall/agents/model_calls.ex, marshall/lib/marshall/agents/web_search.ex. 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 marshall/lib/marshall/terminal/sharing.ex:39— `Ledger.lock!(VirtualMachine, session.vm_id) || Ledger.rollback(:unknown_session)` appears character-identically in 2 files — marshall/lib/marshall/terminal/sharing.ex, marshall/lib/marshall/terminal/termination.ex. 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 marshall/lib/marshall/threads/activity.ex:18— `Ledger.lock_history!(Thread, thread.id) || Ledger.rollback(:not_found)` appears character-identically in 2 files — marshall/lib/marshall/threads/activity.ex, marshall/lib/marshall/threads/coordinator.ex. 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 marshall/lib/marshall/galileo/credentials.ex:105— `Ledger.share_host!(id) || Ledger.rollback(:unauthorized)` appears character-identically in 2 files — marshall/lib/marshall/galileo/credentials.ex, marshall/lib/marshall/peach/credentials.ex. 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 marshall/lib/marshall/ingress/open.ex:63— `List.first(Ledger.read!(Endpoint, label: label)) || deny!()` appears character-identically in 2 files — marshall/lib/marshall/ingress/open.ex, marshall/lib/marshall/ingress/routes.ex. 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 marshall/lib/marshall/ingress/sessions.ex:105— `List.first(Ledger.read!(Endpoint, label: request.label)) || deny!()` appears character-identically in 2 files — marshall/lib/marshall/ingress/sessions.ex, marshall/lib/marshall/ingress/web_streams.ex. 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 marshall/lib/marshall/ingress/routes.ex:43— `List.first(Ledger.read!(Endpoint, vm_id: vm.id)) || deny!()` appears character-identically in 2 files — marshall/lib/marshall/ingress/routes.ex, marshall/lib/marshall/ingress/web_streams.ex. 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 marshall/lib/marshall/ingress/environment_discovery.ex:23— `List.first(Ledger.read!(Environment, label: request.label)) || deny!()` appears character-identically in 2 files — marshall/lib/marshall/ingress/environment_discovery.ex, marshall/lib/marshall/ingress/environment_streams.ex. 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.
Silent fallback default in catch mila/windows-dotnet/Interop/RustNative.cs:232— `TrySessionConnect` swallows every exception into `return -1;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/RustNative.cs:753— `TrySessionClose` swallows `DllNotFoundException` into `return MilaNativeStatus.Unavailable;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/RustNative.cs:826— `TrySessionTerminalInput` swallows `DllNotFoundException` into `return MilaNativeStatus.Unavailable;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/RustNative.cs:836— `TrySessionTerminalResize` swallows `DllNotFoundException` into `return MilaNativeStatus.Unavailable;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/RustNative.cs:845— `TrySessionTerminalKill` swallows `DllNotFoundException` into `return MilaNativeStatus.Unavailable;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/RustNative.cs:879— `TryValidateWindowsPushRegistration` swallows `DllNotFoundException` into `return MilaNativeStatus.Unavailable;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/RustNativeLifecycle.cs:70— `TrySessionReadMachines` swallows `DllNotFoundException` into `return MilaNativeStatus.Unavailable;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/SettingsStore.cs:54— `Load` swallows `IOException` into `return MilaSettings.Defaults;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/SignInCoordinator.cs:71— `Decode` swallows `JsonException` into `return new MilaWhoami.Invalid();` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/TerminalStream.cs:40— `End` swallows `Exception` into `return false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/Interop/WindowsNotifications.cs:188— `Load` swallows `IOException` into `return Array.Empty<MilaWindowsNotificationDevice>();` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet/MainWindow.xaml.cs:1011— `ShowOfflineMachines` swallows `Exception` into `return false;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet-smoke/DeviceKeyCustodySmoke.cs:51— `Throws` swallows `T` into `return true;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch REDACTED:248— `Refuses` swallows `Exception` into `return true;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/windows-dotnet-smoke/WatchSmoke.cs:58— `Refuses` swallows `InvalidDataException` into `return true;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaDeploymentPersistence.kt:32— `readAll` swallows every exception into `emptyList()` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing.
Silent fallback default in catch mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSshKeys.kt:83— `readKeys` swallows every exception into `emptyList()` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing.
Silent fallback default on Err lilly/native/hostd/src/ingress.rs:121— `live` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err lyra/src/bin/overalls-ssh-sync-windows.rs:424— `new_lines` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err lyra/src/agent/maintenance.rs:603— `bootstrap_invocation` turns every `Err` into `Some(64)` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err lyra/src/ssh_config.rs:195— `local_identity` turns every `Err` into `"overalls-identity.pub".into()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/native/linux/src/journey.rs:1499— `run_terminal` turns every `Err` into `"renderer_refused"` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:90— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionConnect` turns every `Err` into `0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:162— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionMachineAction` turns every `Err` into `-4` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:200— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionMachineResize` turns every `Err` into `-4` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:243— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionMachineCreate` turns every `Err` into `-4` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:282— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionShareMutation` turns every `Err` into `-4` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:478— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionWebSet` turns every `Err` into `-4` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:679— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionDeviceRemove` turns every `Err` into `-2` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:699— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionDeviceRemoveWithRequest` turns every `Err` into `-2` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:726— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionDevicePreferences` turns every `Err` into `-2` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:751— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionDevicePreferencesWithRequest` turns every `Err` into `-2` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/session_bridge.rs:789— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionMachineClone` turns every `Err` into `-4` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err mila/rust/mila-ffi/src/android/terminal.rs:398— `Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeTerminalInput` turns every `Err` into `-4` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
M2 · Architecture documentation· Architecture diagram out of date · ×6
Architecture diagram out of date audi/README.md:9— `audi/README.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `audi-private`, `porsche`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape.
Architecture diagram out of date galileo/README.md:9— `galileo/README.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `ziggy`, `porsche`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape.
Architecture diagram out of date protocol/README.md:9— `protocol/README.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `peach`, `susan`, `audi-private`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape.
Architecture diagram out of date ziggy/README.md:8— `ziggy/README.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `galileo`, `porsche`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape.
Architecture diagram out of date antithesis/scratchbook/sut-analysis.md:65— `antithesis/scratchbook/sut-analysis.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `peach`, `protocol`, `susan`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape.
Architecture diagram out of date antithesis/scratchbook/discovery/focus-01-architecture.md:36— `antithesis/scratchbook/discovery/focus-01-architecture.md` draws the system's parts, and the drawing no longer matches the code: it leaves out `peach`, `protocol`, `susan`, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape.
Silent fallback default on parse failure mila/windows-dotnet/Interop/DeploymentPickerController.cs:109— `ParsePort` falls back to `(ushort)0` when `ushort.TryParse(text?.Trim(), NumberStyles.None, CultureInfo.InvariantCulture, o…` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Silent fallback default on parse failure antithesis/workload/recorder/client.py:134— `_sample` returns `0` when `(OSError, ValueError, KeyError)` 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 nix/domains/system/otel-guest/browser_journey.py:136— `at_editor` (in `observe_startup`) returns `False` when `(PlaywrightError, 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 nix/verification/tests/machines/fleet/relocation-diagnostics.py:223— `field` (in `observe`) returns `'unknown'` when `(OSError, ValueError, KeyError, TypeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure nix/verification/tests/machines/mila-journey/approver.py:145— `failure_code` returns `'action_exception'` when `(OSError, 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.
D20 · ADR Quality· ADR considers only one option · ×2
ADR considers only one option docs/architecture/decisions/0225-marshall-notifications-domain.md:42— `docs/architecture/decisions/0225-marshall-notifications-domain.md:42` lists one option, "**Sending from the request process.** Rejected: provider latency and retries", so the record shows no choice being made. List the alternatives that were rejected and why, or remove the section.
ADR considers only one option docs/architecture/decisions/0226-monospace-web-on-flutter.md:34— `docs/architecture/decisions/0226-monospace-web-on-flutter.md:34` lists one option, "**Material or Cupertino defaults.** Rejected: a second visual language for", so the record shows no choice being made. List the alternatives that were rejected and why, or remove the section.
P10 · Library API & versioning· No explicit versioning · ×2
No explicit versioning mila/native/apple/Package.swift— No explicit version was found for the SwiftPM library declared by `Package.swift`. This check read nothing in Package.swift, which has no version field, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library's directory or at the repository root, or a semver release tag (or a Drupal `8.x-1.2` release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes.
No explicit versioning REDACTED— No explicit version was found for the Go module library declared by `REDACTED`. This check read a `/vN` major-version suffix on the REDACTED module path, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library's directory or at the repository root, or a semver release tag (or a Drupal `8.x-1.2` release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes.
C2 · Access Controls· No named authorization policies · ×1
No named authorization policies — Authorization IS enforced here (by imperative guard methods that throw on violation) — this is NOT a claim that the code is unprotected. What's missing is a NAMED rule set: the guards encode the access rules inline, so the rules can't be listed, reviewed or tested apart from the call sites that apply them. Recommendation, not a defect.
Documentation: no map of the repository's parts README.md:1— The repository has 5 units (`marvin`, `windows-dotnet`, `windows-dotnet-smoke`, `windows-dotnet-uia`, `code-contracts`); `README.md` and the documents it links name none of them. Add a short list of the parts and what each does.
D20 · ADR Quality· ADR superseded but its status says otherwise · ×1
ADR superseded but its status says otherwise docs/architecture/decisions/0182-unprivileged-lilly-beam.md:5— docs/architecture/decisions/0182-unprivileged-lilly-beam.md:5 says "accepted", but docs/architecture/decisions/0183-guest-dataset-streams-in-hostd.md, docs/architecture/decisions/0184-lilly-owns-every-socket.md supersedes it. Two records now claim the same ground; mark this one "Superseded by" its successor.
D20 · ADR Quality· ADR decides a question another record already decided · ×1
ADR decides a question another record already decided docs/architecture/decisions/0204-git-attribution-and-guest-identity.md:1— docs/architecture/decisions/0204-git-attribution-and-guest-identity.md and docs/architecture/decisions/0198-git-attribution-and-guest-identity.md are both in force and decide the same question ("ADR-0204: Git attribution and guest identity"), and neither names the other. If this record replaces the earlier one, say so ("Supersedes …") and mark the earlier one superseded; if both hold, state how they relate.
ADR not followed: ADR-0255: Thread lifecycle state machine and Oban server-tool dispatch docs/architecture/decisions/0255-thread-lifecycle-and-server-tool-dispatch.md:26— docs/architecture/decisions/0255-thread-lifecycle-and-server-tool-dispatch.md:26 rules out `status`, but production code uses it: mila/windows-dotnet-smoke/JourneyPages.cs:80, mila/windows-dotnet-smoke/JourneyPages.cs:83, mila/windows-dotnet-smoke/JourneyPages.cs:372, REDACTED:190, REDACTED:558 (+106 more). Remove the use, or supersede the record if the decision changed.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
ED3 · Event naming· Event not named in past tense · ×1
Event not named in past tense: UpdateRolledBack lyra/src/log.rs:12— `UpdateRolledBack` is an imperative name inside a domain-event set whose siblings are past-tense facts — it reads as an intent, not something that happened. Name new events for the fact that occurred (e.g. `ItemAdded`). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe.
Logging is not universal — Only 5/33 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `antithesis/fixtures`, `antithesis/integration`, `elixir/diagnostics/native/spool`, `enrico` and 23 more.
P3 · Security & performance tooling· Dependabot does not watch github-actions/nuget/npm/cargo/gomod/pip/gradle · ×1
Dependabot does not watch github-actions/nuget/npm/cargo/gomod/pip/gradle vendor/ash_scim/.github/dependabot.yml:6— `vendor/ash_scim/.github/dependabot.yml` schedules updates, but no `package-ecosystem` entry covers `github-actions`, `nuget`, `npm`, `cargo`, `gomod`, `pip`, `gradle`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the `updates:` list.
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.)
R7 · Dead Code· Unused module-local declaration 'setPref' · ×1
Unused module-local declaration 'setPref' marshall/assets/js/terminals.js:40— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Null-forgiving operator (`!`) suppressions override nullable warnings — ~0.9 `!` suppressions per 1k syntax nodes — 79 suppression(s) across the 83379 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
Silent fallback default on error nix/domains/artifacts/guest/github/transport/transport.go:81— `Direct` turns a non-nil `err` into `return refusedTrust{}` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 `if` or in the doc comment, and the row stops firing.
Outdated: ash — `:ash` is locked at 3.33.6 but 3.37.6 is the current stable release on hex.pm, and it already satisfies the `"~> 3.0"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash` and commit the updated REDACTED.
Outdated: ash_admin — `:ash_admin` is locked at 1.3.2 but 1.4.0 is the current stable release on hex.pm, and it already satisfies the `"~> 1.0"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash_admin` and commit the updated REDACTED.
Outdated: ash_archival — `:ash_archival` is locked at 2.0.3 but 2.0.5 is the current stable release on hex.pm, and it already satisfies the `"~> 2.0"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash_archival` and commit the updated REDACTED.
Outdated: ash_cloak — `:ash_cloak` is locked at 0.4.0 but 0.5.0 is the current stable release on hex.pm, and it already satisfies the `"~> 0.4"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash_cloak` and commit the updated REDACTED.
Outdated: ash_oban — `:ash_oban` is locked at 0.8.14 but 0.10.3 is the current stable release on hex.pm, and it already satisfies the `"~> 0.8"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash_oban` and commit the updated REDACTED.
Outdated: ash_paper_trail — `:ash_paper_trail` is locked at 0.7.0 but 0.8.1 is the current stable release on hex.pm, and it already satisfies the `"~> 0.7"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash_paper_trail` and commit the updated REDACTED.
Outdated: ash_phoenix — `:ash_phoenix` is locked at 2.3.25 but 2.3.26 is the current stable release on hex.pm, and it already satisfies the `"~> 2.0"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash_phoenix` and commit the updated REDACTED.
Outdated: ash_postgres — `:ash_postgres` is locked at 2.13.1 but 2.16.0 is the current stable release on hex.pm, and it already satisfies the `"~> 2.0"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash_postgres` and commit the updated REDACTED.
Outdated: ash_state_machine — `:ash_state_machine` is locked at 0.2.13 but 0.3.1 is the current stable release on hex.pm, and it already satisfies the `"~> 0.2"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update ash_state_machine` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in susan/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in porsche/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in peach/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in ziggy/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in lilly/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in galileo/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in audi/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in enrico/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: dialyxir — `:dialyxir` is locked at 1.4.8 but 1.4.9 is the current stable release on hex.pm, and it already satisfies the `"~> 1.4"` requirement declared in brady/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update dialyxir` and commit the updated REDACTED.
Outdated: esbuild — `:esbuild` is locked at 0.10.0 but 0.10.1 is the current stable release on hex.pm, and it already satisfies the `"~> 0.10"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update esbuild` and commit the updated REDACTED.
Outdated: lazy_html — `:lazy_html` is locked at 0.1.13 but 0.1.14 is the current stable release on hex.pm, and it already satisfies the `">= 0.1.0"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update lazy_html` and commit the updated REDACTED.
Outdated: live_debugger — `:live_debugger` is locked at 1.0.2 but 1.0.3 is the current stable release on hex.pm, and it already satisfies the `"~> 1.0"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update live_debugger` and commit the updated REDACTED.
Outdated: llm_db — `:llm_db` is locked at 2026.9.3 but 2026.11.2 is the current stable release on hex.pm, and it already satisfies the `"~> 2026.5"` requirement declared in ziggy/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update llm_db` and commit the updated REDACTED.
Outdated: localize — `:localize` is locked at 1.3.0 but 1.7.1 is the current stable release on hex.pm, and it already satisfies the `"~> 1.3"` requirement declared in porsche/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update localize` and commit the updated REDACTED.
Outdated: localize — `:localize` is locked at 1.3.0 but 1.7.1 is the current stable release on hex.pm, and it already satisfies the `"~> 1.3"` requirement declared in marshall/mix.exs — so the lockfile is behind this repository's own declared range. Run `mix deps.update localize` and commit the updated REDACTED.
+ 21 more in this group — see findings.md.
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 40 file(s) — `antithesis/verification/schema.py`, `antithesis/workload/access/session.py`, `antithesis/workload/core/config.py`, `antithesis/workload/core/interesting.py`, `antithesis/workload/core/outcome.py`, … (+35 more) — 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 01a1e5be-1da0-7d0e-8a40-4777520fe944 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Appendix C — Personal-data map
Every field, property and record parameter whose name is conventional personal data — 2 field(s) across 1 category, each with an exact repo-relative file:line. This is the data inventory a compliance review starts from — right-to-erasure, retention, minimisation. Detected by NAME, from the C# syntax tree, with a deliberately specific identifier classifier — the same one the C1–C5 compliance cards use to decide whether personal data is present, so CardDefinition or FileName don't trip. Two caveats stated rather than glossed: those cards additionally require corroboration (a persistence/account signal, or two distinct PII categories) that this inventory deliberately does not, so it lists more than they gate on; and D32 Data Compliance shares nothing with it — that dimension is a separate semgrep ruleset for personal data leaking into logs, URLs and browser storage, and a clean D32 result says nothing about this list. Informational — it feeds no score.
Issues: 41 · Warnings: 2500 · Recommendations: 237 · Info: 46 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 16-11-2026 @ 19:03 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.