Public report of jdx/mise, published 26 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 26 October 2026, 02:45 UTC · Survey ID cd_b092814fda924f65bd4050e5ceeb611a
jdx/mise
Measured 26 October 2026, 02:33 UTC, at code version dec9ac6
No regression since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Down 1 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A very large codebase: 559,497 lines of product code in 22 projects, tests not counted · Estimated rebuild effort: about 4.5 person-years · Weakest lens: Security and Compliance, 56
Findings by how serious they are
36 critical2088 serious95 minor
10 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
26 October 2026, 02:33 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
76of 76 dimensions measured by tools.
2175of 2219 findings point to an exact file and line, so you can open each one in the code. The other 44 concern the repository as a whole, such as missing documentation.
76dimensions across 8 lenses, read from 559,497 lines of product code in 22 projects.
jdx/mise falls short of our standard for production because it has weaknesses in the build pipeline's configuration. It scores 62 out of 100 and is rated Adequate, and 29 of its 36 critical findings are security problems.
Security and Compliance, at 56, is the weakest lens and counts most in the score. The best first step is serving traffic only over an encrypted connection, worth about 5 points. Raising Security and Compliance to 70 would lift the score to about 65.
Ten settings leave the servers or containers unsafe. Three pipeline steps run downloads nobody checks, and four sets of files in separate parts keep changing together, which points to hidden dependencies. Correcting the unsafe settings, checking each download against a checksum and making the hidden dependencies explicit would close these risks. Correcting the flagged pipeline settings would fix the eight weaknesses in the build pipeline's configuration, and passing outside input through environment variables would deal with the two pipeline steps that put outside input straight into a shell command. The two buttons or links with no name need a name, even when they only show an icon.
The product code is 559,497 lines, about €650,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Security and Compliance rose from 56 to 70, the lowest score rated Strong, the score would rise from 62 to about 65.
Code composition: what the lines of code are
Product code 96%Tests 4%
New since the last survey: 718 findings
These 718 critical or serious findings weren't in the previous survey, on 12 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 551 findings
These 551 critical or serious findings were in the previous survey, on 12 October 2026, and are gone from this one. The first 100 are listed here.
€220,000 to €1,100,000, for 3,606 to 11,440 hours of work, about 4.5 person-years for 2 to 9 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 62. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Very large: 559,497 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Secure the server's transport: serve TLS itself (`HttpServer::bind_rustls_0_23(addr, config)` in actix-web, `axum_server::bind_rustls(addr, RustlsConfig::from_pem_file(…))`, tonic's `Server::builder().tls_config(ServerTlsConfig::new().identity(…))`, Rocket's `[default.tls]`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only.
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 1 point · Low effort · ADR Quality
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €650,000 to build again, about 4.5 person-years of work. Its weakest lens is Security and Compliance, at 56 (Adequate). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Secure the server's transport: serve TLS itself (`HttpServer::bind_rustls_0_23(addr, config)` in actix-web, `axum_server::bind_rustls(addr, RustlsConfig::from_pem_file(…))`, tonic's `Server::builder().tls_config(ServerTlsConfig::new().identity(…))`, Rocket's `[default.tls]`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.0 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 1,059,274 lines over the last 90 days, which is about 4,295,945 lines a year. At that pace, the extra work comes to an estimated 257 to 1542.2 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — 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.
878 modules, with 2380 dependencies between them. 9 loops run through 121 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 838 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.
mise.backend.platform_target uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.backend.platform_target, while a change to mise.backend.platform_target can't break mise_oci.manifest.
Position
Below the diagonal: mise.backend.platform_target uses a module listed above it, which is the healthy direction.
mise.cli.settings uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.cli.settings, while a change to mise.cli.settings can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.cli.settings uses a module listed above it, which is the healthy direction.
mise.deps.rule uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.deps.rule, while a change to mise.deps.rule can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.deps.rule uses a module listed above it, which is the healthy direction.
10→30 mise_lsp.schema uses aqua_registry.templatepart of a loop✕
Connections
2 pairs of types, where a type in mise_lsp.schema uses a type in aqua_registry.template.
mise_lsp.schema uses aqua_registry.template, so a change to aqua_registry.template can break mise_lsp.schema, while a change to mise_lsp.schema can't break aqua_registry.template.
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.
mise_system.history.shadow uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_system.history.shadow, while a change to mise_system.history.shadow can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_system.history.shadow uses a module listed above it, which is the healthy direction.
11→25 mise_system.history.shadow uses mise_system.history.purgepart of a loop✕
Connections
1 pair of types, where a type in mise_system.history.shadow uses a type in mise_system.history.purge.
mise_system.history.shadow uses mise_system.history.purge, so a change to mise_system.history.purge can break mise_system.history.shadow, while a change to mise_system.history.shadow can't break mise_system.history.purge.
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.
mise.backend.options uses mise.backend.platform_target, so a change to mise.backend.platform_target can break mise.backend.options, while a change to mise.backend.options can't break mise.backend.platform_target.
Position
Below the diagonal: mise.backend.options uses a module listed above it, which is the healthy direction.
12→30 mise.backend.options uses aqua_registry.templatepart of a loop✕
Connections
2 pairs of types, where a type in mise.backend.options uses a type in aqua_registry.template.
mise.backend.options uses aqua_registry.template, so a change to aqua_registry.template can break mise.backend.options, while a change to mise.backend.options can't break aqua_registry.template.
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.
mise.deps.providers uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.deps.providers, while a change to mise.deps.providers can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.deps.providers uses a module listed above it, which is the healthy direction.
mise.deps.providers uses mise.deps.rule, so a change to mise.deps.rule can break mise.deps.providers, while a change to mise.deps.providers can't break mise.deps.rule.
Position
Below the diagonal: mise.deps.providers uses a module listed above it, which is the healthy direction.
13→17 mise.deps.providers uses mise.depspart of a loop✕
Connections
1 pair of types, where a type in mise.deps.providers uses a type in mise.deps.
mise.deps.providers uses mise.deps, so a change to mise.deps can break mise.deps.providers, while a change to mise.deps.providers can't break mise.deps.
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.
mise_config.tools.schema uses mise_lsp.schema, so a change to mise_lsp.schema can break mise_config.tools.schema, while a change to mise_config.tools.schema can't break mise_lsp.schema.
Position
Below the diagonal: mise_config.tools.schema uses a module listed above it, which is the healthy direction.
mise_lsp.diagnostics uses mise_lsp.schema, so a change to mise_lsp.schema can break mise_lsp.diagnostics, while a change to mise_lsp.diagnostics can't break mise_lsp.schema.
Position
Below the diagonal: mise_lsp.diagnostics uses a module listed above it, which is the healthy direction.
15→30 mise_lsp.diagnostics uses aqua_registry.templatepart of a loop✕
Connections
1 pair of types, where a type in mise_lsp.diagnostics uses a type in aqua_registry.template.
mise_lsp.diagnostics uses aqua_registry.template, so a change to aqua_registry.template can break mise_lsp.diagnostics, while a change to mise_lsp.diagnostics can't break aqua_registry.template.
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.
mise.args.backend_arg uses mise.backend.backend_type, so a change to mise.backend.backend_type can break mise.args.backend_arg, while a change to mise.args.backend_arg can't break mise.backend.backend_type.
Position
Below the diagonal: mise.args.backend_arg uses a module listed above it, which is the healthy direction.
mise.args.backend_arg uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.args.backend_arg, while a change to mise.args.backend_arg can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.args.backend_arg uses a module listed above it, which is the healthy direction.
mise.args.backend_arg uses mise.backend.options, so a change to mise.backend.options can break mise.args.backend_arg, while a change to mise.args.backend_arg can't break mise.backend.options.
Position
Below the diagonal: mise.args.backend_arg uses a module listed above it, which is the healthy direction.
mise.deps uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.deps, while a change to mise.deps can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.deps uses a module listed above it, which is the healthy direction.
mise.deps uses mise.deps.providers, so a change to mise.deps.providers can break mise.deps, while a change to mise.deps can't break mise.deps.providers.
Position
Below the diagonal: mise.deps uses a module listed above it, which is the healthy direction.
mise_lsp.tasks uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_lsp.tasks, while a change to mise_lsp.tasks can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_lsp.tasks uses a module listed above it, which is the healthy direction.
mise_lsp.tasks uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise_lsp.tasks, while a change to mise_lsp.tasks can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise_lsp.tasks uses a module listed above it, which is the healthy direction.
18→30 mise_lsp.tasks uses aqua_registry.templatepart of a loop✕
Connections
1 pair of types, where a type in mise_lsp.tasks uses a type in aqua_registry.template.
mise_lsp.tasks uses aqua_registry.template, so a change to aqua_registry.template can break mise_lsp.tasks, while a change to mise_lsp.tasks can't break aqua_registry.template.
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.
mise_system.files uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_system.files, while a change to mise_system.files can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_system.files uses a module listed above it, which is the healthy direction.
mise_system.files uses mise_oci.manifest, so a change to mise_oci.manifest can break mise_system.files, while a change to mise_system.files can't break mise_oci.manifest.
Position
Below the diagonal: mise_system.files uses a module listed above it, which is the healthy direction.
mise_system.files uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise_system.files, while a change to mise_system.files can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise_system.files uses a module listed above it, which is the healthy direction.
19→30 mise_system.files uses aqua_registry.templatepart of a loop✕
Connections
1 pair of types, where a type in mise_system.files uses a type in aqua_registry.template.
mise_system.files uses aqua_registry.template, so a change to aqua_registry.template can break mise_system.files, while a change to mise_system.files can't break aqua_registry.template.
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.
mise.toolset.tool_version uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.toolset.tool_version, while a change to mise.toolset.tool_version can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.toolset.tool_version uses a module listed above it, which is the healthy direction.
mise.toolset.tool_version uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.toolset.tool_version, while a change to mise.toolset.tool_version can't break mise_oci.manifest.
Position
Below the diagonal: mise.toolset.tool_version uses a module listed above it, which is the healthy direction.
mise.toolset.tool_version uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.toolset.tool_version, while a change to mise.toolset.tool_version can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.toolset.tool_version uses a module listed above it, which is the healthy direction.
mise.toolset.tool_version uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.toolset.tool_version, while a change to mise.toolset.tool_version can't break mise.args.backend_arg.
Position
Below the diagonal: mise.toolset.tool_version uses a module listed above it, which is the healthy direction.
20→22 mise.toolset.tool_version uses mise.toolset.tool_requestpart of a loop✕
Connections
1 pair of types, where a type in mise.toolset.tool_version uses a type in mise.toolset.tool_request.
mise.toolset.tool_version uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.toolset.tool_version, while a change to mise.toolset.tool_version can't break mise.toolset.tool_request.
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.
20→29 mise.toolset.tool_version uses mise.lockfilepart of a loop✕
Connections
1 pair of types, where a type in mise.toolset.tool_version uses a type in mise.lockfile.
mise.toolset.tool_version uses mise.lockfile, so a change to mise.lockfile can break mise.toolset.tool_version, while a change to mise.toolset.tool_version can't break mise.lockfile.
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.
mise_system.history.tracked uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_system.history.tracked, while a change to mise_system.history.tracked can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_system.history.tracked uses a module listed above it, which is the healthy direction.
mise_system.history.tracked uses mise_oci.manifest, so a change to mise_oci.manifest can break mise_system.history.tracked, while a change to mise_system.history.tracked can't break mise_oci.manifest.
Position
Below the diagonal: mise_system.history.tracked uses a module listed above it, which is the healthy direction.
mise_system.history.tracked uses mise_system.history.shadow, so a change to mise_system.history.shadow can break mise_system.history.tracked, while a change to mise_system.history.tracked can't break mise_system.history.shadow.
Position
Below the diagonal: mise_system.history.tracked uses a module listed above it, which is the healthy direction.
mise_system.history.tracked uses mise_lsp.tasks, so a change to mise_lsp.tasks can break mise_system.history.tracked, while a change to mise_system.history.tracked can't break mise_lsp.tasks.
Position
Below the diagonal: mise_system.history.tracked uses a module listed above it, which is the healthy direction.
mise_system.history.tracked uses mise_system.files, so a change to mise_system.files can break mise_system.history.tracked, while a change to mise_system.history.tracked can't break mise_system.files.
Position
Below the diagonal: mise_system.history.tracked uses a module listed above it, which is the healthy direction.
21→25 mise_system.history.tracked uses mise_system.history.purgepart of a loop✕
Connections
2 pairs of types, where a type in mise_system.history.tracked uses a type in mise_system.history.purge.
mise_system.history.tracked uses mise_system.history.purge, so a change to mise_system.history.purge can break mise_system.history.tracked, while a change to mise_system.history.tracked can't break mise_system.history.purge.
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.
mise.toolset.tool_request uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.toolset.tool_request, while a change to mise.toolset.tool_request can't break mise_oci.manifest.
Position
Below the diagonal: mise.toolset.tool_request uses a module listed above it, which is the healthy direction.
mise.toolset.tool_request uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.toolset.tool_request, while a change to mise.toolset.tool_request can't break mise.args.backend_arg.
Position
Below the diagonal: mise.toolset.tool_request uses a module listed above it, which is the healthy direction.
mise.toolset.tool_request uses mise.toolset.tool_version, so a change to mise.toolset.tool_version can break mise.toolset.tool_request, while a change to mise.toolset.tool_request can't break mise.toolset.tool_version.
Position
Below the diagonal: mise.toolset.tool_request uses a module listed above it, which is the healthy direction.
mise_system.history.checkpoint uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_system.history.checkpoint, while a change to mise_system.history.checkpoint can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_system.history.checkpoint uses a module listed above it, which is the healthy direction.
mise_system.history.checkpoint uses mise_system.history.shadow, so a change to mise_system.history.shadow can break mise_system.history.checkpoint, while a change to mise_system.history.checkpoint can't break mise_system.history.shadow.
Position
Below the diagonal: mise_system.history.checkpoint uses a module listed above it, which is the healthy direction.
mise_system.history.checkpoint uses mise_lsp.tasks, so a change to mise_lsp.tasks can break mise_system.history.checkpoint, while a change to mise_system.history.checkpoint can't break mise_lsp.tasks.
Position
Below the diagonal: mise_system.history.checkpoint uses a module listed above it, which is the healthy direction.
mise_system.history.checkpoint uses mise_system.history.tracked, so a change to mise_system.history.tracked can break mise_system.history.checkpoint, while a change to mise_system.history.checkpoint can't break mise_system.history.tracked.
Position
Below the diagonal: mise_system.history.checkpoint uses a module listed above it, which is the healthy direction.
23→25 mise_system.history.checkpoint uses mise_system.history.purgepart of a loop✕
Connections
1 pair of types, where a type in mise_system.history.checkpoint uses a type in mise_system.history.purge.
mise_system.history.checkpoint uses mise_system.history.purge, so a change to mise_system.history.purge can break mise_system.history.checkpoint, while a change to mise_system.history.checkpoint can't break mise_system.history.purge.
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.
mise.args.tool_arg uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.args.tool_arg, while a change to mise.args.tool_arg can't break mise.args.backend_arg.
Position
Below the diagonal: mise.args.tool_arg uses a module listed above it, which is the healthy direction.
mise.args.tool_arg uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.args.tool_arg, while a change to mise.args.tool_arg can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.args.tool_arg uses a module listed above it, which is the healthy direction.
mise_system.history.purge uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_system.history.purge, while a change to mise_system.history.purge can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_system.history.purge uses a module listed above it, which is the healthy direction.
mise_system.history.purge uses mise_system.history.shadow, so a change to mise_system.history.shadow can break mise_system.history.purge, while a change to mise_system.history.purge can't break mise_system.history.shadow.
Position
Below the diagonal: mise_system.history.purge uses a module listed above it, which is the healthy direction.
mise_system.history.purge uses mise_lsp.tasks, so a change to mise_lsp.tasks can break mise_system.history.purge, while a change to mise_system.history.purge can't break mise_lsp.tasks.
Position
Below the diagonal: mise_system.history.purge uses a module listed above it, which is the healthy direction.
mise_system.history.purge uses mise_system.history.tracked, so a change to mise_system.history.tracked can break mise_system.history.purge, while a change to mise_system.history.purge can't break mise_system.history.tracked.
Position
Below the diagonal: mise_system.history.purge uses a module listed above it, which is the healthy direction.
mise_system.history.purge uses mise_system.history.checkpoint, so a change to mise_system.history.checkpoint can break mise_system.history.purge, while a change to mise_system.history.purge can't break mise_system.history.checkpoint.
Position
Below the diagonal: mise_system.history.purge uses a module listed above it, which is the healthy direction.
mise_dotenv uses mise_system.history.purge, so a change to mise_system.history.purge can break mise_dotenv, while a change to mise_dotenv can't break mise_system.history.purge.
Position
Below the diagonal: mise_dotenv uses a module listed above it, which is the healthy direction.
mise.toolset uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.toolset, while a change to mise.toolset can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.toolset uses a module listed above it, which is the healthy direction.
mise.toolset uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.toolset, while a change to mise.toolset can't break mise_oci.manifest.
Position
Below the diagonal: mise.toolset uses a module listed above it, which is the healthy direction.
mise.toolset uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.toolset, while a change to mise.toolset can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.toolset uses a module listed above it, which is the healthy direction.
mise.toolset uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.toolset, while a change to mise.toolset can't break mise.args.backend_arg.
Position
Below the diagonal: mise.toolset uses a module listed above it, which is the healthy direction.
mise.toolset uses mise.toolset.tool_version, so a change to mise.toolset.tool_version can break mise.toolset, while a change to mise.toolset can't break mise.toolset.tool_version.
Position
Below the diagonal: mise.toolset uses a module listed above it, which is the healthy direction.
mise.toolset uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.toolset, while a change to mise.toolset can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.toolset uses a module listed above it, which is the healthy direction.
mise.install_context uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.install_context, while a change to mise.install_context can't break mise_oci.manifest.
Position
Below the diagonal: mise.install_context uses a module listed above it, which is the healthy direction.
mise.install_context uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.install_context, while a change to mise.install_context can't break mise.args.backend_arg.
Position
Below the diagonal: mise.install_context uses a module listed above it, which is the healthy direction.
mise.install_context uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.install_context, while a change to mise.install_context can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.install_context uses a module listed above it, which is the healthy direction.
mise.install_context uses mise.toolset, so a change to mise.toolset can break mise.install_context, while a change to mise.install_context can't break mise.toolset.
Position
Below the diagonal: mise.install_context uses a module listed above it, which is the healthy direction.
mise.lockfile uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.lockfile, while a change to mise.lockfile can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.lockfile uses a module listed above it, which is the healthy direction.
mise.lockfile uses mise_dotenv.err, so a change to mise_dotenv.err can break mise.lockfile, while a change to mise.lockfile can't break mise_dotenv.err.
Position
Below the diagonal: mise.lockfile uses a module listed above it, which is the healthy direction.
mise.lockfile uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.lockfile, while a change to mise.lockfile can't break mise_oci.manifest.
Position
Below the diagonal: mise.lockfile uses a module listed above it, which is the healthy direction.
mise.lockfile uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.lockfile, while a change to mise.lockfile can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.lockfile uses a module listed above it, which is the healthy direction.
mise.lockfile uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.lockfile, while a change to mise.lockfile can't break mise.args.backend_arg.
Position
Below the diagonal: mise.lockfile uses a module listed above it, which is the healthy direction.
mise.lockfile uses mise.toolset.tool_version, so a change to mise.toolset.tool_version can break mise.lockfile, while a change to mise.lockfile can't break mise.toolset.tool_version.
Position
Below the diagonal: mise.lockfile uses a module listed above it, which is the healthy direction.
mise.lockfile uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.lockfile, while a change to mise.lockfile can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.lockfile uses a module listed above it, which is the healthy direction.
mise.lockfile uses aqua_registry.template, so a change to aqua_registry.template can break mise.lockfile, while a change to mise.lockfile can't break aqua_registry.template.
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.
aqua_registry.template uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break aqua_registry.template, while a change to aqua_registry.template can't break mise_lsp.diagnostics.
Position
Below the diagonal: aqua_registry.template uses a module listed above it, which is the healthy direction.
aqua_registry.template uses mise.lockfile, so a change to mise.lockfile can break aqua_registry.template, while a change to aqua_registry.template can't break mise.lockfile.
Position
Below the diagonal: aqua_registry.template uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in mise.task uses a type in mise.cli.doctor.path.
The types involved
mise.task.Task → mise.cli.doctor.path.Path
mise.task.task$module → mise.cli.doctor.path.Path
Direction
mise.task uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.task, while a change to mise.task can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.task uses a module listed above it, which is the healthy direction.
mise.task uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.task, while a change to mise.task can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.task uses a module listed above it, which is the healthy direction.
mise.task uses aqua_registry.template, so a change to aqua_registry.template can break mise.task, while a change to mise.task can't break aqua_registry.template.
Position
Below the diagonal: mise.task uses a module listed above it, which is the healthy direction.
mise_daemons.presets uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_daemons.presets, while a change to mise_daemons.presets can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_daemons.presets uses a module listed above it, which is the healthy direction.
mise_daemons.presets uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise_daemons.presets, while a change to mise_daemons.presets can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise_daemons.presets uses a module listed above it, which is the healthy direction.
mise_daemons.presets uses aqua_registry.template, so a change to aqua_registry.template can break mise_daemons.presets, while a change to mise_daemons.presets can't break aqua_registry.template.
Position
Below the diagonal: mise_daemons.presets uses a module listed above it, which is the healthy direction.
mise_system uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_system, while a change to mise_system can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_system uses a module listed above it, which is the healthy direction.
mise_system uses mise_oci.manifest, so a change to mise_oci.manifest can break mise_system, while a change to mise_system can't break mise_oci.manifest.
Position
Below the diagonal: mise_system uses a module listed above it, which is the healthy direction.
mise_system uses mise_system_packages, so a change to mise_system_packages can break mise_system, while a change to mise_system can't break mise_system_packages.
Position
Below the diagonal: mise_system uses a module listed above it, which is the healthy direction.
mise_system uses aqua_registry.template, so a change to aqua_registry.template can break mise_system, while a change to mise_system can't break aqua_registry.template.
Position
Below the diagonal: mise_system uses a module listed above it, which is the healthy direction.
mise_system.history.watch.runtime uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise_system.history.watch.runtime, while a change to mise_system.history.watch.runtime can't break mise.cli.doctor.path.
Position
Below the diagonal: mise_system.history.watch.runtime uses a module listed above it, which is the healthy direction.
mise_system.history.watch.runtime uses mise.cli.settings, so a change to mise.cli.settings can break mise_system.history.watch.runtime, while a change to mise_system.history.watch.runtime can't break mise.cli.settings.
Position
Below the diagonal: mise_system.history.watch.runtime uses a module listed above it, which is the healthy direction.
mise_system.history.watch.runtime uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise_system.history.watch.runtime, while a change to mise_system.history.watch.runtime can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise_system.history.watch.runtime uses a module listed above it, which is the healthy direction.
mise_system.history.watch.runtime uses mise_system.history.tracked, so a change to mise_system.history.tracked can break mise_system.history.watch.runtime, while a change to mise_system.history.watch.runtime can't break mise_system.history.tracked.
Position
Below the diagonal: mise_system.history.watch.runtime uses a module listed above it, which is the healthy direction.
mise_system.history.watch.runtime uses mise_system.history.checkpoint, so a change to mise_system.history.checkpoint can break mise_system.history.watch.runtime, while a change to mise_system.history.watch.runtime can't break mise_system.history.checkpoint.
Position
Below the diagonal: mise_system.history.watch.runtime uses a module listed above it, which is the healthy direction.
mise_system.history.watch.runtime uses aqua_registry.template, so a change to aqua_registry.template can break mise_system.history.watch.runtime, while a change to mise_system.history.watch.runtime can't break aqua_registry.template.
Position
Below the diagonal: mise_system.history.watch.runtime uses a module listed above it, which is the healthy direction.
mise.backend uses mise.backend.backend_type, so a change to mise.backend.backend_type can break mise.backend, while a change to mise.backend can't break mise.backend.backend_type.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.backend, while a change to mise.backend can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.backend, while a change to mise.backend can't break mise_oci.manifest.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise.backend.platform_target, so a change to mise.backend.platform_target can break mise.backend, while a change to mise.backend can't break mise.backend.platform_target.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.backend, while a change to mise.backend can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.backend, while a change to mise.backend can't break mise.args.backend_arg.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise.toolset.tool_version, so a change to mise.toolset.tool_version can break mise.backend, while a change to mise.backend can't break mise.toolset.tool_version.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.backend, while a change to mise.backend can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise.install_context, so a change to mise.install_context can break mise.backend, while a change to mise.backend can't break mise.install_context.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses aqua_registry.template, so a change to aqua_registry.template can break mise.backend, while a change to mise.backend can't break aqua_registry.template.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.backend uses mise_daemons.presets, so a change to mise_daemons.presets can break mise.backend, while a change to mise.backend can't break mise_daemons.presets.
Position
Below the diagonal: mise.backend uses a module listed above it, which is the healthy direction.
mise.config uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.config, while a change to mise.config can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.config uses a module listed above it, which is the healthy direction.
mise.config uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.config, while a change to mise.config can't break mise_oci.manifest.
Position
Below the diagonal: mise.config uses a module listed above it, which is the healthy direction.
mise.config uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.config, while a change to mise.config can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.config uses a module listed above it, which is the healthy direction.
mise.config uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.config, while a change to mise.config can't break mise.args.backend_arg.
Position
Below the diagonal: mise.config uses a module listed above it, which is the healthy direction.
mise.config uses mise.toolset.tool_version, so a change to mise.toolset.tool_version can break mise.config, while a change to mise.config can't break mise.toolset.tool_version.
Position
Below the diagonal: mise.config uses a module listed above it, which is the healthy direction.
mise.config uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.config, while a change to mise.config can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.config uses a module listed above it, which is the healthy direction.
mise.config.config_file uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.config.config_file, while a change to mise.config.config_file can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.config.config_file uses a module listed above it, which is the healthy direction.
mise.config.config_file uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.config.config_file, while a change to mise.config.config_file can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.config.config_file uses a module listed above it, which is the healthy direction.
mise.config.config_file uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.config.config_file, while a change to mise.config.config_file can't break mise.args.backend_arg.
Position
Below the diagonal: mise.config.config_file uses a module listed above it, which is the healthy direction.
mise.config.config_file uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.config.config_file, while a change to mise.config.config_file can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.config.config_file uses a module listed above it, which is the healthy direction.
mise.config.config_file uses aqua_registry.template, so a change to aqua_registry.template can break mise.config.config_file, while a change to mise.config.config_file can't break aqua_registry.template.
Position
Below the diagonal: mise.config.config_file uses a module listed above it, which is the healthy direction.
mise.config.config_file uses mise.task, so a change to mise.task can break mise.config.config_file, while a change to mise.config.config_file can't break mise.task.
Position
Below the diagonal: mise.config.config_file uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.backend.backend_type, so a change to mise.backend.backend_type can break mise.backend.github, while a change to mise.backend.github can't break mise.backend.backend_type.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.backend.github, while a change to mise.backend.github can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.backend.github, while a change to mise.backend.github can't break mise_oci.manifest.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.backend.platform_target, so a change to mise.backend.platform_target can break mise.backend.github, while a change to mise.backend.github can't break mise.backend.platform_target.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.backend.options, so a change to mise.backend.options can break mise.backend.github, while a change to mise.backend.github can't break mise.backend.options.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise_config.tools.schema, so a change to mise_config.tools.schema can break mise.backend.github, while a change to mise.backend.github can't break mise_config.tools.schema.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.backend.github, while a change to mise.backend.github can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.backend.github, while a change to mise.backend.github can't break mise.args.backend_arg.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.toolset.tool_version, so a change to mise.toolset.tool_version can break mise.backend.github, while a change to mise.backend.github can't break mise.toolset.tool_version.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.backend.github, while a change to mise.backend.github can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.install_context, so a change to mise.install_context can break mise.backend.github, while a change to mise.backend.github can't break mise.install_context.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.lockfile, so a change to mise.lockfile can break mise.backend.github, while a change to mise.backend.github can't break mise.lockfile.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses aqua_registry.template, so a change to aqua_registry.template can break mise.backend.github, while a change to mise.backend.github can't break aqua_registry.template.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise_daemons.presets, so a change to mise_daemons.presets can break mise.backend.github, while a change to mise.backend.github can't break mise_daemons.presets.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.github uses mise.backend, so a change to mise.backend can break mise.backend.github, while a change to mise.backend.github can't break mise.backend.
Position
Below the diagonal: mise.backend.github uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.backend.backend_type, so a change to mise.backend.backend_type can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.backend.backend_type.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise_oci.manifest, so a change to mise_oci.manifest can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise_oci.manifest.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.backend.platform_target, so a change to mise.backend.platform_target can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.backend.platform_target.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.backend.options, so a change to mise.backend.options can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.backend.options.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise_config.tools.schema, so a change to mise_config.tools.schema can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise_config.tools.schema.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise_lsp.diagnostics, so a change to mise_lsp.diagnostics can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise_lsp.diagnostics.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.args.backend_arg.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.toolset.tool_version, so a change to mise.toolset.tool_version can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.toolset.tool_version.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.install_context, so a change to mise.install_context can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.install_context.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.lockfile, so a change to mise.lockfile can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.lockfile.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise_daemons.presets, so a change to mise_daemons.presets can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise_daemons.presets.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.backend.packslip uses mise.backend, so a change to mise.backend can break mise.backend.packslip, while a change to mise.backend.packslip can't break mise.backend.
Position
Below the diagonal: mise.backend.packslip uses a module listed above it, which is the healthy direction.
mise.config.config_file.mise_toml uses mise.cli.doctor.path, so a change to mise.cli.doctor.path can break mise.config.config_file.mise_toml, while a change to mise.config.config_file.mise_toml can't break mise.cli.doctor.path.
Position
Below the diagonal: mise.config.config_file.mise_toml uses a module listed above it, which is the healthy direction.
mise.config.config_file.mise_toml uses mise.args.backend_arg, so a change to mise.args.backend_arg can break mise.config.config_file.mise_toml, while a change to mise.config.config_file.mise_toml can't break mise.args.backend_arg.
Position
Below the diagonal: mise.config.config_file.mise_toml uses a module listed above it, which is the healthy direction.
mise.config.config_file.mise_toml uses mise.toolset.tool_request, so a change to mise.toolset.tool_request can break mise.config.config_file.mise_toml, while a change to mise.config.config_file.mise_toml can't break mise.toolset.tool_request.
Position
Below the diagonal: mise.config.config_file.mise_toml uses a module listed above it, which is the healthy direction.
mise.config.config_file.mise_toml uses mise_dotenv, so a change to mise_dotenv can break mise.config.config_file.mise_toml, while a change to mise.config.config_file.mise_toml can't break mise_dotenv.
Position
Below the diagonal: mise.config.config_file.mise_toml uses a module listed above it, which is the healthy direction.
mise.config.config_file.mise_toml uses aqua_registry.template, so a change to aqua_registry.template can break mise.config.config_file.mise_toml, while a change to mise.config.config_file.mise_toml can't break aqua_registry.template.
Position
Below the diagonal: mise.config.config_file.mise_toml uses a module listed above it, which is the healthy direction.
mise.config.config_file.mise_toml uses mise.task, so a change to mise.task can break mise.config.config_file.mise_toml, while a change to mise.config.config_file.mise_toml can't break mise.task.
Position
Below the diagonal: mise.config.config_file.mise_toml uses a module listed above it, which is the healthy direction.
mise.config.config_file.mise_toml uses mise.config.config_file, so a change to mise.config.config_file can break mise.config.config_file.mise_toml, while a change to mise.config.config_file.mise_toml can't break mise.config.config_file.
Position
Below the diagonal: mise.config.config_file.mise_toml uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 88% · Adequate · gated by D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
21
High / Critical
A02:2025 — Security Misconfiguration
14
High / Critical
A03:2025 — Software Supply Chain Failures
11
High / Critical
A01:2025 — Broken Access Control
1
Medium
Roadmap
First, secure the server's transport by enforcing TLS and HSTS headers across all frameworks or proxies. Second, enforce accessibility by integrating axe or pa11y into the test suite and CI pipeline to catch violations early. Third, add text alternatives like alt tags and captions to all media elements. Fourth, improve outbound HTTP resilience by setting request timeouts and adding retry logic with back-off. Finally, resolve the seven secret exposure findings in the GitHub workflow files.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Secure the server's transport: serve TLS itself (`HttpServer::bind_rustls_0_23(addr, config)` in actix-web, `axum_server::bind_rustls(addr, RustlsConfig::from_pem_file(…))`, tonic's `Server::builder().tls_config(ServerTlsConfig::new().identity(…))`, Rocket's `[default.tls]`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only.
Enforce accessibility in the toolchain: add an accessibility check that can read your UI — no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
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 — 36
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 — 2088
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 — 95
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 10
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 76 of 76 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 76 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, 2175 of 2219 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.rs, .ts, .ps1, .mjs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference (.NET: C#, VB.NET and F# alike), lcov — `swift test --enable-code-coverage` or `xcodebuild -enableCodeCoverage YES` then `xcrun llvm-cov export -format=lcov` (Swift/Xcode), `cargo llvm-cov --lcov`, `go test -coverprofile`, `rebar3 do eunit --cover, cover` or covertool (Erlang/BEAM), `flutter test --coverage` or `dart test --coverage=coverage` then `dart run coverage:format_coverage --lcov` (Dart/Flutter), `sbt clean coverage test coverageReport` via the sbt-scoverage plugin in `project/plugins.sbt` (Scala/sbt), jest/nyc, JaCoCo/Cobertura XML, coverage.py … most ecosystems' coverage tools can emit one) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference (.NET: C#, VB.NET and F# alike), lcov — `swift test --enable-code-coverage` or `xcodebuild -enableCodeCoverage YES` then `xcrun llvm-cov export -format=lcov` (Swift/Xcode), `cargo llvm-cov --lcov`, `go test -coverprofile`, `rebar3 do eunit --cover, cover` or covertool (Erlang/BEAM), `flutter test --coverage` or `dart test --coverage=coverage` then `dart run coverage:format_coverage --lcov` (Dart/Flutter), `sbt clean coverage test coverageReport` via the sbt-scoverage plugin in `project/plugins.sbt` (Scala/sbt), jest/nyc, JaCoCo/Cobertura XML, coverage.py … most ecosystems' coverage tools can emit one) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 213 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 72 test source file(s) (.rs, .ps1) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs, .ts, .ps1, .mjs) and this repository declares a Cargo test suite (repository root, 562 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. `docs/.vitepress/theme/index.ts`, `docs/.vitepress/theme/showreel/handoff.ts`, `docs/.vitepress/theme/showreel/score/cues.ts`, `docs/.vitepress/theme/showreel/score/harmony.ts`, `docs/.vitepress/theme/showreel/timeline.ts` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via REDACTED (REDACTED). docker build failed (exit 1) — 3 | LABEL maintainer="jdx" -------------------- ERROR: failed to solve: failed to resolve source metadata for docker.io/docker/dockerfile:1@sha256:4edf897a3ffa55b89f906fc8cc78afdb3f1834cc9c7083565e611a8a7d5fe99e: failed to do request: Head "https://registry-1.docker.io/v2/docker/dockerfile/manifests/sha256:4edf897a3ffa55b89f906fc8cc78afdb3f1834cc9c7083565e611a8a7d5fe99e": Forbidden; runtime evidence skipped.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Python, Rust, Swift, Vue components, lua, objectivec is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Python, Rust, Swift, Vue components, lua, objectivec is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python and Rust source only, and no C# was loaded, and no named async function in this repository's JavaScript/TypeScript, nor any Go, PHP or Dart function or Kotlin suspend function, makes a request that can be cancelled (fetch, axios, ky, ofetch; net/http, net.Dial; amphp; Dio; Ktor, OkHttp), so there is nothing to judge, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations: 4 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned 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.
D32 Data Compliance (PII/GDPR): PII/GDPR signals are heuristic pattern matches in code — they flag likely handling concerns, not legal compliance, and cannot trace where data actually flows at runtime.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
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 domain 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.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
348 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was EnvResults::resolve_with_toolset at 96. A further 13 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 Commands::run at 79 — they are counted neither in the figure above nor in this dimension's score. 7 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: src/cli/dotfiles/mod.rs (Dotfiles::dispatch at 23), src/backend/backend_type.rs (BackendType::guess at 21), crates/mise-system-packages/src/brew/tap_cask_metadata.rb (JSON.generate at 16), crates/mise-system-packages/src/brew/tap_formula_metadata.rb (JSON.generate at 16), crates/mise-interactive-config/src/editor/handlers.rs (InteractiveConfig::handle_navigate_key at 16), and 2 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.
+ 129 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 18 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with EnvResults::resolve_with_toolset (cyclomatic 96), mise_system::history::watch::runtime::run (cyclomatic 94), Daemons::run (cyclomatic 94). — 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 18 together lifts Cyclomatic Complexity from 6.1 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 191 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 14 bodies over 120 down to 120 or less in Cognitive Complexity — start with EnvResults::resolve_with_toolset (cognitive 231), mise_system::history::watch::runtime::run (cognitive 220), Lock::get_tools_to_lock (cognitive 197). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 14 together lifts Cognitive Complexity from 3.0 to about 4.2/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.4 / 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.
TooManyMethods: Formula · ×31crates/mise-system-packages/src/brew/shim.rb:575
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 124 FileTooLong finding(s) in God Classes — start with mod.rs (10), http.rs (2), github.rs (2). — One of this dimension's main actionable groups (124 warning-level).
Resolve the 89 MethodTooLong finding(s) in God Classes — start with mod.rs (8), aqua.rs (5), http.rs (4). — One of this dimension's main actionable groups (89 warning-level).
Resolve the 62 FunctionTooLong finding(s) in God Classes — start with files.rs (7), lib.rs (5), lockfile.rs (4). — One of this dimension's main actionable groups (62 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
416 duplicated block group(s) detected. A further 13 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 1 of the 429 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.
+ 82 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 39 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with REDACTED (4), mod.rs (3), builder.rs (3). — One of this dimension's main actionable groups (39 warning-level).
Resolve the 39 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with tera.rs (2), mod.rs (2), lib.rs. — One of this dimension's main actionable groups (39 warning-level).
Resolve the 38 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with choco.rs (2), files.rs (2), ls.rs (2). — One of this dimension's main actionable groups (38 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling5.1 / 10Adequate✓ 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.
22 production modules (Cargo), 0 dependency cycle(s), 2 unstable depended-on module(s). Read from the build's own module declarations; 11 module(s) off the main sequence, with abstractness counted on 21 of the 22 (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: mise-agent-env · ×11
Unstable project mise-oci
Unstable project mise-system-packages
What to do
Resolve the 11 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 1 Unstable project mise-oci finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project mise-system-packages finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 20 Low cohesion finding(s) in Cohesion (LCOM4) — start with mod.rs (2), dotnet.rs (2), node.rs. — One of this dimension's main actionable groups (20 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
7558 test methods: 7543 unit, 5 integration, 0 BDD, 10 e2e. The JavaScript/TypeScript suite contributes 213 `it`/`test` case(s) across 30 test file(s) declaring at least one; its tier split is read from package names and paths only. The Rust suite contributes 7307 `#[test]` function(s) across 562 file(s) declaring at least one; its unit/integration split is Cargo's own — 2 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test. The Python suite contributes 38 test function(s) across 2 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality9.9 / 10Stronggated by 1 serious finding✓ 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.
7 skipped (7 with a documented reason), 1 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 213 tests. Measured on the JavaScript/TypeScript suite only — at least 72 test source file(s) (.rs, .ps1) went unread, so its test quality is unmeasured and is not in these counts.
No assertions: built-page checks offer the showreel as og:video on the homepage onlydocs/.vitepress/social-images.test.mjs:160
Skipped (documented): a real capture run and the reference set agree on shape · ×7docs/.vitepress/theme/showreel/test/captures.test.ts:201
What to do
Resolve the 1 No assertions finding(s) in Test Quality — start with social-images.test.mjs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
15 outdated, 0 yanked direct Cargo dependencies. 166 of 169 direct crates were graded against crates.io (0 not published there, 3 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Outdated: aws-sdk-s3 · ×15
✓ On the Gold path — maintain.
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.
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 1129 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares package.json, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
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: src/cli/bootstrap.rs (101×93=9393); src/backend/mod.rs (122×67=8174); src/cli/mod.rs (79×79=6241) Repeated repair below the complexity floor: src/errors.rs (8 of 15 changes were fixes); crates/aqua-registry/src/types.rs (8 of 14 changes were fixes); src/cli/dotfiles/history_status.rs (7 of 12 changes were fixes)
Resolve the 156 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (12), run.rs (3), install.rs (3). — One of this dimension's main actionable groups (156 warning-level).
Resolve the 17 Repeated repair finding(s) in Churn × Complexity Hotspots — start with errors.rs, types.rs, history_status.rs. — One of this dimension's main actionable groups (17 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor7.5 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
175 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/cli/bootstrap.rs. Counted over 719 of the 934 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
48 deducted task-comment markers across 559497 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
TodoComment · ×48src/lockfile.rs:1731
What to do
Resolve the 48 TodoComment finding(s) in Explicit Debt — start with mod.rs (5), python.rs (3), vfox.rs (3). — One of this dimension's main actionable groups (48 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 198 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
5 of 22 build units (Cargo, npm) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
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).
21 finding(s): 0 critical, 18 high, 3 medium, 0 low. semgrep hit a parse error in 41 file(s) — `benchmarks/task-cache/benchmark.sh` (line 45), `crates/mise-shim/src/windows_process.rs` (line 49, line 85), `crates/mise-util/src/cache.rs` (line 757, line 794, line 821, …), `crates/mise-util/src/forgejo.rs` (line 87, line 174), `crates/mise-util/src/github.rs` (line 252, line 286, line 354, …), … (+36 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. 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
+ 7 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 7 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED (3), REDACTED. — One of this dimension's main actionable groups (7 issue-level).
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 3 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 10 High IaC finding(s) in IaC & Container Security — start with REDACTED (10). — One of this dimension's main actionable groups (10 issue-level).
Resolve the 4 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (4). — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D32 · Data Compliance (PII/GDPR)8.1 / 10Strong✓ Tool-verified
What it measures: Likely personal-data (PII / GDPR) handling concerns — logging or storing data without safeguards.
Method: Heuristic PII/GDPR LEAK scan via semgrep across the repo, using Watchdog's own ruleset: personal data crossing a boundary it should not — reaching a log/console sink, a URL or query string, or unprotected browser storage. Matches map to severity and a 0-10 wide normalizer. A clean sweep is unscored rather than an unearned 10, and is a statement about the leak paths checked only — this dimension does not inventory the personal data a repository holds (the personal-data map and the C1-C5 compliance cards do that), so it never reports that a repository has no personal-data surface. Reported LOUDLY as a measurement gap if the ruleset is missing from the analyzer image. Exhaustive over the leak paths, advisory-leaning; degrades on parse failure.
2 finding(s): 0 critical, 0 high, 2 medium, 0 low. semgrep could not parse 5 file(s) — `docs/.vitepress/theme/index.ts`, `docs/.vitepress/theme/showreel/handoff.ts`, `docs/.vitepress/theme/showreel/score/cues.ts`, `docs/.vitepress/theme/showreel/score/harmony.ts`, `docs/.vitepress/theme/showreel/timeline.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Data Compliance (PII/GDPR) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d32_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 719 of the 934 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 4 Boundary-crossing change coupling finding(s) in Change Coupling — start with lib.rs (3), resources.rs. — One of this dimension's main actionable groups (4 issue-level).
Resolve the 20 Change coupling finding(s) in Change Coupling — start with install.rs (3), envrc.rs (2), cache.rs. — One of this dimension's main actionable groups (20 warning-level).
Resolve the 1 Change coupling clique finding(s) in Change Coupling — start with ls.rs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives4.3 / 10Weak✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
Video with no captions <track> offers no captions. This player's source is set at runtime, so there is no caption file to author here: give the player a way to carry captions — accept a track/captions URL alongside the media and render a <track kind="captions"> when one is supplied — and capture that asset wherever the media enters the product (upload, import or generation). — docs/.vitepress/theme/HomeShowreel.vue:168
What to do
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Do you agree with this assessment?
AC2 · Forms & labels6.6 / 10Adequate✓ Tool-verified
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label. (×2) — docs/components/registry.vue:32, docs/components/registry.vue:52
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). — docs/components/config-key-detail.vue:158
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no a11y linter (an accessibility check that can read your UI — no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 13 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the toolchain: add an accessibility check that can read your UI — no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether 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 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.
`TasksValidate.find_additional_graph_issues` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command. — src/cli/tasks/validate.rs:192
What to do
Keep query handlers read-only — move the writes/event-publishes into a command handler so reads stay safe to retry, cache, and route to a read replica.
Do you agree with this assessment?
DM4 · Rich vs anemic domain model10.0 / 10Exemplary✓ Tool-verified
Other · Domain Modelling — Whether domain entities own their behaviour (invariant-enforcing commands) rather than being data-only structs driven by a foreign service.
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.
Other · Domain Modelling — Whether a domain type's identity-bearing field stays immutable — a `pub` mutable field under a hand-rolled Hash/PartialEq breaks the value-identity invariant.
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.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 17 of 24 project(s) that lack one — worth up to 1.4 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability8.6 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 14/16 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/mise-shim`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Add a health-check endpoint (a /health route on your axum/actix router) so orchestrators and load balancers can probe liveness/readiness.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
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 & Backup4.0 / 10Weak✓ 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.
What to do
Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
Enable purge protection / soft-delete (and prevent_destroy on critical resources) so data stores can't be lost to an accidental or malicious delete.
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.
`Client::builder()` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×2) — crates/mise-tls/src/lib.rs:95, crates/mise-tls/src/lib.rs:98
`ClientBuilder::new()` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×2) — crates/vfox/src/http.rs:13, crates/vfox/src/http.rs:20
What to do
Give every client a whole-request bound: `reqwest::Client::builder().timeout(Duration::from_secs(10))` (never `reqwest::get` or `Client::new()`, which have none), ureq's `timeout_global`, or wrap the call in `tokio::time::timeout`; add retry with back-off (`reqwest-retry`'s `RetryTransientMiddleware`, `backoff`) around dependencies that fail.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`fs.readFileSync` in `load` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — docs/settings.data.ts:103
What to do
TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
Other · Security — Read from this repository's Rust source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. This repository serves HTTP itself (`axum::serve(` (crates/mise-util/src/github_relay.rs:525)), so its Rust source was also read for the server controls: TLS served or HSTS set, security response headers, cookie flags and inbound validation — each credited where its Rust spelling appears in production source, not proven on every route. A Rocket 0.5 application is credited the headers Rocket's default `Shield` sends unless it attaches its own, and its cookie jar's SameSite=Strict default; a session middleware its default cookie flags.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
This repository starts an HTTP server and nothing in its Rust source or committed `Rocket.toml` secures the transport: no TLS served (actix-web `bind_rustls`/`bind_openssl`, axum-server `bind_rustls` with a `RustlsConfig`, tonic `ServerTlsConfig`, a `TlsAcceptor`, Rocket's `[default.tls]`), no `Strict-Transport-Security` header, no `X-Forwarded-Proto` read from a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: `axum::serve(` (crates/mise-util/src/github_relay.rs:525).
None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Rust server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: `axum::serve(` (crates/mise-util/src/github_relay.rs:525).
No handler of this repository's Rust server answers 400, 413 or 422 (`StatusCode::BAD_REQUEST`, `HttpResponse::BadRequest()`, `Status::BadRequest`, tonic `Status::invalid_argument`), and nothing declares validation — no `validator`/`garde` derive, no body limit (`DefaultBodyLimit::max`, `RequestBodyLimitLayer`, `JsonConfig::default().limit(…)`, Rocket `Limits`) — nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (−2.0 on this card.) The server: `axum::serve(` (crates/mise-util/src/github_relay.rs:525).
What to do
Secure the server's transport: serve TLS itself (`HttpServer::bind_rustls_0_23(addr, config)` in actix-web, `axum_server::bind_rustls(addr, RustlsConfig::from_pem_file(…))`, tonic's `Server::builder().tls_config(ServerTlsConfig::new().identity(…))`, Rocket's `[default.tls]`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only.
Set security response headers on what the server sends — actix-web's `DefaultHeaders::new().add((header::X_CONTENT_TYPE_OPTIONS, "nosniff"))`, tower-http's `SetResponseHeaderLayer::overriding(…)` on an axum router, or keep Rocket's default `Shield` — with `Content-Security-Policy`, `X-Content-Type-Options` and a frame policy on every response.
Validate what the server reads from a request — path, query, headers, body size and shape — and answer what fails with 400 (413 for an oversized body) before a handler acts on it: derive `validator::Validate` (or `garde::Validate`) on the request types and reject with `StatusCode::BAD_REQUEST`, and cap bodies with `DefaultBodyLimit::max`/`RequestBodyLimitLayer` or actix's `JsonConfig::default().limit(…)`.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen. Whether a walk over a `Hash` or `Set` (`each`, `each_pair`, `map`, `for … in` and the other block walks) leaves it alone — Ruby refuses `rehash`, `replace`, `compare_by_identity` and `transform_keys!` on a Hash, and `reset`, `replace`, `compare_by_identity` and `map!` on a Set, while it is being iterated: the call raises `RuntimeError` at once and the remaining entries are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
~1.4 `!` null assertions per 1k TypeScript source lines — 56 assertion(s) across the 40575 source line(s) of the 136 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: docs/.vitepress/theme/showreel/kit/diagrams/skills-link.ts (5), docs/.vitepress/mise-toml/scan.ts (4), docs/components/config-reference-toml.ts (4). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
What to do
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 5 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.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 35 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not included — 47 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.
AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Ruby imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one; this repository's Swift imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. No class in this Ruby code is a Rails controller, a Sinatra, Grape or Roda app, a Hanami action or a Rack app (an instance `call(env)`), so no request handler shares state between request threads. No Swift request handler (a Vapor, Hummingbird, Kitura, Swifter or Perfect route handler, as a method or a registered closure) is declared, so no state is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — no exported interface declares behaviour
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — 3 | LABEL maintainer="jdx" -------------------- ERROR: failed to solve: failed to resolve source metadata for docker.io/docker/dockerfile:1@sha256:4edf897a3ffa55b89f906fc8cc78afdb3f1834cc9c7083565e611a8a7d5fe99e: failed to do request: Head "https://registry-1.docker.io/v2/docker/dockerfile/manifests/sha256:4edf897a3ffa55b89f906fc8cc78afdb3f1834cc9c7083565e611a8a7d5fe99e": Forbidden; 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 a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, Python, Ruby, Rust, Swift, TypeScript not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rb, .rs, .swift, .ts, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Aggregate boundaries — this Rust crate declares no domain aggregate (a struct with private state and its own command methods), so DM1's aggregate-boundary read has no population to be taken over
DM2 Strongly-typed ids — the crate defines newtype typed-ids but declares no domain aggregate that could carry an id — so DM2's adoption ratio has no population to be taken over
DM3 Integration-event coupling — not applicable: no DDD domain layer was detected (no aggregate, entity or value-object structure), so there is no domain model for this card to grade
DM6 Domain ↔ infrastructure boundary — this Rust crate maps no type to a persistence framework (diesel/sea-orm/sqlx), so DM6's domain↔infrastructure fusion read has no population to be taken over
DM7 Repository granularity — not applicable: no DDD domain layer was detected (no aggregate, entity or value-object structure), so there is no domain model for this card to grade
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 — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: allocation awareness is rated where code engineers for it — at least 400 production lines that ship benchmarks or already use allocation-aware idioms (8 or more). This repository's Swift code has 67 production line(s), 0 such use(s) and no benchmarks, so there is no allocation work to rate. The card is reward-only: its absence costs nothing.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Ruby was read, and it logs through none: the standard library's Logger, which Rails.logger is, takes one finished message and no template arguments or fields (as log4net does in C#), so an interpolated message there loses nothing the API could have kept. The console gem (`Console.info`), SemanticLogger, Ougai and dry-logger would be judged.
X6 Hand-rolled structured-format parsing — 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.
Boundary-crossing change coupling: lib.rs ↔ upgrade.rs crates/mise-system-packages/src/lib.rs:1— `crates/mise-system-packages/src/lib.rs` (context crates) and `src/cli/system/upgrade.rs` (context cli) sit in DIFFERENT parts of the tree yet change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `48d2fd0e` feat(bootstrap): support zypper host packages (#13335) (at that commit the file was still `src/system/packages/mod.rs`); `82052914` fix(bootstrap): reject two spellings of one package that disagree (#1… (at that commit the file was still `src/system/packages/mod.rs`); `e09d0963` feat(bootstrap): add winget package manager support (#12928) (at that commit the file was still `src/system/packages/mod.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: resources.rs ↔ mod.rs crates/mise-system/src/resources.rs:1— `crates/mise-system/src/resources.rs` (context crates) and `src/system/mod.rs` (context system) sit in DIFFERENT parts of the tree yet change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `82052914` fix(bootstrap): reject two spellings of one package that disagree (#1… (at that commit the file was still `src/system/resources.rs`); `4252b279` feat(bootstrap): compose config roots (#12105) (at that commit the file was still `src/system/resources.rs`); `84c54e31` feat(bootstrap): support self-updating and adopted brew casks (#12074) (at that commit the file was still `src/system/resources.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: lib.rs ↔ mod.rs crates/mise-system-packages/src/lib.rs:1— `crates/mise-system-packages/src/lib.rs` (context crates) and `src/system/mod.rs` (context system) sit in DIFFERENT parts of the tree yet change together 50% of the time (11 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `39a82172` feat(bootstrap): enable COPR repositories with [bootstrap.dnf.repos] … (at that commit the file was still `src/system/packages/mod.rs`); `926dd15b` feat(bootstrap): add snap package manager (#14402) (at that commit the file was still `src/system/packages/mod.rs`); `82052914` fix(bootstrap): reject two spellings of one package that disagree (#1… (at that commit the file was still `src/system/packages/mod.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: lib.rs ↔ install.rs crates/mise-system-packages/src/lib.rs:1— `crates/mise-system-packages/src/lib.rs` (context crates) and `src/cli/system/install.rs` (context cli) sit in DIFFERENT parts of the tree yet change together 50% of the time (11 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `926dd15b` feat(bootstrap): add snap package manager (#14402) (at that commit the file was still `src/system/packages/mod.rs`); `48d2fd0e` feat(bootstrap): support zypper host packages (#13335) (at that commit the file was still `src/system/packages/mod.rs`); `82052914` fix(bootstrap): reject two spellings of one package that disagree (#1… (at that commit the file was still `src/system/packages/mod.rs`) — run `git show` on any of them.
AC2 · Forms & labels· Link with no accessible name · ×2
Link with no accessible name docs/components/registry.vue:32— A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label.
Link with no accessible name docs/components/registry.vue:52— A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label.
AX9 · CQS / query purity· Query writes persistent state on the read path · ×1
Query writes persistent state on the read path: TasksValidate.find_additional_graph_issues src/cli/tasks/validate.rs:192— `TasksValidate.find_additional_graph_issues` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command.
mise::lockfile::format (cognitive 110) src/lockfile.rs:6351— mise::lockfile::format has cognitive complexity 110 (threshold 15). Drivers by points: if/else 11 (64 pts), loops 6 (36 pts), match/switch 1 (8 pts), boolean chains 2 (nesting depth added 90). 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.
mise::lockfile::update_lockfiles (cognitive 101) src/lockfile.rs:3296— mise::lockfile::update_lockfiles has cognitive complexity 101 (threshold 15). Drivers by points: if/else 24 (61 pts), loops 12 (28 pts), boolean chains 9, match/switch 1 (3 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::packslip::fetch_files (cognitive 89) src/packslip.rs:319— mise::packslip::fetch_files has cognitive complexity 89 (threshold 15). Drivers by points: if/else 24 (73 pts), match/switch 4 (9 pts), boolean chains 6, loops 1 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::lockfile::auto_lock_new_versions (cognitive 85) src/lockfile.rs:4212— mise::lockfile::auto_lock_new_versions has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 10 (23 pts), boolean chains 4, match/switch 1 (3 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.
mise::lockfile::generate::generate (cognitive 77) src/lockfile/generate.rs:400— mise::lockfile::generate::generate has cognitive complexity 77 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 16 (28 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::config::expand_config_roots_inner_for (cognitive 70) src/config/mod.rs:5952— mise::config::expand_config_roots_inner_for has cognitive complexity 70 (threshold 15). Drivers by points: if/else 16 (46 pts), match/switch 5 (18 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 46). 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.
mise::config::merge_file_and_config_tasks (cognitive 70) src/config/mod.rs:6366— mise::config::merge_file_and_config_tasks has cognitive complexity 70 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 8 (19 pts), boolean chains 11 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::task::task_source_checker::compute_output_hash (cognitive 67) src/task/task_source_checker.rs:1133— mise::task::task_source_checker::compute_output_hash has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (46 pts), match/switch 3 (10 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 38). Of this number, 57 points are the body's own statements and 10 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.
mise::sops::decrypt (cognitive 66) src/sops.rs:43— mise::sops::decrypt has cognitive complexity 66 (threshold 15). Drivers by points: if/else 30 (57 pts), match/switch 3 (7 pts), boolean chains 2 (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.
mise::toolset::get_versions_needed_by_tracked_configs_with_progress (cognitive 64) src/toolset/mod.rs:995— mise::toolset::get_versions_needed_by_tracked_configs_with_progress has cognitive complexity 64 (threshold 15). Drivers by points: loops 9 (30 pts), if/else 8 (25 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 41). 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.
mise::lockfile::get_locked_version (cognitive 63) src/lockfile.rs:5414— mise::lockfile::get_locked_version has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 15, match/switch 5 (10 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
mise::lockfile::generate::is_current (cognitive 62) src/lockfile/generate.rs:256— mise::lockfile::generate::is_current has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (47 pts), boolean chains 9, loops 3 (6 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.
mise::backend::static_helpers::rename_executable_in_dir (cognitive 61) src/backend/static_helpers.rs:1255— mise::backend::static_helpers::rename_executable_in_dir has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (54 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
mise::config::discover_monorepo_subdirs (cognitive 59) src/config/mod.rs:6112— mise::config::discover_monorepo_subdirs has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (51 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 36). 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.
mise::system_install::apply_for_owner (cognitive 56) src/system_install.rs:339— mise::system_install::apply_for_owner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (34 pts), match/switch 7 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 32). 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.
mise::backend::static_helpers::clean_binary_name (cognitive 54) src/backend/static_helpers.rs:1716— mise::backend::static_helpers::clean_binary_name has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 7 (12 pts), boolean chains 2, match/switch 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::backend::cargo::native_binstall::install (cognitive 53) src/backend/cargo/native_binstall.rs:28— mise::backend::cargo::native_binstall::install has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (40 pts), loops 7 (13 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.
mise::hook_env::check_exit_early_fast (cognitive 53) src/hook_env.rs:217— mise::hook_env::check_exit_early_fast has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29 (39 pts), boolean chains 10, loops 4 (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.
mise::cli::shim::which_shim (cognitive 52) src/cli/shim.rs:368— mise::cli::shim::which_shim has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 9, loops 5 (9 pts), match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::lockfile::merge_tool_entries (cognitive 52) src/lockfile.rs:4838— mise::lockfile::merge_tool_entries has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 5 (13 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
mise::task::workspace::gradle::tokenize (cognitive 49) src/task/workspace/gradle.rs:181— mise::task::workspace::gradle::tokenize has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (18 pts), boolean chains 10 (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.
mise::cli::installs::migrate::recover_interrupted (cognitive 47) src/cli/installs/migrate.rs:392— mise::cli::installs::migrate::recover_interrupted has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 4 (5 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.
mise::config::load_tasks_includes (cognitive 45) src/config/mod.rs:6923— mise::config::load_tasks_includes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::task::task_source_checker::get_last_modified (cognitive 43) src/task/task_source_checker.rs:1465— mise::task::task_source_checker::get_last_modified has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 5 (13 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::task::task_list::get_task_lists (cognitive 42) src/task/task_list.rs:444— mise::task::task_list::get_task_lists has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 7, 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.
Hotspot: src/cli/bootstrap.rs src/cli/bootstrap.rs:1916— src/cli/bootstrap.rs changed 101 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in Bootstrap::run_phases at line 1916. 21 of those changes were fix/bug commits, and the other 80 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/bootstrap.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: src/backend/mod.rs src/backend/mod.rs:5023— src/backend/mod.rs changed 122 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in Backend::install_version at line 5023. 59 of those changes were fix/bug commits, and the other 63 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/backend/mod.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: src/cli/mod.rs src/cli/mod.rs:516— src/cli/mod.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in Commands::run at line 516. 25 of those changes were fix/bug commits, and the other 54 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/mod.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: src/config/mod.rs src/config/mod.rs:6366— src/config/mod.rs changed 166 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in mise::config::merge_file_and_config_tasks at line 6366. 73 of those changes were fix/bug commits, and the other 93 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/config/mod.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: src/task/task_executor.rs src/task/task_executor.rs:1847— src/task/task_executor.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in TaskExecutor::exec_program at line 1847. 25 of those changes were fix/bug commits, and the other 41 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/task/task_executor.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: crates/mise-system/src/files.rs crates/mise-system/src/files.rs:1549— crates/mise-system/src/files.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in mise_system::files::merge_file_entry at line 1549. 3 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-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/mise-system/src/files.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: src/cli/upgrade.rs src/cli/upgrade.rs:789— src/cli/upgrade.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in Upgrade::upgrade at line 789. 24 of those changes were fix/bug commits, and the other 27 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/upgrade.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: src/toolset/tool_version.rs src/toolset/tool_version.rs:808— src/toolset/tool_version.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in ToolVersion::resolve_version at line 808. 29 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/toolset/tool_version.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: src/cli/lock.rs src/cli/lock.rs:2268— src/cli/lock.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Lock::get_tools_to_lock at line 2268. 21 of those changes were fix/bug commits, and the other 23 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/lock.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: src/cli/dotfiles/add.rs src/cli/dotfiles/add.rs:154— src/cli/dotfiles/add.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in DotfilesAdd::run_inner at line 154. 6 of those changes were fix/bug commits, and the other 27 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/dotfiles/add.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: src/lockfile.rs src/lockfile.rs:3296— src/lockfile.rs changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in mise::lockfile::update_lockfiles at line 3296. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/lockfile.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: src/cli/run.rs src/cli/run.rs:674— src/cli/run.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Run::run at line 674. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/run.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: src/backend/aqua.rs src/backend/aqua.rs:826— src/backend/aqua.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in AquaBackend::resolve_lock_info at line 826. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/backend/aqua.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: src/config/env_directive/mod.rs src/config/env_directive/mod.rs:192— src/config/env_directive/mod.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in EnvResults::resolve_with_toolset at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/config/env_directive/mod.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: src/cli/dotfiles/track.rs src/cli/dotfiles/track.rs:115— src/cli/dotfiles/track.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in DotfilesTrack::run at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/dotfiles/track.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: src/config/config_file/mise_toml.rs src/config/config_file/mise_toml.rs:1707— src/config/config_file/mise_toml.rs changed 91 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MiseToml::replace_versions at line 1707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/config/config_file/mise_toml.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: src/config/settings.rs src/config/settings.rs:1751— src/config/settings.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Settings::set_hidden_configs at line 1751. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/config/settings.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: src/task/mod.rs src/task/mod.rs:2599— src/task/mod.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Task::merge_toml_overlay at line 2599. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/task/mod.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: crates/mise-system/src/history/checkpoint.rs crates/mise-system/src/history/checkpoint.rs:189— crates/mise-system/src/history/checkpoint.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in Store::attempt_locked at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/mise-system/src/history/checkpoint.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: src/cli/daemons.rs src/cli/daemons.rs:256— src/cli/daemons.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in Daemons::run at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/daemons.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: src/toolset/toolset_install.rs src/toolset/toolset_install.rs:322— src/toolset/toolset_install.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Toolset::install_all_versions_with_progress at line 322. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/toolset/toolset_install.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: src/cli/dotfiles/status.rs src/cli/dotfiles/status.rs:75— src/cli/dotfiles/status.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in DotfilesStatus::run at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/dotfiles/status.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: crates/mise-system-packages/src/brew/cask/mod.rs crates/mise-system-packages/src/brew/cask/mod.rs:582— crates/mise-system-packages/src/brew/cask/mod.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in BrewCaskManager::install_one_with_ancestors at line 582. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/mise-system-packages/src/brew/cask/mod.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: src/backend/packslip.rs src/backend/packslip.rs:2179— src/backend/packslip.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in PackslipBackend::install_payload at line 2179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/backend/packslip.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: crates/mise-system/src/history/watch/runtime.rs crates/mise-system/src/history/watch/runtime.rs:97— crates/mise-system/src/history/watch/runtime.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in mise_system::history::watch::runtime::run at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/mise-system/src/history/watch/runtime.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.
FileTooLong: config/mod.rs src/config/mod.rs— FileTooLong — 5262 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 204 free functions. The bar is 500 significant lines; this is 4762 over it, 10.52× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: cli/bootstrap.rs src/cli/bootstrap.rs— FileTooLong — 4210 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 3710 over it, 8.42× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/files.rs crates/mise-system/src/files.rs— FileTooLong — 4165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 183 free functions. The bar is 500 significant lines; this is 3665 over it, 8.33× 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/lockfile.rs src/lockfile.rs— FileTooLong — 4086 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 114 free functions. The bar is 500 significant lines; this is 3586 over it, 8.17× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: backend/aqua.rs src/backend/aqua.rs— FileTooLong — 3342 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 79% of them inside a single declaration: AquaBackend (3 blocks, 49-4115), declaring 53 free functions. The bar is 500 significant lines; this is 2842 over it, 6.68× 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: backend/mod.rs src/backend/mod.rs— FileTooLong — 3155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 63% of them inside a single declaration: Backend (3060-6582), declaring 79 free functions. The bar is 500 significant lines; this is 2655 over it, 6.31× 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: cask/mod.rs crates/mise-system-packages/src/brew/cask/mod.rs— FileTooLong — 2994 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 128 free functions. The bar is 500 significant lines; this is 2494 over it, 5.99× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: task/mod.rs src/task/mod.rs— FileTooLong — 2657 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 47 free functions. The bar is 500 significant lines; this is 2157 over it, 5.31× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/http.rs crates/mise-util/src/http.rs— FileTooLong — 2545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 71 free functions. The bar is 500 significant lines; this is 2045 over it, 5.09× 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: task/task_executor.rs src/task/task_executor.rs— FileTooLong — 2185 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 1685 over it, 4.37× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: backend/github.rs src/backend/github.rs— FileTooLong — 2154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 82% of them inside a single declaration: UnifiedGitBackend (3 blocks, 31-3286). The bar is 500 significant lines; this is 1654 over it, 4.31× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/file.rs crates/mise-util/src/file.rs— FileTooLong — 2101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 163 free functions. The bar is 500 significant lines; this is 1601 over it, 4.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: cli/lock.rs src/cli/lock.rs— FileTooLong — 2077 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 84% of them inside a single declaration: Lock (2 blocks, 189-3020). The bar is 500 significant lines; this is 1577 over it, 4.15× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/managed_files.rs crates/mise-system/src/managed_files.rs— FileTooLong — 2071 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 71 free functions. The bar is 500 significant lines; this is 1571 over it, 4.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: backend/npm.rs src/backend/npm.rs— FileTooLong — 1981 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 61% of them inside a single declaration: NPMBackend (3 blocks, 266-2701), declaring 36 free functions. The bar is 500 significant lines; this is 1481 over it, 3.96× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: backend/packslip.rs src/backend/packslip.rs— FileTooLong — 1923 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 46 free functions. The bar is 500 significant lines; this is 1423 over it, 3.85× 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: config_file/mise_toml.rs src/config/config_file/mise_toml.rs— FileTooLong — 1826 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 1326 over it, 3.65× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/lib.rs crates/mise-system/src/lib.rs— FileTooLong — 1692 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 75 free functions. The bar is 500 significant lines; this is 1192 over it, 3.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: src/cmd.rs crates/mise-util/src/cmd.rs— FileTooLong — 1681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 64% of them inside a single declaration: CmdLineRunner (4 blocks, 128-2578), declaring 35 free functions. The bar is 500 significant lines; this is 1181 over it, 3.36× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/tera.rs crates/mise-util/src/tera.rs— FileTooLong — 1491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 75 free functions. The bar is 500 significant lines; this is 991 over it, 2.98× 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/firewall.rs crates/mise-system/src/firewall.rs— FileTooLong — 1445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 74 free functions. The bar is 500 significant lines; this is 945 over it, 2.89× 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: history/shadow.rs crates/mise-system/src/history/shadow.rs— FileTooLong — 1433 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 89% of them inside a single declaration: HistoryRepo (2 blocks, 111-2206). The bar is 500 significant lines; this is 933 over it, 2.87× 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: history/replay.rs crates/mise-system/src/history/replay.rs— FileTooLong — 1389 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 40 free functions. The bar is 500 significant lines; this is 889 over it, 2.78× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/shims.rs src/shims.rs— FileTooLong — 1387 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 71 free functions. The bar is 500 significant lines; this is 887 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/github.rs crates/mise-util/src/github.rs— FileTooLong — 1362 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 102 free functions. The bar is 500 significant lines; this is 862 over it, 2.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.
MethodTooLong: Bootstrap.run_phases src/cli/bootstrap.rs:1916— MethodTooLong — run_phases runs 468 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 368 over it, 4.68× 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: Builder.build src/oci/builder.rs:183— MethodTooLong — build runs 413 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 313 over it, 4.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Store.attempt_locked crates/mise-system/src/history/checkpoint.rs:189— MethodTooLong — attempt_locked runs 404 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 304 over it, 4.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: Upgrade.upgrade src/cli/upgrade.rs:789— MethodTooLong — upgrade runs 392 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 292 over it, 3.92× 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: DotfilesAdd.run_inner src/cli/dotfiles/add.rs:154— MethodTooLong — run_inner runs 387 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 287 over it, 3.87× 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: EnvList.deserialize crates/mise-config/src/env.rs:293— MethodTooLong — deserialize runs 378 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 278 over it, 3.78× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: EnvResults.resolve_with_toolset src/config/env_directive/mod.rs:192— MethodTooLong — resolve_with_toolset runs 371 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 271 over it, 3.71× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Daemons.run src/cli/daemons.rs:256— MethodTooLong — run runs 341 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 241 over it, 3.41× 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: Renderer.render_item crates/mise-interactive-config/src/render/item.rs:4— MethodTooLong — render_item runs 328 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 228 over it, 3.28× 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: DotfilesTrack.run src/cli/dotfiles/track.rs:115— MethodTooLong — run runs 324 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 224 over it, 3.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: BrewCaskManager.install_one_with_ancestors crates/mise-system-packages/src/brew/cask/mod.rs:582— MethodTooLong — install_one_with_ancestors runs 323 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 223 over it, 3.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: Upgrade.run src/cli/upgrade.rs:350— MethodTooLong — run runs 321 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 221 over it, 3.21× 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: Lock.get_tools_to_lock src/cli/lock.rs:2268— MethodTooLong — get_tools_to_lock runs 268 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 168 over it, 2.68× 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: Backend.install_version src/backend/mod.rs:5023— MethodTooLong — install_version runs 254 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 154 over it, 2.54× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: InteractiveConfig.handle_enter crates/mise-interactive-config/src/editor/actions/enter.rs:4— MethodTooLong — handle_enter runs 229 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 129 over it, 2.29× 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: PackslipBackend.install_payload src/backend/packslip.rs:2179— MethodTooLong — install_payload runs 229 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 129 over it, 2.29× 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: Run.run src/cli/run.rs:674— MethodTooLong — run 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: DotfilesStatus.run src/cli/dotfiles/status.rs:75— MethodTooLong — run runs 222 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 122 over it, 2.22× 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: ToolVersion.resolve_version src/toolset/tool_version.rs:808— MethodTooLong — resolve_version runs 207 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 107 over it, 2.07× 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: AquaBackend.resolve_lock_info src/backend/aqua.rs:826— MethodTooLong — resolve_lock_info runs 203 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 103 over it, 2.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.
MethodTooLong: Client.download_file_attempt crates/mise-util/src/http.rs:1990— MethodTooLong — download_file_attempt runs 195 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 95 over it, 1.95× 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: DotfilesUntrack.run src/cli/dotfiles/untrack.rs:36— MethodTooLong — run runs 190 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 90 over it, 1.90× 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: BrewManager.install_via_pour crates/mise-system-packages/src/brew/mod.rs:121— MethodTooLong — install_via_pour runs 188 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 88 over it, 1.88× 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: TaskScriptParser.setup_tera_for_spec_parsing src/task/task_script_parser.rs:427— MethodTooLong — setup_tera_for_spec_parsing runs 186 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 86 over it, 1.86× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Builder.build_image_config src/oci/builder.rs:776— MethodTooLong — build_image_config runs 181 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 81 over it, 1.81× 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.
mise_system::history::watch::runtime::run (cognitive 220) crates/mise-system/src/history/watch/runtime.rs:97— mise_system::history::watch::runtime::run has cognitive complexity 220 (threshold 15). Drivers by points: if/else 39 (113 pts), match/switch 26 (75 pts), loops 7 (26 pts), boolean chains 6 (nesting depth added 142). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::files::validate_incoming_files (cognitive 137) crates/mise-system/src/files.rs:1018— mise_system::files::validate_incoming_files has cognitive complexity 137 (threshold 15). Drivers by points: if/else 33 (90 pts), boolean chains 27, loops 5 (16 pts), match/switch 1 (4 pts) (nesting depth added 71). 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.
mise_system::history::replay::plan (cognitive 112) crates/mise-system/src/history/replay.rs:1023— mise_system::history::replay::plan has cognitive complexity 112 (threshold 15). Drivers by points: if/else 19 (73 pts), loops 8 (24 pts), boolean chains 11, match/switch 1 (4 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::files::merge_file_entry (cognitive 94) crates/mise-system/src/files.rs:1549— mise_system::files::merge_file_entry has cognitive complexity 94 (threshold 15). Drivers by points: if/else 37 (51 pts), boolean chains 22, match/switch 14 (20 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::unapply::plan (cognitive 90) crates/mise-system/src/unapply.rs:78— mise_system::unapply::plan has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (62 pts), match/switch 8 (16 pts), loops 8 (11 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::history::replay::apply_steps (cognitive 89) crates/mise-system/src/history/replay.rs:530— mise_system::history::replay::apply_steps has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (69 pts), loops 5 (8 pts), boolean chains 7, match/switch 2 (5 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::files::apply_one (cognitive 80) crates/mise-system/src/files.rs:5931— mise_system::files::apply_one has cognitive complexity 80 (threshold 15). Drivers by points: if/else 29 (58 pts), match/switch 4 (11 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::files::plan_unapply_one (cognitive 70) crates/mise-system/src/files.rs:5035— mise_system::files::plan_unapply_one has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (48 pts), boolean chains 11, loops 3 (10 pts), match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::remote_repository::install_at (cognitive 69) crates/mise-system/src/remote_repository.rs:204— mise_system::remote_repository::install_at has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (54 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::package_requests_from_config_files (cognitive 67) crates/mise-system/src/lib.rs:666— mise_system::package_requests_from_config_files has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (43 pts), match/switch 4 (13 pts), boolean chains 10, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::resources::plan (cognitive 66) crates/mise-system/src/resources.rs:19— mise_system::resources::plan has cognitive complexity 66 (threshold 15). Drivers by points: loops 24 (39 pts), if/else 14 (26 pts), boolean chains 1 (nesting depth added 27). 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.
mise_system::history::tracked::walk_entry (cognitive 57) crates/mise-system/src/history/tracked.rs:933— mise_system::history::tracked::walk_entry has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 7 (15 pts), boolean chains 6, loops 1 (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.
mise_system::history::sync::run::sync_locked (cognitive 56) crates/mise-system/src/history/sync/run.rs:265— mise_system::history::sync::run::sync_locked has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 12, loops 4 (9 pts), match/switch 3 (5 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.
mise_system::merge_manager_packages (cognitive 55) crates/mise-system/src/lib.rs:550— mise_system::merge_manager_packages has cognitive complexity 55 (threshold 15). Drivers by points: if/else 7 (39 pts), match/switch 3 (10 pts), boolean chains 3, loops 2 (3 pts) (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.
mise_system::files::execute_apply (cognitive 54) crates/mise-system/src/files.rs:4396— mise_system::files::execute_apply has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 9 (17 pts), boolean chains 6 (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.
mise_system::history::sync::reconcile::reconcile (cognitive 52) crates/mise-system/src/history/sync/reconcile.rs:208— mise_system::history::sync::reconcile::reconcile has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 8, match/switch 3 (8 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::packages_from_specs_with_config_files (cognitive 50) crates/mise-system/src/lib.rs:2005— mise_system::packages_from_specs_with_config_files has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (39 pts), match/switch 2 (6 pts), boolean chains 3, loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::files::plan_apply_with_active (cognitive 50) crates/mise-system/src/files.rs:4585— mise_system::files::plan_apply_with_active has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 9, match/switch 3 (7 pts), loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::history::enrollment::reconcile (cognitive 50) crates/mise-system/src/history/enrollment.rs:168— mise_system::history::enrollment::reconcile has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (40 pts), boolean chains 5, loops 3 (5 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.
mise_system::edits::apply (cognitive 49) crates/mise-system/src/edits.rs:1155— mise_system::edits::apply has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 5 (11 pts), boolean chains 6, loops 4 (5 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.
mise_system::driver::run_manager (cognitive 47) crates/mise-system/src/driver.rs:183— mise_system::driver::run_manager has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 8, match/switch 4 (5 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.
mise_system::history::purge::purge (cognitive 46) crates/mise-system/src/history/purge.rs:142— mise_system::history::purge::purge has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 6 (8 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::files::execute_unapply (cognitive 42) crates/mise-system/src/files.rs:4921— mise_system::files::execute_unapply has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system::files::validate_composed_file_footprints (cognitive 41) crates/mise-system/src/files.rs:824— mise_system::files::validate_composed_file_footprints has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 7 (12 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.
mise_system::managed_files::open_or_create_directory_tree_inner (cognitive 40) crates/mise-system/src/managed_files.rs:2439— mise_system::managed_files::open_or_create_directory_tree_inner has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise::lockfile::update_lockfiles (cyclomatic 45) src/lockfile.rs:3296— mise::lockfile::update_lockfiles has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise::lockfile::generate::generate (cyclomatic 43) src/lockfile/generate.rs:400— mise::lockfile::generate::generate has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise::hook_env::check_exit_early_fast (cyclomatic 42) src/hook_env.rs:217— mise::hook_env::check_exit_early_fast has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise::packslip::fetch_files (cyclomatic 42) src/packslip.rs:319— mise::packslip::fetch_files has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise::lockfile::get_locked_version (cyclomatic 41) src/lockfile.rs:5414— mise::lockfile::get_locked_version 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.
mise::config::merge_file_and_config_tasks (cyclomatic 36) src/config/mod.rs:6366— mise::config::merge_file_and_config_tasks has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise::lockfile::auto_lock_new_versions (cyclomatic 35) src/lockfile.rs:4212— mise::lockfile::auto_lock_new_versions 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.
mise::cli::shim::which_shim (cyclomatic 31) src/cli/shim.rs:368— mise::cli::shim::which_shim 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.
mise::task::task_source_checker::compute_output_hash (cyclomatic 31) src/task/task_source_checker.rs:1133— mise::task::task_source_checker::compute_output_hash has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body's own statements and 6 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.
mise::cli::settings::set::set (cyclomatic 30) src/cli/settings/set.rs:66— mise::cli::settings::set::set has cyclomatic complexity 30 (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.
mise::backend::cargo::native_binstall::install (cyclomatic 28) src/backend/cargo/native_binstall.rs:28— mise::backend::cargo::native_binstall::install 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.
mise::lockfile::generate::is_current (cyclomatic 28) src/lockfile/generate.rs:256— mise::lockfile::generate::is_current 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.
mise::cli::exec::exec_program (cyclomatic 27) src/cli/exec.rs:943— mise::cli::exec::exec_program has cyclomatic complexity 27 (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.
mise::toolset::helpers::preflight_system_deps_inner (cyclomatic 27) src/toolset/helpers.rs:50— mise::toolset::helpers::preflight_system_deps_inner 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.
mise::backend::static_helpers::rename_executable_in_dir (cyclomatic 26) src/backend/static_helpers.rs:1255— mise::backend::static_helpers::rename_executable_in_dir 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.
mise::system_install::apply_for_owner (cyclomatic 25) src/system_install.rs:339— mise::system_install::apply_for_owner 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.
mise::task::task_list::get_task_lists (cyclomatic 25) src/task/task_list.rs:444— mise::task::task_list::get_task_lists 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.
mise::task::workspace::gradle::tokenize (cyclomatic 25) src/task/workspace/gradle.rs:181— mise::task::workspace::gradle::tokenize has cyclomatic complexity 25 (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.
mise::lockfile::format (cyclomatic 24) src/lockfile.rs:6351— mise::lockfile::format 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.
mise::backend::static_helpers::clean_binary_name (cyclomatic 23) src/backend/static_helpers.rs:1716— mise::backend::static_helpers::clean_binary_name 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.
mise::cli::generate::task_stubs::validate_stub_paths (cyclomatic 23) src/cli/generate/task_stubs.rs:543— mise::cli::generate::task_stubs::validate_stub_paths 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.
mise::config::load_task_sources_from_configs (cyclomatic 23) src/config/mod.rs:7738— mise::config::load_task_sources_from_configs 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.
mise::sops::decrypt (cyclomatic 23) src/sops.rs:43— mise::sops::decrypt 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.
mise::toolset::get_versions_needed_by_tracked_configs_with_progress (cyclomatic 23) src/toolset/mod.rs:995— mise::toolset::get_versions_needed_by_tracked_configs_with_progress has cyclomatic complexity 23 (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.
mise::hooks::run_one_hook_with_context (cyclomatic 22) src/hooks.rs:300— mise::hooks::run_one_hook_with_context 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.
FunctionTooLong: mise_system::files::merge_file_entry crates/mise-system/src/files.rs:1549— FunctionTooLong — mise_system::files::merge_file_entry runs 459 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 359 over it, 4.59× 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: mise_system::history::watch::runtime::run crates/mise-system/src/history/watch/runtime.rs:97— FunctionTooLong — mise_system::history::watch::runtime::run runs 430 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 330 over it, 4.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: mise_brew_metadata::cask::flight::step::parse_flight_step crates/mise-brew-metadata/src/cask/flight/step.rs:3— FunctionTooLong — mise_brew_metadata::cask::flight::step::parse_flight_step runs 321 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 221 over it, 3.21× 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: mise_system_packages::brew::cask::flight::execute_flight_step crates/mise-system-packages/src/brew/cask/flight.rs:585— FunctionTooLong — mise_system_packages::brew::cask::flight::execute_flight_step runs 248 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 148 over it, 2.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: mise_system::unapply::plan crates/mise-system/src/unapply.rs:78— FunctionTooLong — mise_system::unapply::plan runs 245 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 145 over it, 2.45× 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: mise::lockfile::update_lockfiles src/lockfile.rs:3296— FunctionTooLong — mise::lockfile::update_lockfiles runs 231 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 131 over it, 2.31× 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: mise_system::resources::plan crates/mise-system/src/resources.rs:19— FunctionTooLong — mise_system::resources::plan runs 229 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 129 over it, 2.29× 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: mise::lockfile::generate::generate src/lockfile/generate.rs:400— FunctionTooLong — mise::lockfile::generate::generate runs 220 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 120 over it, 2.20× 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: mise_daemons::load crates/mise-daemons/src/lib.rs:258— FunctionTooLong — mise_daemons::load runs 215 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 115 over it, 2.15× 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: mise::backend::cargo::native_binstall::install src/backend/cargo/native_binstall.rs:28— FunctionTooLong — mise::backend::cargo::native_binstall::install runs 214 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 114 over it, 2.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: mise_system::history::replay::apply_steps crates/mise-system/src/history/replay.rs:530— FunctionTooLong — mise_system::history::replay::apply_steps runs 190 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 90 over it, 1.90× 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: mise_brew_relocation::elf::patch crates/mise-brew-relocation/src/elf.rs:192— FunctionTooLong — mise_brew_relocation::elf::patch runs 188 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 88 over it, 1.88× 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: mise_system::files::validate_incoming_files crates/mise-system/src/files.rs:1018— FunctionTooLong — mise_system::files::validate_incoming_files runs 180 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 80 over it, 1.80× 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: mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens crates/mise-system-packages/src/brew/cask/state.rs:1175— FunctionTooLong — mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens runs 171 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 71 over it, 1.71× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: mise_system::history::sync::run::sync_locked crates/mise-system/src/history/sync/run.rs:265— FunctionTooLong — mise_system::history::sync::run::sync_locked runs 167 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 67 over it, 1.67× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: mise_system::remote_repository::install_at crates/mise-system/src/remote_repository.rs:204— FunctionTooLong — mise_system::remote_repository::install_at runs 164 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 64 over it, 1.64× 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: mise::lockfile::auto_lock_new_versions src/lockfile.rs:4212— FunctionTooLong — mise::lockfile::auto_lock_new_versions runs 164 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 64 over it, 1.64× 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: mise_daemons::build crates/mise-daemons/src/lib.rs:639— FunctionTooLong — mise_daemons::build runs 161 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 61 over it, 1.61× 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: mise_system::history::replay::plan crates/mise-system/src/history/replay.rs:1023— FunctionTooLong — mise_system::history::replay::plan runs 159 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 59 over it, 1.59× 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: mise_system::driver::run_manager crates/mise-system/src/driver.rs:183— FunctionTooLong — mise_system::driver::run_manager 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.
FunctionTooLong: mise::packslip::fetch_files src/packslip.rs:319— FunctionTooLong — mise::packslip::fetch_files 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: mise::lockfile::get_locked_version src/lockfile.rs:5414— FunctionTooLong — mise::lockfile::get_locked_version runs 151 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 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: mise_system::history::sync::onboard::run crates/mise-system/src/history/sync/onboard.rs:291— FunctionTooLong — mise_system::history::sync::onboard::run runs 145 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 45 over it, 1.45× 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: mise::system_install::apply_for_owner src/system_install.rs:339— FunctionTooLong — mise::system_install::apply_for_owner runs 145 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 45 over it, 1.45× 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: mise::cli::exec::exec_program src/cli/exec.rs:943— FunctionTooLong — mise::cli::exec::exec_program runs 142 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 42 over it, 1.42× 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.
mise_system::history::watch::runtime::run (cyclomatic 94) crates/mise-system/src/history/watch/runtime.rs:97— mise_system::history::watch::runtime::run has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::files::merge_file_entry (cyclomatic 76) crates/mise-system/src/files.rs:1549— mise_system::files::merge_file_entry has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::files::validate_incoming_files (cyclomatic 67) crates/mise-system/src/files.rs:1018— mise_system::files::validate_incoming_files has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::unapply::plan (cyclomatic 48) crates/mise-system/src/unapply.rs:78— mise_system::unapply::plan has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::history::replay::apply_steps (cyclomatic 45) crates/mise-system/src/history/replay.rs:530— mise_system::history::replay::apply_steps has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::files::plan_unapply_one (cyclomatic 44) crates/mise-system/src/files.rs:5035— mise_system::files::plan_unapply_one has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::files::apply_one (cyclomatic 42) crates/mise-system/src/files.rs:5931— mise_system::files::apply_one has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::driver::run_manager (cyclomatic 39) crates/mise-system/src/driver.rs:183— mise_system::driver::run_manager has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::history::replay::plan (cyclomatic 39) crates/mise-system/src/history/replay.rs:1023— mise_system::history::replay::plan has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::remote_repository::install_at (cyclomatic 39) crates/mise-system/src/remote_repository.rs:204— mise_system::remote_repository::install_at has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::history::sync::run::sync_locked (cyclomatic 38) crates/mise-system/src/history/sync/run.rs:265— mise_system::history::sync::run::sync_locked 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.
mise_system::resources::plan (cyclomatic 37) crates/mise-system/src/resources.rs:19— mise_system::resources::plan has cyclomatic complexity 37 (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.
mise_system::package_requests_from_config_files (cyclomatic 34) crates/mise-system/src/lib.rs:666— mise_system::package_requests_from_config_files has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::history::tracked::walk_entry (cyclomatic 34) crates/mise-system/src/history/tracked.rs:933— mise_system::history::tracked::walk_entry has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system::history::purge::purge (cyclomatic 33) crates/mise-system/src/history/purge.rs:142— mise_system::history::purge::purge 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.
mise_system::files::plan_apply_with_active (cyclomatic 32) crates/mise-system/src/files.rs:4585— mise_system::files::plan_apply_with_active 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.
mise_system::dotfile_groups::group_entry (cyclomatic 31) crates/mise-system/src/dotfile_groups.rs:351— mise_system::dotfile_groups::group_entry has cyclomatic complexity 31 (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.
mise_system::edits::apply (cyclomatic 31) crates/mise-system/src/edits.rs:1155— mise_system::edits::apply 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.
mise_system::files::execute_apply (cyclomatic 31) crates/mise-system/src/files.rs:4396— mise_system::files::execute_apply 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.
mise_system::history::sync::apply::apply_locked_with_scope (cyclomatic 31) crates/mise-system/src/history/sync/apply.rs:1152— mise_system::history::sync::apply::apply_locked_with_scope has cyclomatic complexity 31 (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.
mise_system::history::sync::reconcile::reconcile (cyclomatic 30) crates/mise-system/src/history/sync/reconcile.rs:208— mise_system::history::sync::reconcile::reconcile 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.
mise_system::history::enrollment::reconcile (cyclomatic 28) crates/mise-system/src/history/enrollment.rs:168— mise_system::history::enrollment::reconcile 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.
mise_system::remote::run_staged (cyclomatic 27) crates/mise-system/src/remote.rs:498— mise_system::remote::run_staged 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.
mise_system::files::validate_composed_file_footprints (cyclomatic 26) crates/mise-system/src/files.rs:824— mise_system::files::validate_composed_file_footprints 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.
mise_system::files::print_diff (cyclomatic 26) crates/mise-system/src/files.rs:5474— mise_system::files::print_diff 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.
TodoComment src/lockfile.rs:1731— // TODO: Maybe instead of overwriting, we should create the new lockfile at — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/lockfile.rs:6374— // TODO: use TOML 1.1 multiline inline tables once toml_edit supports — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/watch_files.rs:251— // TODO: this should be different but I don't have easy access to it — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/toolset/tool_version.rs:563— // TODO: make this a utility function in xx — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/toolset/toolset_paths.rs:105— // TODO: why? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/task/task_script_parser.rs:769— // TODO: ensure no gaps in args, e.g.: 1,2,3,4,5 — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/task/task_script_parser.rs:844— // TODO: ensure no gaps in args, e.g.: 1,2,3,4,5 — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/shell/xonsh.rs:115— // todo: drop illegal chars, not escape? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/shell/xonsh.rs:137— // todo: drop illegal chars, not escape? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/plugins/core/erlang.rs:90— // TODO: find a way to not have to do this #1209
TodoComment src/plugins/core/python.rs:243— // TODO: do not update if recently updated — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/plugins/core/python.rs:770— // TODO: enable when it is more reliable — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/plugins/core/ruby_windows.rs:190— // TODO: use windows set of versions — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/config/settings.rs:175— // TODO(2027.8.0): Remove the per-tool warning accessors once the NixOS — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/config/env_directive/venv.rs:316— // TODO: the toolset stuff doesn't feel like it's in the right place here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/config/env_directive/venv.rs:317— // TODO: in fact this should probably be moved to execute at the same time as src/uv.rs runs in ts.env() instead of config.env() — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/config/config_file/mod.rs:349— // TODO: this has become a complete mess and could probably be greatly simplified — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/cli/exec.rs:530— // TODO: env is being calculated twice with final_env and env_with_path — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/cli/ls.rs:174— // TODO: global is a little weird: it will show global versions as the active ones even if — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/cli/shim.rs:32— // TODO: instead, check if bin is in shims dir — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/cli/use.rs:343— // TODO: this should only happen on this tool, not all of them — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/cli/tasks/add.rs:88— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/cli/tasks/ls.rs:452— // TODO: fill this out — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/cli/sync/python.rs:144— // TODO: uv doesn't support symlinked dirs — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/cli/direnv/envrc.rs:26— // TODO: exit early if envrc_path exists and is up to date — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
ClassTooLong: AquaBackend src/backend/aqua.rs:49— ClassTooLong — 2627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 86 methods, 3 blocks, lines 49-4115. The bar is 400 significant lines; this is 2227 over it, 6.57× 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: Backend src/backend/mod.rs:3060— ClassTooLong — 1998 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 143 methods. The bar is 400 significant lines; this is 1598 over it, 5.00× 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: UnifiedGitBackend src/backend/github.rs:31— ClassTooLong — 1758 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 41 methods, 3 blocks, lines 31-3286. The bar is 400 significant lines; this is 1358 over it, 4.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Lock src/cli/lock.rs:189— ClassTooLong — 1753 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 52 methods, 2 blocks, lines 189-3020. The bar is 400 significant lines; this is 1353 over it, 4.38× 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: Client crates/mise-util/src/http.rs:850— ClassTooLong — 1303 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 55 methods, 2 blocks, lines 850-2697. The bar is 400 significant lines; this is 903 over it, 3.26× 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: HistoryRepo crates/mise-system/src/history/shadow.rs:111— ClassTooLong — 1274 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 62 methods, 2 blocks, lines 111-2206. The bar is 400 significant lines; this is 874 over it, 3.19× 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: NPMBackend src/backend/npm.rs:266— ClassTooLong — 1208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 53 methods, 3 blocks, lines 266-2701. The bar is 400 significant lines; this is 808 over it, 3.02× 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: CmdLineRunner crates/mise-util/src/cmd.rs:128— ClassTooLong — 1080 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 62 methods, 4 blocks, lines 128-2578. The bar is 400 significant lines; this is 680 over it, 2.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: PackslipBackend src/backend/packslip.rs:66— ClassTooLong — 1039 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 4 blocks, lines 66-2953. The bar is 400 significant lines; this is 639 over it, 2.60× 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: Upgrade src/cli/upgrade.rs:65— ClassTooLong — 1003 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 17 methods, 2 blocks, lines 65-1572. The bar is 400 significant lines; this is 603 over it, 2.51× 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: Doctor src/cli/doctor/mod.rs:47— ClassTooLong — 941 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 31 methods, 2 blocks, lines 47-1562. The bar is 400 significant lines; this is 541 over it, 2.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: ToolVersion src/toolset/tool_version.rs:43— ClassTooLong — 853 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 46 methods, 7 blocks, lines 43-1429. The bar is 400 significant lines; this is 453 over it, 2.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Run src/cli/run.rs:101— ClassTooLong — 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 23 methods, 2 blocks, lines 101-1801. The bar is 400 significant lines; this is 421 over it, 2.05× 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: Bootstrap src/cli/bootstrap.rs:104— ClassTooLong — 804 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 14 methods, 3 blocks, lines 104-2846. The bar is 400 significant lines; this is 404 over it, 2.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: HttpBackend src/backend/http.rs:152— ClassTooLong — 796 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 33 methods, 3 blocks, lines 152-1737. The bar is 400 significant lines; this is 396 over it, 1.99× 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: NodePlugin src/plugins/core/node.rs:33— ClassTooLong — 778 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 32 methods, 4 blocks, lines 33-1099. The bar is 400 significant lines; this is 378 over it, 1.95× 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: BootstrapStatus src/cli/bootstrap.rs:575— ClassTooLong — 768 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 20 methods, 2 blocks, lines 575-5183. The bar is 400 significant lines; this is 368 over it, 1.92× 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: Lockfile src/lockfile.rs:349— ClassTooLong — 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 39 methods, 5 blocks, lines 349-5285. The bar is 400 significant lines; this is 360 over it, 1.90× 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: PIPXBackend REDACTED:91— ClassTooLong — 748 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 46 methods, 3 blocks, lines 91-1516. The bar is 400 significant lines; this is 348 over it, 1.87× 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: PythonPlugin src/plugins/core/python.rs:59— ClassTooLong — 717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 3 blocks, lines 59-1271. The bar is 400 significant lines; this is 317 over it, 1.79× 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: DepsEngine src/deps/engine.rs:203— ClassTooLong — 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 18 methods, 2 blocks, lines 203-1313. The bar is 400 significant lines; this is 305 over it, 1.76× 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: TaskScriptParser src/task/task_script_parser.rs:50— ClassTooLong — 692 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 2 blocks, lines 50-1088. The bar is 400 significant lines; this is 292 over it, 1.73× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: CondaBackend src/backend/conda.rs:46— ClassTooLong — 691 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 34 methods, 3 blocks, lines 46-1249. The bar is 400 significant lines; this is 291 over it, 1.73× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Store crates/mise-system/src/history/checkpoint.rs:104— ClassTooLong — 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 104-1039. The bar is 400 significant lines; this is 270 over it, 1.68× 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: VfoxBackend src/backend/vfox.rs:43— ClassTooLong — 641 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, 3 blocks, lines 43-1102. The bar is 400 significant lines; this is 241 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (9 lines × 2) crates/mise-daemons/src/lib.rs:1614— crates/mise-daemons/src/lib.rs:1614-1622 | crates/mise-daemons/src/lib.rs:1672-1680 — both copies are in the same file, so extract the 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) crates/mise-oci/src/registry.rs:750— crates/mise-oci/src/registry.rs:750-764 | crates/mise-oci/src/registry.rs:1078-1086 — both copies are in the same file, so extract the 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) crates/mise-system-packages/src/apt_sources.rs:556— crates/mise-system-packages/src/apt_sources.rs:556-564 | crates/mise-system-packages/src/dnf_repos.rs:250-258 — 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) crates/mise-system-packages/src/brew/cask/mod.rs:4020— crates/mise-system-packages/src/brew/cask/mod.rs:4020-4028 | crates/mise-system-packages/src/brew/cask/paths.rs:352-360 — 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) crates/mise-system/src/repos.rs:773— crates/mise-system/src/repos.rs:773-781 | crates/mise-system/src/repos.rs:794-802 — both copies are in the same file, so extract the 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) crates/mise-system/src/secrets.rs:105— crates/mise-system/src/secrets.rs:105-113 | crates/mise-system/src/services_common.rs:148-156 — before extracting anything, compare `crates/mise-system/src/secrets.rs` and `crates/mise-system/src/services_common.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) crates/mise-util/src/cmd.rs:1349— crates/mise-util/src/cmd.rs:1349-1358 | crates/mise-util/src/cmd.rs:1553-1561 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:1743— crates/mise-util/src/cmd.rs:1743-1751 | crates/mise-util/src/cmd.rs:1767-1775 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:2151— crates/mise-util/src/cmd.rs:2151-2159 | crates/mise-util/src/cmd.rs:2189-2197 — both copies are in the same file, so extract the 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) crates/mise-util/src/file.rs:223— crates/mise-util/src/file.rs:223-231 | crates/mise-util/src/file.rs:275-283 — both copies are in the same file, so extract the 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) crates/mise-util/src/github/sigstore.rs:645— crates/mise-util/src/github/sigstore.rs:645-653 | crates/mise-util/src/github/sigstore.rs:767-775 — both copies are in the same file, so extract the 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) crates/mise-util/src/http.rs:1836— crates/mise-util/src/http.rs:1836-1844 | crates/mise-util/src/http.rs:1945-1953 — both copies are in the same file, so extract the 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) crates/vfox/src/lua_mod/http.rs:394— crates/vfox/src/lua_mod/http.rs:394-402 | crates/vfox/src/lua_mod/http.rs:436-444 — both copies are in the same file, so extract the 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) src/backend/go.rs:447— src/backend/go.rs:447-455 | src/backend/go.rs:470-478 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/backend/jq.rs:70— src/backend/jq.rs:70-78 | src/backend/jq.rs:196-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 (9 lines × 2) src/cli/doctor/mod.rs:697— src/cli/doctor/mod.rs:697-705 | src/cli/doctor/mod.rs:1198-1206 — both copies are in the same file, so extract the 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) src/cli/lock.rs:986— src/cli/lock.rs:986-994 | src/cli/lock.rs:1110-1119 — both copies are in the same file, so extract the 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) src/cli/lock.rs:2014— src/cli/lock.rs:2014-2022 | src/cli/lock.rs:2328-2336 — both copies are in the same file, so extract the 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) src/cli/settings/ls.rs:267— src/cli/settings/ls.rs:267-275 | src/cli/settings/ls.rs:281-289 — both copies are in the same file, so extract the 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) src/install_before.rs:208— src/install_before.rs:208-216 | src/install_before.rs:218-226 — both copies are in the same file, so extract the 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) src/lockfile.rs:740— src/lockfile.rs:740-748 | src/lockfile.rs:983-991 — both copies are in the same file, so extract the 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) src/oci/builder.rs:606— src/oci/builder.rs:606-614 | src/oci/builder.rs:672-680 — both copies are in the same file, so extract the 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) src/oci/builder.rs:606— src/oci/builder.rs:606-614 | src/oci/builder.rs:686-694 — both copies are in the same file, so extract the 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) src/oci/builder.rs:672— src/oci/builder.rs:672-680 | src/oci/builder.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.
Duplicated block (9 lines × 2) src/plugins/core/erlang.rs:386— src/plugins/core/erlang.rs:386-394 | src/plugins/core/erlang.rs:478-486 — both copies are in the same file, so extract the 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) crates/mise-brew-metadata/src/lib.rs:263— crates/mise-brew-metadata/src/lib.rs:263-268 | crates/mise-brew-metadata/src/lib.rs:307-312 — both copies are in the same file, so extract the 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) crates/mise-config/src/min_version.rs:106— crates/mise-config/src/min_version.rs:106-111 | crates/mise-config/src/min_version.rs:116-121 — both copies are in the same file, so extract the 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) crates/mise-dotenv/src/key.rs:82— crates/mise-dotenv/src/key.rs:82-89 | crates/mise-util/src/env.rs:1240-1245 — 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) crates/mise-system/src/accounts.rs:904— crates/mise-system/src/accounts.rs:904-909 | crates/mise-system/src/accounts.rs:948-953 — both copies are in the same file, so extract the 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) crates/mise-system/src/history/tracked.rs:1269— crates/mise-system/src/history/tracked.rs:1269-1274 | crates/mise-system/src/history/tracked.rs:1287-1292 — both copies are in the same file, so extract the 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) crates/mise-system/src/scheduled_tasks.rs:671— crates/mise-system/src/scheduled_tasks.rs:671-676 | crates/mise-system/src/scheduled_tasks.rs:721-726 — both copies are in the same file, so extract the 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) crates/mise-ui/src/sudo.rs:311— crates/mise-ui/src/sudo.rs:311-316 | crates/mise-ui/src/sudo.rs:340-345 — both copies are in the same file, so extract the 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) crates/mise-util/src/agecrypt.rs:325— crates/mise-util/src/agecrypt.rs:325-330 | crates/mise-util/src/agecrypt.rs:356-361 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:2025— crates/mise-util/src/cmd.rs:2025-2030 | crates/mise-util/src/cmd.rs:2055-2060 — both copies are in the same file, so extract the 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) crates/mise-util/src/errors.rs:68— crates/mise-util/src/errors.rs:68-73 | crates/mise-util/src/errors.rs:88-93 — both copies are in the same file, so extract the 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) crates/mise-util/src/file.rs:750— crates/mise-util/src/file.rs:750-755 | crates/mise-util/src/github/oauth.rs:1012-1017 — 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) crates/mise-util/src/tera.rs:1905— crates/mise-util/src/tera.rs:1905-1910 | crates/mise-util/src/tera.rs:2026-2037 — both copies are in the same file, so extract the 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) src/backend/aqua.rs:3525— src/backend/aqua.rs:3525-3530 | src/plugins/core/ruby.rs:718-723 — 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) src/backend/cargo/native_binstall.rs:106— src/backend/cargo/native_binstall.rs:106-112 | src/backend/cargo/native_binstall.rs:161-166 — both copies are in the same file, so extract the 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) src/cli/bootstrap.rs:4587— src/cli/bootstrap.rs:4587-4592 | src/cli/system/status.rs:131-136 — 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) src/cli/lock.rs:1348— src/cli/lock.rs:1348-1353 | src/cli/upgrade.rs:915-920 — 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) src/cli/tasks/validate.rs:868— src/cli/tasks/validate.rs:868-873 | src/cli/tasks/validate.rs:882-887 — both copies are in the same file, so extract the 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) src/config/mod.rs:3086— src/config/mod.rs:3086-3091 | src/config/mod.rs:3403-3408 — both copies are in the same file, so extract the 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) src/oci/builder.rs:807— src/oci/builder.rs:807-812 | src/oci/builder.rs:814-819 — both copies are in the same file, so extract the 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) src/plugins/asdf_plugin.rs:274— src/plugins/asdf_plugin.rs:274-279 | src/plugins/vfox_plugin.rs:338-343 — before extracting anything, compare `src/plugins/asdf_plugin.rs` and `src/plugins/vfox_plugin.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) src/plugins/core/deno.rs:160— src/plugins/core/deno.rs:160-165 | src/plugins/core/go.rs:320-325 — 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) src/plugins/core/rust/nightly_channel.rs:221— src/plugins/core/rust/nightly_channel.rs:221-226 | src/plugins/core/rust/nightly_channel.rs:248-253 — both copies are in the same file, so extract the 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) src/task/mod.rs:2361— src/task/mod.rs:2361-2366 | src/task/mod.rs:2422-2427 — both copies are in the same file, so extract the 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) crates/mise-system-packages/src/apk.rs:48— crates/mise-system-packages/src/apk.rs:48-53 | crates/mise-system-packages/src/pacman.rs:223-228 — 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) crates/mise-system/src/launchd.rs:427— crates/mise-system/src/launchd.rs:427-432 | crates/mise-system/src/user_services.rs:293-298 — 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) crates/aqua-registry/src/types/matchers.rs:119— crates/aqua-registry/src/types/matchers.rs:119-125 | crates/mise-util/src/semver.rs:12-18 — 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) crates/mise-lsp/src/includes.rs:284— crates/mise-lsp/src/includes.rs:284-290 | crates/mise-system/src/files.rs:2459-2465 — 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) crates/mise-lsp/src/schema.rs:239— crates/mise-lsp/src/schema.rs:239-245 | src/config/schema.rs:68-74 — 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) crates/mise-shim/src/windows_process.rs:165— crates/mise-shim/src/windows_process.rs:165-171 | crates/mise-util/src/windows_process.rs:100-106 — before extracting anything, compare `crates/mise-shim/src/windows_process.rs` and `crates/mise-util/src/windows_process.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 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 × 2) crates/mise-system-packages/src/choco.rs:81— crates/mise-system-packages/src/choco.rs:81-87 | crates/mise-system-packages/src/scoop.rs:356-362 — 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) crates/mise-system-packages/src/flatpak.rs:132— crates/mise-system-packages/src/flatpak.rs:132-138 | crates/mise-system-packages/src/snap.rs:188-194 — 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) crates/mise-system/src/files.rs:5086— crates/mise-system/src/files.rs:5086-5092 | crates/mise-system/src/files.rs:5111-5117 — both copies are in the same file, so extract the 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) crates/mise-system/src/history/shadow.rs:1674— crates/mise-system/src/history/shadow.rs:1674-1681 | crates/mise-util/src/cmd.rs:320-326 — 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) crates/mise-system/src/lib.rs:1028— crates/mise-system/src/lib.rs:1028-1034 | crates/mise-system/src/lib.rs:1648-1654 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:1923— crates/mise-util/src/cmd.rs:1923-1930 | crates/mise-util/src/cmd.rs:1976-1982 — both copies are in the same file, so extract the 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) crates/mise-util/src/env_diff.rs:244— crates/mise-util/src/env_diff.rs:244-250 | src/hook_env.rs:616-622 — 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) crates/mise-util/src/github.rs:977— crates/mise-util/src/github.rs:977-983 | crates/mise-util/src/github.rs:1142-1148 — both copies are in the same file, so extract the 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) src/args/backend_arg.rs:736— src/args/backend_arg.rs:736-742 | src/args/backend_arg.rs:1015-1021 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/backend/aqua.rs:2338— src/backend/aqua.rs:2338-2344 | src/backend/aqua.rs:2413-2421 — both copies are in the same file, so extract the 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) src/backend/http.rs:1096— src/backend/http.rs:1096-1102 | src/backend/s3.rs:417-423 — before extracting anything, compare `src/backend/http.rs` and `src/backend/s3.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 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) src/cli/config/ls.rs:78— src/cli/config/ls.rs:78-84 | src/cli/config/ls.rs:107-113 — both copies are in the same file, so extract the 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) src/cli/ls.rs:460— src/cli/ls.rs:460-466 | src/cli/ls.rs:513-519 — both copies are in the same file, so extract the 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) src/cli/upgrade.rs:915— src/cli/upgrade.rs:915-921 | src/cli/upgrade.rs:1116-1122 — both copies are in the same file, so extract the 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) src/config/config_file/mise_toml.rs:279— src/config/config_file/mise_toml.rs:279-285 | src/config/config_file/mise_toml.rs:288-296 — both copies are in the same file, so extract the 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) src/config/mod.rs:1663— src/config/mod.rs:1663-1669 | src/config/mod.rs:1806-1812 — both copies are in the same file, so extract the 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) src/config/mod.rs:7429— src/config/mod.rs:7429-7435 | src/config/mod.rs:7441-7447 — both copies are in the same file, so extract the 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) src/deps/rule.rs:65— src/deps/rule.rs:65-71 | src/deps/rule.rs:158-164 — both copies are in the same file, so extract the 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) src/plugins/core/ruby.rs:313— src/plugins/core/ruby.rs:313-319 | src/plugins/core/ruby_windows.rs:82-88 — before extracting anything, compare `src/plugins/core/ruby.rs` and `src/plugins/core/ruby_windows.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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) src/task/task_context_builder.rs:361— src/task/task_context_builder.rs:361-367 | src/task/task_context_builder.rs:376-382 — both copies are in the same file, so extract the 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) src/task/workspace/cargo.rs:114— src/task/workspace/cargo.rs:114-120 | src/task/workspace/uv.rs:108-114 — 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) crates/aqua-registry/src/types/matchers.rs:113— crates/aqua-registry/src/types/matchers.rs:113-118 | crates/mise-util/src/semver.rs:7-11 — 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) crates/mise-brew-metadata/src/lib.rs:248— crates/mise-brew-metadata/src/lib.rs:248-252 | crates/mise-brew-metadata/src/lib.rs:305-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.
Duplicated block (5 lines × 2) crates/mise-lsp/src/schema.rs:249— crates/mise-lsp/src/schema.rs:249-253 | src/config/schema.rs:78-82 — 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) crates/mise-oci/src/docker_archive.rs:41— crates/mise-oci/src/docker_archive.rs:41-45 | crates/mise-oci/src/registry.rs:1326-1333 — 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) crates/mise-system/src/files.rs:1039— crates/mise-system/src/files.rs:1039-1043 | crates/mise-system/src/files.rs:1424-1428 — both copies are in the same file, so extract the 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) crates/mise-ui/src/text_install_progress.rs:860— crates/mise-ui/src/text_install_progress.rs:860-864 | crates/mise-ui/src/tty_install_progress.rs:470-474 — 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) src/backend/aqua.rs:2332— src/backend/aqua.rs:2332-2336 | src/backend/aqua.rs:2403-2407 — both copies are in the same file, so extract the 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) src/backend/github.rs:256— src/backend/github.rs:256-260 | src/backend/spm.rs:123-127 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) src/backend/github.rs:2167— src/backend/github.rs:2167-2171 | src/backend/s3.rs:714-718 — 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) src/backend/packslip.rs:1562— src/backend/packslip.rs:1562-1566 | src/backend/packslip.rs:1606-1610 — both copies are in the same file, so extract the 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) src/cli/dotfiles/pull.rs:86— src/cli/dotfiles/pull.rs:86-90 | src/cli/dotfiles/sync.rs:47-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 (5 lines × 2) src/cli/shell_alias/mod.rs:37— src/cli/shell_alias/mod.rs:37-41 | src/cli/tool_alias/mod.rs:51-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 (5 lines × 2) src/config/config_file/mise_toml.rs:338— src/config/config_file/mise_toml.rs:338-342 | src/config/config_file/mise_toml.rs:371-375 — both copies are in the same file, so extract the 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) src/config/config_file/mise_toml.rs:1284— src/config/config_file/mise_toml.rs:1284-1288 | src/config/env_directive/mod.rs:861-865 — 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) src/config/mod.rs:1640— src/config/mod.rs:1640-1644 | src/toolset/toolset_env.rs:423-427 — 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) src/config/mod.rs:7263— src/config/mod.rs:7263-7267 | src/config/mod.rs:7795-7799 — both copies are in the same file, so extract the 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) src/config/mod.rs:7415— src/config/mod.rs:7415-7419 | src/config/mod.rs:7421-7425 — both copies are in the same file, so extract the 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) crates/aqua-registry/src/cache.rs:141— crates/aqua-registry/src/cache.rs:141-145 | crates/mise-util/src/hash.rs:79-83 — 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) crates/aqua-registry/src/cache.rs:147— crates/aqua-registry/src/cache.rs:147-151 | crates/mise-util/src/hash.rs:29-33 — 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) crates/mise-system/src/firewall.rs:1688— crates/mise-system/src/firewall.rs:1688-1693 | src/backend/aqua.rs:4260-4264 — 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) crates/mise-util/src/forgejo.rs:110— crates/mise-util/src/forgejo.rs:110-114 | crates/mise-util/src/github.rs:338-342 — before extracting anything, compare `crates/mise-util/src/forgejo.rs` and `crates/mise-util/src/github.rs` 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 (5 lines × 2) src/cli/upgrade.rs:1609— src/cli/upgrade.rs:1609-1613 | src/install_context.rs:108-112 — 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) REDACTED:280— REDACTED:280-288 | REDACTED:320-324 — both copies are in the same file, so extract the 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) src/task/task_cache.rs:1443— src/task/task_cache.rs:1443-1447 | src/task/task_cache.rs:1466-1471 — both copies are in the same file, so extract the 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) crates/mise-util/src/versions_host.rs:1016— crates/mise-util/src/versions_host.rs:1016-1020 | crates/mise-util/src/versions_host.rs:1048-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.
TooManyMethods: Formula crates/mise-system-packages/src/brew/shim.rb:575— TooManyMethods — 99 methods. The bar is 30 methods; this is 69 over it, 3.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.
TooManyMethods: AquaBackend src/backend/aqua.rs:49— TooManyMethods — 86 methods. The bar is 30 methods; this is 56 over it, 2.87× 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: Config src/config/mod.rs:149— TooManyMethods — 78 methods. The bar is 30 methods; this is 48 over it, 2.60× 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: Task src/task/mod.rs:326— TooManyMethods — 78 methods, declared across 2 files: task/mod.rs (75), task/task_template.rs (3). The bar is 30 methods; this is 48 over it, 2.60× 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: Toolset src/toolset/mod.rs:94— TooManyMethods — 78 methods, declared across 4 files: toolset/mod.rs (33), toolset/toolset_env.rs (21), toolset/toolset_install.rs (19), toolset/toolset_paths.rs (5). The bar is 30 methods; this is 48 over it, 2.60× 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: HistoryRepo crates/mise-system/src/history/shadow.rs:111— TooManyMethods — 62 methods. The bar is 30 methods; this is 32 over it, 2.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CmdLineRunner crates/mise-util/src/cmd.rs:128— TooManyMethods — 62 methods, declared across 2 files: src/cmd.rs (60), cmd/bounded.rs (2). The bar is 30 methods; this is 32 over it, 2.07× 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: Client crates/mise-util/src/http.rs:850— TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× 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: Vfox crates/vfox/src/vfox.rs:54— TooManyMethods — 54 methods, declared across 4 files: src/vfox.rs (19), vfox/install.rs (13), vfox/backend.rs (11), vfox/hooks.rs (11). The bar is 30 methods; this is 24 over it, 1.80× 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: NPMBackend src/backend/npm.rs:266— TooManyMethods — 53 methods. The bar is 30 methods; this is 23 over it, 1.77× 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: CaskContext crates/mise-system-packages/src/brew/cask_shim.rb:220— TooManyMethods — 52 methods. The bar is 30 methods; this is 22 over it, 1.73× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Lock src/cli/lock.rs:189— TooManyMethods — 52 methods. The bar is 30 methods; this is 22 over it, 1.73× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Plugin crates/vfox/src/plugin.rs:29— TooManyMethods — 48 methods, declared across 18 files: src/plugin.rs (24), hooks/package.rs (4), hooks/pre_install.rs (4), hooks/available.rs (2), +14 more file(s). The bar is 30 methods; this is 18 over it, 1.60× 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: RubyPlugin src/plugins/core/ruby.rs:77— TooManyMethods — 48 methods, declared across 2 files: core/ruby.rs (32), core/ruby_lock.rs (16). The bar is 30 methods; this is 18 over it, 1.60× 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: BackendArg src/args/backend_arg.rs:100— 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: PIPXBackend REDACTED:91— TooManyMethods — 46 methods, declared across 2 files: REDACTED (26), pipx/lock.rs (20). The bar is 30 methods; this is 16 over it, 1.53× 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: ToolVersion src/toolset/tool_version.rs:43— 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: ToolRequest src/toolset/tool_request.rs:44— 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: MiseToml src/config/config_file/mise_toml.rs:387— TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× 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: TaskExecutor src/task/task_executor.rs:392— TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× 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: UnifiedGitBackend src/backend/github.rs:31— TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AquaPackage crates/aqua-registry/src/types.rs:57— TooManyMethods — 40 methods, declared across 3 files: types/package_assets.rs (24), types/package.rs (11), types/package_filter.rs (5). 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: InteractiveConfig crates/mise-interactive-config/src/editor/mod.rs:33— TooManyMethods — 40 methods, declared across 8 files: editor/mod.rs (14), editor/handlers.rs (7), handlers/picker.rs (6), editor/actions.rs (5), +4 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: Lockfile src/lockfile.rs:349— TooManyMethods — 39 methods. The bar is 30 methods; this is 9 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.
TooManyMethods: CondaBackend src/backend/conda.rs:46— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (8 lines × 2) crates/mise-lsp/src/doc.rs:65— crates/mise-lsp/src/doc.rs:65-72 | crates/mise-lsp/src/doc.rs:93-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.
Duplicated block (8 lines × 2) crates/mise-system-packages/src/apk.rs:108— crates/mise-system-packages/src/apk.rs:108-115 | crates/mise-system-packages/src/apk.rs: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.
Duplicated block (8 lines × 2) crates/mise-system-packages/src/flatpak.rs:153— crates/mise-system-packages/src/flatpak.rs:153-160 | crates/mise-system-packages/src/flatpak.rs:173-180 — both copies are in the same file, so extract the 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) crates/mise-system/src/accounts.rs:797— crates/mise-system/src/accounts.rs:797-804 | crates/mise-system/src/services.rs:479-486 — before extracting anything, compare `crates/mise-system/src/accounts.rs` and `crates/mise-system/src/services.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) crates/mise-system/src/firewall.rs:219— crates/mise-system/src/firewall.rs:219-226 | crates/mise-system/src/managed_files.rs:1428-1435 — 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) crates/mise-system/src/history/store.rs:1016— crates/mise-system/src/history/store.rs:1016-1023 | crates/mise-system/src/history/store.rs:1206-1213 — both copies are in the same file, so extract the 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) crates/mise-system/src/history/watch/runtime.rs:273— crates/mise-system/src/history/watch/runtime.rs:273-280 | crates/mise-system/src/history/watch/runtime.rs:290-297 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:1285— crates/mise-util/src/cmd.rs:1285-1292 | crates/mise-util/src/cmd.rs:1301-1308 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:1492— crates/mise-util/src/cmd.rs:1492-1499 | crates/mise-util/src/cmd.rs:1511-1518 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:1894— crates/mise-util/src/cmd.rs:1894-1901 | crates/mise-util/src/cmd.rs:1954-1961 — both copies are in the same file, so extract the 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) crates/mise-util/src/file.rs:1562— crates/mise-util/src/file.rs:1562-1569 | crates/mise-util/src/file.rs:1582-1589 — both copies are in the same file, so extract the 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) src/backend/conda.rs:479— src/backend/conda.rs:479-486 | src/backend/conda.rs:578-585 — both copies are in the same file, so extract the 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) src/cli/sync/node.rs:89— src/cli/sync/node.rs:89-96 | src/cli/sync/ruby.rs:62-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.
Duplicated block (8 lines × 2) src/cli/system/import.rs:288— src/cli/system/import.rs:288-295 | src/config/config_file/mise_toml.rs:1091-1098 — 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) src/cli/system/install.rs:88— src/cli/system/install.rs:88-95 | src/cli/system/upgrade.rs:63-70 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) src/config/env_directive/mod.rs:341— src/config/env_directive/mod.rs:341-349 | src/config/env_directive/mod.rs:412-419 — both copies are in the same file, so extract the 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) src/plugins/core/erlang.rs:428— src/plugins/core/erlang.rs:428-435 | src/plugins/core/java.rs:279-286 — 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) crates/mise-system/src/scheduled_tasks.rs:435— crates/mise-system/src/scheduled_tasks.rs:435-442 | crates/mise-system/src/systemd.rs:867-874 — 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) crates/mise-util/src/file.rs:2326— crates/mise-util/src/file.rs:2326-2333 | src/backend/mod.rs:8743-8750 — 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) src/backend/http.rs:1515— src/backend/http.rs:1515-1522 | src/backend/s3.rs:614-621 — before extracting anything, compare `src/backend/http.rs` and `src/backend/s3.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) crates/mise-system/src/repos.rs:93— crates/mise-system/src/repos.rs:93-106 | src/task/task_cache.rs:1278-1285 — 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) src/task/task_script_parser.rs:501— src/task/task_script_parser.rs:501-508 | src/task/task_script_parser.rs:585-593 — both copies are in the same file, so extract the 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) crates/mise-util/src/env_diff.rs:484— crates/mise-util/src/env_diff.rs:484-491 | src/direnv.rs:114-121 — 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) crates/mise-util/src/cmd.rs:2659— crates/mise-util/src/cmd.rs:2659-2666 | crates/mise-util/src/cmd.rs:2712-2719 — both copies are in the same file, so extract the 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) src/config/config_file/mise_toml.rs:123— src/config/config_file/mise_toml.rs:123-130 | src/config/config_file/mise_toml.rs:132-139 — both copies are in the same file, so extract the 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) crates/aqua-registry/src/types/merge.rs:60— crates/aqua-registry/src/types/merge.rs:60-69 | crates/aqua-registry/src/types/merge.rs:82-91 — both copies are in the same file, so extract the 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) crates/mise-cache-core/src/protocol.rs:140— crates/mise-cache-core/src/protocol.rs:140-149 | crates/mise-cache-core/src/protocol.rs:156-165 — both copies are in the same file, so extract the 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) crates/mise-shim/src/windows_process.rs:290— crates/mise-shim/src/windows_process.rs:290-299 | crates/mise-util/src/windows_process.rs:176-185 — before extracting anything, compare `crates/mise-shim/src/windows_process.rs` and `crates/mise-util/src/windows_process.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 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 × 2) crates/mise-shim/src/windows_process.rs:365— crates/mise-shim/src/windows_process.rs:365-374 | crates/mise-util/src/windows_process.rs:201-210 — before extracting anything, compare `crates/mise-shim/src/windows_process.rs` and `crates/mise-util/src/windows_process.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 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 × 2) crates/mise-sigstore/src/certificate.rs:91— crates/mise-sigstore/src/certificate.rs:91-100 | crates/mise-sigstore/src/cosign_identity.rs:271-280 — 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) crates/mise-system-packages/src/dnf.rs:255— crates/mise-system-packages/src/dnf.rs:255-264 | crates/mise-system-packages/src/pacman.rs: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 both call sites, so a change lands once.
Duplicated block (10 lines × 2) crates/mise-system/src/firewall.rs:654— crates/mise-system/src/firewall.rs:654-663 | crates/mise-system/src/firewall.rs:666-675 — both copies are in the same file, so extract the 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) crates/mise-system/src/history/sync/network.rs:275— crates/mise-system/src/history/sync/network.rs:275-284 | crates/mise-system/src/history/sync/network.rs:301-310 — both copies are in the same file, so extract the 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) crates/mise-system/src/history/sync/reconcile.rs:309— crates/mise-system/src/history/sync/reconcile.rs:309-318 | crates/mise-system/src/history/sync/reconcile.rs:329-338 — both copies are in the same file, so extract the 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) crates/mise-system/src/managed_files.rs:2244— crates/mise-system/src/managed_files.rs:2244-2253 | crates/mise-system/src/managed_files.rs:2928-2937 — both copies are in the same file, so extract the 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) crates/mise-system/src/remote_repository.rs:175— crates/mise-system/src/remote_repository.rs:175-184 | crates/mise-system/src/remote_repository.rs:240-249 — both copies are in the same file, so extract the 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) crates/mise-util/src/forgejo.rs:293— crates/mise-util/src/forgejo.rs:293-302 | crates/mise-util/src/gitlab.rs:445-454 — before extracting anything, compare `crates/mise-util/src/forgejo.rs` and `crates/mise-util/src/gitlab.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 66 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) crates/mise-util/src/tera.rs:1860— crates/mise-util/src/tera.rs:1860-1869 | crates/mise-util/src/tera.rs:1971-1980 — both copies are in the same file, so extract the 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) src/cli/bootstrap.rs:4530— src/cli/bootstrap.rs:4530-4539 | src/cli/system/status.rs:82-91 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) src/cli/dotfiles/track.rs:931— src/cli/dotfiles/track.rs:931-941 | src/cli/dotfiles/track.rs:1005-1014 — both copies are in the same file, so extract the 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) src/cli/shim.rs:405— src/cli/shim.rs:405-414 | src/cli/shim.rs:457-466 — both copies are in the same file, so extract the 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) src/config/config_file/mise_toml.rs:967— src/config/config_file/mise_toml.rs:967-976 | src/config/config_file/mise_toml.rs:1206-1215 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/hooks.rs:660— src/hooks.rs:660-669 | src/hooks.rs:780-789 — both copies are in the same file, so extract the 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) src/lockfile.rs:2298— src/lockfile.rs:2298-2307 | src/lockfile.rs:2334-2343 — both copies are in the same file, so extract the 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) src/lockfile.rs:2309— src/lockfile.rs:2309-2318 | src/lockfile.rs:2345-2354 — both copies are in the same file, so extract the 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) src/oci/builder.rs:574— src/oci/builder.rs:574-583 | src/oci/builder.rs:711-720 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/shims.rs:1853— src/shims.rs:1853-1862 | src/shims.rs:1870-1879 — both copies are in the same file, so extract the 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) src/task/mod.rs:257— src/task/mod.rs:257-266 | src/task/mod.rs:283-292 — both copies are in the same file, so extract the 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) crates/mise-cache-core/src/retry.rs:18— crates/mise-cache-core/src/retry.rs:18-27 | crates/mise-util/src/http.rs:3616-3625 — 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) crates/mise-system-packages/src/apt_sources.rs:119— crates/mise-system-packages/src/apt_sources.rs:119-134 | crates/mise-system/src/systemd.rs:182-191 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) crates/mise-dotenv/src/lib.rs:176— crates/mise-dotenv/src/lib.rs:176-187 | crates/mise-dotenv/src/lib.rs:204-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 (12 lines × 2) crates/mise-system-packages/src/brew/cask/mod.rs:4139— crates/mise-system-packages/src/brew/cask/mod.rs:4139-4150 | crates/mise-system-packages/src/brew/cask/state.rs:450-461 — 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) crates/mise-system-packages/src/brew/pour.rs:679— crates/mise-system-packages/src/brew/pour.rs:679-690 | crates/mise-system/src/files.rs:2248-2259 — 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) crates/mise-system/src/defaults/dock.rs:21— crates/mise-system/src/defaults/dock.rs:21-32 | crates/mise-system/src/login_items.rs:72-83 — 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) crates/mise-system/src/managed_files.rs:1298— crates/mise-system/src/managed_files.rs:1298-1309 | crates/mise-system/src/managed_files.rs:1477-1488 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:2038— crates/mise-util/src/cmd.rs:2038-2049 | crates/mise-util/src/cmd.rs:2075-2086 — both copies are in the same file, so extract the 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) crates/mise-util/src/cmd.rs:2132— crates/mise-util/src/cmd.rs:2132-2143 | crates/mise-util/src/cmd.rs:2169-2180 — both copies are in the same file, so extract the 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) crates/mise-util/src/file.rs:2991— crates/mise-util/src/file.rs:2991-3002 | crates/vfox/src/vfox/install.rs:467-478 — before extracting anything, compare `crates/mise-util/src/file.rs` and `crates/vfox/src/vfox/install.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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) crates/mise-util/src/forgejo.rs:216— crates/mise-util/src/forgejo.rs:216-227 | crates/mise-util/src/gitlab.rs:367-378 — before extracting anything, compare `crates/mise-util/src/forgejo.rs` and `crates/mise-util/src/gitlab.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 66 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 (12 lines × 2) crates/mise-util/src/hash.rs:64— crates/mise-util/src/hash.rs:64-75 | crates/mise-util/src/hash.rs:91-102 — both copies are in the same file, so extract the 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) src/backend/aqua.rs:885— src/backend/aqua.rs:885-896 | src/backend/aqua.rs:1226-1238 — both copies are in the same file, so extract the 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) src/backend/cargo/native_binstall.rs:121— src/backend/cargo/native_binstall.rs:121-132 | src/backend/cargo/native_binstall.rs:213-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.
Duplicated block (12 lines × 2) src/backend/http.rs:1717— src/backend/http.rs:1717-1728 | src/backend/s3.rs:716-727 — before extracting anything, compare `src/backend/http.rs` and `src/backend/s3.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 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 (12 lines × 2) src/backend/static_helpers.rs:515— src/backend/static_helpers.rs:515-526 | src/backend/static_helpers.rs:616-627 — both copies are in the same file, so extract the 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) src/backend/ubi.rs:244— src/backend/ubi.rs:244-255 | src/backend/ubi.rs:281-292 — both copies are in the same file, so extract the 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) src/backend/vfox.rs:630— src/backend/vfox.rs:630-641 | src/backend/vfox.rs:660-671 — both copies are in the same file, so extract the 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) src/cli/bootstrap.rs:2865— src/cli/bootstrap.rs:2865-2876 | src/cli/bootstrap.rs:2895-2907 — both copies are in the same file, so extract the 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) src/cli/bootstrap.rs:3978— src/cli/bootstrap.rs:3978-3989 | src/cli/ssh.rs:175-186 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) src/cli/exec.rs:838— src/cli/exec.rs:838-849 | src/cli/exec.rs:1033-1044 — both copies are in the same file, so extract the 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) src/daemons/glue.rs:264— src/daemons/glue.rs:264-275 | src/daemons/glue.rs:297-308 — both copies are in the same file, so extract the 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) src/sops.rs:93— src/sops.rs:93-104 | src/sops.rs:153-164 — both copies are in the same file, so extract the 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) src/task/task_source_checker.rs:754— src/task/task_source_checker.rs:754-765 | src/task/task_source_checker.rs:878-889 — both copies are in the same file, so extract the 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) crates/mise-system-packages/src/apt_sources.rs:828— crates/mise-system-packages/src/apt_sources.rs:828-839 | crates/mise-system-packages/src/dnf_repos.rs:407-418 — 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) crates/mise-system/src/secrets.rs:84— crates/mise-system/src/secrets.rs:84-96 | crates/mise-system/src/services_common.rs:130-141 — before extracting anything, compare `crates/mise-system/src/secrets.rs` and `crates/mise-system/src/services_common.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) crates/mise-system/src/unapply.rs:181— crates/mise-system/src/unapply.rs:181-192 | crates/mise-system/src/unapply.rs:251-262 — both copies are in the same file, so extract the 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) crates/mise-config/src/packages.rs:158— crates/mise-config/src/packages.rs:158-168 | crates/mise-config/src/packages.rs:182-192 — both copies are in the same file, so extract the 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) crates/mise-sigstore/src/bundle.rs:36— crates/mise-sigstore/src/bundle.rs:36-46 | crates/mise-sigstore/src/github.rs:120-130 — 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) crates/mise-system-packages/src/apt.rs:604— crates/mise-system-packages/src/apt.rs:604-614 | crates/mise-system-packages/src/apt.rs:633-643 — both copies are in the same file, so extract the 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) crates/mise-system/src/files.rs:4438— crates/mise-system/src/files.rs:4438-4448 | crates/mise-system/src/files.rs:4554-4564 — both copies are in the same file, so extract the 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) crates/mise-system/src/firewall.rs:1249— crates/mise-system/src/firewall.rs:1249-1259 | crates/mise-system/src/firewall.rs:1431-1441 — both copies are in the same file, so extract the 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) crates/mise-system/src/history/journal.rs:218— crates/mise-system/src/history/journal.rs:218-228 | crates/mise-system/src/history/journal.rs:387-397 — both copies are in the same file, so extract the 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) crates/mise-util/src/forgejo.rs:45— crates/mise-util/src/forgejo.rs:45-55 | crates/mise-util/src/gitlab.rs:178-188 — before extracting anything, compare `crates/mise-util/src/forgejo.rs` and `crates/mise-util/src/gitlab.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) crates/mise-util/src/github.rs:163— crates/mise-util/src/github.rs:163-173 | crates/mise-util/src/gitlab.rs:165-175 — before extracting anything, compare `crates/mise-util/src/github.rs` and `crates/mise-util/src/gitlab.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) src/backend/external_plugin_cache.rs:42— src/backend/external_plugin_cache.rs:42-52 | src/backend/external_plugin_cache.rs:82-92 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/backend/go.rs:773— src/backend/go.rs:773-783 | src/backend/go.rs:807-817 — both copies are in the same file, so extract the 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) src/backend/http.rs:1105— src/backend/http.rs:1105-1115 | src/backend/s3.rs:426-436 — before extracting anything, compare `src/backend/http.rs` and `src/backend/s3.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) src/cli/bootstrap.rs:3678— src/cli/bootstrap.rs:3678-3688 | src/cli/bootstrap.rs:4333-4343 — both copies are in the same file, so extract the 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) src/cli/bootstrap.rs:4448— src/cli/bootstrap.rs:4448-4458 | src/cli/doctor/mod.rs:509-519 — 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) src/cli/sync/node.rs:132— src/cli/sync/node.rs:132-142 | src/cli/sync/python.rs:81-91 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) src/config/env_directive/mod.rs:538— src/config/env_directive/mod.rs:538-548 | src/config/env_directive/mod.rs:592-602 — both copies are in the same file, so extract the 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) src/direnv.rs:69— src/direnv.rs:69-79 | src/direnv.rs:92-102 — both copies are in the same file, so extract the 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) src/plugins/core/erlang.rs:458— src/plugins/core/erlang.rs:458-468 | src/plugins/core/erlang.rs:521-531 — both copies are in the same file, so extract the 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) src/plugins/core/ruby.rs:301— src/plugins/core/ruby.rs:301-311 | src/plugins/core/ruby_windows.rs:70-80 — before extracting anything, compare `src/plugins/core/ruby.rs` and `src/plugins/core/ruby_windows.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) src/watch_files.rs:240— src/watch_files.rs:240-250 | src/watch_files.rs:315-325 — both copies are in the same file, so extract the 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) crates/mise-system/src/files.rs:4124— crates/mise-system/src/files.rs:4124-4136 | crates/mise-system/src/files.rs:4162-4172 — both copies are in the same file, so extract the 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) src/cli/generate/tool_stub.rs:557— src/cli/generate/tool_stub.rs:557-567 | src/cli/generate/tool_stub.rs:572-583 — both copies are in the same file, so extract the 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) src/cli/cache/clear.rs:64— src/cli/cache/clear.rs:64-74 | src/cli/cache/prune.rs: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 × 2) src/cli/trust.rs:234— src/cli/trust.rs:234-244 | src/cli/trust.rs:325-335 — both copies are in the same file, so extract the 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) src/toolset/env_cache.rs:159— src/toolset/env_cache.rs:159-169 | src/toolset/env_cache.rs:335-345 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
mise_system_packages::brew::cask::flight::execute_flight_step (cognitive 163) crates/mise-system-packages/src/brew/cask/flight.rs:585— mise_system_packages::brew::cask::flight::execute_flight_step has cognitive complexity 163 (threshold 15). Drivers by points: if/else 49 (118 pts), loops 12 (30 pts), boolean chains 12, match/switch 2 (3 pts) (nesting depth added 88). 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.
mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens (cognitive 79) crates/mise-system-packages/src/brew/cask/state.rs:1175— mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens has cognitive complexity 79 (threshold 15). Drivers by points: if/else 25 (55 pts), match/switch 5 (13 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system_packages::apt_sources::apply (cognitive 49) crates/mise-system-packages/src/apt_sources.rs:600— mise_system_packages::apt_sources::apply has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 4 (11 pts), loops 4 (8 pts), boolean chains 6 (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.
mise_system_packages::brew::resolve::resolve_closure_pairs (cognitive 47) crates/mise-system-packages/src/brew/resolve.rs:144— mise_system_packages::brew::resolve::resolve_closure_pairs has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 8 (17 pts), match/switch 1 (3 pts) (nesting depth added 27). Of this number, 43 points are the body's own statements and 4 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.
mise_system_packages::brew::post_install::copy_tree (cognitive 42) crates/mise-system-packages/src/brew/post_install.rs:73— mise_system_packages::brew::post_install::copy_tree has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (39 pts), boolean chains 2, loops 1 (nesting depth added 26). 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.
mise_system_packages::brew::pour::link_keg (cognitive 39) crates/mise-system-packages/src/brew/pour.rs:769— mise_system_packages::brew::pour::link_keg has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 5 (10 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.
mise_system_packages::brew::cask::state::validate_cask_prune_candidate (cognitive 27) crates/mise-system-packages/src/brew/cask/state.rs:1612— mise_system_packages::brew::cask::state::validate_cask_prune_candidate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, loops 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system_packages::brew::cask::prewarm_downloads (cognitive 25) crates/mise-system-packages/src/brew/cask/mod.rs:1405— mise_system_packages::brew::cask::prewarm_downloads has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, loops 2, 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.
mise_system_packages::brew::cask::copy_staged_artifact_closure (cognitive 25) crates/mise-system-packages/src/brew/cask/mod.rs:2329— mise_system_packages::brew::cask::copy_staged_artifact_closure has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system_packages::brew::cask::installed_skip_reason (cognitive 23) crates/mise-system-packages/src/brew/cask/mod.rs:105— mise_system_packages::brew::cask::installed_skip_reason has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 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.
mise_system_packages::brew::cask::state::cask_target_claimed_by_another (cognitive 23) crates/mise-system-packages/src/brew/cask/state.rs:1566— mise_system_packages::brew::cask::state::cask_target_claimed_by_another has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), boolean chains 4, 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.
mise_system_packages::brew::pour::remove_abandoned_staging_dirs (cognitive 23) crates/mise-system-packages/src/brew/pour.rs:290— mise_system_packages::brew::pour::remove_abandoned_staging_dirs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system_packages::brew::prefix::bootstrap (cognitive 23) crates/mise-system-packages/src/brew/prefix.rs:196— mise_system_packages::brew::prefix::bootstrap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 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.
mise_system_packages::brew::cask::app_version::compare_app_versions (cognitive 22) crates/mise-system-packages/src/brew/cask/app_version.rs:268— mise_system_packages::brew::cask::app_version::compare_app_versions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 1 (nesting depth added 5). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
mise_system_packages::brew::cask::bulk::top_level_elements (cognitive 21) crates/mise-system-packages/src/brew/cask/bulk.rs:595— mise_system_packages::brew::cask::bulk::top_level_elements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 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.
mise_system_packages::check_name_conflicts (cognitive 19) crates/mise-system-packages/src/lib.rs:346— mise_system_packages::check_name_conflicts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system_packages::brew::cask::remove_obsolete_app_targets (cognitive 19) crates/mise-system-packages/src/brew/cask/mod.rs:3214— mise_system_packages::brew::cask::remove_obsolete_app_targets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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.
mise_system_packages::brew::cask::state::validate_cask_prune_claims (cognitive 19) crates/mise-system-packages/src/brew/cask/state.rs:1525— mise_system_packages::brew::cask::state::validate_cask_prune_claims has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (8 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.
mise_system_packages::brew::post_install::apply_mode (cognitive 19) crates/mise-system-packages/src/brew/post_install.rs:575— mise_system_packages::brew::post_install::apply_mode has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 3 (5 pts), if/else 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system_packages::apt::parse_policy_origins (cognitive 17) crates/mise-system-packages/src/apt.rs:289— mise_system_packages::apt::parse_policy_origins has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_system_packages::brew::cask::open_trusted_directory (cognitive 17) crates/mise-system-packages/src/brew/cask/mod.rs:2910— mise_system_packages::brew::cask::open_trusted_directory has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, match/switch 2 (5 pts), if/else 2 (3 pts), loops 1 (nesting depth added 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.
mise_system_packages::brew::cask::fetch::fetch_cask (cognitive 16) crates/mise-system-packages/src/brew/cask/fetch.rs:3— mise_system_packages::brew::cask::fetch::fetch_cask has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 3 (4 pts), boolean chains 3 (nesting depth added 4). 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.
mise_util::agecrypt::load_identities (cognitive 41) crates/mise-util/src/agecrypt.rs:313— mise_util::agecrypt::load_identities has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (8 pts), match/switch 3 (7 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.
mise_util::tera::tera_exec (cognitive 33) crates/mise-util/src/tera.rs:1998— mise_util::tera::tera_exec has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (7 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 17). 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.
mise_util::cache::prune_dir (cognitive 32) crates/mise-util/src/cache.rs:617— mise_util::cache::prune_dir has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 6, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_util::github::sigstore::verify_with_mirror (cognitive 30) crates/mise-util/src/github/sigstore.rs:630— mise_util::github::sigstore::verify_with_mirror has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 2 (4 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.
mise_util::github_relay::unix::forward (cognitive 30) crates/mise-util/src/github_relay.rs:607— mise_util::github_relay::unix::forward has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 4 (5 pts), boolean chains 2, match/switch 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.
mise_util::github::resolve_token_inner (cognitive 28) crates/mise-util/src/github.rs:2107— mise_util::github::resolve_token_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_util::http::apply_url_replacements (cognitive 28) crates/mise-util/src/http.rs:3403— mise_util::http::apply_url_replacements has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
mise_util::github::sigstore::detect_with_mirror (cognitive 25) crates/mise-util/src/github/sigstore.rs:749— mise_util::github::sigstore::detect_with_mirror has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, 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.
mise_util::http::cas::evict (cognitive 23) crates/mise-util/src/http/cas.rs:474— mise_util::http::cas::evict has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (6 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.
mise_util::github::oauth::refresh_cached_token (cognitive 22) crates/mise-util/src/github/oauth.rs:182— mise_util::github::oauth::refresh_cached_token has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, 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.
mise_util::file::link_target_stays_within (cognitive 21) crates/mise-util/src/file.rs:2990— mise_util::file::link_target_stays_within has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 2 (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.
mise_util::path::split_shell_command_windows (cognitive 20) crates/mise-util/src/path.rs:421— mise_util::path::split_shell_command_windows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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.
mise_util::http::cas::keep_file (cognitive 19) crates/mise-util/src/http/cas.rs:333— mise_util::http::cas::keep_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 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.
mise_util::path::resolve_posix_shell_program_path (cognitive 19) crates/mise-util/src/path.rs:538— mise_util::path::resolve_posix_shell_program_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_util::args::first_non_global_arg_idx_with (cognitive 18) crates/mise-util/src/args.rs:42— mise_util::args::first_non_global_arg_idx_with has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_util::semver::chunkify_version (cognitive 18) crates/mise-util/src/semver.rs:22— mise_util::semver::chunkify_version has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 6). Of this number, 11 points are the body's own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_util::env_diff::parse_export_p (cognitive 17) crates/mise-util/src/env_diff.rs:357— mise_util::env_diff::parse_export_p has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 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.
mise_util::github::paginate_mirrored_releases (cognitive 17) crates/mise-util/src/github.rs:434— mise_util::github::paginate_mirrored_releases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_util::gitlab::find_expired_glab_tokens (cognitive 17) crates/mise-util/src/gitlab.rs:610— mise_util::gitlab::find_expired_glab_tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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.
mise_util::env_diff::normalize_escape_sequences (cognitive 16) crates/mise-util/src/env_diff.rs:497— mise_util::env_diff::normalize_escape_sequences has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_util::github::oauth::token_async (cognitive 16) crates/mise-util/src/github/oauth.rs:247— mise_util::github::oauth::token_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 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.
Change coupling: install.rs ↔ upgrade.rs src/cli/system/install.rs:1— `src/cli/system/install.rs` and `src/cli/system/upgrade.rs` change together 93% of the time (13 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `83345da9` feat(bootstrap): add --upgrade to upgrade packages and tools (#14433); `a50c23e5` refactor: remove every core → cli dependency (#13642); `48d2fd0e` feat(bootstrap): support zypper host packages (#13335) — run `git show` on any of them.
Change coupling: cache.rs ↔ types.rs crates/aqua-registry/src/cache.rs:1— `crates/aqua-registry/src/cache.rs` and `crates/aqua-registry/src/types.rs` change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `48c85e3e` fix(aqua): make the baked registry encoding deterministic (#14809); `13e05af7` fix(aqua): use crate names in cargo warnings (#12252); `bc1bb339` fix(aqua): apply explicit package type overrides (#11901) — run `git show` on any of them.
Change coupling: outdated.rs ↔ upgrade.rs src/cli/outdated.rs:1— `src/cli/outdated.rs` and `src/cli/upgrade.rs` change together 80% of the time (16 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are `90ca0b36` perf(outdated): resolve many registry tools with one request to the m…; `0090d946` feat(upgrade): add --global so self-updating tools can update through…; `710686ec` fix(cli): replace unimplemented!() in --monorepo flags with an error … — run `git show` on any of them.
Change coupling: mise_toml.rs ↔ tool_versions.rs src/config/config_file/mise_toml.rs:1— `src/config/config_file/mise_toml.rs` and `src/config/config_file/tool_versions.rs` change together 79% of the time (34 of the 43 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 34 shared commits counted here, the most recent 3 are `00da73f7` security(hooks): render hook commands once and keep templates out of …; `27e92ea0` security(config): require trust for path: tool versions (#14358); `d1ca2185` feat(config): expose the config file's own path to templates (#12454) — run `git show` on any of them.
Change coupling: install.rs ↔ use.rs src/cli/system/install.rs:1— `src/cli/system/install.rs` and `src/cli/system/use.rs` change together 73% of the time (11 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `83345da9` feat(bootstrap): add --upgrade to upgrade packages and tools (#14433); `926dd15b` feat(bootstrap): add snap package manager (#14402); `a50c23e5` refactor: remove every core → cli dependency (#13642) — run `git show` on any of them.
Change coupling: upgrade.rs ↔ use.rs src/cli/system/upgrade.rs:1— `src/cli/system/upgrade.rs` and `src/cli/system/use.rs` change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `83345da9` feat(bootstrap): add --upgrade to upgrade packages and tools (#14433); `a50c23e5` refactor: remove every core → cli dependency (#13642); `e09d0963` feat(bootstrap): add winget package manager support (#12928) — run `git show` on any of them.
Change coupling: node.rs ↔ python.rs src/cli/sync/node.rs:1— `src/cli/sync/node.rs` and `src/cli/sync/python.rs` change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `f2b35406` fix(lock): allow lock and upgrade in locked mode (#10111); `30d9e19e` feat: added `mise sync python --uv` (#3575); `ba961329` fix: bug with missing shims after install (#3159) — run `git show` on any of them.
Change coupling: envrc.rs ↔ hook_env.rs src/cli/direnv/envrc.rs:1— `src/cli/direnv/envrc.rs` and `src/cli/hook_env.rs` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `1aa36708` fix: bug fixes with tools=true in env (#3639); `39ab82ce` fix: windows paths; `a7aa50ca` refactor: env parsing (#1515) — run `git show` on any of them.
Change coupling: asdf.rs ↔ uninstall.rs src/backend/asdf.rs:1— `src/backend/asdf.rs` and `src/cli/plugins/uninstall.rs` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `44cca9fe` refactor: split asdf into forge+plugin (#2226); `9314640a` verbose: improve verbose progress bar output (#1187) (at that commit the file was still `src/plugins/external_plugin.rs`); `37f592af` plugin-update: update in parallel (#1186) (at that commit the file was still `src/plugins/external_plugin.rs`) — run `git show` on any of them.
Change coupling: run.rs ↔ edit.rs src/cli/run.rs:1— `src/cli/run.rs` and `src/cli/tasks/edit.rs` change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `d949e6c8` chore: update singular/plural forms for word "task" (#7448); `baa4d33b` feat(tasks): add experimental monorepo task support with target paths…; `be06de19` fix: use project_root for task execution (#2942) — run `git show` on any of them.
Change coupling: hooks.rs ↔ watch_files.rs src/hooks.rs:1— `src/hooks.rs` and `src/watch_files.rs` change together 56% of the time (10 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `71529e4d` security(config): stop treating help, shims, hooks and config writes …; `00da73f7` security(hooks): render hook commands once and keep templates out of …; `49290aac` fix(hooks): run task hooks with mise instead of the initiating tool s… — run `git show` on any of them.
Change coupling: settings.data.ts ↔ settings.rs docs/settings.data.ts:1— `docs/settings.data.ts` and `src/config/settings.rs` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `d821d59f` refactor(cache): generalize remote action protocol (#11763); `1c4ebb54` feat(python): rework `python.uv_venv_auto` setting (#7905); `49c7002d` feat(http): add URL replacement feature for HTTP requests (#6207) — run `git show` on any of them.
Change coupling: bootstrap.rs ↔ edit.rs src/cli/bootstrap.rs:1— `src/cli/bootstrap.rs` and `src/cli/dotfiles/edit.rs` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `9a79c907` feat(dotfiles): remove targets with mode = "absent" (#13513); `f80454c9` feat(dotfiles): set target file permissions with a permissions key (#…; `5fb0429e` feat(dotfiles): run history reload commands after mise dot apply (#13… — run `git show` on any of them.
Change coupling: info.rs ↔ ls.rs src/cli/tasks/info.rs:1— `src/cli/tasks/info.rs` and `src/cli/tasks/ls.rs` change together 52% of the time (13 of the 25 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `06abf0fc` fix: require experimental for remote task sources, OpenTelemetry and …; `7ecc466b` feat(task): allow {{ secrets.X }} in task env values (#13978); `52ee31d2` feat(daemons): let tasks require daemons and daemons run tasks (#13340) — run `git show` on any of them.
Change coupling: uninstall.rs ↔ upgrade.rs src/cli/uninstall.rs:1— `src/cli/uninstall.rs` and `src/cli/upgrade.rs` change together 50% of the time (21 of the 42 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are `329a7dda` fix(upgrade): defer pruning replaced tool versions (#12593); `259b3584` refactor(cli): defer process termination (#11440); `f2b35406` fix(lock): allow lock and upgrade in locked mode (#10111) — run `git show` on any of them.
Change coupling: asdf_plugin.rs ↔ vfox_plugin.rs src/plugins/asdf_plugin.rs:1— `src/plugins/asdf_plugin.rs` and `src/plugins/vfox_plugin.rs` change together 50% of the time (15 of the 30 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are `da974fbe` refactor: distinguish "could not ask" from "no" in confirmation promp…; `ee3e9171` fix(plugins): support local paths in config (#11487); `f617b961` feat(config): add MISE_SAFE mode to block repo-controlled code execut… — run `git show` on any of them.
Change coupling: install.rs ↔ uninstall.rs src/cli/plugins/install.rs:1— `src/cli/plugins/install.rs` and `src/cli/plugins/uninstall.rs` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `44cca9fe` refactor: split asdf into forge+plugin (#2226); `2b1aa1a9` logging: added --quiet flag (#1140); `9fba26f0` completions: fix zsh completions when sourced directly (#1080) — run `git show` on any of them.
Change coupling: unset.rs ↔ use.rs src/cli/unset.rs:1— `src/cli/unset.rs` and `src/cli/use.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `11c78ba1` feat(config): add global section write targets (#14018); `e055799d` fix(unset): respect global config path from home (#10105); `4ed73b4d` fix: MISE_PROFILE fixes (#2973) — run `git show` on any of them.
Change coupling: envrc.rs ↔ exec.rs src/cli/direnv/envrc.rs:1— `src/cli/direnv/envrc.rs` and `src/cli/exec.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `1aa36708` fix: bug fixes with tools=true in env (#3639); `6c74c4ac` chore: sign macos binary; `0a7d33b9` bump rust version — run `git show` on any of them.
Change coupling: main.rs ↔ shims.rs crates/mise-shim/src/main.rs:1— `crates/mise-shim/src/main.rs` and `src/shims.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `0f2a89a1` feat(doctor): flag a mise-shim.exe template older than mise (#14586); `2fcec190` fix(shim): support shared executable directories (#12675); `2e15e1ae` fix(generate): deliver Windows launcher arguments intact (#12463) — run `git show` on any of them.
Low cohesion: Settings (LCOM4 17) src/cli/settings/mod.rs:59— Settings's methods fall into 17 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 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: NodePlugin (LCOM4 9) src/plugins/core/node.rs:33— NodePlugin's methods fall into 9 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 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: RustPlugin (LCOM4 8) src/plugins/core/rust.rs:27— RustPlugin's methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: NPMBackend (LCOM4 7) src/backend/npm.rs:266— NPMBackend's methods fall into 7 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 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: MiseServer (LCOM4 7) src/cli/mcp.rs:63— MiseServer's methods fall into 7 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 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: PackslipBackend (LCOM4 6) src/backend/packslip.rs:66— PackslipBackend's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: PIPXBackend (LCOM4 6) REDACTED:91— PIPXBackend's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: DotnetPlugin (LCOM4 6) src/plugins/core/dotnet.rs:26— DotnetPlugin's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: JavaPlugin (LCOM4 6) src/plugins/core/java.rs:44— JavaPlugin's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: GoBackend (LCOM4 5) src/backend/go.rs:24— GoBackend's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Config (LCOM4 5) src/config/mod.rs:149— Config's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: BunPlugin (LCOM4 5) src/plugins/core/bun.rs:36— BunPlugin's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: SwiftPlugin (LCOM4 5) src/plugins/core/swift.rs:32— SwiftPlugin's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ZigPlugin (LCOM4 5) src/plugins/core/zig.rs:30— ZigPlugin's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: CondaBackend (LCOM4 4) src/backend/conda.rs:46— CondaBackend's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: DotnetBackend (LCOM4 4) src/backend/dotnet.rs:21— DotnetBackend's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: HttpBackend (LCOM4 4) src/backend/http.rs:152— HttpBackend's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: UbiBackend (LCOM4 4) src/backend/ubi.rs:30— UbiBackend's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: DenoPlugin (LCOM4 4) src/plugins/core/deno.rs:32— DenoPlugin's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: RubyPlugin (LCOM4 4) src/plugins/core/ruby_windows.rs:30— RubyPlugin'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.
Repeated repair: src/errors.rs src/errors.rs:68— src/errors.rs changed 15 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is mise::errors::format_install_failures at line 68), 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(config): require content-bound trust for env files in paranoid mode (#14604)”; “fix(lock): refuse to lock a version that a failed listing never confirmed (#13552)”; “fix(cmd): name the child's last stderr line in a command failure (#13315)”; “fix(install): skip lockfile-missing warnings for unrequested tools (#13259)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/errors.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.
Repeated repair: crates/aqua-registry/src/types.rs crates/aqua-registry/src/types.rs:302— crates/aqua-registry/src/types.rs changed 14 times in last 90 days and 8 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 aqua_registry::types::deserialize_registry_aliases at line 302), 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(aqua): make the baked registry encoding deterministic (#14809)”; “fix(windows): repair ARM64 project tooling (#12931)”; “fix(aqua): suggest compatible package backends (#12225)”; “fix(aqua): use crate names in cargo warnings (#12252)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/aqua-registry/src/types.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.
Repeated repair: src/cli/dotfiles/history_status.rs src/cli/dotfiles/history_status.rs:437— src/cli/dotfiles/history_status.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is mise::cli::dotfiles::history_status::print_capture at line 437), 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(dot): show the local history path in status and explain split track entries (#14979)”; “fix(dotfiles): stop a newly selected profile from deleting its shared file (#14275)”; “fix(dotfiles): diagnose stale history watchers (#13864)”; “fix(dotfiles): restart the history watcher after mise is upgraded (#13845)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/dotfiles/history_status.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.
Repeated repair: src/toolset/install_options.rs src/toolset/install_options.rs:55— src/toolset/install_options.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 1 (its worst body is InstallOptions::default at line 55), 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(shim): skip other missing lazy tools when a lazy tool installs on first use (#14201)”; “fix(npm): report aube safety checks and honor --yes (#13123)”; “fix(task): auto-install tools for run task references (#13086)”; “fix(install): summarize interactive progress without duplicate rows (#13030)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/toolset/install_options.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.
Repeated repair: crates/mise-shim/src/main.rs crates/mise-shim/src/main.rs:80— crates/mise-shim/src/main.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is mise_shim::run at line 80), 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(shim): keep the version tag in the Windows release mise-shim.exe (#14656)”; “fix(shim): forward Node IPC through Windows shims (#13903)”; “fix(shim): stop native shim copies recursing through mise x (#13681)”; “fix(release): package every file mise reads at compile time (#13573)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/mise-shim/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.
Repeated repair: src/backend/asset_matcher.rs src/backend/asset_matcher.rs:635— src/backend/asset_matcher.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is AssetPicker::score_build_penalties at line 635), 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(github): never auto-select metadata assets as the tool (#13908)”; “fix(backend): handle unsupported ARM32 artifacts safely (#13004)”; “fix(backend): normalize shorthand archive stems (#12199)”; “fix(backend): preserve Windows ZIP preference (#12200)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/backend/asset_matcher.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.
Repeated repair: crates/mise-util/src/versions_host.rs crates/mise-util/src/versions_host.rs:232— crates/mise-util/src/versions_host.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is VersionsHostLogContext::fields at line 232), 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(github): retry api.github.com when mise-versions errors (#14501)”; “fix(github): verify attestations from mise-versions without api.github.com fallbacks (#14469)”; “fix(github): list git tags from mise-versions instead of api.github.com (#14461)”; “fix(github): stop falling back to api.github.com when mise-versions misses (#14460)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/mise-util/src/versions_host.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.
Repeated repair: crates/vfox/src/http.rs crates/vfox/src/http.rs:238— crates/vfox/src/http.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is vfox::http::download_to_file at line 238), 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(http): fall back to bundled root certificates when the system store is empty (#14817)”; “fix(vfox): report an HTTP client that cannot be built instead of panicking (#14576)”; “fix(vfox): apply netrc credentials to HTTP requests (#12168)”; “fix(vfox): honor url replacements (#11795)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/vfox/src/http.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.
Repeated repair: src/lockfile/graph.rs src/lockfile/graph.rs:408— src/lockfile/graph.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is SidecarWrites::prepare at line 408), 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(lock): keep npm sidecars in one place for a symlinked config dir (#14961)”; “fix(lock): pin a relocated dependency sidecar to the bytes mise just wrote (#13407)”; “fix(lock): keep installing lockfiles whose sidecar digest was recorded on Windows (#13403)”; “fix(lock): install locked npm and pypi tools from Windows checkouts (#13398)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/lockfile/graph.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.
Repeated repair: src/migrate.rs src/migrate.rs:39— src/migrate.rs 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 mise::migrate::migrate_incomplete_markers at line 39), 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(migrate): keep an unwritable stderr from aborting mise during a migration (#14158)”; “fix(install): keep incomplete-install markers out of the cache (#14051)”; “fix(skills): show $HOME as ~ in skills sync output (#13910)”; “fix(backend): retire expired runtime symlink migration (#13868)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/migrate.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.
Repeated repair: src/toolset/tool_version_list.rs src/toolset/tool_version_list.rs:27— src/toolset/tool_version_list.rs 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 8 (its worst body is ToolVersionList::resolve at line 27), 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(exec): limit @latest resolution to the tools named on the command line (#13943)”; “fix(lock): make --bump check remote versions and fail when it can't (#13544)”; “fix(tool): exclude os-inactive inspection versions (#12021)”; “fix(rust): resolve nightly to dated toolchains (#11980)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/toolset/tool_version_list.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.
Repeated repair: src/task/task_file_providers/remote_task_git.rs src/task/task_file_providers/remote_task_git.rs:153— src/task/task_file_providers/remote_task_git.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is RemoteTaskGit::fetch_to_destination at line 153), 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(task): preserve Git task snapshots (#12000)”; “fix(task): support azure devops cloud ssh urls (remote git sources) (#12102)”; “fix(task): handle azure devops remote git includes (#11768)”; “chore(clippy): fix warnings surfaced by clippy 0.1.97 (#11516)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/task/task_file_providers/remote_task_git.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.
Repeated repair: src/cli/dotfiles/capture_health.rs src/cli/dotfiles/capture_health.rs:38— src/cli/dotfiles/capture_health.rs changed 5 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 7 (its worst body is mise::cli::dotfiles::capture_health::watcher at line 38), 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(dotfiles): don't say nothing is configured when history tracks entries (#14206)”; “fix(dotfiles): diagnose stale history watchers (#13864)”; “fix(dotfiles): restart the history watcher after mise is upgraded (#13845)”; “fix(dotfiles): restart a history watcher that is not watching this store (#13190)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/cli/dotfiles/capture_health.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.
Repeated repair: crates/aqua-registry/src/cache.rs crates/aqua-registry/src/cache.rs:78— crates/aqua-registry/src/cache.rs changed 4 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 7 (its worst body is RegistryCache::write_compiled at line 78), 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(aqua): make the baked registry encoding deterministic (#14809)”; “fix(aqua): invalidate incompatible compiled registry caches (#13884)”; “fix(aqua): use crate names in cargo warnings (#12252)”; “fix(aqua): apply explicit package type overrides (#11901)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/aqua-registry/src/cache.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.
Repeated repair: crates/mise-util/src/packslip_pins.rs crates/mise-util/src/packslip_pins.rs:291— crates/mise-util/src/packslip_pins.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is mise_util::packslip_pins::check_against at line 291), 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(install): retain saved packslip shared-workflow pins (#14408)”; “fix(packslip): let a workflow list carry the signer pin across a workflow move (#14338)”; “fix(packslip): follow transferred repositories, and document installing mise with packslip (#13710)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- crates/mise-util/src/packslip_pins.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.
Repeated repair: src/packslip_forge.rs src/packslip_forge.rs:216— src/packslip_forge.rs 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 6 (its worst body is ForgeExpect::new at line 216), 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(packslip): keep a renamed project's lockfile signer under packslip 1.7 (#14362)”; “fix(packslip): let a workflow list carry the signer pin across a workflow move (#14338)”; “fix(packslip): follow transferred repositories, and document installing mise with packslip (#13710)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/packslip_forge.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.
Repeated repair: src/deps/state.rs src/deps/state.rs:174— src/deps/state.rs 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 5 (its worst body is mise::deps::state::hash_dir_files at line 174), 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(deps): rerun providers when mise recreates the venv (#14532)”; “fix(deps): honor source and output overrides (#11896)”; “fix(deps): invalidate state when commands change (#11849)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:15:51 -05:00' --until='2026-10-25 20:15:51 -05:00' --full-history --no-merges -- src/deps/state.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.
mise_system_packages::brew::cask::flight::execute_flight_step (cyclomatic 76) crates/mise-system-packages/src/brew/cask/flight.rs:585— mise_system_packages::brew::cask::flight::execute_flight_step has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens (cyclomatic 37) crates/mise-system-packages/src/brew/cask/state.rs:1175— mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens 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.
mise_system_packages::apt_sources::apply (cyclomatic 29) crates/mise-system-packages/src/apt_sources.rs:600— mise_system_packages::apt_sources::apply 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.
mise_system_packages::brew::cask::state::validate_cask_prune_candidate (cyclomatic 23) crates/mise-system-packages/src/brew/cask/state.rs:1612— mise_system_packages::brew::cask::state::validate_cask_prune_candidate 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.
mise_system_packages::brew::cask::installed_skip_reason (cyclomatic 21) crates/mise-system-packages/src/brew/cask/mod.rs:105— mise_system_packages::brew::cask::installed_skip_reason 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.
mise_system_packages::brew::resolve::resolve_closure_pairs (cyclomatic 20) crates/mise-system-packages/src/brew/resolve.rs:144— mise_system_packages::brew::resolve::resolve_closure_pairs has cyclomatic complexity 20 (threshold 15). Of this number, 16 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.
mise_system_packages::brew::post_install::apply_mode (cyclomatic 19) crates/mise-system-packages/src/brew/post_install.rs:575— mise_system_packages::brew::post_install::apply_mode 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.
mise_system_packages::brew::pour::link_keg (cyclomatic 18) crates/mise-system-packages/src/brew/pour.rs:769— mise_system_packages::brew::pour::link_keg 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.
mise_system_packages::brew::cask::prewarm_downloads (cyclomatic 17) crates/mise-system-packages/src/brew/cask/mod.rs:1405— mise_system_packages::brew::cask::prewarm_downloads 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.
mise_system_packages::brew::post_install::copy_tree (cyclomatic 17) crates/mise-system-packages/src/brew/post_install.rs:73— mise_system_packages::brew::post_install::copy_tree 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.
mise_system_packages::brew::cask::app_version::compare_app_versions (cyclomatic 16) crates/mise-system-packages/src/brew/cask/app_version.rs:268— mise_system_packages::brew::cask::app_version::compare_app_versions has cyclomatic complexity 16 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
mise_system_packages::brew::cask::fetch::fetch_cask (cyclomatic 16) crates/mise-system-packages/src/brew/cask/fetch.rs:3— mise_system_packages::brew::cask::fetch::fetch_cask 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.
mise_system_packages::brew::pour::remove_abandoned_staging_dirs (cyclomatic 16) crates/mise-system-packages/src/brew/pour.rs:290— mise_system_packages::brew::pour::remove_abandoned_staging_dirs 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.
mise_system_packages::brew::prefix::bootstrap (cyclomatic 16) crates/mise-system-packages/src/brew/prefix.rs:196— mise_system_packages::brew::prefix::bootstrap 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.
TooManyFields: Task src/task/mod.rs:326— TooManyFields — 72 stored fields beside 78 methods. The bar is 30 stored fields; this is 42 over it, 2.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Run src/cli/run.rs:101— TooManyFields — 54 stored fields beside 23 methods. The bar is 30 stored fields; this is 24 over it, 1.80× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: WatchexecArgs src/cli/watch.rs:566— TooManyFields — 44 stored fields beside 1 method. The bar is 30 stored fields; this is 14 over it, 1.47× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: TaskDecl crates/mise-config/src/task/decl.rs:28— TooManyFields — 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: SystemdRequest crates/mise-system/src/systemd.rs:23— TooManyFields — 43 stored fields beside 2 methods. The bar is 30 stored fields; this is 13 over it, 1.43× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: MiseToml src/config/config_file/mise_toml.rs:387— TooManyFields — 42 stored fields beside 43 methods. The bar is 30 stored fields; this is 12 over it, 1.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: SystemdTomlConfig crates/mise-config/src/systemd.rs:83— TooManyFields — 39 stored fields. The bar is 30 stored fields; this is 9 over it, 1.30× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: MiseTomlDecl crates/mise-config/src/mise_toml.rs:42— TooManyFields — 37 stored fields. The bar is 30 stored fields; this is 7 over it, 1.23× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: AquaPackage crates/aqua-registry/src/types.rs:57— TooManyFields — 36 stored fields beside 40 methods. The bar is 30 stored fields; this is 6 over it, 1.20× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: TaskTemplate crates/mise-config/src/task/decl.rs:197— TooManyFields — 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: BootstrapRemote src/cli/bootstrap.rs:1115— TooManyFields — 35 stored fields beside 1 method. The bar is 30 stored fields; this is 5 over it, 1.17× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
Duplicated block (14 lines × 2) crates/mise-util/src/git.rs:190— crates/mise-util/src/git.rs:190-203 | crates/mise-util/src/git.rs:337-350 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) crates/vfox/src/hooks/backend_install.rs:36— crates/vfox/src/hooks/backend_install.rs:36-49 | crates/vfox/src/hooks/backend_uninstall.rs:30-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 (14 lines × 2) src/backend/aqua.rs:3711— src/backend/aqua.rs:3711-3724 | src/backend/aqua.rs:3738-3751 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/backend/github.rs:2374— src/backend/github.rs:2374-2387 | src/backend/github.rs:2570-2583 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/backend/static_helpers.rs:1787— src/backend/static_helpers.rs:1787-1800 | src/backend/static_helpers.rs:1808-1821 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/cli/token/forgejo.rs:40— src/cli/token/forgejo.rs:40-53 | src/cli/token/gitlab.rs:40-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.
Duplicated block (14 lines × 2) src/cli/watch.rs:427— src/cli/watch.rs:427-440 | src/toolset/tool_version.rs:1659-1672 — 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) src/plugins/core/ruby.rs:286— src/plugins/core/ruby.rs:286-299 | src/plugins/core/ruby_windows.rs:55-68 — before extracting anything, compare `src/plugins/core/ruby.rs` and `src/plugins/core/ruby_windows.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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) src/toolset/toolset_install.rs:155— src/toolset/toolset_install.rs:155-168 | src/toolset/toolset_install.rs:246-259 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/tool_catalog.rs:298— src/tool_catalog.rs:298-311 | src/tool_catalog.rs:346-359 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/shell/fish.rs:192— src/shell/fish.rs:192-205 | src/shell/fish.rs:216-229 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Off the main sequence: mise-agent-env — mise-agent-env: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: mise-bootstrap — mise-bootstrap: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: mise-brew-metadata — mise-brew-metadata: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: mise-brew-relocation — mise-brew-relocation: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: mise-dotenv — mise-dotenv: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: mise-lsp — mise-lsp: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: aqua-registry — aqua-registry: abstractness 0.04, instability 0.00, distance 0.96 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: mise-config — mise-config: abstractness 0.00, instability 0.14, distance 0.86 — zone of pain — concrete and depended on by 6 project(s), so it's rigid to change.
Off the main sequence: mise-interactive-config — mise-interactive-config: abstractness 0.15, instability 0.00, distance 0.85 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: mise-settings — mise-settings: abstractness 0.00, instability 0.22, distance 0.78 — zone of pain — concrete and depended on by 7 project(s), so it's rigid to change.
Off the main sequence: mise-cache-core — mise-cache-core: abstractness 0.00, instability 0.25, distance 0.75 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Duplicated block (16 lines × 2) crates/mise-system-packages/src/brew/mod.rs:451— crates/mise-system-packages/src/brew/mod.rs:451-466 | crates/mise-system-packages/src/brew/mod.rs:473-488 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/backend/github.rs:2336— src/backend/github.rs:2336-2351 | src/backend/github.rs:2535-2550 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/cli/system/import.rs:229— src/cli/system/import.rs:229-244 | src/cli/system/use.rs:213-228 — 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 (16 lines × 2) src/cli/tool.rs:188— src/cli/tool.rs:188-203 | src/cli/tool.rs:247-262 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/cli/upgrade.rs:469— src/cli/upgrade.rs:469-484 | src/cli/upgrade.rs:945-960 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/config/env_directive/mod.rs:575— src/config/env_directive/mod.rs:575-590 | src/config/env_directive/mod.rs:606-621 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/plugins/asdf_plugin.rs:398— src/plugins/asdf_plugin.rs:398-413 | src/plugins/vfox_plugin.rs:500-515 — before extracting anything, compare `src/plugins/asdf_plugin.rs` and `src/plugins/vfox_plugin.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) src/plugins/core/ruby.rs:835— src/plugins/core/ruby.rs:835-850 | src/plugins/core/ruby_windows.rs:218-233 — before extracting anything, compare `src/plugins/core/ruby.rs` and `src/plugins/core/ruby_windows.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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) src/task/task_executor.rs:1218— src/task/task_executor.rs:1218-1233 | src/task/task_executor.rs:1246-1261 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/toolset/env_cache.rs:284— src/toolset/env_cache.rs:284-299 | src/toolset/env_cache.rs:434-449 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
mise_lsp::complete::advance (cognitive 49) crates/mise-lsp/src/complete.rs:465— mise_lsp::complete::advance has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 4 (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.
mise_lsp::tasks::cycles (cognitive 29) crates/mise-lsp/src/tasks.rs:1037— mise_lsp::tasks::cycles has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_lsp::includes::glob_matches (cognitive 24) crates/mise-lsp/src/includes.rs:279— mise_lsp::includes::glob_matches has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (6 pts), loops 2 (4 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.
mise_lsp::semantic::tokens (cognitive 20) crates/mise-lsp/src/semantic.rs:84— mise_lsp::semantic::tokens has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (6 pts), 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.
mise_lsp::tasks::references_in (cognitive 20) crates/mise-lsp/src/tasks.rs:676— mise_lsp::tasks::references_in has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 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.
mise_lsp::includes::task_include_files (cognitive 19) crates/mise-lsp/src/includes.rs:157— mise_lsp::includes::task_include_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_lsp::rpc::read_message (cognitive 19) crates/mise-lsp/src/rpc.rs:10— mise_lsp::rpc::read_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_lsp::tasks::key_occurrences (cognitive 18) crates/mise-lsp/src/tasks.rs:764— mise_lsp::tasks::key_occurrences has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_lsp::tasks::config_dir_files (cognitive 16) crates/mise-lsp/src/tasks.rs:909— mise_lsp::tasks::config_dir_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, 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.
mise_util::agecrypt::load_identities (cyclomatic 22) crates/mise-util/src/agecrypt.rs:313— mise_util::agecrypt::load_identities 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.
mise_util::env_diff::normalize_escape_sequences (cyclomatic 22) crates/mise-util/src/env_diff.rs:497— mise_util::env_diff::normalize_escape_sequences 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.
mise_util::cache::prune_dir (cyclomatic 21) crates/mise-util/src/cache.rs:617— mise_util::cache::prune_dir 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.
mise_util::github::resolve_token_inner (cyclomatic 21) crates/mise-util/src/github.rs:2107— mise_util::github::resolve_token_inner 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.
mise_util::github_relay::unix::forward (cyclomatic 21) crates/mise-util/src/github_relay.rs:607— mise_util::github_relay::unix::forward 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.
mise_util::github::sigstore::verify_with_mirror (cyclomatic 18) crates/mise-util/src/github/sigstore.rs:630— mise_util::github::sigstore::verify_with_mirror 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.
mise_util::github::sigstore::detect_with_mirror (cyclomatic 16) crates/mise-util/src/github/sigstore.rs:749— mise_util::github::sigstore::detect_with_mirror 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.
mise_util::tera::tera_exec (cyclomatic 16) crates/mise-util/src/tera.rs:1998— mise_util::tera::tera_exec 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.
Lock::get_tools_to_lock (cognitive 197) src/cli/lock.rs:2268— Lock::get_tools_to_lock has cognitive complexity 197 (threshold 15). Drivers by points: if/else 35 (117 pts), match/switch 8 (34 pts), boolean chains 23, loops 9 (23 pts) (nesting depth added 122). 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.
Lock::process_tools (cognitive 33) src/cli/lock.rs:2885— Lock::process_tools has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 6 (9 pts), match/switch 2 (5 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.
Lock::add_task_tools_to_lock (cognitive 31) src/cli/lock.rs:2697— Lock::add_task_tools_to_lock has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 1 (5 pts), boolean chains 3, loops 2 (3 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.
Lock::prepare_targets (cognitive 22) src/cli/lock.rs:810— Lock::prepare_targets has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 5 (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.
Lock::compute_version_changes (cognitive 18) src/cli/lock.rs:1541— Lock::compute_version_changes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 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.
Lock::run_with_installed (cognitive 17) src/cli/lock.rs:613— Lock::run_with_installed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 6, loops 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.
Lock::list_sidecars (cognitive 16) src/cli/lock.rs:1596— Lock::list_sidecars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 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.
Lock::bind_requests (cognitive 16) src/cli/lock.rs:1727— Lock::bind_requests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_daemons::load (cognitive 89) crates/mise-daemons/src/lib.rs:258— mise_daemons::load has cognitive complexity 89 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 15 (22 pts), boolean chains 9, match/switch 4 (9 pts) (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.
mise_daemons::presets::run_steps (cognitive 51) crates/mise-daemons/src/presets.rs:1187— mise_daemons::presets::run_steps has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 4 (11 pts), loops 3 (6 pts), boolean chains 4 (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.
mise_daemons::build (cognitive 50) crates/mise-daemons/src/lib.rs:639— mise_daemons::build has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 7, match/switch 4 (6 pts), loops 1 (3 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.
mise_daemons::presets::expand (cognitive 38) crates/mise-daemons/src/presets.rs:666— mise_daemons::presets::expand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (25 pts), loops 8 (11 pts), match/switch 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.
mise_daemons::presets::resolve_options (cognitive 29) crates/mise-daemons/src/presets.rs:398— mise_daemons::presets::resolve_options has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_daemons::import (cognitive 22) crates/mise-daemons/src/lib.rs:990— mise_daemons::import has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, 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.
mise_daemons::prune::remove (cognitive 22) crates/mise-daemons/src/prune.rs:294— mise_daemons::prune::remove has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (7 pts), loops 2 (5 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.
mise_daemons::expand_group (cognitive 16) crates/mise-daemons/src/lib.rs:1315— mise_daemons::expand_group has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 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.
AquaBackend::install_version_ (cognitive 54) src/backend/aqua.rs:489— AquaBackend::install_version_ has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (36 pts), match/switch 4 (12 pts), boolean chains 6 (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.
AquaBackend::verify_provenance (cognitive 54) src/backend/aqua.rs:3303— AquaBackend::verify_provenance has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 17, match/switch 2 (5 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.
AquaBackend::resolve_lock_info (cognitive 51) src/backend/aqua.rs:826— AquaBackend::resolve_lock_info has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 11 (21 pts), if/else 14 (18 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AquaBackend::verify_provenance_at_lock_time (cognitive 21) src/backend/aqua.rs:1788— AquaBackend::verify_provenance_at_lock_time has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (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.
AquaBackend::run_cosign_check (cognitive 20) src/backend/aqua.rs:2321— AquaBackend::run_cosign_check has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 7 (9 pts) (nesting depth added 8). 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.
AquaBackend::install (cognitive 20) src/backend/aqua.rs:3782— AquaBackend::install has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, loops 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.
AquaBackend::resolve_validated_package (cognitive 16) src/backend/aqua.rs:1157— AquaBackend::resolve_validated_package has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 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.
UnifiedGitBackend::discover_bin_paths (cognitive 51) src/backend/github.rs:2135— UnifiedGitBackend::discover_bin_paths has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 3 (10 pts), boolean chains 2 (nesting depth added 31). 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.
UnifiedGitBackend::verify_attestations_or_slsa (cognitive 35) src/backend/github.rs:2858— UnifiedGitBackend::verify_attestations_or_slsa has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 10, match/switch 2 (4 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.
UnifiedGitBackend::verify_provenance_at_lock_time (cognitive 31) src/backend/github.rs:1557— UnifiedGitBackend::verify_provenance_at_lock_time has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (11 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UnifiedGitBackend::resolve_lock_info (cognitive 26) src/backend/github.rs:1139— UnifiedGitBackend::resolve_lock_info has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UnifiedGitBackend::detect_provenance_type (cognitive 24) src/backend/github.rs:1439— UnifiedGitBackend::detect_provenance_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, 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.
UnifiedGitBackend::download_verify_and_install_additional_asset (cognitive 18) src/backend/github.rs:1973— UnifiedGitBackend::download_verify_and_install_additional_asset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
UnifiedGitBackend::try_verify_slsa (cognitive 16) src/backend/github.rs:3136— UnifiedGitBackend::try_verify_slsa has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (6 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.
Toolset::install_all_versions_with_progress (cognitive 48) src/toolset/toolset_install.rs:322— Toolset::install_all_versions_with_progress has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 8, loops 3 (7 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.
Toolset::install_with_deps (cognitive 42) src/toolset/toolset_install.rs:694— Toolset::install_with_deps has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 7 (16 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Toolset::sort_by_overrides (cognitive 33) src/toolset/mod.rs:702— Toolset::sort_by_overrides has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 9 (13 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.
Toolset::install_missing_bin (cognitive 26) src/toolset/toolset_install.rs:1027— Toolset::install_missing_bin has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (8 pts), match/switch 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.
Toolset::ensure_plugins_installed (cognitive 22) src/toolset/toolset_install.rs:643— Toolset::ensure_plugins_installed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 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.
Toolset::list_installed_versions (cognitive 21) src/toolset/mod.rs:304— Toolset::list_installed_versions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (7 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Toolset::list_outdated_versions_selecting (cognitive 19) src/toolset/mod.rs:532— Toolset::list_outdated_versions_selecting has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
mise_oci::layer::collect_sorted_entries (cognitive 31) crates/mise-oci/src/layer.rs:518— mise_oci::layer::collect_sorted_entries has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (30 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.
mise_oci::layer::build_layer_from_sources (cognitive 28) crates/mise-oci/src/layer.rs:348— mise_oci::layer::build_layer_from_sources has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_oci::registry::parse_challenge_params (cognitive 25) crates/mise-oci/src/registry.rs:210— mise_oci::registry::parse_challenge_params has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 7, if/else 4 (7 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.
mise_oci::registry::push_image (cognitive 24) crates/mise-oci/src/registry.rs:1314— mise_oci::registry::push_image has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (8 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.
mise_oci::registry::merge_artifact_tree (cognitive 21) crates/mise-oci/src/registry.rs:1019— mise_oci::registry::merge_artifact_tree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (7 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.
mise_oci::layer::build_layer_from_entries (cognitive 16) crates/mise-oci/src/layer.rs:593— mise_oci::layer::build_layer_from_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2, match/switch 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.
mise_oci::packages::materialize_diff (cognitive 16) crates/mise-oci/src/packages.rs:780— mise_oci::packages::materialize_diff 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.
mise_daemons::load (cyclomatic 50) crates/mise-daemons/src/lib.rs:258— mise_daemons::load has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_daemons::build (cyclomatic 37) crates/mise-daemons/src/lib.rs:639— mise_daemons::build has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mise_daemons::presets::expand (cyclomatic 26) crates/mise-daemons/src/presets.rs:666— mise_daemons::presets::expand 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.
mise_daemons::presets::run_steps (cyclomatic 23) crates/mise-daemons/src/presets.rs:1187— mise_daemons::presets::run_steps 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.
mise_daemons::presets::resolve_options (cyclomatic 16) crates/mise-daemons/src/presets.rs:398— mise_daemons::presets::resolve_options 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.
mise_daemons::prune::remove (cyclomatic 16) crates/mise-daemons/src/prune.rs:294— mise_daemons::prune::remove 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.
TaskExecutor::run_task_sched (cognitive 160) src/task/task_executor.rs:630— TaskExecutor::run_task_sched has cognitive complexity 160 (threshold 15). Drivers by points: if/else 55 (125 pts), boolean chains 21, match/switch 3 (9 pts), loops 1 (5 pts) (nesting depth added 80). 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.
TaskExecutor::exec_program (cognitive 133) src/task/task_executor.rs:1847— TaskExecutor::exec_program has cognitive complexity 133 (threshold 15). Drivers by points: if/else 74 (113 pts), boolean chains 18, match/switch 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskExecutor::exec_task_run_entries (cognitive 33) src/task/task_executor.rs:1127— TaskExecutor::exec_task_run_entries has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskExecutor::inject_and_wait (cognitive 32) src/task/task_executor.rs:1267— TaskExecutor::inject_and_wait has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 6 (10 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskExecutor::prepare_task_context (cognitive 24) src/task/task_executor.rs:2717— TaskExecutor::prepare_task_context has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TaskExecutor::check_confirmation (cognitive 16) src/task/task_executor.rs:2433— TaskExecutor::check_confirmation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HistoryRepo::read_meta_in (cognitive 53) crates/mise-system/src/history/shadow.rs:905— HistoryRepo::read_meta_in has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 7 (12 pts), boolean chains 5, match/switch 2 (4 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.
HistoryRepo::decrypted_diff (cognitive 35) crates/mise-system/src/history/shadow.rs:1451— HistoryRepo::decrypted_diff has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HistoryRepo::capture_tracked_files (cognitive 29) crates/mise-system/src/history/shadow.rs:423— HistoryRepo::capture_tracked_files has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 7 (12 pts), loops 2 (3 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.
HistoryRepo::compose (cognitive 21) crates/mise-system/src/history/shadow.rs:1731— HistoryRepo::compose has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (8 pts), match/switch 1 (2 pts) (nesting depth added 11). 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.
HistoryRepo::visit_paths_in (cognitive 18) crates/mise-system/src/history/shadow.rs:852— HistoryRepo::visit_paths_in has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HistoryRepo::diff (cognitive 17) crates/mise-system/src/history/shadow.rs:1379— HistoryRepo::diff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Duplicated block (15 lines × 2) crates/mise-system/src/lib.rs:737— crates/mise-system/src/lib.rs:737-751 | crates/mise-system/src/lib.rs:2117-2131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/backend/gem.rs:527— src/backend/gem.rs:527-541 | src/backend/gem.rs:570-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 (15 lines × 2) src/backend/github.rs:2446— src/backend/github.rs:2446-2460 | src/backend/github.rs:2544-2558 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/backend/github.rs:2479— src/backend/github.rs:2479-2493 | src/backend/github.rs:2577-2591 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/cli/generate/task_stubs.rs:638— src/cli/generate/task_stubs.rs:638-652 | src/cli/generate/tool_stub.rs:257-271 — 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) crates/mise-util/src/sandbox/landlock.rs:209— crates/mise-util/src/sandbox/landlock.rs:209-223 | crates/mise-util/src/sandbox/landlock.rs:233-247 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) crates/mise-system-packages/src/mas.rs:264— crates/mise-system-packages/src/mas.rs:264-276 | crates/mise-system-packages/src/mas.rs:287-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.
Duplicated block (13 lines × 2) crates/mise-system/src/managed_files.rs:946— crates/mise-system/src/managed_files.rs:946-958 | crates/mise-system/src/managed_files.rs:996-1008 — both copies are in the same file, so extract the 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 (13 lines × 2) crates/mise-util/src/cmd.rs:1720— crates/mise-util/src/cmd.rs:1720-1732 | crates/mise-util/src/cmd.rs:1957-1969 — both copies are in the same file, so extract the 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 (13 lines × 2) src/cli/lock.rs:2841— src/cli/lock.rs:2841-2853 | src/cli/lock.rs:2905-2917 — both copies are in the same file, so extract the 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 (13 lines × 2) src/secrets/broker.rs:321— src/secrets/broker.rs:321-333 | src/secrets/broker.rs:355-367 — both copies are in the same file, so extract the 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 (13 lines × 2) crates/mise-system/src/history/tracked.rs:2441— crates/mise-system/src/history/tracked.rs:2441-2453 | src/config/env_directive/file.rs:131-143 — 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–7 lines × 2) crates/vfox/src/lua_mod/http.rs:309— crates/vfox/src/lua_mod/http.rs:309-314 | crates/vfox/src/lua_mod/http.rs:368-374 — both copies are in the same file, so extract the 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–7 lines × 2) src/backend/aqua.rs:840— src/backend/aqua.rs:840-845 | src/backend/aqua.rs:1188-1194 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6–7 lines × 2) src/cli/mod.rs:623— src/cli/mod.rs:623-628 | src/cli/mod.rs:630-636 — both copies are in the same file, so extract the 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–7 lines × 2) src/lockfile.rs:3190— src/lockfile.rs:3190-3195 | src/lockfile.rs:4992-4998 — both copies are in the same file, so extract the 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–7 lines × 2) src/plugins/core/erlang.rs:447— src/plugins/core/erlang.rs:447-452 | src/plugins/core/erlang.rs:509-515 — both copies are in the same file, so extract the 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–7 lines × 2) src/watch_files.rs:231— src/watch_files.rs:231-237 | src/watch_files.rs:300-305 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Task::merge_template_with (cyclomatic 38) src/task/task_template.rs:50— Task::merge_template_with has cyclomatic complexity 38 (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.
Task::merge_toml_overlay (cyclomatic 25) src/task/mod.rs:2599— Task::merge_toml_overlay has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, 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.
Task::render (cyclomatic 19) src/task/mod.rs:2828— Task::render 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.
Task::resolve_workspace_task_dependencies (cyclomatic 17) src/task/mod.rs:1767— Task::resolve_workspace_task_dependencies has cyclomatic complexity 17 (threshold 15). Of this number, 13 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.
Task::render_runtime_templates_with_usage (cyclomatic 17) src/task/mod.rs:2938— Task::render_runtime_templates_with_usage 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.
DepsEngine::run (cyclomatic 29) src/deps/engine.rs:592— DepsEngine::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.
DepsEngine::check_freshness (cyclomatic 28) src/deps/engine.rs:1071— DepsEngine::check_freshness 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.
DepsEngine::run_with_deps (cyclomatic 25) src/deps/engine.rs:855— DepsEngine::run_with_deps 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.
DepsEngine::new_monorepo_with_fallback (cyclomatic 17) src/deps/engine.rs:232— DepsEngine::new_monorepo_with_fallback 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.
DepsEngine::execute_command (cyclomatic 17) src/deps/engine.rs:1212— DepsEngine::execute_command 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.
EnvResults::resolve_with_toolset (cognitive 231) src/config/env_directive/mod.rs:192— EnvResults::resolve_with_toolset has cognitive complexity 231 (threshold 15). Drivers by points: if/else 57 (158 pts), loops 11 (31 pts), match/switch 12 (29 pts), boolean chains 13 (nesting depth added 138). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EnvResults::file (cognitive 48) src/config/env_directive/file.rs:146— EnvResults::file has cognitive complexity 48 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 9 (16 pts), match/switch 3 (9 pts), boolean chains 4 (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.
EnvResults::source (cognitive 35) src/config/env_directive/source.rs:9— EnvResults::source has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (9 pts), match/switch 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.
EnvResults::validate_required_vars (cognitive 29) src/config/env_directive/mod.rs:764— EnvResults::validate_required_vars has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, loops 2, 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.
EnvResults::module (cognitive 18) src/config/env_directive/module.rs:15— EnvResults::module has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 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.
Backend::install_version (cognitive 82) src/backend/mod.rs:5023— Backend::install_version has cognitive complexity 82 (threshold 15). Drivers by points: if/else 43 (55 pts), boolean chains 25, match/switch 2 (nesting depth added 12). 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.
Backend::is_version_installed (cognitive 26) src/backend/mod.rs:3892— Backend::is_version_installed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 10, 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.
Backend::run_postinstall_hook (cognitive 23) src/backend/mod.rs:5460— Backend::run_postinstall_hook has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 5 (8 pts), match/switch 3 (5 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.
Backend::list_remote_versions_with_info_and_options (cognitive 20) src/backend/mod.rs:3461— Backend::list_remote_versions_with_info_and_options has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, match/switch 5 (7 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Backend::latest_version_with_selection_options (cognitive 19) src/backend/mod.rs:4541— Backend::latest_version_with_selection_options 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.
InteractiveConfig::handle_enter (cognitive 80) crates/mise-interactive-config/src/editor/actions/enter.rs:4— InteractiveConfig::handle_enter has cognitive complexity 80 (threshold 15). Drivers by points: if/else 31 (69 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 43). 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.
InteractiveConfig::undo (cognitive 52) crates/mise-interactive-config/src/editor/actions/undo.rs:64— InteractiveConfig::undo has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (41 pts), boolean chains 9, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InteractiveConfig::apply_new_key (cognitive 21) crates/mise-interactive-config/src/editor/actions/edit.rs:55— InteractiveConfig::apply_new_key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, match/switch 1 (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.
InteractiveConfig::handle_picker_section_select (cognitive 17) crates/mise-interactive-config/src/editor/handlers/picker.rs:210— InteractiveConfig::handle_picker_section_select has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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.
InteractiveConfig::handle_version_select_key (cognitive 17) crates/mise-interactive-config/src/editor/handlers/selection.rs:4— InteractiveConfig::handle_version_select_key has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (7 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.
DepsEngine::run (cognitive 61) src/deps/engine.rs:592— DepsEngine::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (48 pts), loops 5 (7 pts), boolean chains 5, match/switch 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
DepsEngine::run_with_deps (cognitive 56) src/deps/engine.rs:855— DepsEngine::run_with_deps has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 6 (13 pts), match/switch 4 (10 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DepsEngine::check_freshness (cognitive 38) src/deps/engine.rs:1071— DepsEngine::check_freshness has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 5 (8 pts), boolean chains 6, 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.
DepsEngine::new_monorepo_with_fallback (cognitive 36) src/deps/engine.rs:232— DepsEngine::new_monorepo_with_fallback has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DepsEngine::execute_command (cognitive 23) src/deps/engine.rs:1212— DepsEngine::execute_command has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3, boolean chains 2, match/switch 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.
PIPXBackend::install_version_ (cognitive 49) REDACTED:707— PIPXBackend::install_version_ has cognitive complexity 49 (threshold 15). Drivers by points: if/else 26 (41 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PIPXBackend::prepare_install_version (cognitive 28) REDACTED:563— PIPXBackend::prepare_install_version has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, match/switch 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.
PIPXBackend::validate_uv_lock (cognitive 27) src/backend/pipx/lock.rs:510— PIPXBackend::validate_uv_lock has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 9, 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.
PIPXBackend::is_install_satisfied (cognitive 27) REDACTED:645— PIPXBackend::is_install_satisfied has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6 (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.
PIPXBackend::version_from_distribution_filename (cognitive 17) REDACTED:1136— PIPXBackend::version_from_distribution_filename has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Task::merge_template_with (cognitive 38) src/task/task_template.rs:50— Task::merge_template_with has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24 (25 pts), boolean chains 12, 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.
Task::merge_toml_overlay (cognitive 25) src/task/mod.rs:2599— Task::merge_toml_overlay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (20 pts), loops 3, boolean chains 2 (nesting depth added 1). Of this number, 23 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, 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.
Task::render (cognitive 24) src/task/mod.rs:2828— Task::render has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 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.
Task::resolve_workspace_task_dependencies (cognitive 22) src/task/mod.rs:1767— Task::resolve_workspace_task_dependencies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 3 (nesting depth added 5). Of this number, 15 points are the body's own statements and 7 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.
Task::render_runtime_templates_with_usage (cognitive 18) src/task/mod.rs:2938— Task::render_runtime_templates_with_usage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7 (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.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×5
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/mise-system/src/accounts.rs:713— crates/mise-system/src/accounts.rs:713-811 | crates/mise-system/src/firewall.rs:543-615 | crates/mise-system/src/managed_files.rs:936-1063 | crates/mise-system/src/services.rs:404-493 — 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) crates/mise-util/src/github.rs:564— crates/mise-util/src/github.rs:564-604 | crates/mise-util/src/github.rs:611-649 | crates/mise-util/src/github.rs:1214-1242 | crates/mise-util/src/gitlab.rs:114-146 — 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) crates/mise-util/src/github.rs:967— crates/mise-util/src/github.rs:967-987 | crates/mise-util/src/github.rs:1132-1181 | crates/mise-util/src/gitlab.rs:232-261 | crates/mise-util/src/gitlab.rs:290-315 — 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) src/cli/bootstrap.rs:3574— src/cli/bootstrap.rs:3574-3601 | src/cli/bootstrap.rs:3818-3855 | src/cli/bootstrap.rs:3883-3911 | src/cli/bootstrap.rs:3936-3963 — 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) src/cli/bootstrap.rs:3574— src/cli/bootstrap.rs:3574-3601 | src/cli/bootstrap.rs:3666-3719 | src/cli/bootstrap.rs:3818-3855 | src/cli/bootstrap.rs:3936-3963 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (19–20 lines × 2) crates/mise-util/src/cmd.rs:1434— crates/mise-util/src/cmd.rs:1434-1453 | crates/mise-util/src/cmd.rs:1674-1692 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19–20 lines × 2) src/config/mod.rs:6184— src/config/mod.rs:6184-6202 | src/config/mod.rs:6219-6238 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19–20 lines × 2) src/plugins/asdf_plugin.rs:192— src/plugins/asdf_plugin.rs:192-211 | src/plugins/vfox_plugin.rs:223-241 — before extracting anything, compare `src/plugins/asdf_plugin.rs` and `src/plugins/vfox_plugin.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (19–20 lines × 2) src/plugins/asdf_plugin.rs:286— src/plugins/asdf_plugin.rs:286-304 | src/plugins/vfox_plugin.rs:351-370 — before extracting anything, compare `src/plugins/asdf_plugin.rs` and `src/plugins/vfox_plugin.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (19–20 lines × 2) src/task/task_scheduler.rs:264— src/task/task_scheduler.rs:264-283 | src/task/task_scheduler.rs:342-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.
Duplicated block (17 lines × 2) crates/mise-shim/src/windows_process.rs:377— crates/mise-shim/src/windows_process.rs:377-393 | crates/mise-util/src/windows_process.rs:214-230 — before extracting anything, compare `crates/mise-shim/src/windows_process.rs` and `crates/mise-util/src/windows_process.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 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 (17 lines × 2) crates/mise-sigstore/src/bundle.rs:71— crates/mise-sigstore/src/bundle.rs:71-87 | crates/mise-sigstore/src/github.rs:147-163 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (17 lines × 2) crates/mise-system/src/lib.rs:813— crates/mise-system/src/lib.rs:813-829 | crates/mise-system/src/lib.rs:2148-2164 — both copies are in the same file, so extract the 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) src/toolset/install_state.rs:1665— src/toolset/install_state.rs:1665-1681 | src/toolset/install_state.rs:1684-1700 — both copies are in the same file, so extract the 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) crates/mise-system-packages/src/brew/tap.rs:74— crates/mise-system-packages/src/brew/tap.rs:74-91 | crates/mise-system-packages/src/brew/tap.rs:134-150 — both copies are in the same file, so extract the 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 × 3) crates/mise-util/src/forgejo.rs:58— crates/mise-util/src/forgejo.rs:58-68 | crates/mise-util/src/github.rs:204-214 | crates/mise-util/src/gitlab.rs:191-201 — before extracting anything, compare `crates/mise-util/src/forgejo.rs` and `crates/mise-util/src/github.rs` 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 (11 lines × 3) src/backend/cargo/native_binstall.rs:120— src/backend/cargo/native_binstall.rs:120-130 | src/backend/cargo/native_binstall.rs:212-222 | src/backend/cargo/native_binstall.rs:285-295 — 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 (11 lines × 3) src/sops.rs:94— src/sops.rs:94-104 | src/sops.rs:121-131 | src/sops.rs:154-164 — 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 (11 lines × 3) crates/mise-system/src/accounts.rs:798— crates/mise-system/src/accounts.rs:798-808 | crates/mise-system/src/firewall.rs:602-612 | crates/mise-system/src/services.rs:480-490 — before extracting anything, compare `crates/mise-system/src/accounts.rs` and `crates/mise-system/src/services.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) src/cli/shim.rs:407— src/cli/shim.rs:407-417 | src/cli/shim.rs:439-449 | src/cli/shim.rs:459-469 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) crates/mise-util/src/github.rs:972— crates/mise-util/src/github.rs:972-978 | crates/mise-util/src/gitlab.rs:242-252 | crates/mise-util/src/gitlab.rs:299-306 — before extracting anything, compare `crates/mise-util/src/github.rs` and `crates/mise-util/src/gitlab.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 62 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 × 3) crates/vfox/src/hooks/backend_exec_env.rs:37— crates/vfox/src/hooks/backend_exec_env.rs:37-43 | crates/vfox/src/hooks/backend_install.rs:36-43 | crates/vfox/src/hooks/backend_uninstall.rs:30-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.
Duplicated block (7 lines × 3) src/backend/github.rs:1528— src/backend/github.rs:1528-1534 | src/backend/github.rs:1663-1669 | src/backend/github.rs:3189-3195 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) src/cli/tasks/add.rs:172— src/cli/tasks/add.rs:172-178 | src/cli/tasks/add.rs:179-185 | src/cli/tasks/add.rs:212-218 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) crates/mise-util/src/forgejo.rs:49— crates/mise-util/src/forgejo.rs:49-55 | crates/mise-util/src/github.rs:195-201 | crates/mise-util/src/gitlab.rs:182-188 — before extracting anything, compare `crates/mise-util/src/forgejo.rs` and `crates/mise-util/src/github.rs` 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.
TaskExecutor::exec_program (cyclomatic 79) src/task/task_executor.rs:1847— TaskExecutor::exec_program has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TaskExecutor::run_task_sched (cyclomatic 72) src/task/task_executor.rs:630— TaskExecutor::run_task_sched has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TaskExecutor::inject_and_wait (cyclomatic 24) src/task/task_executor.rs:1267— TaskExecutor::inject_and_wait 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.
TaskExecutor::prepare_task_context (cyclomatic 19) src/task/task_executor.rs:2717— TaskExecutor::prepare_task_context 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.
AquaBackend::resolve_lock_info (cyclomatic 38) src/backend/aqua.rs:826— AquaBackend::resolve_lock_info 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.
AquaBackend::verify_provenance (cyclomatic 38) src/backend/aqua.rs:3303— AquaBackend::verify_provenance 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.
AquaBackend::install_version_ (cyclomatic 29) src/backend/aqua.rs:489— AquaBackend::install_version_ 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.
AquaBackend::install (cyclomatic 18) src/backend/aqua.rs:3782— AquaBackend::install 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.
Toolset::install_all_versions_with_progress (cyclomatic 32) src/toolset/toolset_install.rs:322— Toolset::install_all_versions_with_progress 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.
Toolset::install_with_deps (cyclomatic 23) src/toolset/toolset_install.rs:694— Toolset::install_with_deps 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.
Toolset::list_outdated_versions_selecting (cyclomatic 18) src/toolset/mod.rs:532— Toolset::list_outdated_versions_selecting 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.
Toolset::sort_by_overrides (cyclomatic 18) src/toolset/mod.rs:702— Toolset::sort_by_overrides 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.
UnifiedGitBackend::verify_attestations_or_slsa (cyclomatic 31) src/backend/github.rs:2858— UnifiedGitBackend::verify_attestations_or_slsa 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.
UnifiedGitBackend::verify_provenance_at_lock_time (cyclomatic 21) src/backend/github.rs:1557— UnifiedGitBackend::verify_provenance_at_lock_time 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.
UnifiedGitBackend::discover_bin_paths (cyclomatic 19) src/backend/github.rs:2135— UnifiedGitBackend::discover_bin_paths 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.
UnifiedGitBackend::detect_provenance_type (cyclomatic 16) src/backend/github.rs:1439— UnifiedGitBackend::detect_provenance_type 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.
PIPXBackend::install_version_ (cyclomatic 26) REDACTED:707— PIPXBackend::install_version_ 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.
PIPXBackend::validate_uv_lock (cyclomatic 20) src/backend/pipx/lock.rs:510— PIPXBackend::validate_uv_lock 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.
PIPXBackend::is_install_satisfied (cyclomatic 18) REDACTED:645— PIPXBackend::is_install_satisfied 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.
PIPXBackend::prepare_install_version (cyclomatic 17) REDACTED:563— PIPXBackend::prepare_install_version 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.
Client::download_file_attempt (cognitive 91) crates/mise-util/src/http.rs:1990— Client::download_file_attempt has cognitive complexity 91 (threshold 15). Drivers by points: if/else 31 (75 pts), boolean chains 10, loops 2 (3 pts), match/switch 1 (3 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.
Client::send_once_inner (cognitive 37) crates/mise-util/src/http.rs:2433— Client::send_once_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 8, match/switch 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.
Client::send_scoped (cognitive 26) crates/mise-util/src/http.rs:1022— Client::send_scoped has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 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.
Client::download_file_inner (cognitive 16) crates/mise-util/src/http.rs:1815— Client::download_file_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 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.
Run::run (cognitive 68) src/cli/run.rs:674— Run::run has cognitive complexity 68 (threshold 15). Drivers by points: if/else 36 (49 pts), loops 6 (9 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Run::spawn_sched_job (cognitive 61) src/cli/run.rs:1183— Run::spawn_sched_job has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (43 pts), boolean chains 12, loops 1 (4 pts), match/switch 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.
Run::setup_output_and_validate (cognitive 23) src/cli/run.rs:1547— Run::setup_output_and_validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (11 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.
Run::run (cognitive 17) src/cli/oci/run.rs:117— Run::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2, match/switch 1 (2 pts), boolean chains 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.
Lockfile::set_platform_info (cognitive 60) src/lockfile.rs:2125— Lockfile::set_platform_info has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (54 pts), boolean chains 6 (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.
Lockfile::prepare_write (cognitive 44) src/lockfile.rs:1699— Lockfile::prepare_write has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (30 pts), loops 5 (10 pts), boolean chains 2, match/switch 1 (2 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.
Lockfile::read (cognitive 31) src/lockfile.rs:1528— Lockfile::read has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 5 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). 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.
Lockfile::cleanup_unreferenced_conda_packages (cognitive 16) src/lockfile.rs:1926— Lockfile::cleanup_unreferenced_conda_packages has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 1 (4 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.
Config::load_all_tasks_with_context (cognitive 53) src/config/mod.rs:1298— Config::load_all_tasks_with_context has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 9 (20 pts), match/switch 2 (4 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.
Config::load_env (cognitive 40) src/config/mod.rs:1615— Config::load_env has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 4 (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_tracked_config_files (cognitive 19) src/config/mod.rs:1481— Config::load_tracked_config_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 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.
Config::monorepo_path_aliases (cognitive 17) src/config/mod.rs:904— Config::monorepo_path_aliases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Doctor::check_dotfiles (cognitive 42) src/cli/doctor/mod.rs:847— Doctor::check_dotfiles has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 5, loops 2 (4 pts), match/switch 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.
Doctor::doctor (cognitive 21) src/cli/doctor/mod.rs:409— Doctor::doctor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (4 pts), boolean chains 1, match/switch 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.
Doctor::analyze_system_deps (cognitive 18) src/cli/doctor/mod.rs:500— Doctor::analyze_system_deps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 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.
Doctor::analyze_backend_mismatches (cognitive 17) src/cli/doctor/mod.rs:1360— Doctor::analyze_backend_mismatches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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.
Applying::check_planning_still_holds (cognitive 24) crates/mise-system/src/history/sync/apply.rs:711— Applying::check_planning_still_holds has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Applying::adopt_history (cognitive 19) crates/mise-system/src/history/sync/apply.rs:921— Applying::adopt_history has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 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.
Applying::protect_replaced_files (cognitive 18) crates/mise-system/src/history/sync/apply.rs:819— Applying::protect_replaced_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Applying::record_failure (cognitive 18) crates/mise-system/src/history/sync/apply.rs:988— Applying::record_failure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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.
TasksValidate::validate_run_entries (cognitive 19) src/cli/tasks/validate.rs:841— TasksValidate::validate_run_entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 2, match/switch 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.
TasksValidate::output_human (cognitive 17) src/cli/tasks/validate.rs:928— TasksValidate::output_human has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TasksValidate::find_additional_graph_issues (cognitive 16) src/cli/tasks/validate.rs:192— TasksValidate::find_additional_graph_issues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TasksValidate::validate_directory (cognitive 16) src/cli/tasks/validate.rs:717— TasksValidate::validate_directory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (20 lines × 2) crates/mise-shim/src/windows_process.rs:197— crates/mise-shim/src/windows_process.rs:197-216 | crates/mise-util/src/windows_process.rs:132-151 — before extracting anything, compare `crates/mise-shim/src/windows_process.rs` and `crates/mise-util/src/windows_process.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 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 (20 lines × 2) crates/mise-system/src/history/watch/runtime.rs:472— crates/mise-system/src/history/watch/runtime.rs:472-491 | crates/mise-system/src/history/watch/runtime.rs:599-618 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) crates/mise-util/src/file.rs:3007— crates/mise-util/src/file.rs:3007-3026 | crates/vfox/src/vfox/install.rs:480-499 — before extracting anything, compare `crates/mise-util/src/file.rs` and `crates/vfox/src/vfox/install.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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 (20 lines × 2) src/task/task_executor.rs:2081— src/task/task_executor.rs:2081-2100 | src/task/task_executor.rs:2163-2182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–15 lines × 2) src/backend/aqua.rs:2212— src/backend/aqua.rs:2212-2225 | src/backend/github.rs:3113-3127 — 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–15 lines × 2) src/backend/jq.rs:53— src/backend/jq.rs:53-66 | src/backend/jq.rs:173-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 (14–15 lines × 2) src/config/config_file/mise_toml.rs:998— src/config/config_file/mise_toml.rs:998-1012 | src/config/config_file/mise_toml.rs:1067-1080 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–15 lines × 2) src/toolset/toolset_env.rs:240— src/toolset/toolset_env.rs:240-254 | src/toolset/toolset_env.rs:308-321 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–12 lines × 2) crates/mise-system/src/history/notify/macos.rs:86— crates/mise-system/src/history/notify/macos.rs:86-97 | src/enclave/macos.rs:65-75 — 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–12 lines × 2) src/cli/bootstrap.rs:4789— src/cli/bootstrap.rs:4789-4800 | src/cli/bootstrap.rs:6092-6102 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–12 lines × 2) src/deps/engine.rs:934— src/deps/engine.rs:934-945 | src/deps/engine.rs:951-961 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–12 lines × 2) src/toolset/toolset_env.rs:200— src/toolset/toolset_env.rs:200-210 | src/toolset/toolset_env.rs:598-609 — both copies are in the same file, so extract the 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–11 lines × 2) crates/mise-shim/src/windows_process.rs:353— crates/mise-shim/src/windows_process.rs:353-362 | crates/mise-util/src/windows_process.rs:188-198 — before extracting anything, compare `crates/mise-shim/src/windows_process.rs` and `crates/mise-util/src/windows_process.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 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–11 lines × 2) crates/mise-system-packages/src/pacman.rs:312— crates/mise-system-packages/src/pacman.rs:312-322 | crates/mise-system-packages/src/pacman.rs:358-367 — both copies are in the same file, so extract the 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–11 lines × 2) crates/vfox/src/lua_mod/archiver.rs:86— crates/vfox/src/lua_mod/archiver.rs:86-95 | crates/vfox/src/lua_mod/archiver.rs:97-107 — both copies are in the same file, so extract the 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–11 lines × 2) src/backend/github.rs:1868— src/backend/github.rs:1868-1878 | src/backend/github.rs:2003-2012 — both copies are in the same file, so extract the 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–9 lines × 2) src/backend/conda.rs:1015— src/backend/conda.rs:1015-1022 | src/backend/conda.rs:1182-1190 — both copies are in the same file, so extract the 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–9 lines × 2) src/backend/github.rs:2322— src/backend/github.rs:2322-2330 | src/backend/github.rs:2513-2520 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8–9 lines × 2) src/cli/bootstrap.rs:4853— src/cli/bootstrap.rs:4853-4861 | src/cli/bootstrap.rs:6004-6011 — both copies are in the same file, so extract the 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–9 lines × 2) src/plugins/core/rust.rs:521— src/plugins/core/rust.rs:521-529 | src/plugins/core/rust.rs:561-568 — both copies are in the same file, so extract the 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 × 3) crates/mise-system-packages/src/brew/cask/state.rs:906— crates/mise-system-packages/src/brew/cask/state.rs:906-910 | crates/mise-util/src/file.rs:237-241 | crates/mise-util/src/file.rs:285-289 — 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 (5 lines × 3) crates/mise-util/src/http.rs:643— crates/mise-util/src/http.rs:643-647 | src/task/task_cache.rs:1120-1124 | src/task/task_cache_store.rs:941-945 — 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 (5 lines × 3) crates/mise-lsp/src/complete.rs:563— crates/mise-lsp/src/complete.rs:563-567 | crates/mise-lsp/src/keypath.rs:27-31 | crates/mise-lsp/src/tasks.rs:837-841 — 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) crates/mise-system-packages/src/brew/shim.rb:175— crates/mise-system-packages/src/brew/shim.rb:175-179 | crates/mise-system-packages/src/brew/tap_cask_metadata.rb:84-88 | crates/mise-system-packages/src/brew/tap_formula_metadata.rb:69-73 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Outbound HTTP without resilience crates/mise-tls/src/lib.rs:95— `Client::builder()` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience crates/mise-tls/src/lib.rs:98— `Client::builder()` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience crates/vfox/src/http.rs:13— `ClientBuilder::new()` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience crates/vfox/src/http.rs:20— `ClientBuilder::new()` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Upgrade::upgrade (cyclomatic 75) src/cli/upgrade.rs:789— Upgrade::upgrade has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Upgrade::run (cyclomatic 74) src/cli/upgrade.rs:350— Upgrade::run has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Upgrade::warn_if_newer_versions_hidden_by_minimum_release_age (cyclomatic 19) src/cli/upgrade.rs:1423— Upgrade::warn_if_newer_versions_hidden_by_minimum_release_age 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.
Backend::install_version (cyclomatic 67) src/backend/mod.rs:5023— Backend::install_version has cyclomatic complexity 67 (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.
Backend::is_version_installed (cyclomatic 21) src/backend/mod.rs:3892— Backend::is_version_installed has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: mise::backend::arg_to_backend (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.
Backend::list_remote_versions_with_info_and_options (cyclomatic 18) src/backend/mod.rs:3461— Backend::list_remote_versions_with_info_and_options has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: mise::backend::arg_to_backend (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.
mise_brew_relocation::elf::patch (cyclomatic 52) crates/mise-brew-relocation/src/elf.rs:192— mise_brew_relocation::elf::patch has cyclomatic complexity 52 (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.
mise_brew_relocation::relocate_keg_with_replacements (cyclomatic 22) crates/mise-brew-relocation/src/lib.rs:219— mise_brew_relocation::relocate_keg_with_replacements 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.
mise_brew_relocation::macho::patch_slice (cyclomatic 20) crates/mise-brew-relocation/src/macho.rs:65— mise_brew_relocation::macho::patch_slice 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.
CmdLineRunner::execute_async_with_cancel_check (cyclomatic 49) crates/mise-util/src/cmd.rs:1461— CmdLineRunner::execute_async_with_cancel_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.
CmdLineRunner::execute (cyclomatic 34) crates/mise-util/src/cmd.rs:1267— CmdLineRunner::execute has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CmdLineRunner::execute_hashes_async_with_drain_timeout (cyclomatic 28) crates/mise-util/src/cmd.rs:1704— CmdLineRunner::execute_hashes_async_with_drain_timeout 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.
InteractiveConfig::handle_enter (cyclomatic 48) crates/mise-interactive-config/src/editor/actions/enter.rs:4— InteractiveConfig::handle_enter has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
InteractiveConfig::undo (cyclomatic 36) crates/mise-interactive-config/src/editor/actions/undo.rs:64— InteractiveConfig::undo has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
InteractiveConfig::apply_new_key (cyclomatic 26) crates/mise-interactive-config/src/editor/actions/edit.rs:55— InteractiveConfig::apply_new_key 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.
Run::run (cyclomatic 43) src/cli/run.rs:674— Run::run has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Run::spawn_sched_job (cyclomatic 39) src/cli/run.rs:1183— Run::spawn_sched_job has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Run::run (cyclomatic 16) src/cli/oci/run.rs:117— Run::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.
Client::download_file_attempt (cyclomatic 41) crates/mise-util/src/http.rs:1990— Client::download_file_attempt 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.
Client::send_once_inner (cyclomatic 27) crates/mise-util/src/http.rs:2433— Client::send_once_inner 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.
Client::send_scoped (cyclomatic 16) crates/mise-util/src/http.rs:1022— Client::send_scoped 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.
mise_lsp::complete::advance (cyclomatic 28) crates/mise-lsp/src/complete.rs:465— mise_lsp::complete::advance 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.
mise_lsp::tasks::cycles (cyclomatic 17) crates/mise-lsp/src/tasks.rs:1037— mise_lsp::tasks::cycles 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.
mise_lsp::semantic::tokens (cyclomatic 16) crates/mise-lsp/src/semantic.rs:84— mise_lsp::semantic::tokens 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.
Lockfile::prepare_write (cyclomatic 25) src/lockfile.rs:1699— Lockfile::prepare_write 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.
Lockfile::read (cyclomatic 23) src/lockfile.rs:1528— Lockfile::read 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.
Lockfile::set_platform_info (cyclomatic 23) src/lockfile.rs:2125— Lockfile::set_platform_info 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.
Bootstrap::run_phases (cognitive 178) src/cli/bootstrap.rs:1916— Bootstrap::run_phases has cognitive complexity 178 (threshold 15). Drivers by points: if/else 109 (154 pts), boolean chains 21, loops 1 (3 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.
Bootstrap::run_from (cognitive 32) src/cli/bootstrap.rs:2520— Bootstrap::run_from has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 4, 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.
Bootstrap::run_with_notices (cognitive 16) src/cli/bootstrap.rs:1862— Bootstrap::run_with_notices 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.
Upgrade::upgrade (cognitive 134) src/cli/upgrade.rs:789— Upgrade::upgrade has cognitive complexity 134 (threshold 15). Drivers by points: if/else 50 (87 pts), loops 15 (23 pts), match/switch 6 (17 pts), boolean chains 7 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Upgrade::run (cognitive 128) src/cli/upgrade.rs:350— Upgrade::run has cognitive complexity 128 (threshold 15). Drivers by points: if/else 48 (89 pts), boolean chains 27, loops 5 (12 pts) (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.
Upgrade::warn_if_newer_versions_hidden_by_minimum_release_age (cognitive 32) src/cli/upgrade.rs:1423— Upgrade::warn_if_newer_versions_hidden_by_minimum_release_age has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CmdLineRunner::execute_async_with_cancel_check (cognitive 91) crates/mise-util/src/cmd.rs:1461— CmdLineRunner::execute_async_with_cancel_check has cognitive complexity 91 (threshold 15). Drivers by points: if/else 29 (64 pts), match/switch 6 (13 pts), loops 5 (8 pts), boolean chains 6 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CmdLineRunner::execute (cognitive 58) crates/mise-util/src/cmd.rs:1267— CmdLineRunner::execute has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 6 (14 pts), loops 4 (7 pts), boolean chains 4 (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.
CmdLineRunner::execute_hashes_async_with_drain_timeout (cognitive 45) crates/mise-util/src/cmd.rs:1704— CmdLineRunner::execute_hashes_async_with_drain_timeout has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 5 (11 pts), loops 4 (6 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.
mise_brew_relocation::elf::patch (cognitive 63) crates/mise-brew-relocation/src/elf.rs:192— mise_brew_relocation::elf::patch has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 14, loops 7 (12 pts), match/switch 8 (10 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.
mise_brew_relocation::relocate_keg_with_replacements (cognitive 42) crates/mise-brew-relocation/src/lib.rs:219— mise_brew_relocation::relocate_keg_with_replacements has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 8, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_brew_relocation::macho::patch_slice (cognitive 37) crates/mise-brew-relocation/src/macho.rs:65— mise_brew_relocation::macho::patch_slice has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (6 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.
Index::add_file_tasks::walk (cognitive 45) crates/mise-lsp/src/tasks.rs:330— Index::add_file_tasks::walk has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 11, match/switch 1 (4 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.
Index::add_includes (cognitive 25) crates/mise-lsp/src/tasks.rs:243— Index::add_includes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Index::add (cognitive 24) crates/mise-lsp/src/tasks.rs:429— Index::add has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 2 (6 pts), loops 2 (3 pts) (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.
HookEnv::build_path_operations (cognitive 39) src/cli/hook_env.rs:349— HookEnv::build_path_operations has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 4, loops 2 (4 pts), 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.
HookEnv::run (cognitive 27) src/cli/hook_env.rs:53— HookEnv::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 4 (5 pts), boolean chains 4, loops 2 (3 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.
HookEnv::display_status (cognitive 16) src/cli/hook_env.rs:276— HookEnv::display_status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 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.
MiseToml::replace_versions (cognitive 38) src/config/config_file/mise_toml.rs:1707— MiseToml::replace_versions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 5 (11 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MiseToml::remove_alias (cognitive 29) src/config/config_file/mise_toml.rs:889— MiseToml::remove_alias has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2, boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
MiseToml::build_tool_request_set (cognitive 27) src/config/config_file/mise_toml.rs:1386— MiseToml::build_tool_request_set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Unuse::run (cognitive 35) src/cli/unuse.rs:67— Unuse::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 2 (4 pts), boolean chains 3, 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.
Unuse::prune_scope (cognitive 18) src/cli/unuse.rs:191— Unuse::prune_scope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Unuse::get_config_file (cognitive 17) src/cli/unuse.rs:259— Unuse::get_config_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), 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.
Install::install_runtimes (cognitive 27) src/cli/install.rs:296— Install::install_runtimes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 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.
Install::hint_missing_system_packages (cognitive 18) src/cli/install.rs:208— Install::hint_missing_system_packages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2, match/switch 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.
Install::install_missing_runtimes (cognitive 18) src/cli/install.rs:575— Install::install_missing_runtimes 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, 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.
Settings::set_hidden_configs (cognitive 27) src/config/settings.rs:1751— Settings::set_hidden_configs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 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.
Settings::parse_settings_file (cognitive 22) src/config/settings.rs:1200— Settings::parse_settings_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (2 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.
Settings::load_sources_from (cognitive 19) src/config/settings.rs:1593— Settings::load_sources_from has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 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.
WorkspaceProjectGraph::with_overrides (cognitive 26) src/task/workspace.rs:673— WorkspaceProjectGraph::with_overrides has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (9 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WorkspaceProjectGraph::affected_projects_for_changes (cognitive 26) src/task/workspace.rs:855— WorkspaceProjectGraph::affected_projects_for_changes has cognitive complexity 26 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 4 (8 pts), boolean chains 2 (nesting depth added 11). 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.
WorkspaceProjectGraph::discover_all_with_overrides_inner (cognitive 18) src/task/workspace.rs:545— WorkspaceProjectGraph::discover_all_with_overrides_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 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.
BootstrapStatus::collect_packages (cognitive 24) src/cli/bootstrap.rs:4489— BootstrapStatus::collect_packages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), match/switch 1 (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.
BootstrapStatus::collect_dotfiles (cognitive 18) src/cli/bootstrap.rs:4655— BootstrapStatus::collect_dotfiles has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 1 (2 pts), loops 2, boolean chains 1 (nesting depth added 8). 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.
BootstrapStatus::collect_plugin_deps (cognitive 16) src/cli/bootstrap.rs:4435— BootstrapStatus::collect_plugin_deps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TomlDocument::parse (cognitive 19) crates/mise-interactive-config/src/document/parse.rs:55— TomlDocument::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4, boolean chains 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.
TomlDocument::entry_value_to_item (cognitive 19) crates/mise-interactive-config/src/document/serialize.rs:106— TomlDocument::entry_value_to_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TomlDocument::to_toml (cognitive 17) crates/mise-interactive-config/src/document/serialize.rs:5— TomlDocument::to_toml has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 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.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×3
Duplicated block (13–14 lines × 2) crates/mise-system-packages/src/apk.rs:81— crates/mise-system-packages/src/apk.rs:81-94 | crates/mise-system-packages/src/dnf.rs:311-323 — 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–14 lines × 2) crates/mise-util/src/github.rs:574— crates/mise-util/src/github.rs:574-587 | crates/mise-util/src/github.rs:618-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.
Duplicated block (13–14 lines × 2) crates/vfox/src/lua_mod/http.rs:406— crates/vfox/src/lua_mod/http.rs:406-419 | crates/vfox/src/lua_mod/http.rs:448-460 — both copies are in the same file, so extract the 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 × 3) src/toolset/tool_request.rs:228— src/toolset/tool_request.rs:228-236 | src/toolset/tool_request.rs:263-271 | src/toolset/tool_request.rs:273-281 — 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) src/cli/config/explain.rs:67— src/cli/config/explain.rs:67-75 | src/cli/config/get.rs:53-61 | src/cli/config/set.rs:120-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 all 3 call sites, so a change lands once.
Duplicated block (9 lines × 3) crates/mise-oci/src/registry.rs:571— crates/mise-oci/src/registry.rs:571-579 | crates/mise-oci/src/registry.rs:673-681 | crates/mise-oci/src/registry.rs:1886-1894 — 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 (8 lines × 3) crates/mise-util/src/forgejo.rs:202— crates/mise-util/src/forgejo.rs:202-209 | crates/mise-util/src/github.rs:1576-1583 | crates/mise-util/src/gitlab.rs:353-360 — before extracting anything, compare `crates/mise-util/src/forgejo.rs` and `crates/mise-util/src/github.rs` 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 (8 lines × 3) src/task/task_executor.rs:1745— src/task/task_executor.rs:1745-1752 | src/task/task_executor.rs:1979-1986 | src/task/task_executor.rs:2392-2399 — 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 (8 lines × 3) src/cli/system/install.rs:144— src/cli/system/install.rs:144-151 | src/cli/system/install.rs:459-466 | src/cli/system/install.rs:519-526 — 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.
EnvResults::resolve_with_toolset (cyclomatic 96) src/config/env_directive/mod.rs:192— EnvResults::resolve_with_toolset has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
EnvResults::file (cyclomatic 24) src/config/env_directive/file.rs:146— EnvResults::file 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.
Bootstrap::run_phases (cyclomatic 93) src/cli/bootstrap.rs:1916— Bootstrap::run_phases has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent 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::run_from (cyclomatic 22) src/cli/bootstrap.rs:2520— Bootstrap::run_from 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. This is NOT this file's highest cyclomatic complexity: Commands::run (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 function is counted neither in this dimension's figures nor in its score.
Renderer::render_item (cyclomatic 88) crates/mise-interactive-config/src/render/item.rs:4— Renderer::render_item has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Renderer::render (cyclomatic 27) crates/mise-interactive-config/src/render.rs:119— Renderer::render 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.
DotfilesTrack::run (cyclomatic 84) src/cli/dotfiles/track.rs:115— DotfilesTrack::run has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DotfilesTrack::entry (cyclomatic 29) src/cli/dotfiles/track.rs:650— DotfilesTrack::entry 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.
Lock::get_tools_to_lock (cyclomatic 71) src/cli/lock.rs:2268— Lock::get_tools_to_lock has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Lock::run_with_installed (cyclomatic 16) src/cli/lock.rs:613— Lock::run_with_installed 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.
Builder::build_image_config (cyclomatic 39) src/oci/builder.rs:776— Builder::build_image_config has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Builder::build (cyclomatic 35) src/oci/builder.rs:183— Builder::build 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.
aqua_registry::types::merge::apply_override (cyclomatic 32) crates/aqua-registry/src/types/merge.rs:3— aqua_registry::types::merge::apply_override has cyclomatic complexity 32 (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.
aqua_registry::template::lex (cyclomatic 17) crates/aqua-registry/src/template.rs:113— aqua_registry::template::lex 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.
Cli::run_inner (cyclomatic 32) src/cli/mod.rs:1036— Cli::run_inner has cyclomatic complexity 32 (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: Commands::run (cyclomatic 79) 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.
Cli::settings_layer (cyclomatic 16) src/cli/mod.rs:962— Cli::settings_layer 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. This is NOT this file's highest cyclomatic complexity: Commands::run (cyclomatic 79) 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.
PlatformInfo::try_from (cyclomatic 31) src/lockfile.rs:1043— PlatformInfo::try_from has cyclomatic complexity 31 (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.
PlatformInfo::merge_with (cyclomatic 22) src/lockfile.rs:925— PlatformInfo::merge_with 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.
HistoryRepo::read_meta_in (cyclomatic 30) crates/mise-system/src/history/shadow.rs:905— HistoryRepo::read_meta_in 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.
HistoryRepo::decrypted_diff (cyclomatic 19) crates/mise-system/src/history/shadow.rs:1451— HistoryRepo::decrypted_diff 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.
Config::load_all_tasks_with_context (cyclomatic 25) src/config/mod.rs:1298— Config::load_all_tasks_with_context 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.
Config::load_env (cyclomatic 24) src/config/mod.rs:1615— Config::load_env 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.
HookEnv::build_path_operations (cyclomatic 24) src/cli/hook_env.rs:349— HookEnv::build_path_operations 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.
HookEnv::run (cyclomatic 20) src/cli/hook_env.rs:53— HookEnv::run 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.
Project::run (cyclomatic 23) src/cli/doctor/project.rs:67— Project::run 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.
Project::check (cyclomatic 17) src/cli/doctor/project.rs:165— Project::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.
BootstrapStatus::collect_dotfiles (cyclomatic 21) src/cli/bootstrap.rs:4655— BootstrapStatus::collect_dotfiles 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: Commands::run (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 function is counted neither in this dimension's figures nor in its score.
BootstrapStatus::collect_packages (cyclomatic 17) src/cli/bootstrap.rs:4489— BootstrapStatus::collect_packages has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: Commands::run (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 function is counted neither in this dimension's figures nor in its score.
Parser::parse_unquoted (cyclomatic 20) crates/mise-dotenv/src/parse.rs:428— Parser::parse_unquoted 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.
Parser::evaluate_substitution (cyclomatic 16) crates/mise-dotenv/src/parse.rs:678— Parser::evaluate_substitution 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.
Install::install_runtimes (cyclomatic 19) src/cli/install.rs:296— Install::install_runtimes 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.
Install::hint_missing_system_packages (cyclomatic 16) src/cli/install.rs:208— Install::hint_missing_system_packages 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.
mise_brew_metadata::cask::artifacts::cask_artifacts (cyclomatic 18) crates/mise-brew-metadata/src/cask/artifacts.rs:17— mise_brew_metadata::cask::artifacts::cask_artifacts 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.
mise_brew_metadata::cask::flight::step::parse_flight_step (cyclomatic 18) crates/mise-brew-metadata/src/cask/flight/step.rs:3— mise_brew_metadata::cask::flight::step::parse_flight_step 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.
mise_oci::registry::parse_challenge_params (cyclomatic 16) crates/mise-oci/src/registry.rs:210— mise_oci::registry::parse_challenge_params 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.
mise_oci::registry::push_image (cyclomatic 16) crates/mise-oci/src/registry.rs:1314— mise_oci::registry::push_image 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.
DotfilesTrack::run (cognitive 150) src/cli/dotfiles/track.rs:115— DotfilesTrack::run has cognitive complexity 150 (threshold 15). Drivers by points: if/else 50 (95 pts), boolean chains 27, loops 12 (25 pts), match/switch 2 (3 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DotfilesTrack::entry (cognitive 40) src/cli/dotfiles/track.rs:650— DotfilesTrack::entry has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 4 (10 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 12). 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.
Renderer::render_item (cognitive 135) crates/mise-interactive-config/src/render/item.rs:4— Renderer::render_item has cognitive complexity 135 (threshold 15). Drivers by points: if/else 53 (110 pts), match/switch 6 (13 pts), boolean chains 12 (nesting depth added 64). 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.
Renderer::render (cognitive 27) crates/mise-interactive-config/src/render.rs:119— Renderer::render has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 3 (6 pts), loops 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ToolStub::generate_stub (cognitive 75) src/cli/generate/tool_stub.rs:281— ToolStub::generate_stub has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (59 pts), boolean chains 9, loops 3 (7 pts) (nesting depth added 36). 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.
ToolStub::fetch_checksums (cognitive 31) src/cli/generate/tool_stub.rs:862— ToolStub::fetch_checksums has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 1 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Builder::build_image_config (cognitive 67) src/oci/builder.rs:776— Builder::build_image_config has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (45 pts), loops 9 (15 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Builder::build (cognitive 56) src/oci/builder.rs:183— Builder::build has cognitive complexity 56 (threshold 15). Drivers by points: if/else 30 (44 pts), loops 7 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pull::record_resolutions (cognitive 63) crates/mise-system/src/history/sync/apply.rs:191— Pull::record_resolutions has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (47 pts), boolean chains 9, match/switch 2 (6 pts), loops 1 (nesting depth added 36). 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.
Pull::pause_for_conflicts (cognitive 17) crates/mise-system/src/history/sync/apply.rs:413— Pull::pause_for_conflicts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskScriptParser::register_task_source_files_function (cognitive 59) src/task/task_script_parser.rs:192— TaskScriptParser::register_task_source_files_function has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 3 (11 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskScriptParser::setup_tera_for_spec_parsing (cognitive 18) src/task/task_script_parser.rs:427— TaskScriptParser::setup_tera_for_spec_parsing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5, boolean chains 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.
PlatformInfo::try_from (cognitive 55) src/lockfile.rs:1043— PlatformInfo::try_from has cognitive complexity 55 (threshold 15). Drivers by points: match/switch 16 (36 pts), if/else 8 (18 pts), boolean chains 1 (nesting depth added 30). 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.
PlatformInfo::merge_with (cognitive 32) src/lockfile.rs:925— PlatformInfo::merge_with has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22, boolean chains 5, match/switch 2 (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.
Set::run (cognitive 54) src/cli/set.rs:137— Set::run has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 4 (11 pts), match/switch 4 (11 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.
Set::get (cognitive 23) src/cli/set.rs:280— Set::get has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (4 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.
BackendsSwitch::switch (cognitive 47) src/cli/backends/switch.rs:97— BackendsSwitch::switch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BackendsSwitch::find_switches (cognitive 19) src/cli/backends/switch.rs:387— BackendsSwitch::find_switches has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
aqua_registry::template::lex (cognitive 41) crates/aqua-registry/src/template.rs:113— aqua_registry::template::lex has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
aqua_registry::types::merge::apply_override (cognitive 36) crates/aqua-registry/src/types/merge.rs:3— aqua_registry::types::merge::apply_override has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26, match/switch 5 (10 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ToolsetBuilder::warn_overridden_lockfiles (cognitive 41) src/toolset/builder.rs:252— ToolsetBuilder::warn_overridden_lockfiles has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 3 (12 pts), loops 3 (6 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.
ToolsetBuilder::load_runtime_args (cognitive 19) src/toolset/builder.rs:330— ToolsetBuilder::load_runtime_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BackendArg::full (cognitive 39) src/args/backend_arg.rs:613— BackendArg::full has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (27 pts), match/switch 3 (7 pts), boolean chains 5 (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.
BackendArg::backend (cognitive 17) src/args/backend_arg.rs:409— BackendArg::backend has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 1 (3 pts), match/switch 1 (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.
TrackedSet::add_requests (cognitive 38) crates/mise-system/src/history/tracked.rs:374— TrackedSet::add_requests has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (9 pts), boolean chains 6, 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.
TrackedSet::walk_entries (cognitive 19) crates/mise-system/src/history/tracked.rs:791— TrackedSet::walk_entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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.
Cli::run_inner (cognitive 34) src/cli/mod.rs:1036— Cli::run_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 8, 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.
Cli::get_command (cognitive 22) src/cli/mod.rs:1246— Cli::get_command has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Parser::parse_unquoted (cognitive 33) crates/mise-dotenv/src/parse.rs:428— Parser::parse_unquoted has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 4, 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.
Parser::parse_quoted (cognitive 18) crates/mise-dotenv/src/parse.rs:381— Parser::parse_quoted has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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.
Project::run (cognitive 33) src/cli/doctor/project.rs:67— Project::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, match/switch 3 (5 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.
Project::check (cognitive 31) src/cli/doctor/project.rs:165— Project::check has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 3 (6 pts), loops 3 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Use::run (cognitive 31) src/cli/use.rs:272— Use::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, loops 3 (4 pts), match/switch 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.
Use::render_success_message (cognitive 18) src/cli/use.rs:543— Use::render_success_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 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.
RubyPlugin::fetch_ruby_release_dates (cognitive 30) src/plugins/core/ruby.rs:570— RubyPlugin::fetch_ruby_release_dates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (12 pts), match/switch 4 (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.
RubyPlugin::find_precompiled_asset_in_repo (cognitive 22) src/plugins/core/ruby_lock.rs:219— RubyPlugin::find_precompiled_asset_in_repo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (7 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.
Manifest::validate (cognitive 27) crates/mise-system/src/history/manifest.rs:546— Manifest::validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (9 pts), boolean chains 4 (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.
Manifest::preserve_other_files (cognitive 16) crates/mise-system/src/history/manifest.rs:482— Manifest::preserve_other_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Walk::strip_one (cognitive 22) crates/mise-system/src/history/purge.rs:596— Walk::strip_one has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Walk::rewrite (cognitive 21) crates/mise-system/src/history/purge.rs:404— Walk::rewrite has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, match/switch 2 (3 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.
Ls::run (cognitive 22) src/cli/ls.rs:158— Ls::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (4 pts), boolean chains 1, 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.
Ls::display_user (cognitive 17) src/cli/ls.rs:283— Ls::display_user has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, 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.
DepsInstall::explain_provider (cognitive 21) src/cli/deps/install.rs:181— DepsInstall::explain_provider has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3 (4 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.
DepsInstall::run (cognitive 17) src/cli/deps/install.rs:62— DepsInstall::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 5 (6 pts), boolean chains 2, 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.
FirewallRequest::plans (cognitive 19) crates/mise-system/src/firewall.rs:395— FirewallRequest::plans has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (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.
FirewallRequest::validate_safety_with_rules (cognitive 18) crates/mise-system/src/firewall.rs:307— FirewallRequest::validate_safety_with_rules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (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.
SidecarWrites::prepare (cognitive 18) src/lockfile/graph.rs:408— SidecarWrites::prepare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, 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.
SidecarWrites::collect_garbage (cognitive 17) src/lockfile/graph.rs:485— SidecarWrites::collect_garbage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×2
REDACTED
REDACTED
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (5 members, 50+ identical tokens) src/cli/bootstrap.rs:4312— src/cli/bootstrap.rs:4312-4324 | src/cli/bootstrap.rs:4332-4355 | src/cli/bootstrap.rs:4362-4374 | src/cli/bootstrap.rs:4403-4415 | src/cli/bootstrap.rs:4421-4433 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) src/config/mod.rs:1615— src/config/mod.rs:1615-1829 | src/config/mod.rs:4533-4558 | src/task/mod.rs:2396-2482 | src/task/task_context_builder.rs:564-612 | src/toolset/toolset_env.rs:676-714 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Duplicated block (19 lines × 2) crates/mise-util/src/file.rs:3028— crates/mise-util/src/file.rs:3028-3046 | crates/vfox/src/vfox/install.rs:501-519 — before extracting anything, compare `crates/mise-util/src/file.rs` and `crates/vfox/src/vfox/install.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) src/system/package_plugin.rs:602— src/system/package_plugin.rs:602-620 | src/system/package_plugin.rs:639-657 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) crates/mise-brew-metadata/src/cask/flight/path.rs:289— crates/mise-brew-metadata/src/cask/flight/path.rs:289-306 | crates/mise-brew-metadata/src/cask/flight/path.rs:331-348 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) src/cli/hook_env.rs:461— src/cli/hook_env.rs:461-478 | src/cli/hook_env.rs:493-510 — both copies are in the same file, so extract the 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 (13–15 lines × 2) crates/mise-system-packages/src/apt.rs:91— crates/mise-system-packages/src/apt.rs:91-105 | crates/mise-system-packages/src/apt.rs:118-130 — both copies are in the same file, so extract the 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 (13–15 lines × 2) src/hooks.rs:668— src/hooks.rs:668-682 | src/hooks.rs:792-804 — both copies are in the same file, so extract the 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–13 lines × 2) src/backend/github.rs:1529— src/backend/github.rs:1529-1540 | src/backend/github.rs:1664-1676 — both copies are in the same file, so extract the 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–13 lines × 2) src/toolset/toolset_install.rs:462— src/toolset/toolset_install.rs:462-473 | src/toolset/toolset_install.rs:478-490 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–12 lines × 2) src/backend/aqua.rs:3249— src/backend/aqua.rs:3249-3260 | src/backend/github.rs:1897-1906 — 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–12 lines × 2) src/backend/http.rs:1602— src/backend/http.rs:1602-1613 | src/backend/s3.rs:665-674 — before extracting anything, compare `src/backend/http.rs` and `src/backend/s3.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 4) crates/mise-system/src/history/watch/runtime.rs:454— crates/mise-system/src/history/watch/runtime.rs:454-464 | crates/mise-system/src/history/watch/runtime.rs:481-491 | crates/mise-system/src/history/watch/runtime.rs:608-618 | crates/mise-system/src/history/watch/runtime.rs:716-726 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 4) crates/mise-system/src/accounts.rs:798— crates/mise-system/src/accounts.rs:798-808 | crates/mise-system/src/firewall.rs:602-612 | crates/mise-system/src/managed_files.rs:1049-1059 | crates/mise-system/src/services.rs:480-490 — before extracting anything, compare `crates/mise-system/src/accounts.rs` and `crates/mise-system/src/services.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 × 4) src/cli/mcp.rs:518— src/cli/mcp.rs:518-527 | src/cli/mcp.rs:584-593 | src/cli/mcp.rs:612-621 | src/cli/mcp.rs:638-647 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 4) crates/mise-system-packages/src/apt.rs:94— crates/mise-system-packages/src/apt.rs:94-105 | crates/mise-system-packages/src/apt.rs:121-130 | crates/mise-system-packages/src/dnf.rs:362-371 | crates/mise-system-packages/src/pacman.rs:294-303 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8–10 lines × 2) src/backend/gem.rs:517— src/backend/gem.rs:517-524 | src/backend/gem.rs:558-567 — both copies are in the same file, so extract the 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–10 lines × 2) src/plugins/core/erlang.rs:775— src/plugins/core/erlang.rs:775-784 | src/plugins/core/erlang.rs:790-797 — both copies are in the same file, so extract the 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–8 lines × 2) crates/mise-system-packages/src/aur.rs:127— crates/mise-system-packages/src/aur.rs:127-134 | crates/mise-system-packages/src/winget.rs:158-164 — 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–8 lines × 2) src/plugins/core/bun.rs:249— src/plugins/core/bun.rs:249-256 | src/plugins/core/zig.rs:438-444 — 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 × 4) crates/mise-system/src/history/watch/runtime.rs:402— crates/mise-system/src/history/watch/runtime.rs:402-408 | crates/mise-system/src/history/watch/runtime.rs:470-476 | crates/mise-system/src/history/watch/runtime.rs:597-603 | crates/mise-system/src/history/watch/runtime.rs:700-706 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 4) crates/mise-util/src/github.rs:578— crates/mise-util/src/github.rs:578-584 | crates/mise-util/src/github.rs:621-627 | crates/mise-util/src/github.rs:1222-1228 | crates/mise-util/src/gitlab.rs:122-128 — before extracting anything, compare `crates/mise-util/src/github.rs` and `crates/mise-util/src/gitlab.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 62 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 × 3) crates/mise-system/src/files.rs:2815— crates/mise-system/src/files.rs:2815-2820 | src/cli/dotfiles/add.rs:859-864 | src/plugins/core/go.rs:512-517 — 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 (6 lines × 3) src/cli/mcp.rs:528— src/cli/mcp.rs:528-533 | src/cli/mcp.rs:594-599 | src/cli/mcp.rs:622-627 — 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 (12 lines × 3) src/config/config_file/mise_toml.rs:999— src/config/config_file/mise_toml.rs:999-1011 | src/config/config_file/mise_toml.rs:1068-1079 | src/config/config_file/mise_toml.rs:1115-1126 — 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 (12 lines × 3) crates/mise-system/src/compose.rs:84— crates/mise-system/src/compose.rs:84-95 | crates/mise-system/src/secrets.rs:84-95 | crates/mise-system/src/services_common.rs:130-141 — before extracting anything, compare `crates/mise-system/src/secrets.rs` and `crates/mise-system/src/services_common.rs` 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.
AC1 · Text alternatives· <video> without a captions track · ×1
<video> without a captions track docs/.vitepress/theme/HomeShowreel.vue:168— Video with no captions <track> offers no captions. This player's source is set at runtime, so there is no caption file to author here: give the player a way to carry captions — accept a track/captions URL alongside the media and render a <track kind="captions"> when one is supplied — and capture that asset wherever the media enters the product (upload, import or generation).
AC3 · Page structure· Data table has no header cells · ×1
Data table has no header cells docs/components/config-key-detail.vue:158— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no a11y linter (an accessibility check that can read your UI — no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 13 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
Daemons::run (cyclomatic 94) src/cli/daemons.rs:256— Daemons::run has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DotfilesAdd::run_inner (cyclomatic 92) src/cli/dotfiles/add.rs:154— DotfilesAdd::run_inner has cyclomatic complexity 92 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Store::attempt_locked (cyclomatic 82) crates/mise-system/src/history/checkpoint.rs:189— Store::attempt_locked has cyclomatic complexity 82 (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.
ToolVersion::resolve_version (cyclomatic 64) src/toolset/tool_version.rs:808— ToolVersion::resolve_version has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BrewCaskManager::install_one_with_ancestors (cyclomatic 56) crates/mise-system-packages/src/brew/cask/mod.rs:582— BrewCaskManager::install_one_with_ancestors 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.
DotfilesStatus::run (cyclomatic 55) src/cli/dotfiles/status.rs:75— DotfilesStatus::run has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
EnvList::deserialize (cyclomatic 53) crates/mise-config/src/env.rs:293— EnvList::deserialize has cyclomatic complexity 53 (threshold 15). Of this number, 47 points are the body's own statements and 6 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ConfigSet::run (cyclomatic 44) src/cli/config/set.rs:131— ConfigSet::run has cyclomatic complexity 44 (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.
WatchexecArgs::watchexec_args (cyclomatic 43) src/cli/watch.rs:1296— WatchexecArgs::watchexec_args has cyclomatic complexity 43 (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.
BrewManager::install_via_pour (cyclomatic 40) crates/mise-system-packages/src/brew/mod.rs:121— BrewManager::install_via_pour 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.
Watch::run (cyclomatic 38) src/cli/watch.rs:83— Watch::run 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.
ToolStub::generate_stub (cyclomatic 37) src/cli/generate/tool_stub.rs:281— ToolStub::generate_stub 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.
TasksAdd::run (cyclomatic 37) src/cli/tasks/add.rs:94— TasksAdd::run 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.
SecretBroker::grant_values_with (cyclomatic 36) src/secrets/broker.rs:886— SecretBroker::grant_values_with has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
record.run_session (cyclomatic 36) docs/.vitepress/showreel-capture/record.py:497— record.run_session has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
shape.check (cyclomatic 35) docs/.vitepress/showreel-capture/shape.py:49— shape.check has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
HistoryShow::run (cyclomatic 34) src/cli/dotfiles/history/show.rs:40— HistoryShow::run has cyclomatic complexity 34 (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.
BackendArg::full (cyclomatic 33) src/args/backend_arg.rs:613— BackendArg::full 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.
Tool::output_user (cyclomatic 33) src/cli/tool.rs:178— Tool::output_user 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.
Exec::run_with_context (cyclomatic 32) src/cli/exec.rs:276— Exec::run_with_context has cyclomatic complexity 32 (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.
DotfilesUntrack::run (cyclomatic 31) src/cli/dotfiles/untrack.rs:36— DotfilesUntrack::run 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.
Runtime::prepare (cyclomatic 30) crates/mise-daemons/src/runtime.rs:526— Runtime::prepare 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.
PackslipBackend::install_payload (cyclomatic 30) src/backend/packslip.rs:2179— PackslipBackend::install_payload 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.
bed.arrange (cyclomatic 30) docs/.vitepress/showreel-bed/bed.py:682— bed.arrange 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.
Screen.select_graphic_rendition (cyclomatic 30) docs/.vitepress/showreel-capture/frames.py:79— Screen.select_graphic_rendition 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.
bed.verify (cyclomatic 29) docs/.vitepress/showreel-bed/bed.py:803— bed.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.
config-reference.data.describeKey (cyclomatic 29) docs/config-reference.data.ts:151— config-reference.data.describeKey has cyclomatic complexity 29 (threshold 15). Of this number, 27 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.
Index::add_file_tasks::walk (cyclomatic 27) crates/mise-lsp/src/tasks.rs:330— Index::add_file_tasks::walk 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.
Pull::record_resolutions (cyclomatic 27) crates/mise-system/src/history/sync/apply.rs:191— Pull::record_resolutions 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.
Providers::run (cyclomatic 27) REDACTED:72— Providers::run 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.
versions.main (cyclomatic 27) docs/.vitepress/showreel-capture/versions.py:88— versions.main 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.
Settings::set_hidden_configs (cyclomatic 26) src/config/settings.rs:1751— Settings::set_hidden_configs 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.
SystemStatus::run (cyclomatic 26) src/cli/system/status.rs:38— SystemStatus::run 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.
AccountAction::apply (cyclomatic 25) crates/mise-system/src/accounts.rs:859— AccountAction::apply 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.
Doctor::check_dotfiles (cyclomatic 25) src/cli/doctor/mod.rs:847— Doctor::check_dotfiles 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.
Set::run (cyclomatic 25) src/cli/set.rs:137— Set::run 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.
Uninstall::run (cyclomatic 25) src/cli/uninstall.rs:63— Uninstall::run 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.
Use::run (cyclomatic 25) src/cli/use.rs:272— Use::run 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.
MiseBackendProvider::list_backends (cyclomatic 24) src/cli/edit.rs:67— MiseBackendProvider::list_backends 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.
Deps::new_with_cycle_limit (cyclomatic 24) src/task/deps.rs:151— Deps::new_with_cycle_limit 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.
Scheduler::run_loop (cyclomatic 24) src/task/task_scheduler.rs:228— Scheduler::run_loop 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.
UvWorkspaceProvider::discover_with_context (cyclomatic 24) src/task/workspace/uv.rs:76— UvWorkspaceProvider::discover_with_context 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.
TrackedSet::add_requests (cyclomatic 23) crates/mise-system/src/history/tracked.rs:374— TrackedSet::add_requests 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.
Unuse::run (cyclomatic 23) src/cli/unuse.rs:67— Unuse::run 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.
scan.compare_dirs (cyclomatic 23) docs/.vitepress/showreel-capture/scan.py:229— scan.compare_dirs 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.
RemoteHost::validate_with_source (cyclomatic 22) crates/mise-system/src/remote.rs:266— RemoteHost::validate_with_source 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.
CargoBackend::install_crate (cyclomatic 22) src/backend/cargo.rs:292— CargoBackend::install_crate 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.
DotfilesPaths::run (cyclomatic 22) src/cli/dotfiles/paths.rs:72— DotfilesPaths::run has cyclomatic complexity 22 (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.
TasksInfo::display (cyclomatic 22) src/cli/tasks/info.rs:71— TasksInfo::display 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.
MiseToml::replace_versions (cyclomatic 22) src/config/config_file/mise_toml.rs:1707— MiseToml::replace_versions 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.
ToolOptions::insert_core_option (cyclomatic 22) src/toolset/tool_version_options.rs:662— ToolOptions::insert_core_option 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.
mise_config::schema::settings::element (cyclomatic 21) crates/mise-config/src/schema/settings.rs:67— mise_config::schema::settings::element 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.
BackendsSwitch::switch (cyclomatic 21) src/cli/backends/switch.rs:97— BackendsSwitch::switch 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.
OutputHandler::replay_cached_output (cyclomatic 21) src/task/task_output_handler.rs:584— OutputHandler::replay_cached_output 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.
DotfilesUnapply::run_inner (cyclomatic 20) src/cli/dotfiles/unapply.rs:67— DotfilesUnapply::run_inner 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.
ComposeRequest::action_args (cyclomatic 19) crates/mise-system/src/compose.rs:720— ComposeRequest::action_args 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.
FirewallRequest::plans (cyclomatic 19) crates/mise-system/src/firewall.rs:395— FirewallRequest::plans 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.
RepoRequest::from_toml (cyclomatic 19) crates/mise-system/src/repos.rs:73— RepoRequest::from_toml 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.
DepsInstall::run (cyclomatic 19) src/cli/deps/install.rs:62— DepsInstall::run 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.
Ssh::run_inner (cyclomatic 19) src/cli/ssh.rs:98— Ssh::run_inner 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.
PythonPlugin::install_precompiled (cyclomatic 19) src/plugins/core/python.rs:492— PythonPlugin::install_precompiled 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.
TaskScriptParser::register_task_source_files_function (cyclomatic 19) src/task/task_script_parser.rs:192— TaskScriptParser::register_task_source_files_function 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.
CargoWorkspaceProvider::discover_with_context (cyclomatic 19) src/task/workspace/cargo.rs:73— CargoWorkspaceProvider::discover_with_context 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.
record.main (cyclomatic 19) docs/.vitepress/showreel-capture/record.py:624— record.main 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.
config-reference.data.referenceMarkdown (cyclomatic 19) docs/config-reference.data.ts:408— config-reference.data.referenceMarkdown has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (details, entry, about, …). 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.
Promotion::snapshot (cyclomatic 18) crates/mise-system/src/history/checkpoint/preimages.rs:162— Promotion::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.
Walk::rewrite (cyclomatic 18) crates/mise-system/src/history/purge.rs:404— Walk::rewrite 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.
SystemdRequest::from_toml (cyclomatic 18) crates/mise-system/src/systemd.rs:124— SystemdRequest::from_toml 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.
Token::compare (cyclomatic 18) crates/mise-system-packages/src/brew/cask/app_version.rs:185— Token::compare has cyclomatic complexity 18 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
BootstrapRemote::run (cyclomatic 18) src/cli/bootstrap.rs:3975— BootstrapRemote::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. This is NOT this file's highest cyclomatic complexity: Commands::run (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 function is counted neither in this dimension's figures nor in its score.
TomlOpenState::feed (cyclomatic 18) src/task/mod.rs:517— TomlOpenState::feed 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.
TaskCacheAudit::report (cyclomatic 18) src/task/task_cache_audit.rs:179— TaskCacheAudit::report has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan.compare (cyclomatic 18) docs/.vitepress/showreel-capture/scan.py:177— scan.compare 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.
scan.summarize (cyclomatic 18) docs/.vitepress/showreel-capture/scan.py:313— scan.summarize 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.
shape.main (cyclomatic 18) docs/.vitepress/showreel-capture/shape.py:162— shape.main 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.
mise_agent_env::detect_with_env (cyclomatic 17) crates/mise-agent-env/src/lib.rs:117— mise_agent_env::detect_with_env has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: mise_agent_env::classify_generic (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 function is counted neither in this dimension's figures nor in its score.
BootstrapTomlConfig::merge_below (cyclomatic 17) crates/mise-system/src/lib.rs:135— BootstrapTomlConfig::merge_below has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function items inside it that branch. 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.
EnvDirective::fmt (cyclomatic 17) crates/mise-config/src/env.rs:226— EnvDirective::fmt 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.
mise_dotenv::render::is_unquoted_safe (cyclomatic 17) crates/mise-dotenv/src/render.rs:137— mise_dotenv::render::is_unquoted_safe 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.
UserRequest::from_toml (cyclomatic 17) crates/mise-system/src/accounts.rs:295— UserRequest::from_toml 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.
Vfox::verify (cyclomatic 17) crates/vfox/src/vfox/install.rs:255— Vfox::verify 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.
CondaBackend::create_bin_launcher_dir (cyclomatic 17) src/backend/conda.rs:634— CondaBackend::create_bin_launcher_dir 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.
ConfigGet::run (cyclomatic 17) src/cli/config/get.rs:64— ConfigGet::run 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.
HistoryDiff::run (cyclomatic 17) src/cli/dotfiles/history/diff.rs:56— HistoryDiff::run 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.
DotfilesSave::save (cyclomatic 17) src/cli/dotfiles/save.rs:96— DotfilesSave::save 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.
GradleWorkspaceProvider::discover_with_context (cyclomatic 17) src/task/workspace/gradle.rs:42— GradleWorkspaceProvider::discover_with_context 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.
ToolsetBuilder::warn_overridden_lockfiles (cyclomatic 17) src/toolset/builder.rs:252— ToolsetBuilder::warn_overridden_lockfiles 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.
AquaChecksum::merge (cyclomatic 16) crates/aqua-registry/src/types/verification.rs:52— AquaChecksum::merge 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.
TomlDocument::parse (cyclomatic 16) crates/mise-interactive-config/src/document/parse.rs:55— TomlDocument::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.
Manifest::validate (cyclomatic 16) crates/mise-system/src/history/manifest.rs:546— Manifest::validate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BootstrapLaunchdStatus::run (cyclomatic 16) src/cli/bootstrap.rs:5714— BootstrapLaunchdStatus::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. This is NOT this file's highest cyclomatic complexity: Commands::run (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 function is counted neither in this dimension's figures nor in its score.
InstallsMigrate::run (cyclomatic 16) src/cli/installs/migrate.rs:60— InstallsMigrate::run 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.
RubyPlugin::fetch_ruby_release_dates (cyclomatic 16) src/plugins/core/ruby.rs:570— RubyPlugin::fetch_ruby_release_dates 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.
OutdatedInfo::resolve (cyclomatic 16) src/toolset/outdated_info.rs:109— OutdatedInfo::resolve 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.
export.main (cyclomatic 16) docs/.vitepress/showreel-capture/export.py:63— export.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.
No assertions: built-page checks offer the showreel as og:video on the homepage only docs/.vitepress/social-images.test.mjs:160— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
DotfilesAdd::run_inner (cognitive 169) src/cli/dotfiles/add.rs:154— DotfilesAdd::run_inner has cognitive complexity 169 (threshold 15). Drivers by points: if/else 56 (114 pts), boolean chains 26, loops 9 (18 pts), match/switch 3 (11 pts) (nesting depth added 75). 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.
Daemons::run (cognitive 162) src/cli/daemons.rs:256— Daemons::run has cognitive complexity 162 (threshold 15). Drivers by points: if/else 60 (108 pts), loops 13 (26 pts), boolean chains 16, match/switch 6 (12 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent 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::attempt_locked (cognitive 115) crates/mise-system/src/history/checkpoint.rs:189— Store::attempt_locked has cognitive complexity 115 (threshold 15). Drivers by points: if/else 35 (54 pts), boolean chains 28, loops 9 (21 pts), match/switch 10 (12 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EnvList::deserialize (cognitive 112) crates/mise-config/src/env.rs:293— EnvList::deserialize has cognitive complexity 112 (threshold 15). Drivers by points: if/else 18 (55 pts), match/switch 11 (36 pts), loops 5 (15 pts), boolean chains 6 (nesting depth added 72). Of this number, 97 points are the body's own statements and 15 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
record.run_session (cognitive 96) docs/.vitepress/showreel-capture/record.py:497— record.run_session has cognitive complexity 96 (threshold 15). Drivers by points: if/else 21 (57 pts), ternaries 7 (25 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BrewManager::install_via_pour (cognitive 85) crates/mise-system-packages/src/brew/mod.rs:121— BrewManager::install_via_pour has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (50 pts), match/switch 5 (17 pts), loops 9 (15 pts), boolean chains 3 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DotfilesStatus::run (cognitive 81) src/cli/dotfiles/status.rs:75— DotfilesStatus::run has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (46 pts), match/switch 7 (14 pts), loops 6 (11 pts), boolean chains 10 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Watch::run (cognitive 79) src/cli/watch.rs:83— Watch::run has cognitive complexity 79 (threshold 15). Drivers by points: if/else 28 (53 pts), loops 7 (17 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ToolVersion::resolve_version (cognitive 79) src/toolset/tool_version.rs:808— ToolVersion::resolve_version has cognitive complexity 79 (threshold 15). Drivers by points: if/else 29 (47 pts), boolean chains 22, match/switch 6 (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.
BrewCaskManager::install_one_with_ancestors (cognitive 74) crates/mise-system-packages/src/brew/cask/mod.rs:582— BrewCaskManager::install_one_with_ancestors has cognitive complexity 74 (threshold 15). Drivers by points: if/else 29 (44 pts), loops 18 (21 pts), boolean chains 7, match/switch 1 (2 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.
DotfilesUntrack::run (cognitive 67) src/cli/dotfiles/untrack.rs:36— DotfilesUntrack::run has cognitive complexity 67 (threshold 15). Drivers by points: if/else 22 (56 pts), boolean chains 6, loops 3, match/switch 1 (2 pts) (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.
shape.check (cognitive 66) docs/.vitepress/showreel-capture/shape.py:49— shape.check has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 12 (17 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Tool::output_user (cognitive 63) src/cli/tool.rs:178— Tool::output_user has cognitive complexity 63 (threshold 15). Drivers by points: if/else 38 (57 pts), loops 1 (3 pts), match/switch 1 (3 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.
TasksAdd::run (cognitive 61) src/cli/tasks/add.rs:94— TasksAdd::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 31 (43 pts), loops 6 (18 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HistoryShow::run (cognitive 59) src/cli/dotfiles/history/show.rs:40— HistoryShow::run has cognitive complexity 59 (threshold 15). Drivers by points: loops 13 (27 pts), if/else 17 (25 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 25). 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.
SecretBroker::grant_values_with (cognitive 54) src/secrets/broker.rs:886— SecretBroker::grant_values_with has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 10 (13 pts), boolean chains 7, match/switch 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.
TaskDocs::run (cognitive 51) src/cli/generate/task_docs.rs:71— TaskDocs::run has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 4 (12 pts) (nesting depth added 32). 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.
UvWorkspaceProvider::discover_with_context (cognitive 51) src/task/workspace/uv.rs:76— UvWorkspaceProvider::discover_with_context has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Scheduler::run_loop (cognitive 50) src/task/task_scheduler.rs:228— Scheduler::run_loop has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (32 pts), boolean chains 7, loops 3 (6 pts), match/switch 2 (5 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.
TasksGraph::display_explain (cognitive 46) src/cli/tasks/graph.rs:93— TasksGraph::display_explain has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 6 (22 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan.summarize (cognitive 46) docs/.vitepress/showreel-capture/scan.py:313— scan.summarize has cognitive complexity 46 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 5 (14 pts), ternaries 4 (13 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
config-reference.data.describeKey (cognitive 44) docs/config-reference.data.ts:151— config-reference.data.describeKey has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 9 (14 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 18). Of this number, 40 points are the body's own statements and 4 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.
WatchexecArgs::watchexec_args (cognitive 43) src/cli/watch.rs:1296— WatchexecArgs::watchexec_args has cognitive complexity 43 (threshold 15). Drivers by points: if/else 31 (32 pts), loops 10, 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.
Deps::new_with_cycle_limit (cognitive 43) src/task/deps.rs:151— Deps::new_with_cycle_limit has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 12 (18 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Exec::run_with_context (cognitive 42) src/cli/exec.rs:276— Exec::run_with_context has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 9). 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.
SystemStatus::run (cognitive 42) src/cli/system/status.rs:38— SystemStatus::run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 4 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bed.verify (cognitive 42) docs/.vitepress/showreel-bed/bed.py:803— bed.verify has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 8 (15 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan.compare_dirs (cognitive 42) docs/.vitepress/showreel-capture/scan.py:229— scan.compare_dirs has cognitive complexity 42 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (11 pts), ternaries 4 (11 pts), boolean chains 5 (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.
DotfilesPaths::run (cognitive 41) src/cli/dotfiles/paths.rs:72— DotfilesPaths::run has cognitive complexity 41 (threshold 15). Drivers by points: loops 13 (23 pts), if/else 8 (14 pts), match/switch 2 (4 pts) (nesting depth added 18). 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.
Providers::run (cognitive 40) REDACTED:72— Providers::run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4 (7 pts), boolean chains 6, match/switch 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.
bed.arrange (cognitive 40) docs/.vitepress/showreel-bed/bed.py:682— bed.arrange has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 4 (10 pts), boolean chains 6, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PackslipBackend::install_payload (cognitive 39) src/backend/packslip.rs:2179— PackslipBackend::install_payload has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 3 (5 pts), boolean chains 4, match/switch 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.
Uninstall::run (cognitive 39) src/cli/uninstall.rs:63— Uninstall::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 7, loops 2, 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.
Runtime::prepare (cognitive 37) crates/mise-daemons/src/runtime.rs:526— Runtime::prepare has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 12, loops 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.
AccountAction::apply (cognitive 37) crates/mise-system/src/accounts.rs:859— AccountAction::apply has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 2, match/switch 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.
record.main (cognitive 37) docs/.vitepress/showreel-capture/record.py:624— record.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 5 (10 pts), boolean chains 3, 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.
CondaBackend::create_bin_launcher_dir (cognitive 36) src/backend/conda.rs:634— CondaBackend::create_bin_launcher_dir has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PythonPlugin::install_precompiled (cognitive 36) src/plugins/core/python.rs:492— PythonPlugin::install_precompiled has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Promotion::snapshot (cognitive 35) crates/mise-system/src/history/checkpoint/preimages.rs:162— Promotion::snapshot has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (11 pts), boolean chains 1, match/switch 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.
ConfigSet::run (cognitive 35) src/cli/config/set.rs:131— ConfigSet::run has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 9 (13 pts), if/else 10 (12 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan.compare (cognitive 35) docs/.vitepress/showreel-capture/scan.py:177— scan.compare has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 5 (13 pts), loops 2 (4 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.
versions.main (cognitive 35) docs/.vitepress/showreel-capture/versions.py:88— versions.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (25 pts), loops 4 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
BootstrapMacosDefaultsStatus::run (cognitive 34) src/cli/bootstrap.rs:5962— BootstrapMacosDefaultsStatus::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (9 pts), match/switch 1 (4 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.
BootstrapLaunchdStatus::run (cognitive 34) src/cli/bootstrap.rs:5714— BootstrapLaunchdStatus::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (9 pts), match/switch 1 (4 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.
BootstrapSystemdStatus::run (cognitive 34) src/cli/bootstrap.rs:5835— BootstrapSystemdStatus::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 3 (9 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.
shape.main (cognitive 34) docs/.vitepress/showreel-capture/shape.py:162— shape.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Cursor::build_visible_items (cognitive 33) crates/mise-interactive-config/src/cursor.rs:214— Cursor::build_visible_items has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (22 pts), if/else 2 (6 pts), match/switch 1 (5 pts) (nesting depth added 24). 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.
Vfox::verify (cognitive 33) crates/vfox/src/vfox/install.rs:255— Vfox::verify has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CargoWorkspaceProvider::discover_with_context (cognitive 33) src/task/workspace/cargo.rs:73— CargoWorkspaceProvider::discover_with_context has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GradleWorkspaceProvider::discover_with_context (cognitive 30) src/task/workspace/gradle.rs:42— GradleWorkspaceProvider::discover_with_context has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_brew_metadata::cask::artifacts::cask_artifacts (cognitive 29) crates/mise-brew-metadata/src/cask/artifacts.rs:17— mise_brew_metadata::cask::artifacts::cask_artifacts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (27 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.
TaskDep::parse_shell_style_env (cognitive 29) crates/mise-config/src/task/dep.rs:18— TaskDep::parse_shell_style_env has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 3, loops 1 (3 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.
TaskCacheAudit::report (cognitive 29) src/task/task_cache_audit.rs:179— TaskCacheAudit::report has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskFetcher::fetch_tasks (cognitive 29) src/task/task_fetcher.rs:146— TaskFetcher::fetch_tasks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 4, loops 1 (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.
UbiBackend::_list_remote_versions (cognitive 28) src/backend/ubi.rs:168— UbiBackend::_list_remote_versions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CacheClear::run (cognitive 28) src/cli/cache/clear.rs:43— CacheClear::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (10 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CargoBackend::install_crate (cognitive 27) src/backend/cargo.rs:292— CargoBackend::install_crate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
S3Backend::fetch_versions_from_listing (cognitive 27) src/backend/s3.rs:311— S3Backend::fetch_versions_from_listing has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Ssh::run_inner (cognitive 27) src/cli/ssh.rs:98— Ssh::run_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 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.
BootstrapTomlConfig::merge_below (cognitive 26) crates/mise-system/src/lib.rs:135— BootstrapTomlConfig::merge_below has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (9 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 12). Of this number, 24 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BootstrapRemote::run (cognitive 26) src/cli/bootstrap.rs:3975— BootstrapRemote::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProviderBase::resolve_path_patterns (cognitive 26) src/deps/providers/mod.rs:159— ProviderBase::resolve_path_patterns has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 2, match/switch 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.
PluginsLs::run (cognitive 25) src/cli/plugins/ls.rs:67— PluginsLs::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 4 (9 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.
RustPlugin::outdated_info (cognitive 25) src/plugins/core/rust.rs:970— RustPlugin::outdated_info has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TomlOpenState::feed (cognitive 25) src/task/mod.rs:517— TomlOpenState::feed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 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.
OutputHandler::replay_cached_output (cognitive 25) src/task/task_output_handler.rs:584— OutputHandler::replay_cached_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (6 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.
RemoteHost::validate_with_source (cognitive 24) crates/mise-system/src/remote.rs:266— RemoteHost::validate_with_source has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, loops 4 (5 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.
HistoryDiff::run (cognitive 24) src/cli/dotfiles/history/diff.rs:56— HistoryDiff::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
VfoxPlugin::ensure_installed (cognitive 24) src/plugins/vfox_plugin.rs:325— VfoxPlugin::ensure_installed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ComposeRequest::action_args (cognitive 23) crates/mise-system/src/compose.rs:720— ComposeRequest::action_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (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.
RepoRequest::from_toml (cognitive 23) crates/mise-system/src/repos.rs:73— RepoRequest::from_toml has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, loops 1 (2 pts), 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.
export.main (cognitive 23) docs/.vitepress/showreel-capture/export.py:63— export.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 6 (10 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan.main (cognitive 23) docs/.vitepress/showreel-capture/scan.py:279— scan.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BootstrapUserStatus::run (cognitive 22) src/cli/bootstrap.rs:6161— BootstrapUserStatus::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (3 pts), loops 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.
SystemUse::run_inner (cognitive 22) src/cli/system/use.rs:96— SystemUse::run_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (7 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.
InstallDependencyContext::resolve (cognitive 22) src/install_context.rs:157— InstallDependencyContext::resolve has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, match/switch 1 (3 pts), 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.
ToolRequest::is_install_satisfied (cognitive 22) src/toolset/tool_request.rs:575— ToolRequest::is_install_satisfied has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 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.
frames.render (cognitive 22) docs/.vitepress/showreel-capture/frames.py:203— frames.render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6 (8 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskToolValue::render_templates (cognitive 21) src/task/mod.rs:190— TaskToolValue::render_templates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 2 (nesting depth added 11). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (render_value). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
SystemdRequest::from_toml (cognitive 21) crates/mise-system/src/systemd.rs:124— SystemdRequest::from_toml has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 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.
FlightTargetTransaction::rollback (cognitive 21) crates/mise-system-packages/src/brew/cask/flight.rs:242— FlightTargetTransaction::rollback has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 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.
ConfigLs::display (cognitive 21) src/cli/config/ls.rs:58— ConfigLs::display has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), 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.
HistoryLs::run (cognitive 21) src/cli/dotfiles/history/ls.rs:49— HistoryLs::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 1 (2 pts), boolean chains 1, 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.
SettingsLs::run (cognitive 21) src/cli/settings/ls.rs:79— SettingsLs::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 2 (5 pts), loops 2 (4 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.
Trust::clean_in (cognitive 21) src/cli/trust.rs:151— Trust::clean_in has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AquaChecksum::merge (cognitive 20) crates/aqua-registry/src/types/verification.rs:52— AquaChecksum::merge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (20 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.
BootstrapPlan::ordered (cognitive 20) crates/mise-bootstrap/src/plan.rs:109— BootstrapPlan::ordered has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mise_dotenv::render::is_unquoted_safe (cognitive 20) crates/mise-dotenv/src/render.rs:137— mise_dotenv::render::is_unquoted_safe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WatchPlan::build (cognitive 20) crates/mise-system/src/history/watch/plan.rs:42— WatchPlan::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 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.
AptSource::parse (cognitive 20) crates/mise-system-packages/src/apt_sources.rs:95— AptSource::parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 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.
OptionSpec::unknown_keys (cognitive 20) src/backend/mod.rs:977— OptionSpec::unknown_keys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (8 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.
Env::run (cognitive 20) src/cli/env.rs:81— Env::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Search::get_matches (cognitive 20) src/cli/search.rs:155— Search::get_matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 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.
LockfileTool::try_from (cognitive 20) src/lockfile.rs:6210— LockfileTool::try_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (8 pts), match/switch 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.
ToolOptions::insert_core_option (cognitive 20) src/toolset/tool_version_options.rs:662— ToolOptions::insert_core_option has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (5 pts), boolean chains 3, 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.
scan.scan_capture (cognitive 20) docs/.vitepress/showreel-capture/scan.py:142— scan.scan_capture has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (6 pts), loops 3 (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.
mise_agent_env::detect_with_env (cognitive 19) crates/mise-agent-env/src/lib.rs:117— mise_agent_env::detect_with_env has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
vfox::vfox::install::link_target_stays_within (cognitive 19) crates/vfox/src/vfox/install.rs:466— vfox::vfox::install::link_target_stays_within has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DotfilesRecover::recover (cognitive 19) src/cli/dotfiles/recover.rs:52— DotfilesRecover::recover has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (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.
DotfilesUnapply::run_inner (cognitive 19) src/cli/dotfiles/unapply.rs:67— DotfilesUnapply::run_inner has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 6, loops 2, match/switch 1 (2 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.
SystemImport::run_brew (cognitive 19) src/cli/system/import.rs:120— SystemImport::run_brew has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (7 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.
TasksInfo::display (cognitive 19) src/cli/tasks/info.rs:71— TasksInfo::display has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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.
AsdfPlugin::ensure_installed (cognitive 19) src/plugins/asdf_plugin.rs:267— AsdfPlugin::ensure_installed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ZigPlugin::download (cognitive 19) src/plugins/core/zig.rs:70— ZigPlugin::download has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), match/switch 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.
TaskContextBuilder::resolve_task_env_with_config (cognitive 19) src/task/task_context_builder.rs:324— TaskContextBuilder::resolve_task_env_with_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 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, 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.
KeepOrderState::insert_injected_tasks (cognitive 19) src/task/task_output_handler.rs:106— KeepOrderState::insert_injected_tasks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 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.
registry.data.loadAquaVerification (cognitive 19) docs/registry.data.ts:76— registry.data.loadAquaVerification has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). Of this number, 17 points are the body's own statements and 2 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.
DepsGraph::detect_and_block_cycles (cognitive 18) crates/mise-util/src/deps_graph.rs:171— DepsGraph::detect_and_block_cycles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (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.
NativeBinstallMetadata::from_manifest (cognitive 18) src/backend/cargo/native_binstall.rs:390— NativeBinstallMetadata::from_manifest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (8 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.
DotfilesSave::save_shared (cognitive 18) src/cli/dotfiles/save.rs:189— DotfilesSave::save_shared has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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.
InstallsMigrate::run (cognitive 18) src/cli/installs/migrate.rs:60— InstallsMigrate::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TasksLs::run (cognitive 18) src/cli/tasks/ls.rs:143— TasksLs::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
OutdatedInfo::resolve (cognitive 18) src/toolset/outdated_info.rs:109— OutdatedInfo::resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, match/switch 2 (4 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.
Pty.wait (cognitive 18) docs/.vitepress/showreel-capture/record.py:227— Pty.wait has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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.
mise_cache_core::blob_pack::decode_blob_pack (cognitive 17) crates/mise-cache-core/src/blob_pack.rs:37— mise_cache_core::blob_pack::decode_blob_pack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), 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.
DaemonSet::with_dependencies (cognitive 17) crates/mise-daemons/src/lib.rs:1627— DaemonSet::with_dependencies has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), 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.
GoBackend::fetch_proxy_versions (cognitive 17) src/backend/go.rs:396— GoBackend::fetch_proxy_versions has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (5 pts), loops 3 (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.
NPMBackend::install_version_ (cognitive 17) src/backend/npm.rs:1233— NPMBackend::install_version_ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, match/switch 2 (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.
Link::run (cognitive 17) src/cli/link.rs:46— Link::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, match/switch 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.
Vars::run (cognitive 17) src/cli/vars/mod.rs:53— Vars::run has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 3 (7 pts), if/else 1 (2 pts) (nesting depth added 10). 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.
NodePlugin::suggest_available_flavors (cognitive 17) src/plugins/core/node.rs:570— NodePlugin::suggest_available_flavors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (6 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.
SecretsToml::from_value (cognitive 17) src/secrets/config.rs:58— SecretsToml::from_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EnvView::walk (cognitive 17) src/secrets/grant.rs:1127— EnvView::walk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PackagePluginManager::apply_prune_plan (cognitive 17) src/system/package_plugin.rs:390— PackagePluginManager::apply_prune_plan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), 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.
GoWorkspaceProvider::discover_with_context (cognitive 17) src/task/workspace/go.rs:27— GoWorkspaceProvider::discover_with_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bed.analyse (cognitive 17) docs/.vitepress/showreel-bed/bed.py:481— bed.analyse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2 (3 pts), 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.
frames.build (cognitive 17) docs/.vitepress/showreel-capture/frames.py:247— frames.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 2, ternaries 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.
Value::from (cognitive 16) src/lockfile.rs:1215— Value::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
UserRequest::from_toml (cognitive 16) crates/mise-system/src/accounts.rs:295— UserRequest::from_toml 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.
BootstrapShellStatus::run (cognitive 16) src/cli/bootstrap.rs:6079— BootstrapShellStatus::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), match/switch 1 (2 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.
PreparationBatch::finish (cognitive 16) src/lockfile/generate.rs:67— PreparationBatch::finish has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 3 (6 pts), loops 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.
MemoValues::apply (cognitive 16) src/secrets/broker.rs:255— MemoValues::apply has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 1 (4 pts), loops 1 (3 pts), boolean chains 1 (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.
config-reference.data.referenceMarkdown (cognitive 16) docs/config-reference.data.ts:408— config-reference.data.referenceMarkdown has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, loops 3, ternaries 3. Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 7 function items inside it that branch (details, entry, about, …). 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.
TooManyFunctions: mise_config::schema::refs crates/mise-config/src/schema.rs:332— TooManyFunctions — 63 free functions. The bar is 30 free functions; this is 33 over it, 2.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.
Change coupling clique: ls.rs, set.rs, unset.rs src/cli/settings/ls.rs— 3 files — `src/cli/settings/ls.rs`, `src/cli/settings/set.rs`, `src/cli/settings/unset.rs` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
D4 · Code Duplication· Near-duplicate member family (3 members, 13 shared lines) · ×1
Near-duplicate member family (3 members, 13 shared lines) src/backend/github.rs:2318— src/backend/github.rs:2318-2404 | src/backend/github.rs:2415-2499 | src/backend/github.rs:2510-2597 — These 3 members are variants of one another: a block of 13 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times.
Near-duplicate member pair (75 shared lines) crates/mise-util/src/cmd.rs:1267— crates/mise-util/src/cmd.rs:1267-1453 | crates/mise-util/src/cmd.rs:1464-1692 — These two members are variants of one another: 75 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 (51 shared lines) crates/mise-util/src/file.rs:2990— crates/mise-util/src/file.rs:2990-3046 | crates/vfox/src/vfox/install.rs:466-519 — These two members are variants of one another: 51 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 (32 shared lines) src/plugins/core/ruby.rs:285— src/plugins/core/ruby.rs:285-319 | src/plugins/core/ruby_windows.rs:54-88 — These two members are variants of one another: 32 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×1
Edited copy of a member (23 corresponding lines) src/lockfile.rs:2297— src/lockfile.rs:2297-2324 | src/lockfile.rs:2333-2360 — 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· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) crates/vfox/src/lua_mod/http.rs:305— crates/vfox/src/lua_mod/http.rs:305-328 | crates/vfox/src/lua_mod/http.rs:330-363 | crates/vfox/src/lua_mod/http.rs:365-380 | crates/vfox/src/lua_mod/http.rs:390-431 | crates/vfox/src/lua_mod/http.rs:433-462 | crates/vfox/src/lua_mod/http.rs:464-519 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Duplicated block (38 lines × 2) src/toolset/env_cache.rs:239— src/toolset/env_cache.rs:239-276 | src/toolset/env_cache.rs:389-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 (36 lines × 2) src/cli/deps/add.rs:37— src/cli/deps/add.rs:37-72 | src/cli/deps/remove.rs:32-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 (27–31 lines × 2) src/plugins/core/zig.rs:451— src/plugins/core/zig.rs:451-477 | src/plugins/core/zig.rs:503-533 — both copies are in the same file, so extract the 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 (30 lines × 2) src/backend/cargo/native_binstall.rs:190— src/backend/cargo/native_binstall.rs:190-219 | src/backend/cargo/native_binstall.rs:263-292 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (29 lines × 2) crates/mise-shim/src/windows_process.rs:133— crates/mise-shim/src/windows_process.rs:133-161 | crates/mise-util/src/windows_process.rs:68-96 — before extracting anything, compare `crates/mise-shim/src/windows_process.rs` and `crates/mise-util/src/windows_process.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 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 (26 lines × 3) crates/mise-util/src/cmd.rs:1385— crates/mise-util/src/cmd.rs:1385-1410 | crates/mise-util/src/cmd.rs:1583-1608 | crates/mise-util/src/cmd.rs:1643-1668 — 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 (25–26 lines × 2) src/toolset/toolset_install.rs:774— src/toolset/toolset_install.rs:774-799 | src/toolset/toolset_install.rs:848-872 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19–25 lines × 2) crates/mise-util/src/tera.rs:1913— crates/mise-util/src/tera.rs:1913-1931 | crates/mise-util/src/tera.rs:2040-2064 — both copies are in the same file, so extract the 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–25 lines × 2) src/task/task_executor.rs:1734— src/task/task_executor.rs:1734-1756 | src/task/task_executor.rs:2381-2405 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22 lines × 2) src/plugins/asdf_plugin.rs:319— src/plugins/asdf_plugin.rs:319-340 | src/plugins/vfox_plugin.rs:421-442 — before extracting anything, compare `src/plugins/asdf_plugin.rs` and `src/plugins/vfox_plugin.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20–21 lines × 2) src/task/task_script_parser.rs:768— src/task/task_script_parser.rs:768-788 | src/task/task_script_parser.rs:843-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.
Duplicated block (21 lines × 2) src/toolset/env_cache.rs:210— src/toolset/env_cache.rs:210-230 | src/toolset/env_cache.rs:361-381 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16–19 lines × 2) crates/mise-util/src/cmd.rs:1321— crates/mise-util/src/cmd.rs:1321-1339 | crates/mise-util/src/cmd.rs:1535-1550 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–19 lines × 2) src/backend/npm.rs:2152— src/backend/npm.rs:2152-2165 | src/backend/npm.rs:2211-2229 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–18 lines × 2) src/backend/aqua.rs:2356— src/backend/aqua.rs:2356-2373 | src/backend/aqua.rs:2405-2418 — both copies are in the same file, so extract the 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–18 lines × 2) src/cli/doctor/mod.rs:713— src/cli/doctor/mod.rs:713-730 | src/cli/doctor/mod.rs:1211-1227 — both copies are in the same file, so extract the 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 × 4) src/cli/bootstrap.rs:3585— src/cli/bootstrap.rs:3585-3601 | src/cli/bootstrap.rs:3839-3855 | src/cli/bootstrap.rs:3895-3911 | src/cli/bootstrap.rs:3947-3963 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14–17 lines × 2) src/cli/dotfiles/track.rs:220— src/cli/dotfiles/track.rs:220-236 | src/cli/dotfiles/untrack.rs:143-156 — 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–16 lines × 2) crates/mise-system/src/files.rs:3774— crates/mise-system/src/files.rs:3774-3789 | crates/mise-system/src/files.rs:5274-5287 — both copies are in the same file, so extract the 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–16 lines × 2) src/plugins/core/bun.rs:77— src/plugins/core/bun.rs:77-92 | src/plugins/core/deno.rs:65-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 both call sites, so a change lands once.
Duplicated block (11–15 lines × 3) crates/mise-system/src/history/watch/runtime.rs:396— crates/mise-system/src/history/watch/runtime.rs:396-410 | crates/mise-system/src/history/watch/runtime.rs:467-477 | crates/mise-system/src/history/watch/runtime.rs:594-604 — 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–14 lines × 2) src/plugins/core/node.rs:815— src/plugins/core/node.rs:815-828 | src/plugins/core/node.rs:916-925 — both copies are in the same file, so extract the 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 (13 lines × 3) src/backend/github.rs:2367— src/backend/github.rs:2367-2379 | src/backend/github.rs:2465-2477 | src/backend/github.rs:2563-2575 — 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 (8–11 lines × 2) src/plugins/core/python.rs:448— src/plugins/core/python.rs:448-455 | src/plugins/core/python.rs:578-588 — both copies are in the same file, so extract the 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–11 lines × 2) src/task/workspace.rs:1193— src/task/workspace.rs:1193-1203 | src/task/workspace.rs:1230-1236 — both copies are in the same file, so extract the 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 (3–10 lines × 3) src/args/backend_arg.rs:308— src/args/backend_arg.rs:308-317 | src/registry.rs:798-807 | src/shims.rs:1171-1173 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7–10 lines × 2) src/backend/static_helpers.rs:1358— src/backend/static_helpers.rs:1358-1367 | src/backend/static_helpers.rs:1607-1613 — both copies are in the same file, so extract the 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) src/cli/bootstrap.rs:4641— src/cli/bootstrap.rs:4641-4650 | src/cli/bootstrap.rs:5605-5613 — both copies are in the same file, so extract the 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 × 3) src/hook_env.rs:310— src/hook_env.rs:310-319 | src/hook_env.rs:322-331 | src/hook_env.rs:333-343 — 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 × 5) src/cli/bootstrap.rs:4314— src/cli/bootstrap.rs:4314-4322 | src/cli/bootstrap.rs:4344-4352 | src/cli/bootstrap.rs:4364-4372 | src/cli/bootstrap.rs:4405-4413 | src/cli/bootstrap.rs:4423-4431 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 4) src/cli/generate/tool_stub.rs:339— src/cli/generate/tool_stub.rs:339-347 | src/cli/generate/tool_stub.rs:403-411 | src/cli/generate/tool_stub.rs:881-889 | src/cli/generate/tool_stub.rs:903-911 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (4–9 lines × 3) crates/mise-brew-metadata/src/lib.rs:275— crates/mise-brew-metadata/src/lib.rs:275-283 | crates/mise-system-packages/src/brew/mod.rs:544-552 | crates/mise-system-packages/src/options.rs:186-189 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7–9 lines × 2) src/task/task_executor.rs:2626— src/task/task_executor.rs:2626-2632 | src/task/task_executor.rs:2944-2952 — both copies are in the same file, so extract the 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 × 6) crates/vfox/src/lua_mod/http.rs:308— crates/vfox/src/lua_mod/http.rs:308-313 | crates/vfox/src/lua_mod/http.rs:333-338 | crates/vfox/src/lua_mod/http.rs:367-372 | crates/vfox/src/lua_mod/http.rs:393-398 | crates/vfox/src/lua_mod/http.rs:435-440 | crates/vfox/src/lua_mod/http.rs:475-480 — 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 (6 lines × 5) src/config/mod.rs:1710— src/config/mod.rs:1710-1715 | src/config/mod.rs:4539-4544 | src/task/mod.rs:2433-2438 | src/task/task_context_builder.rs:577-582 | src/toolset/toolset_env.rs:686-691 — 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.
Duplicated block (6 lines × 4) src/cli/bootstrap.rs:3578— src/cli/bootstrap.rs:3578-3583 | src/cli/bootstrap.rs:3689-3694 | src/cli/bootstrap.rs:3831-3837 | src/cli/bootstrap.rs:3940-3945 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (19 lines × 3) src/shell/pwsh.rs:25— src/shell/pwsh.rs:25-166 | src/shell/xonsh.rs:46-64 | src/shell/zsh.rs:23-61 — 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 lines × 4) src/shell/fish.rs:24— src/shell/fish.rs:24-68 | src/shell/pwsh.rs:25-166 | src/shell/xonsh.rs:46-64 | src/shell/zsh.rs:23-61 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once.
Duplicated block (7 lines × 5) src/cli/tasks/add.rs:178— src/cli/tasks/add.rs:178-184 | src/cli/tasks/add.rs:185-191 | src/cli/tasks/add.rs:195-201 | src/cli/tasks/add.rs:211-217 | src/cli/tasks/add.rs:218-224 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 9) crates/mise-util/src/forgejo.rs:47— crates/mise-util/src/forgejo.rs:47-53 | crates/mise-util/src/forgejo.rs:60-66 | crates/mise-util/src/github.rs:165-171 | crates/mise-util/src/github.rs:180-186 | crates/mise-util/src/github.rs:193-199 | crates/mise-util/src/github.rs:206-212 | crates/mise-util/src/gitlab.rs:167-173 | crates/mise-util/src/gitlab.rs:180-186 | crates/mise-util/src/gitlab.rs:193-199 — before extracting anything, compare `crates/mise-util/src/forgejo.rs` and `crates/mise-util/src/github.rs` 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 (25 lines × 2) crates/mise-system-packages/src/brew/tap_cask_metadata.rb:7— crates/mise-system-packages/src/brew/tap_cask_metadata.rb:7-31 | crates/mise-system-packages/src/brew/tap_formula_metadata.rb:8-32 — 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 `crates/mise-system-packages/src/brew/tap_cask_metadata.rb:7` 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.
Unstable project mise-system-packages — mise-system-packages has instability 0.83 with 1 dependents.
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.
Sync-over-async blocking docs/settings.data.ts:103— `fs.readFileSync` in `load` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
SC1 · Supply-chain hygiene· JavaScript dependencies are not locked · ×1
JavaScript dependencies are not locked — No package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock — JS installs aren't reproducible (SSDF PW.4.4). Commit your package manager's lockfile and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
Silent fallback default on Err crates/mise-daemons/src/runtime.rs:294— `claimed_ports` 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 crates/mise-daemons/src/runtime.rs:855— `executable_stamp` turns every `Err` into `String::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 crates/mise-lsp/src/tasks.rs:994— `script_aliases` turns every `Err` into `vec![]` — 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 crates/mise-sigstore/src/certificate.rs:93— `certificate_uri_sans` 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 crates/mise-sigstore/src/cosign_identity.rs:273— `certificate_identities` 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 crates/mise-system/src/dotfile_groups.rs:750— `load_records` turns every `Err` into `vec![]` — 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 crates/mise-system/src/history/config.rs:208— `exclusion_sources` turns every `Err` into `vec![]` — 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 crates/mise-system/src/history/notices.rs:175— `take` turns every `Err` into `vec![]` — 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 crates/mise-system-packages/src/apt_sources.rs:184— `origins` turns every `Err` into `vec![]` — 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 crates/mise-system-packages/src/brew/cask/mod.rs:168— `installed_skip_reason` turns every `Err` into `Ok(Some("skipped: installed app version is unreadable"))` — 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 crates/mise-system-packages/src/brew/cask/fetch.rs:420— `single_nested_cask_archive` turns every `Err` into `true` — 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 crates/mise-system-packages/src/brew/cask/state.rs:23— `installed_versions` 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 crates/mise-system-packages/src/brew/pour.rs:506— `bottled_by_homebrew_at_least` 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 crates/mise-util/src/gitlab.rs:611— `find_expired_glab_tokens` turns every `Err` into `vec![]` — 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 crates/vfox/src/lua_mod/log.rs:10— `values_to_string` turns every `Err` into `"?".to_string()` — 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 src/backend/aqua.rs:323— `security_info` turns every `Err` into `vec![]` — 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 src/backend/npm.rs:2651— `lifecycle_scripts_from_package_json` turns every `Err` into `vec![]` — 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 src/config/env_directive/file.rs:358— `yaml` turns every `Err` into `Ok(EnvMap::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 src/deps/providers/git_submodule.rs:29— `submodule_paths` turns every `Err` into `vec![]` — 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 src/install_layout/catalog.rs:343— `remove_selections_of` turns every `Err` into `Ok(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 src/plugins/core/swift.rs:663— `new` 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 src/plugins/core/zig.rs:563— `resolve_lock_info` turns every `Err` into `Ok(PlatformInfo::default())` — 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 src/secrets/fnox/mod.rs:201— `version` turns every `Err` into `"(unknown version)".to_string()` — 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 src/cli/config/keys.rs:198— `file_keys` turns every `Err` into `vec![]` — 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 src/cli/self_update.rs:338— `helper_orphans_in` 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.
Duplicated predicate crates/mise-system-packages/src/brew/cask_shim.rb:263— `@languages[@default_language] || @languages.values.first` appears character-identically in 2 files — crates/mise-system-packages/src/brew/cask_shim.rb, crates/mise-system-packages/src/brew/tap_cask_metadata.rb. 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 crates/mise-system-packages/src/brew/shim.rb:665— `OS.mac? && macos && macos_condition_matches?(macos)` appears character-identically in 3 files — crates/mise-system-packages/src/brew/shim.rb, crates/mise-system-packages/src/brew/tap_cask_metadata.rb, crates/mise-system-packages/src/brew/tap_formula_metadata.rb. 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 crates/mise-system-packages/src/brew/shim.rb:685— `host <= target || host.same_release?(target)` appears character-identically in 3 files — crates/mise-system-packages/src/brew/shim.rb, crates/mise-system-packages/src/brew/tap_cask_metadata.rb, crates/mise-system-packages/src/brew/tap_formula_metadata.rb. 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 crates/mise-system-packages/src/brew/shim.rb:179— `mine[0] == theirs[0] && (mine[0] >= 11 || mine[1] == theirs[1])` appears character-identically in 2 files — crates/mise-system-packages/src/brew/shim.rb, crates/mise-system-packages/src/brew/tap_formula_metadata.rb. 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 src/cli/system/import.rs:224— `!(self.global || env::in_home_dir()) || self.path.is_some() || self.env.is_some()` appears character-identically in 2 files — src/cli/system/import.rs, src/cli/system/use.rs. 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 src/cli/run.rs:954— `!Settings::get().task.run_auto_install || !Settings::get().auto_install` appears character-identically in 2 files — src/cli/run.rs, src/task/task_tool_installer.rs. 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 src/cli/system/import.rs:230— `!crate::config::is_global_config(path) || crate::config::is_system_config(path) || crate::config::is_override_config(path)` appears character-identically in 2 files — src/cli/system/import.rs, src/cli/system/use.rs. 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 crates/mise-system/src/user_services.rs:757— `!dry_run && !yes && console::user_attended_stderr()` appears character-identically in 2 files — crates/mise-system/src/user_services.rs, src/cli/system/install.rs. 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 crates/mise-oci/src/registry.rs:992— `!file_type.is_file() && !file_type.is_dir()` appears character-identically in 2 files — crates/mise-oci/src/registry.rs, crates/mise-system/src/files.rs. 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 src/backend/aqua.rs:3267— `!force_verify && locked_provenance.is_none() && lockfile_has_checksum` appears character-identically in 2 files — src/backend/aqua.rs, src/backend/github.rs. 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 src/backend/http.rs:123— `!format.is_archive() && format != file::ExtractionFormat::Raw` appears character-identically in 2 files — src/backend/http.rs, src/backend/static_helpers.rs. 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 src/shell/elvish.rs:128— `!input.is_empty() && !input.contains(needs_quoting)` appears character-identically in 2 files — src/shell/elvish.rs, src/shell/fish.rs. 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 crates/mise-system/src/edits.rs:1302— `!opts.yes && console::user_attended_stderr()` appears character-identically in 2 files — crates/mise-system/src/edits.rs, crates/mise-system/src/files.rs. 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 crates/mise-system-packages/src/apt.rs:554— `!output.status.success() && output.status.code() != Some(1)` appears character-identically in 2 files — crates/mise-system-packages/src/apt.rs, crates/mise-system/src/history/shadow.rs. 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 src/backend/aqua.rs:328— `!pkg.repo_owner.is_empty() && !pkg.repo_name.is_empty()` appears character-identically in 2 files — src/backend/aqua.rs, src/cli/search.rs. 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 src/plugins/asdf_plugin.rs:279— `!settings.yes && self.repo_url.lock().unwrap().is_none()` appears character-identically in 2 files — src/plugins/asdf_plugin.rs, src/plugins/vfox_plugin.rs. 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 src/task/task_executor.rs:2991— `!spec.cmd.args.is_empty() || !spec.cmd.flags.is_empty() || !spec.cmd.subcommands.is_empty()` appears character-identically in 2 files — src/task/task_executor.rs, src/task/task_script_parser.rs. 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 crates/mise-ui/src/ctrlc.rs:26— `EXIT.load(Ordering::Relaxed) || mise_util::cancel::mark()` appears character-identically in 2 files — crates/mise-ui/src/ctrlc.rs, crates/mise-ui/src/ctrlc_windows.rs. 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 src/cli/tool_update.rs:354— `Settings::no_hooks() || Settings::get().no_hooks.unwrap_or(false)` appears character-identically in 3 files — src/cli/tool_update.rs, src/hooks.rs, src/watch_files.rs. 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 build.rs:1021— `a.is_empty() || b.is_empty() || (windows_arm64(a) && windows_arm64(b))` appears character-identically in 2 files — build.rs, src/registry.rs. 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 src/cli/doctor/mod.rs:634— `backend.plugin() && !plugin.is_installed()` appears character-identically in 3 files — src/cli/doctor/mod.rs, src/toolset/tool_version.rs, src/toolset/toolset_install.rs. 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 src/lockfile.rs:3782— `backend.starts_with("packslip:") && new.signer.is_some()` appears character-identically in 2 files — src/lockfile.rs, src/lockfile/generate.rs. 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 crates/mise-util/src/path.rs:481— `bytes.len() >= 2 && bytes[0].is_ascii_alphabetic() && bytes[1] == b':'` appears character-identically in 3 files — crates/mise-util/src/path.rs, crates/mise-util/src/remote_source.rs, crates/mise-util/src/windows_posix.rs. 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 crates/mise-system/src/accounts.rs:823— `dry_run && plan.action == ResourceAction::Unknown` appears character-identically in 2 files — crates/mise-system/src/accounts.rs, crates/mise-system/src/services.rs. 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 src/backend/aqua.rs:269— `filter_prereleases && VERSION_REGEX.is_match(v)` appears character-identically in 5 files — src/backend/aqua.rs, src/backend/aqua/tests.rs, src/backend/mod.rs, src/backend/ubi.rs. 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.
Subsumed condition operand src/backend/cargo/native_binstall.rs:761— `triple.contains("-gnueabihf")` can never decide this `||` — every value satisfying `triple.contains("-gnueabihf")` also satisfies `triple.contains("-gnu")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Subsumed condition operand crates/mise-oci/src/packages.rs:272— `layer.media_type.ends_with(".tar.gzip")` can never decide this `||` — every value satisfying `layer.media_type.ends_with(".tar.gzip")` also satisfies `layer.media_type.ends_with(".gzip")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 173 significant file(s) lose their only recent owner: src/cli/bootstrap.rs, crates/mise-system/src/history/tracked.rs, src/backend/packslip.rs, crates/mise-system/src/managed_files.rs, crates/mise-util/src/http.rs, src/packslip.rs, src/task/workspace.rs, crates/mise-util/src/github.rs (+165 more). Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (175 single-owned of 719 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 719 of the 934 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/mise-interactive-config/src/editor/handlers.rs, crates/aqua-registry/src/file_ext.rs.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 5 of 22 project(s) overshoot their size bounds, lowering Project Cohesion to 5.5/10. The most over is `(repository root)` (328500 LoC, 560 module-visible types across 62 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
Logging is not universal — Only 14/16 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/mise-shim`.
No app-layer HTTPS enforcement detected — This repository starts an HTTP server and nothing in its Rust source or committed `Rocket.toml` secures the transport: no TLS served (actix-web `bind_rustls`/`bind_openssl`, axum-server `bind_rustls` with a `RustlsConfig`, tonic `ServerTlsConfig`, a `TlsAcceptor`, Rocket's `[default.tls]`), no `Strict-Transport-Security` header, no `X-Forwarded-Proto` read from a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: `axum::serve(` (crates/mise-util/src/github_relay.rs:525).
No security response headers detected — None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Rust server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: `axum::serve(` (crates/mise-util/src/github_relay.rs:525).
No inbound request validation detected — No handler of this repository's Rust server answers 400, 413 or 422 (`StatusCode::BAD_REQUEST`, `HttpResponse::BadRequest()`, `Status::BadRequest`, tonic `Status::invalid_argument`), and nothing declares validation — no `validator`/`garde` derive, no body limit (`DefaultBodyLimit::max`, `RequestBodyLimitLayer`, `JsonConfig::default().limit(…)`, Rocket `Limits`) — nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (−2.0 on this card.) The server: `axum::serve(` (crates/mise-util/src/github_relay.rs:525).
Null assertions (`!`) reduce the strict null checking score — ~1.4 `!` null assertions per 1k TypeScript source lines — 56 assertion(s) across the 40575 source line(s) of the 136 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: docs/.vitepress/theme/showreel/kit/diagrams/skills-link.ts (5), docs/.vitepress/mise-toml/scan.ts (4), docs/components/config-reference-toml.ts (4). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
Outdated: aws-sdk-s3 — `aws-sdk-s3` is locked at 1.153.0 but 1.155.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p aws-sdk-s3` and commit the updated REDACTED.
Outdated: cc — `cc` is locked at 1.9.0 but 1.10.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/mise-system/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p cc` and commit the updated REDACTED.
Outdated: fnox-client — `fnox-client` is locked at 1.42.0 but 1.42.1 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p fnox-client` and commit the updated REDACTED.
Outdated: gix — `gix` is locked at 0.89.0 but 0.90.0 is the current stable release on crates.io, and it already satisfies the `"<1"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. This crosses a compatibility boundary. Run `cargo update -p gix` and commit the updated REDACTED.
Outdated: notify — `notify` is locked at 8.2.0 but 8.2.1 is the current stable release on crates.io, and it already satisfies the `"8"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p notify` and commit the updated REDACTED.
Outdated: packslip — `packslip` is locked at 1.9.1 but 1.11.1 is the current stable release on crates.io, and it already satisfies the `"1.5"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p packslip` and commit the updated REDACTED.
Outdated: plist — `plist` is locked at 1.10.2 but 1.10.3 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/mise-system-packages/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p plist` and commit the updated REDACTED.
Outdated: rattler_repodata_gateway — `rattler_repodata_gateway` is locked at 0.36.5 but 0.36.6 is the current stable release on crates.io, and it already satisfies the `"0.36"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p rattler_repodata_gateway` and commit the updated REDACTED.
Outdated: rmcp — `rmcp` is locked at 3.6.0 but 3.7.0 is the current stable release on crates.io, and it already satisfies the `"3"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p rmcp` and commit the updated REDACTED.
Outdated: sevenz-rust2 — `sevenz-rust2` is locked at 0.24.0 but 0.24.1 is the current stable release on crates.io, and it already satisfies the `"0.24"` requirement declared in crates/mise-util/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p sevenz-rust2` and commit the updated REDACTED.
Outdated: sigstore-verify — `sigstore-verify` is locked at 0.15.0 but 0.15.1 is the current stable release on crates.io, and it already satisfies the `"0.15"` requirement declared in crates/mise-sigstore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p sigstore-verify` and commit the updated REDACTED.
Outdated: uuid — `uuid` is locked at 1.28.0 but 1.29.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/mise-system/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p uuid` and commit the updated REDACTED.
Outdated: webpki-root-certs — `webpki-root-certs` is locked at 1.0.10 but 1.0.11 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/mise-tls/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p webpki-root-certs` and commit the updated REDACTED.
Outdated: yaml-edit — `yaml-edit` is locked at 0.3.2 but 0.3.5 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in crates/mise-util/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p yaml-edit` and commit the updated REDACTED.
Outdated: zip — `zip` is locked at 9.0.5 but 9.1.1 is the current stable release on crates.io, and it already satisfies the `"9"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p zip` and commit the updated REDACTED.
Skipped (documented): a real capture run and the reference set agree on shape docs/.vitepress/theme/showreel/test/captures.test.ts:201— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): the block chef is what `mise` printed: C1's rows 1–7, columns 66–79, in green docs/.vitepress/theme/showreel/test/chef.test.ts:105— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): the Environments ticket takes down the registry's card, not packslip's stage docs/.vitepress/theme/showreel/test/edit.test.ts:217— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): nothing the reel draws, at any frame of a 30 fps render, says any of it docs/.vitepress/theme/showreel/test/forbidden.test.ts:87— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): in Chromium, every scene meets its bar lines on the handoff's frame docs/.vitepress/theme/showreel/test/handoff-frames.test.ts:135— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): in Chromium, every ticket sets its title and chip inside it, and draws nothing on its bar lines docs/.vitepress/theme/showreel/test/ticket.test.ts:140— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): at 60 fps, timing text only moves under the time-lapse badge, no progress row is checked, and placeholders are badged docs/.vitepress/theme/showreel/test/timing.test.ts:71— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
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.
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 01a1760e-212e-784a-a278-93c48ca1d2b0 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 36 · Warnings: 2088 · Recommendations: 73 · Info: 22 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 26-10-2026 @ 02:33 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.