Public report of uutils/coreutils, 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, 04:32 UTC · Survey ID cd_e390934e2b5a4575b7c98ee1b1ad1038
uutils/coreutils
Measured 26 October 2026, 04:24 UTC, at code version 0776385
Regression: 1 dimension fell 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 scoreStrong
CriticalWeakAdequateStrongExemplary
No change since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 136,108 lines of product code in 114 projects, tests not counted · Estimated rebuild effort: about 2.4 person-years · Weakest lens: Production Readiness, 61
Findings by how serious they are
248 critical798 serious50 minor
14 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, 04:24 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 ▸
63of 63 dimensions measured by tools.
1072of 1096 findings point to an exact file and line, so you can open each one in the code. The other 24 concern the repository as a whole, such as missing documentation.
63dimensions across 7 lenses, read from 136,108 lines of product code in 114 projects.
uutils/coreutils meets our standard for a preview release, though we found no logging, tracing or health checks in the code. It scores 69 out of 100 and is rated Strong, and all 248 of its critical findings are security problems.
Production Readiness, at 61, is the weakest lens and counts most in the score. The best first step is fixing the password or key in the code, worth about 6 points. Recording design decisions comes next, worth about 4 points.
228 pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Twelve secrets can leak from the build pipeline, and four pipeline steps run downloads nobody checks. Pinning each tool to an exact version, limiting each secret to its own step and checking each download against a checksum would close these risks. The three pipeline steps that install packages without pinning their versions need the packages they install pinned to exact versions.
The product code is 136,108 lines, about €350,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 28 findings
These 28 critical or serious findings were in the previous survey, on 12 October 2026, and are gone from this one.
€120,000 to €590,000, for 1,960 to 6,219 hours of work, about 2.4 person-years for 1 to 5 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
×1.0 at a score of 69. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 136,108 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Raises the score by about 6 points · Low effort · Secret Scanning
2
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 4 points · Low effort · ADR Quality
3
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 6 points · Medium effort · Observability
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 €350,000 to build again, about 2.4 person-years of work. Its weakest lens is Production Readiness, at 61 (Adequate). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Leaked secret finding(s) in Secret Scanning. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for low effort, because it clears the 1 Secret Scanning findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.4 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 102,700 lines over the last 90 days, which is about 416,506 lines a year. At that pace, the extra work comes to an estimated 20.8 to 138.8 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of 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.
471 modules, with 471 dependencies between them. 3 loops run through 36 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 431 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.
uu_chcon.chcon uses uucore.lib.features.safe_traversal, so a change to uucore.lib.features.safe_traversal can break uu_chcon.chcon, while a change to uu_chcon.chcon can't break uucore.lib.features.safe_traversal.
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.
2→26 uu_chcon.chcon uses uu_chcon.errorspart of a loop✕
Connections
2 pairs of types, where a type in uu_chcon.chcon uses a type in uu_chcon.errors.
uu_chcon.chcon uses uu_chcon.errors, so a change to uu_chcon.errors can break uu_chcon.chcon, while a change to uu_chcon.chcon can't break uu_chcon.errors.
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.
3→25 uucore.lib.features.fsext uses uucore.lib.features.safe_traversalpart of a loop✕
Connections
1 pair of types, where a type in uucore.lib.features.fsext uses a type in uucore.lib.features.safe_traversal.
uucore.lib.features.fsext uses uucore.lib.features.safe_traversal, so a change to uucore.lib.features.safe_traversal can break uucore.lib.features.fsext, while a change to uucore.lib.features.fsext can't break uucore.lib.features.safe_traversal.
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.
4→13 uucore.lib.mods.error uses uucore.lib.features.format.num_formatpart of a loop✕
Connections
5 pairs of types, where a type in uucore.lib.mods.error uses a type in uucore.lib.features.format.num_format.
uucore.lib.mods.error uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uucore.lib.mods.error, while a change to uucore.lib.mods.error can't break uucore.lib.features.format.num_format.
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.
4→26 uucore.lib.mods.error uses uu_chcon.errorspart of a loop✕
Connections
7 pairs of types, where a type in uucore.lib.mods.error uses a type in uu_chcon.errors.
uucore.lib.mods.error uses uu_chcon.errors, so a change to uu_chcon.errors can break uucore.lib.mods.error, while a change to uucore.lib.mods.error can't break uu_chcon.errors.
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.
5→13 uucore.lib.mods.line_ending uses uucore.lib.features.format.num_formatpart of a loop✕
Connections
1 pair of types, where a type in uucore.lib.mods.line_ending uses a type in uucore.lib.features.format.num_format.
uucore.lib.mods.line_ending uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uucore.lib.mods.line_ending, while a change to uucore.lib.mods.line_ending can't break uucore.lib.features.format.num_format.
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.
uu_comm.comm uses uucore.lib.mods.line_ending, so a change to uucore.lib.mods.line_ending can break uu_comm.comm, while a change to uu_comm.comm can't break uucore.lib.mods.line_ending.
Position
Below the diagonal: uu_comm.comm uses a module listed above it, which is the healthy direction.
uu_date.date uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_date.date, while a change to uu_date.date can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_date.date uses a module listed above it, which is the healthy direction.
7→28 uu_date.date uses uu_base32.base_commonpart of a loop✕
Connections
2 pairs of types, where a type in uu_date.date uses a type in uu_base32.base_common.
uu_date.date uses uu_base32.base_common, so a change to uu_base32.base_common can break uu_date.date, while a change to uu_date.date can't break uu_base32.base_common.
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.
2 pairs of types, where a type in uu_join.join uses a type in uu_fmt.parasplit.
The types involved
uu_join.join.Repr → uu_fmt.parasplit.Line
uu_join.join.State → uu_fmt.parasplit.Line
Direction
uu_join.join uses uu_fmt.parasplit, so a change to uu_fmt.parasplit can break uu_join.join, while a change to uu_join.join can't break uu_fmt.parasplit.
Position
Below the diagonal: uu_join.join uses a module listed above it, which is the healthy direction.
uu_join.join uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_join.join, while a change to uu_join.join can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_join.join uses a module listed above it, which is the healthy direction.
uu_join.join uses uucore.lib.mods.line_ending, so a change to uucore.lib.mods.line_ending can break uu_join.join, while a change to uu_join.join can't break uucore.lib.mods.line_ending.
Position
Below the diagonal: uu_join.join uses a module listed above it, which is the healthy direction.
uu_tail.follow.watch uses uu_chcon.chcon, so a change to uu_chcon.chcon can break uu_tail.follow.watch, while a change to uu_tail.follow.watch can't break uu_chcon.chcon.
Position
Below the diagonal: uu_tail.follow.watch uses a module listed above it, which is the healthy direction.
uu_tail.follow.watch uses uu_comm.comm, so a change to uu_comm.comm can break uu_tail.follow.watch, while a change to uu_tail.follow.watch can't break uu_comm.comm.
Position
Below the diagonal: uu_tail.follow.watch uses a module listed above it, which is the healthy direction.
uu_tail.follow.watch uses uu_date.date, so a change to uu_date.date can break uu_tail.follow.watch, while a change to uu_tail.follow.watch can't break uu_date.date.
Position
Below the diagonal: uu_tail.follow.watch uses a module listed above it, which is the healthy direction.
uu_dd.parseargs uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_dd.parseargs, while a change to uu_dd.parseargs can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_dd.parseargs uses a module listed above it, which is the healthy direction.
uucore.lib.features.format.num_format uses uu_join.join, so a change to uu_join.join can break uucore.lib.features.format.num_format, while a change to uucore.lib.features.format.num_format can't break uu_join.join.
Position
Below the diagonal: uucore.lib.features.format.num_format uses a module listed above it, which is the healthy direction.
uucore.lib.features.format.num_format uses uu_dd.parseargs, so a change to uu_dd.parseargs can break uucore.lib.features.format.num_format, while a change to uucore.lib.features.format.num_format can't break uu_dd.parseargs.
Position
Below the diagonal: uucore.lib.features.format.num_format uses a module listed above it, which is the healthy direction.
uucore.lib.features.quoting_style uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uucore.lib.features.quoting_style, while a change to uucore.lib.features.quoting_style can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uucore.lib.features.quoting_style uses a module listed above it, which is the healthy direction.
uucore.lib.features.ranges uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uucore.lib.features.ranges, while a change to uucore.lib.features.ranges can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uucore.lib.features.ranges uses a module listed above it, which is the healthy direction.
15→26 uucore.lib.features.ranges uses uu_chcon.errorspart of a loop✕
Connections
1 pair of types, where a type in uucore.lib.features.ranges uses a type in uu_chcon.errors.
uucore.lib.features.ranges uses uu_chcon.errors, so a change to uu_chcon.errors can break uucore.lib.features.ranges, while a change to uucore.lib.features.ranges can't break uu_chcon.errors.
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.
uu_csplit.patterns uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uu_csplit.patterns, while a change to uu_csplit.patterns can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uu_csplit.patterns uses a module listed above it, which is the healthy direction.
uu_csplit.patterns uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uu_csplit.patterns, while a change to uu_csplit.patterns can't break uucore.lib.features.ranges.
Position
Below the diagonal: uu_csplit.patterns uses a module listed above it, which is the healthy direction.
16→26 uu_csplit.patterns uses uu_chcon.errorspart of a loop✕
Connections
1 pair of types, where a type in uu_csplit.patterns uses a type in uu_chcon.errors.
uu_csplit.patterns uses uu_chcon.errors, so a change to uu_chcon.errors can break uu_csplit.patterns, while a change to uu_csplit.patterns can't break uu_chcon.errors.
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.
uu_cut.cut uses uucore.lib.mods.line_ending, so a change to uucore.lib.mods.line_ending can break uu_cut.cut, while a change to uu_cut.cut can't break uucore.lib.mods.line_ending.
Position
Below the diagonal: uu_cut.cut uses a module listed above it, which is the healthy direction.
uu_cut.cut uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uu_cut.cut, while a change to uu_cut.cut can't break uucore.lib.features.ranges.
Position
Below the diagonal: uu_cut.cut uses a module listed above it, which is the healthy direction.
uucore.lib.features.diagnostics_boundary uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uucore.lib.features.diagnostics_boundary, while a change to uucore.lib.features.diagnostics_boundary can't break uucore.lib.features.ranges.
Position
Below the diagonal: uucore.lib.features.diagnostics_boundary uses a module listed above it, which is the healthy direction.
uu_mknod.mknod uses uu_base32.base_common, so a change to uu_base32.base_common can break uu_mknod.mknod, while a change to uu_mknod.mknod can't break uu_base32.base_common.
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.
uucore.lib.features.parser.parse_size uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uucore.lib.features.parser.parse_size, while a change to uucore.lib.features.parser.parse_size can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uucore.lib.features.parser.parse_size uses a module listed above it, which is the healthy direction.
uucore.lib.features.parser.parse_size uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uucore.lib.features.parser.parse_size, while a change to uucore.lib.features.parser.parse_size can't break uucore.lib.features.ranges.
Position
Below the diagonal: uucore.lib.features.parser.parse_size uses a module listed above it, which is the healthy direction.
uucore.lib.features.parser.parse_size uses uucore.lib.features.diagnostics_boundary, so a change to uucore.lib.features.diagnostics_boundary can break uucore.lib.features.parser.parse_size, while a change to uucore.lib.features.parser.parse_size can't break uucore.lib.features.diagnostics_boundary.
Position
Below the diagonal: uucore.lib.features.parser.parse_size uses a module listed above it, which is the healthy direction.
20→26 uucore.lib.features.parser.parse_size uses uu_chcon.errorspart of a loop✕
Connections
2 pairs of types, where a type in uucore.lib.features.parser.parse_size uses a type in uu_chcon.errors.
uucore.lib.features.parser.parse_size uses uu_chcon.errors, so a change to uu_chcon.errors can break uucore.lib.features.parser.parse_size, while a change to uucore.lib.features.parser.parse_size can't break uu_chcon.errors.
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.
uu_df.df uses uucore.lib.features.fsext, so a change to uucore.lib.features.fsext can break uu_df.df, while a change to uu_df.df can't break uucore.lib.features.fsext.
Position
Below the diagonal: uu_df.df uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in uu_df.df uses a type in uucore.lib.mods.error.
The types involved
uu_df.df.DfError → uucore.lib.mods.error.UError
Direction
uu_df.df uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_df.df, while a change to uu_df.df can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_df.df uses a module listed above it, which is the healthy direction.
uu_df.df uses uucore.lib.features.parser.parse_size, so a change to uucore.lib.features.parser.parse_size can break uu_df.df, while a change to uu_df.df can't break uucore.lib.features.parser.parse_size.
Position
Below the diagonal: uu_df.df uses a module listed above it, which is the healthy direction.
uu_du.du uses uucore.lib.features.fsext, so a change to uucore.lib.features.fsext can break uu_du.du, while a change to uu_du.du can't break uucore.lib.features.fsext.
Position
Below the diagonal: uu_du.du uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in uu_du.du uses a type in uucore.lib.mods.error.
The types involved
uu_du.du.DuError → uucore.lib.mods.error.UError
Direction
uu_du.du uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_du.du, while a change to uu_du.du can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_du.du uses a module listed above it, which is the healthy direction.
uu_du.du uses uucore.lib.mods.line_ending, so a change to uucore.lib.mods.line_ending can break uu_du.du, while a change to uu_du.du can't break uucore.lib.mods.line_ending.
Position
Below the diagonal: uu_du.du uses a module listed above it, which is the healthy direction.
uu_du.du uses uucore.lib.features.parser.parse_size, so a change to uucore.lib.features.parser.parse_size can break uu_du.du, while a change to uu_du.du can't break uucore.lib.features.parser.parse_size.
Position
Below the diagonal: uu_du.du uses a module listed above it, which is the healthy direction.
22→25 uu_du.du uses uucore.lib.features.safe_traversalpart of a loop✕
Connections
4 pairs of types, where a type in uu_du.du uses a type in uucore.lib.features.safe_traversal.
uu_du.du uses uucore.lib.features.safe_traversal, so a change to uucore.lib.features.safe_traversal can break uu_du.du, while a change to uu_du.du can't break uucore.lib.features.safe_traversal.
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.
uu_od.od uses uucore.lib.features.parser.parse_size, so a change to uucore.lib.features.parser.parse_size can break uu_od.od, while a change to uu_od.od can't break uucore.lib.features.parser.parse_size.
Position
Below the diagonal: uu_od.od uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in uu_sort.sort uses a type in uu_fmt.parasplit.
The types involved
uu_sort.sort.sort$module → uu_fmt.parasplit.Line
Direction
uu_sort.sort uses uu_fmt.parasplit, so a change to uu_fmt.parasplit can break uu_sort.sort, while a change to uu_sort.sort can't break uu_fmt.parasplit.
Position
Below the diagonal: uu_sort.sort uses a module listed above it, which is the healthy direction.
uu_sort.sort uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_sort.sort, while a change to uu_sort.sort can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_sort.sort uses a module listed above it, which is the healthy direction.
uu_sort.sort uses uucore.lib.mods.line_ending, so a change to uucore.lib.mods.line_ending can break uu_sort.sort, while a change to uu_sort.sort can't break uucore.lib.mods.line_ending.
Position
Below the diagonal: uu_sort.sort uses a module listed above it, which is the healthy direction.
uu_sort.sort uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uu_sort.sort, while a change to uu_sort.sort can't break uucore.lib.features.ranges.
Position
Below the diagonal: uu_sort.sort uses a module listed above it, which is the healthy direction.
uu_sort.sort uses uucore.lib.features.parser.parse_size, so a change to uucore.lib.features.parser.parse_size can break uu_sort.sort, while a change to uu_sort.sort can't break uucore.lib.features.parser.parse_size.
Position
Below the diagonal: uu_sort.sort uses a module listed above it, which is the healthy direction.
uucore.lib.features.safe_traversal uses uu_mknod.mknod, so a change to uu_mknod.mknod can break uucore.lib.features.safe_traversal, while a change to uucore.lib.features.safe_traversal can't break uu_mknod.mknod.
Position
Below the diagonal: uucore.lib.features.safe_traversal uses a module listed above it, which is the healthy direction.
uucore.lib.features.safe_traversal uses uu_du.du, so a change to uu_du.du can break uucore.lib.features.safe_traversal, while a change to uucore.lib.features.safe_traversal can't break uu_du.du.
Position
Below the diagonal: uucore.lib.features.safe_traversal uses a module listed above it, which is the healthy direction.
25→26 uucore.lib.features.safe_traversal uses uu_chcon.errorspart of a loop✕
Connections
1 pair of types, where a type in uucore.lib.features.safe_traversal uses a type in uu_chcon.errors.
uucore.lib.features.safe_traversal uses uu_chcon.errors, so a change to uu_chcon.errors can break uucore.lib.features.safe_traversal, while a change to uucore.lib.features.safe_traversal can't break uu_chcon.errors.
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.
uu_chcon.errors uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_chcon.errors, while a change to uu_chcon.errors can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_chcon.errors uses a module listed above it, which is the healthy direction.
uu_chcon.errors uses uucore.lib.features.safe_traversal, so a change to uucore.lib.features.safe_traversal can break uu_chcon.errors, while a change to uu_chcon.errors can't break uucore.lib.features.safe_traversal.
Position
Below the diagonal: uu_chcon.errors uses a module listed above it, which is the healthy direction.
uu_stat.stat uses uucore.lib.features.fsext, so a change to uucore.lib.features.fsext can break uu_stat.stat, while a change to uu_stat.stat can't break uucore.lib.features.fsext.
Position
Below the diagonal: uu_stat.stat uses a module listed above it, which is the healthy direction.
uu_stat.stat uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_stat.stat, while a change to uu_stat.stat can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_stat.stat uses a module listed above it, which is the healthy direction.
uu_stat.stat uses uucore.lib.features.quoting_style, so a change to uucore.lib.features.quoting_style can break uu_stat.stat, while a change to uu_stat.stat can't break uucore.lib.features.quoting_style.
Position
Below the diagonal: uu_stat.stat uses a module listed above it, which is the healthy direction.
uu_stat.stat uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uu_stat.stat, while a change to uu_stat.stat can't break uucore.lib.features.ranges.
Position
Below the diagonal: uu_stat.stat uses a module listed above it, which is the healthy direction.
uu_stat.stat uses uucore.lib.features.diagnostics_boundary, so a change to uucore.lib.features.diagnostics_boundary can break uu_stat.stat, while a change to uu_stat.stat can't break uucore.lib.features.diagnostics_boundary.
Position
Below the diagonal: uu_stat.stat uses a module listed above it, which is the healthy direction.
uu_stat.stat uses uucore.lib.features.safe_traversal, so a change to uucore.lib.features.safe_traversal can break uu_stat.stat, while a change to uu_stat.stat can't break uucore.lib.features.safe_traversal.
Position
Below the diagonal: uu_stat.stat uses a module listed above it, which is the healthy direction.
uu_base32.base_common uses uu_date.date, so a change to uu_date.date can break uu_base32.base_common, while a change to uu_base32.base_common can't break uu_date.date.
Position
Below the diagonal: uu_base32.base_common uses a module listed above it, which is the healthy direction.
uu_base32.base_common uses uu_chcon.errors, so a change to uu_chcon.errors can break uu_base32.base_common, while a change to uu_base32.base_common can't break uu_chcon.errors.
Position
Below the diagonal: uu_base32.base_common uses a module listed above it, which is the healthy direction.
uu_env.string_parser uses uu_fmt.parasplit, so a change to uu_fmt.parasplit can break uu_env.string_parser, while a change to uu_env.string_parser can't break uu_fmt.parasplit.
Position
Below the diagonal: uu_env.string_parser uses a module listed above it, which is the healthy direction.
uu_env.string_parser uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uu_env.string_parser, while a change to uu_env.string_parser can't break uucore.lib.features.ranges.
Position
Below the diagonal: uu_env.string_parser uses a module listed above it, which is the healthy direction.
uu_env.string_parser uses uu_chcon.errors, so a change to uu_chcon.errors can break uu_env.string_parser, while a change to uu_env.string_parser can't break uu_chcon.errors.
Position
Below the diagonal: uu_env.string_parser uses a module listed above it, which is the healthy direction.
uu_head.head uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_head.head, while a change to uu_head.head can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_head.head uses a module listed above it, which is the healthy direction.
uu_head.head uses uucore.lib.mods.line_ending, so a change to uucore.lib.mods.line_ending can break uu_head.head, while a change to uu_head.head can't break uucore.lib.mods.line_ending.
Position
Below the diagonal: uu_head.head uses a module listed above it, which is the healthy direction.
uu_head.head uses uucore.lib.features.diagnostics_boundary, so a change to uucore.lib.features.diagnostics_boundary can break uu_head.head, while a change to uu_head.head can't break uucore.lib.features.diagnostics_boundary.
Position
Below the diagonal: uu_head.head uses a module listed above it, which is the healthy direction.
uu_head.head uses uucore.lib.features.parser.parse_size, so a change to uucore.lib.features.parser.parse_size can break uu_head.head, while a change to uu_head.head can't break uucore.lib.features.parser.parse_size.
Position
Below the diagonal: uu_head.head uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in uu_wc.wc uses a type in uucore.lib.mods.error.
The types involved
uu_wc.wc.WcError → uucore.lib.mods.error.UError
Direction
uu_wc.wc uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_wc.wc, while a change to uu_wc.wc can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_wc.wc uses a module listed above it, which is the healthy direction.
uucore.lib.features.backup_control uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uucore.lib.features.backup_control, while a change to uucore.lib.features.backup_control can't break uucore.lib.mods.error.
Position
Below the diagonal: uucore.lib.features.backup_control uses a module listed above it, which is the healthy direction.
uucore.lib.features.backup_control uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uucore.lib.features.backup_control, while a change to uucore.lib.features.backup_control can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uucore.lib.features.backup_control uses a module listed above it, which is the healthy direction.
uucore.lib.features.backup_control uses uu_chcon.errors, so a change to uu_chcon.errors can break uucore.lib.features.backup_control, while a change to uucore.lib.features.backup_control can't break uu_chcon.errors.
Position
Below the diagonal: uucore.lib.features.backup_control uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in uu_cp.cp uses a type in uucore.lib.mods.error.
The types involved
uu_cp.cp.CpError → uucore.lib.mods.error.UError
Direction
uu_cp.cp uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_cp.cp, while a change to uu_cp.cp can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_cp.cp uses a module listed above it, which is the healthy direction.
uu_cp.cp uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uu_cp.cp, while a change to uu_cp.cp can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uu_cp.cp uses a module listed above it, which is the healthy direction.
uu_cp.cp uses uucore.lib.features.safe_traversal, so a change to uucore.lib.features.safe_traversal can break uu_cp.cp, while a change to uu_cp.cp can't break uucore.lib.features.safe_traversal.
Position
Below the diagonal: uu_cp.cp uses a module listed above it, which is the healthy direction.
uu_cp.cp uses uucore.lib.features.backup_control, so a change to uucore.lib.features.backup_control can break uu_cp.cp, while a change to uu_cp.cp can't break uucore.lib.features.backup_control.
Position
Below the diagonal: uu_cp.cp uses a module listed above it, which is the healthy direction.
uu_date.format_modifiers uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uu_date.format_modifiers, while a change to uu_date.format_modifiers can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uu_date.format_modifiers uses a module listed above it, which is the healthy direction.
uu_date.format_modifiers uses uu_chcon.errors, so a change to uu_chcon.errors can break uu_date.format_modifiers, while a change to uu_date.format_modifiers can't break uu_chcon.errors.
Position
Below the diagonal: uu_date.format_modifiers uses a module listed above it, which is the healthy direction.
uu_date.format_modifiers uses uu_base32.base_common, so a change to uu_base32.base_common can break uu_date.format_modifiers, while a change to uu_date.format_modifiers can't break uu_base32.base_common.
Position
Below the diagonal: uu_date.format_modifiers uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in uu_ls.ls uses a type in uucore.lib.mods.error.
The types involved
uu_ls.ls.LsError → uucore.lib.mods.error.UError
Direction
uu_ls.ls uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uu_ls.ls, while a change to uu_ls.ls can't break uucore.lib.mods.error.
Position
Below the diagonal: uu_ls.ls uses a module listed above it, which is the healthy direction.
uu_ls.ls uses uucore.lib.features.safe_traversal, so a change to uucore.lib.features.safe_traversal can break uu_ls.ls, while a change to uu_ls.ls can't break uucore.lib.features.safe_traversal.
Position
Below the diagonal: uu_ls.ls uses a module listed above it, which is the healthy direction.
uu_ls.ls uses uu_base32.base_common, so a change to uu_base32.base_common can break uu_ls.ls, while a change to uu_ls.ls can't break uu_base32.base_common.
Position
Below the diagonal: uu_ls.ls uses a module listed above it, which is the healthy direction.
uu_ls.display uses uucore.lib.mods.line_ending, so a change to uucore.lib.mods.line_ending can break uu_ls.display, while a change to uu_ls.display can't break uucore.lib.mods.line_ending.
Position
Below the diagonal: uu_ls.display uses a module listed above it, which is the healthy direction.
uu_ls.display uses uucore.lib.features.safe_traversal, so a change to uucore.lib.features.safe_traversal can break uu_ls.display, while a change to uu_ls.display can't break uucore.lib.features.safe_traversal.
Position
Below the diagonal: uu_ls.display uses a module listed above it, which is the healthy direction.
uu_ls.display uses uu_base32.base_common, so a change to uu_base32.base_common can break uu_ls.display, while a change to uu_ls.display can't break uu_base32.base_common.
Position
Below the diagonal: uu_ls.display uses a module listed above it, which is the healthy direction.
uu_mv.mv uses uucore.lib.features.backup_control, so a change to uucore.lib.features.backup_control can break uu_mv.mv, while a change to uu_mv.mv can't break uucore.lib.features.backup_control.
Position
Below the diagonal: uu_mv.mv uses a module listed above it, which is the healthy direction.
uu_numfmt.options uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uu_numfmt.options, while a change to uu_numfmt.options can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uu_numfmt.options uses a module listed above it, which is the healthy direction.
uu_numfmt.options uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uu_numfmt.options, while a change to uu_numfmt.options can't break uucore.lib.features.ranges.
Position
Below the diagonal: uu_numfmt.options uses a module listed above it, which is the healthy direction.
uu_numfmt.options uses uu_date.format_modifiers, so a change to uu_date.format_modifiers can break uu_numfmt.options, while a change to uu_numfmt.options can't break uu_date.format_modifiers.
Position
Below the diagonal: uu_numfmt.options uses a module listed above it, which is the healthy direction.
uucore.lib.features.format uses uucore.lib.mods.error, so a change to uucore.lib.mods.error can break uucore.lib.features.format, while a change to uucore.lib.features.format can't break uucore.lib.mods.error.
Position
Below the diagonal: uucore.lib.features.format uses a module listed above it, which is the healthy direction.
uucore.lib.features.format uses uucore.lib.features.format.num_format, so a change to uucore.lib.features.format.num_format can break uucore.lib.features.format, while a change to uucore.lib.features.format can't break uucore.lib.features.format.num_format.
Position
Below the diagonal: uucore.lib.features.format uses a module listed above it, which is the healthy direction.
uucore.lib.features.format uses uucore.lib.features.ranges, so a change to uucore.lib.features.ranges can break uucore.lib.features.format, while a change to uucore.lib.features.format can't break uucore.lib.features.ranges.
Position
Below the diagonal: uucore.lib.features.format uses a module listed above it, which is the healthy direction.
uucore.lib.features.format uses uu_chcon.errors, so a change to uu_chcon.errors can break uucore.lib.features.format, while a change to uucore.lib.features.format can't break uu_chcon.errors.
Position
Below the diagonal: uucore.lib.features.format uses a module listed above it, which is the healthy direction.
uucore.lib.features.format uses uu_date.format_modifiers, so a change to uu_date.format_modifiers can break uucore.lib.features.format, while a change to uucore.lib.features.format can't break uu_date.format_modifiers.
Position
Below the diagonal: uucore.lib.features.format uses a module listed above it, which is the healthy direction.
uu_ls.config uses uucore.lib.features.fsext, so a change to uucore.lib.features.fsext can break uu_ls.config, while a change to uu_ls.config can't break uucore.lib.features.fsext.
Position
Below the diagonal: uu_ls.config uses a module listed above it, which is the healthy direction.
uu_ls.config uses uucore.lib.mods.line_ending, so a change to uucore.lib.mods.line_ending can break uu_ls.config, while a change to uu_ls.config can't break uucore.lib.mods.line_ending.
Position
Below the diagonal: uu_ls.config uses a module listed above it, which is the healthy direction.
uu_ls.config uses uucore.lib.features.quoting_style, so a change to uucore.lib.features.quoting_style can break uu_ls.config, while a change to uu_ls.config can't break uucore.lib.features.quoting_style.
Position
Below the diagonal: uu_ls.config uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in uu_ls.config uses a type in uu_csplit.patterns.
The types involved
uu_ls.config.Config → uu_csplit.patterns.Pattern
Direction
uu_ls.config uses uu_csplit.patterns, so a change to uu_csplit.patterns can break uu_ls.config, while a change to uu_ls.config can't break uu_csplit.patterns.
Position
Below the diagonal: uu_ls.config uses a module listed above it, which is the healthy direction.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
248
High / Critical
A03:2025 — Software Supply Chain Failures
6
Medium
A02:2025 — Security Misconfiguration
3
Medium
A07:2025 — Authentication Failures
1
High / Critical
Roadmap
Immediately resolve the leaked secret in REDACTED and establish a diagnostic log trail accessible via verbose flags to capture otherwise invisible errors. Concurrently, document significant design decisions in a structured ADR folder to clarify architectural choices and consequences. Finally, correct the inverted test pyramid by rebalancing test coverage to prioritize unit and integration tests over brittle end-to-end tests.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
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.
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 4 sites, not one: `src/uucore/src/lib/features/checksum/mod.rs:397` (`Md5::default`), `src/uucore/src/lib/features/checksum/mod.rs:399` (`Sha1::default`), `src/uucore/src/lib/features/sum.rs:557` (`MessageDigest::md5`), `src/uucore/src/lib/features/sum.rs:559` (`MessageDigest::sha1`). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Per-file score 0–10 — a quality signature. Of 228 files carrying findings, judged against the Preview bar: 0% slop · 34% mixed · 66% near-clean.
File
Score
Band
Worst signal
REDACTED
4.3
Mixed
Secret Scanning: Leaked secret: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.6
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
5.1
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
5.1
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
5.1
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
5.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
5.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
5.8
Mixed
Static Analysis (SAST): High: REDACTED
How the grades work
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 248
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 — 798
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 — 50
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 14
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
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. 63 of 63 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 — 63 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, 1072 of 1096 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 READ here — but this repository measures it: a Codecov configuration (.codecov.yml) and a coverage step in CI (`codecov/codecov-action`) shows that coverage is collected and tracked in your own CI. The built-in collector has no runner for this ecosystem (.rs), so the analyzer could not read the number — a gap in the analyzer's language coverage, not an unmeasured repo. Not scored. To have the real number read, 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. You can widen what we reach: optional: 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 — then the real number is read on the next scan.
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) and this repository declares a Cargo test suite (repository root, 274 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.
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.
AX6 Interface segregation — 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 is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing 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.
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). the image ran but published no HTTP port — nothing to crawl (EXPOSE the web port to unlock runtime evidence).
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python, Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python, Rust 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.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python, Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
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.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
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.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
104 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was uu_pr::pr::build_options at 56. A further 17 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 uucore::lib::features::fsext::pretty_fstype at 114 — they are counted neither in the figure above nor in this dimension's score. 5 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: src/uucore/src/lib/features/fsext/mod.rs (uucore::lib::features::fsext::pretty_fstype at 114), src/uucore/src/lib/mods/error.rs (UIoError::fmt at 22), src/uucore/src/lib/features/checksum/mod.rs (SizedAlgoKind::from_unsized at 19), src/uu/numfmt/src/format.rs (uu_numfmt::format::consider_suffix at 18), src/uu/od/src/parse_nrofbytes.rs (uu_od::parse_nrofbytes::parse_number_of_bytes at 18). 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.
+ 55 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 18 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with uu_pr::pr::build_options (cyclomatic 56), uu_sort::sort::uumain (cyclomatic 56), uu_cp::cp::copy_file (cyclomatic 52). — 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.5 to about 7.2/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 86 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 11 bodies over 60 down to 60 or less in Cognitive Complexity — start with uu_stty::stty::stty (cognitive 117), uu_install::install::standard (cognitive 100), uu_du::du::du_regular (cognitive 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 11 together lifts Cognitive Complexity from 3.4 to about 4.9/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.2 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 38 FunctionTooLong finding(s) in God Classes — start with sort.rs (4), cp.rs (4), du.rs (4). — One of this dimension's main actionable groups (38 warning-level).
Resolve the 38 FileTooLong finding(s) in God Classes — start with sort.rs, cp.rs, date.rs. — One of this dimension's main actionable groups (38 warning-level).
Resolve the 7 MethodTooLong finding(s) in God Classes — start with config.rs, cp.rs, REDACTED. — One of this dimension's main actionable groups (7 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.
78 duplicated block group(s) detected. A further 2 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 4 of the 80 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.
+ 36 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with env.rs, linebreak.rs, fold.rs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 6 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with date.rs, conversion_tables.rs, parseargs.rs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 6 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with csplit.rs, operation.rs, escape.rs. — One of this dimension's main actionable groups (6 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 · Coupling9.9 / 10Stronggated by 2 serious findings✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
114 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 2 module(s) off the main sequence, with abstractness counted on 64 of the 114 (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: uucore · ×2
What to do
Resolve the 2 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (2 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.
D9 · Test Distribution9.4 / 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.
6956 test methods: 1246 unit, 5710 integration, 0 BDD, 0 e2e. The Rust suite contributes 6922 `#[test]` function(s) across 274 file(s) declaring at least one; its unit/integration split is Cargo's own — 114 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 34 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.
Inverted test pyramid
✓ On the Gold path — maintain.
Detailed fixes: d9_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.
8 outdated, 0 yanked direct Cargo dependencies. 95 of 97 direct crates were graded against crates.io (0 not published there, 2 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: crc-fast · ×8
✓ 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.
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Enforce Secret Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 350 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.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 51 Hotspot finding(s) in Churn × Complexity Hotspots — start with sort.rs, cp.rs, date.rs. — One of this dimension's main actionable groups (51 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 Factor9.2 / 10Exemplary✓ 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.
22 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/uucore/src/lib/features/process/windows.rs. Counted over 293 of the 495 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1 · ×2
Further sole-owners (lower concentration)
✓ On the Gold path — maintain.
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.
255 deducted task-comment markers across 136108 LoC (0.2/KLoC) → score 9.6. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 179 TodoComment finding(s) in Explicit Debt — start with cp.rs (9), test_cp.rs (8), test_tail.rs (7). — One of this dimension's main actionable groups (179 warning-level).
Resolve the 70 FixmeComment finding(s) in Explicit Debt — start with test_tail.rs (35), test_df.rs (8), test_cp.rs (6). — One of this dimension's main actionable groups (70 warning-level).
Resolve the 6 XxxComment finding(s) in Explicit Debt — start with mod.rs (2), test_install.rs, num_format.rs. — One of this dimension's main actionable groups (6 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. 23 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.
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).
248 finding(s): 0 critical, 247 high, 0 medium, 1 low. 228 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 21 file(s) — `src/common/validation.rs` (line 24), `src/uu/cut/src/cut.rs` (line 119), `src/uu/date/src/date.rs` (line 50, lines 66–67, line 2323), `src/uu/du/src/du.rs` (line 245, line 284), `src/uu/env/src/env.rs` (line 776, lines 777–778, line 1167, …), … (+16 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 16 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
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 12 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (7), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (12 issue-level).
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
No action in Static Analysis (SAST) — all 228 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (228 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 1 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
11 of 293 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/uu/ls/src/output.rs. Counted over 293 of the 495 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Orphaned file · ×11src/uu/ls/src/output.rs:1
Orphaned files with no living knowledge
✓ On the Gold path — maintain.
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. 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.
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 the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Other · Architecture — Whether feature slices stay independent (no direct cross-slice references) — the discipline that makes vertical-slice architecture pay off.
Method: Roslyn scan (vertical-slice gated): feature slices resolved from namespaces (.Features.*, .Slices.*) or project names; cross-slice type references detected. Deterministic, traceable.
`Snapshot` (slice 'diagnostics') depends on `Range` from slice 'ranges'. — src/uucore/src/lib/features/diagnostics.rs:177
`EncodingWrapper` (slice 'encoding') depends on `Encoding` from slice 'i18n'. — src/uucore/src/lib/features/encoding.rs:188
`ModeError` (slice 'mode') depends on `Range` from slice 'ranges'. — src/uucore/src/lib/features/mode.rs:28
`UtmpxIter` (slice 'utmpx') depends on `SystemdUtmpxIter` from slice 'systemd_logind'. — src/uucore/src/lib/features/utmpx.rs:412
What to do
Keep slices independent: share cross-slice needs via an explicit contract/shared-kernel, not direct references between slices.
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.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 108 of 113 project(s) that lack one — worth up to 1.9 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 · Observability0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
What to do
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
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.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
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 no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker.
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.
MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. (×4) — src/uucore/src/lib/features/checksum/mod.rs:397, src/uucore/src/lib/features/checksum/mod.rs:399, src/uucore/src/lib/features/sum.rs:557, …
What to do
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 4 sites, not one: `src/uucore/src/lib/features/checksum/mod.rs:397` (`Md5::default`), `src/uucore/src/lib/features/checksum/mod.rs:399` (`Sha1::default`), `src/uucore/src/lib/features/sum.rs:557` (`MessageDigest::md5`), `src/uucore/src/lib/features/sum.rs:559` (`MessageDigest::sha1`). Each is a separate decision — fixing only the line this row cites leaves the others in place.
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.
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 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.
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.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 4 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 54 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC2 Forms & labels — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC3 Page structure — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC4 Keyboard semantics — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC5 ARIA correctness — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC6 Visual & motion safety — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC7 A11y enforcement — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AX1 Captive dependencies — Not applicable: 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; 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.
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. 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).
AX4 Dependency direction — not applicable to a vertical-slice architecture (the inward-dependency rule is for layered/clean styles)
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface 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
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 — the image ran but published no HTTP port — nothing to crawl (EXPOSE the web port to unlock runtime evidence) 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.
D10 Test Quality — ~116897 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
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, Rust 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, .rs, 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.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
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 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 54 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
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
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Python, Rust source, so there is no service whose uptime a failing dependency could take down
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
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — no C# was loaded; this repository's Python and Rust were read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation; a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
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 Rust was read, and it logs through none: the `log` crate's macros take one finished message (as log4net does in C#; its `kv` values are an opt-in its backends mostly drop), `println!`/`eprintln!` are not loggers, or it makes no log call outside its tests and examples at all. Calls through `tracing` (`tracing::info!`, or `info!` imported from it) would be judged.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
TodoComment tests/by-util/test_basename.rs:189— // TODO The GNU tests seem to suggest that some systems treat "//" — 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 tests/by-util/test_cat.rs:123— // TODO(#7542): Re-enable on Android once we figure out why setting limit is broken.
TodoComment tests/by-util/test_sort.rs:1819— // TODO(#7542): Re-enable on Android once we figure out why setting limit is broken.
TodoComment tests/by-util/test_sort.rs:1844— // TODO(#7542): Re-enable on Android once we figure out why setting limit is broken.
TodoComment tests/by-util/test_cat.rs:665— // TODO: make this work on windows — 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 tests/by-util/test_tail.rs:3929— // TODO: make this work on windows — 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 tests/by-util/test_tail.rs:3952— // TODO: make this work on windows — 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 tests/by-util/test_tail.rs:3968— // TODO: make this work on windows — 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 tests/by-util/test_chown.rs:20— // TODO: Maybe `adduser --uid 1001 username` can put things right? — 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 tests/by-util/test_chown.rs:341— // TODO: implement once output "failed to change" to stdout is fixed — 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 tests/by-util/test_chown.rs:862— // TODO: uncomment once message changed from "cannot dereference" to "cannot access" — 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 tests/by-util/test_chroot.rs:47— // todo: override by proper error message on other platforms — 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 tests/by-util/test_chroot.rs:60— // todo: override by proper error message on other platforms — 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 tests/by-util/test_chroot.rs:70— // todo: override by proper error message on other platforms — 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 tests/by-util/test_cp.rs:1501— /// TODO: write a better test that differentiates --remove-destination — 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 tests/by-util/test_cp.rs:2329— // TODO: create a destination that does not allow copying of xattr and context — 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 tests/by-util/test_cp.rs:2400— // TODO: create a destination that does not allow copying of xattr and context — 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 tests/by-util/test_cp.rs:2415— // TODO: verify access time as well. It shouldn't change, however, it does change in this test. — 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 tests/by-util/test_cp.rs:2434— // TODO: Also check whether --preserve=link did the right thing! — 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 tests/by-util/test_cp.rs:3292— // TODO: make Btrfs image without sudo dynamically to support GitHub runner — 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 tests/by-util/test_cp.rs:3312— // todo: replace with std — 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 tests/by-util/test_cp.rs:4610— // TODO: enable for Android, when #3477 solved
TodoComment tests/by-util/test_date.rs:1265— // TODO: We do not handle invalid timezones the same way as GNU coreutils — 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 tests/by-util/test_dd.rs:128— //todo: improve error message at all platforms — 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 tests/by-util/test_dd.rs:1622— // TODO Investigate if this is possible on Windows. — 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.
FixmeComment tests/by-util/test_cp.rs:494— // FixME: for MacOS, this has intermittent failures; track repair progress at GH:uutils/coreutils/issues/1590 — 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.
FixmeComment tests/by-util/test_cp.rs:550— // FixME: for MacOS, this has intermittent failures; track repair progress at GH:uutils/coreutils/issues/1590 — 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.
FixmeComment tests/by-util/test_cp.rs:2407— // FIXME: macos copy keeps the original mtime — 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.
FixmeComment tests/by-util/test_cp.rs:2462— // FIXME: the test looks to .succeed on android — 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.
FixmeComment tests/by-util/test_cp.rs:3822— // FIXME: fix this test for FreeBSD — 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.
FixmeComment tests/by-util/test_df.rs:272— // FIXME: fix this test for FreeBSD — 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.
FixmeComment tests/by-util/test_df.rs:294— // FIXME: fix this test for FreeBSD — 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.
FixmeComment tests/by-util/test_df.rs:321— // FIXME: fix this test for FreeBSD — 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.
FixmeComment tests/by-util/test_df.rs:477— // FIXME: fix this test for FreeBSD — 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.
FixmeComment tests/by-util/test_cp.rs:4067— // FIXME: fix this test for FreeBSD/OpenBSD — 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.
FixmeComment tests/by-util/test_df.rs:345— // FIXME: fix test for FreeBSD, OpenBSD & Win — 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.
FixmeComment tests/by-util/test_df.rs:1021— // FIXME: fix test for FreeBSD & Win — 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.
FixmeComment tests/by-util/test_df.rs:1040— // FIXME: fix test for FreeBSD & Win — 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.
FixmeComment tests/by-util/test_df.rs:1075— // FIXME: fix test for FreeBSD & Win — 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.
FixmeComment tests/by-util/test_env.rs:598— // FixMe: This test fails on MACOS: — 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.
FixmeComment tests/by-util/test_ls.rs:250— // FIXME: fix this test for FreeBSD and OpenBSD — 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.
FixmeComment tests/by-util/test_tac.rs:195— // FIXME: See https://github.com/uutils/coreutils/issues/4204
FixmeComment tests/by-util/test_tail.rs:130— // FIXME: the -f test fails with: Assertion failed. Expected 'tail' to be running but exited with status=exit status: 0 — 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.
FixmeComment tests/by-util/test_tail.rs:132— // FIXME: for currently not working platforms — 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.
FixmeComment tests/by-util/test_tail.rs:361— // FIXME: for currently not working platforms — 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.
FixmeComment tests/by-util/test_tail.rs:773— // FIXME: for currently not working platforms — 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.
FixmeComment tests/by-util/test_tail.rs:816— // FIXME: for currently not working platforms — 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.
FixmeComment tests/by-util/test_tail.rs:1535— // FIXME: for currently not working platforms — 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.
FixmeComment tests/by-util/test_tail.rs:1581— // FIXME: for currently not working platforms — 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.
FixmeComment tests/by-util/test_tail.rs:1641— // FIXME: for currently not working platforms — 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.
Hotspot: src/uu/sort/src/sort.rs src/uu/sort/src/sort.rs:2140— src/uu/sort/src/sort.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in uu_sort::sort::uumain at line 2140. 1 of those changes was a fix/bug commit, and the other 37 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/sort/src/sort.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/uu/cp/src/cp.rs src/uu/cp/src/cp.rs:2775— src/uu/cp/src/cp.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in uu_cp::cp::copy_file at line 2775. 6 of those changes were fix/bug commits, and the other 33 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/cp/src/cp.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/uu/date/src/date.rs src/uu/date/src/date.rs:329— src/uu/date/src/date.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in uu_date::date::uumain at line 329. 2 of those changes were fix/bug commits, and the other 35 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/date/src/date.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/uu/stat/src/stat.rs src/uu/stat/src/stat.rs:1150— src/uu/stat/src/stat.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Stater::process_token_files at line 1150. 4 of those changes were fix/bug commits, and the other 30 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/stat/src/stat.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/uu/install/src/install.rs src/uu/install/src/install.rs:617— src/uu/install/src/install.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in uu_install::install::standard at line 617. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/install/src/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/uu/pr/src/pr.rs src/uu/pr/src/pr.rs:577— src/uu/pr/src/pr.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in uu_pr::pr::build_options at line 577. 2 of those changes were fix/bug commits, and the other 21 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/pr/src/pr.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/uu/ls/src/config.rs src/uu/ls/src/config.rs:655— src/uu/ls/src/config.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Config::from_with_program_mode at line 655. 3 of those changes were fix/bug commits, and the other 19 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/ls/src/config.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/uu/stty/src/stty.rs src/uu/stty/src/stty.rs:1010— src/uu/stty/src/stty.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in uu_stty::stty::combo_to_flags at line 1010. 4 of those changes were fix/bug commits, and the other 18 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/stty/src/stty.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/uucore/src/lib/features/fs.rs src/uucore/src/lib/features/fs.rs:349— src/uucore/src/lib/features/fs.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in uucore::lib::features::fs::canonicalize at line 349. 2 of those changes were fix/bug commits, and the other 25 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uucore/src/lib/features/fs.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/uu/ls/src/display.rs src/uu/ls/src/display.rs:927— src/uu/ls/src/display.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in uu_ls::display::display_item_long at line 927. 3 of those changes were fix/bug commits, and the other 15 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/ls/src/display.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/uu/chmod/src/chmod.rs src/uu/chmod/src/chmod.rs:460— src/uu/chmod/src/chmod.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Chmoder::chmod at line 460. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/chmod/src/chmod.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/uucore/src/lib/features/checksum/validate.rs src/uucore/src/lib/features/checksum/validate.rs:880— src/uucore/src/lib/features/checksum/validate.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in uucore::lib::features::checksum::validate::process_checksum_file at line 880. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uucore/src/lib/features/checksum/validate.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/uu/dd/src/dd.rs src/uu/dd/src/dd.rs:1127— src/uu/dd/src/dd.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in uu_dd::dd::dd_copy at line 1127. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/dd/src/dd.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/uu/date/src/format_modifiers.rs src/uu/date/src/format_modifiers.rs:512— src/uu/date/src/format_modifiers.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in uu_date::format_modifiers::apply_modifiers at line 512. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/date/src/format_modifiers.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/uu/cut/src/cut.rs src/uu/cut/src/cut.rs:360— src/uu/cut/src/cut.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CharCut::write_line at line 360. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/cut/src/cut.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/uu/tr/src/operation.rs src/uu/tr/src/operation.rs:322— src/uu/tr/src/operation.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Sequence::solve_set_characters 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/tr/src/operation.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/uu/ln/src/ln.rs src/uu/ln/src/ln.rs:397— src/uu/ln/src/ln.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in uu_ln::ln::link at line 397. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/ln/src/ln.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/uu/mv/src/mv.rs src/uu/mv/src/mv.rs:812— src/uu/mv/src/mv.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in uu_mv::mv::rename at line 812. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/mv/src/mv.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/uu/du/src/du.rs src/uu/du/src/du.rs:352— src/uu/du/src/du.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in uu_du::du::safe_du at line 352. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/du/src/du.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: REDACTED REDACTED:316— REDACTED changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Observer::handle_event at line 316. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/uu/cp/src/copydir.rs src/uu/cp/src/copydir.rs:351— src/uu/cp/src/copydir.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in uu_cp::copydir::copy_directory at line 351. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/cp/src/copydir.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/uu/od/src/od.rs src/uu/od/src/od.rs:110— src/uu/od/src/od.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OdOptions::new at line 110. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/od/src/od.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/uucore/src/lib/mods/error.rs src/uucore/src/lib/mods/error.rs:423— src/uucore/src/lib/mods/error.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in UIoError::fmt at line 423. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uucore/src/lib/mods/error.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/uu/numfmt/src/options.rs src/uu/numfmt/src/options.rs:222— src/uu/numfmt/src/options.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in FormatOptions::from_str at line 222. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/numfmt/src/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.
Hotspot: src/uu/dd/src/parseargs.rs src/uu/dd/src/parseargs.rs:174— src/uu/dd/src/parseargs.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Parser::validate at line 174. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 01:27:39 +01:00' --until='2026-10-26 01:27:39 +01:00' --full-history --no-merges -- src/uu/dd/src/parseargs.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.
FunctionTooLong: uu_ls::ls::uu_app src/uu/ls/src/ls.rs:137— FunctionTooLong — uu_ls::ls::uu_app runs 536 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 436 over it, 5.36× 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: uu_pr::pr::build_options src/uu/pr/src/pr.rs:577— FunctionTooLong — uu_pr::pr::build_options runs 315 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 215 over it, 3.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: uu_sort::sort::uumain src/uu/sort/src/sort.rs:2140— FunctionTooLong — uu_sort::sort::uumain runs 234 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 134 over it, 2.34× 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: uu_cp::cp::uu_app src/uu/cp/src/cp.rs:550— FunctionTooLong — uu_cp::cp::uu_app runs 223 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 123 over it, 2.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.
FunctionTooLong: uu_du::du::uu_app src/uu/du/src/du.rs:1326— FunctionTooLong — uu_du::du::uu_app runs 209 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 109 over it, 2.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: uu_sort::sort::uu_app src/uu/sort/src/sort.rs:2514— FunctionTooLong — uu_sort::sort::uu_app runs 205 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 105 over it, 2.05× 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: uu_date::date::uumain src/uu/date/src/date.rs:329— FunctionTooLong — uu_date::date::uumain runs 194 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 94 over it, 1.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: uu_ls::display::display_item_long src/uu/ls/src/display.rs:927— FunctionTooLong — uu_ls::display::display_item_long runs 187 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 87 over it, 1.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.
FunctionTooLong: uu_od::od::uu_app src/uu/od/src/od.rs:313— FunctionTooLong — uu_od::od::uu_app runs 179 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 79 over it, 1.79× 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: uu_cp::cp::copy_file src/uu/cp/src/cp.rs:2775— FunctionTooLong — uu_cp::cp::copy_file runs 170 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 70 over it, 1.70× 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: uu_du::du::safe_du src/uu/du/src/du.rs:352— FunctionTooLong — uu_du::du::safe_du 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: uu_id::id::uumain src/uu/id/src/id.rs:116— FunctionTooLong — uu_id::id::uumain runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: uu_pr::pr::uu_app src/uu/pr/src/pr.rs:195— FunctionTooLong — uu_pr::pr::uu_app runs 157 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 57 over it, 1.57× 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: uu_cp::copydir::copy_directory src/uu/cp/src/copydir.rs:351— FunctionTooLong — uu_cp::copydir::copy_directory 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: uu_du::du::uumain src/uu/du/src/du.rs:1054— FunctionTooLong — uu_du::du::uumain runs 149 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 49 over it, 1.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: uu_install::install::standard src/uu/install/src/install.rs:617— FunctionTooLong — uu_install::install::standard runs 141 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 41 over it, 1.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.
FunctionTooLong: uu_split::cli::uu_app src/uu/split/src/cli.rs:32— FunctionTooLong — uu_split::cli::uu_app runs 136 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 36 over it, 1.36× 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: coreutils::bin::uudoc::main src/bin/uudoc.rs:228— FunctionTooLong — coreutils::bin::uudoc::main runs 135 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 35 over it, 1.35× 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: uu_df::df::uu_app src/uu/df/src/df.rs:539— FunctionTooLong — uu_df::df::uu_app runs 135 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 35 over it, 1.35× 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: uu_ptx::ptx::uu_app src/uu/ptx/src/ptx.rs:951— FunctionTooLong — uu_ptx::ptx::uu_app runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: uu_sort::sort::emit_debug_warnings src/uu/sort/src/sort.rs:1937— FunctionTooLong — uu_sort::sort::emit_debug_warnings runs 128 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 28 over it, 1.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.
FunctionTooLong: uu_cp::cp::copy_attributes src/uu/cp/src/cp.rs:1880— FunctionTooLong — uu_cp::cp::copy_attributes runs 127 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 27 over it, 1.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: uu_numfmt::numfmt::uu_app src/uu/numfmt/src/numfmt.rs:564— FunctionTooLong — uu_numfmt::numfmt::uu_app runs 126 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 26 over it, 1.26× 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: uu_stty::stty::stty src/uu/stty/src/stty.rs:230— FunctionTooLong — uu_stty::stty::stty runs 126 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 26 over it, 1.26× 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: uu_cp::cp::handle_copy_mode src/uu/cp/src/cp.rs:2559— FunctionTooLong — uu_cp::cp::handle_copy_mode runs 124 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 24 over it, 1.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.
FileTooLong: src/sort.rs src/uu/sort/src/sort.rs— FileTooLong — 2305 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 63 free functions. The bar is 500 significant lines; this is 1805 over it, 4.61× 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/cp.rs src/uu/cp/src/cp.rs— FileTooLong — 2021 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 1521 over it, 4.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/date.rs src/uu/date/src/date.rs— FileTooLong — 1470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 56 free functions. The bar is 500 significant lines; this is 970 over it, 2.94× 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/ls.rs src/uu/ls/src/ls.rs— FileTooLong — 1205 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 705 over it, 2.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/pr.rs src/uu/pr/src/pr.rs— FileTooLong — 1119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 33 free functions. The bar is 500 significant lines; this is 619 over it, 2.24× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/du.rs src/uu/du/src/du.rs— FileTooLong — 1105 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 605 over it, 2.21× 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/mv.rs src/uu/mv/src/mv.rs— FileTooLong — 1042 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 31 free functions. The bar is 500 significant lines; this is 542 over it, 2.08× 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/stat.rs src/uu/stat/src/stat.rs— FileTooLong — 988 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 488 over it, 1.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/display.rs src/uu/ls/src/display.rs— FileTooLong — 902 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 402 over it, 1.80× 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/dd.rs src/uu/dd/src/dd.rs— FileTooLong — 869 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 369 over it, 1.74× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/cut.rs src/uu/cut/src/cut.rs— FileTooLong — 860 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 360 over it, 1.72× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/install.rs src/uu/install/src/install.rs— FileTooLong — 860 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 360 over it, 1.72× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/env.rs src/uu/env/src/env.rs— FileTooLong — 817 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 317 over it, 1.63× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/join.rs src/uu/join/src/join.rs— FileTooLong — 788 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 288 over it, 1.58× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/ptx.rs src/uu/ptx/src/ptx.rs— FileTooLong — 759 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 259 over it, 1.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: src/stty.rs src/uu/stty/src/stty.rs— FileTooLong — 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 31 free functions. The bar is 500 significant lines; this is 237 over it, 1.47× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/split.rs src/uu/split/src/split.rs— FileTooLong — 727 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 227 over it, 1.45× 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: features/perms.rs src/uucore/src/lib/features/perms.rs— FileTooLong — 709 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 209 over it, 1.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/config.rs src/uu/ls/src/config.rs— FileTooLong — 697 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 197 over it, 1.39× 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/syntax_tree.rs src/uu/expr/src/syntax_tree.rs— FileTooLong — 671 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 171 over it, 1.34× 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/wc.rs src/uu/wc/src/wc.rs— FileTooLong — 662 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 162 over it, 1.32× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: features/fs.rs src/uucore/src/lib/features/fs.rs— FileTooLong — 642 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 142 over it, 1.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: fsext/mod.rs src/uucore/src/lib/features/fsext/mod.rs— FileTooLong — 642 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 142 over it, 1.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/format.rs src/uu/numfmt/src/format.rs— FileTooLong — 637 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 33 free functions. The bar is 500 significant lines; this is 137 over it, 1.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/rm.rs src/uu/rm/src/rm.rs— FileTooLong — 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 33 free functions. The bar is 500 significant lines; this is 136 over it, 1.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
uucore::lib::features::safe_traversal::find_existing_ancestor (cognitive 38) src/uucore/src/lib/features/safe_traversal.rs:647— uucore::lib::features::safe_traversal::find_existing_ancestor has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uucore::lib::features::systemd_logind::read_login_records (cognitive 35) src/uucore/src/lib/features/systemd_logind.rs:325— uucore::lib::features::systemd_logind::read_login_records has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uucore::lib::features::fs::display_permissions_unix (cognitive 32) src/uucore/src/lib/features/fs.rs:532— uucore::lib::features::fs::display_permissions_unix has cognitive complexity 32 (threshold 15). Drivers by points: if/else 29 (32 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
uucore::lib::features::checksum::validate::process_checksum_file (cognitive 31) src/uucore/src/lib/features/checksum/validate.rs:880— uucore::lib::features::checksum::validate::process_checksum_file has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 3 (6 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.
uucore::lib::features::fs::canonicalize (cognitive 31) src/uucore/src/lib/features/fs.rs:349— uucore::lib::features::fs::canonicalize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, match/switch 3 (5 pts), loops 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.
uucore::lib::features::parser::num_parser::parse (cognitive 31) src/uucore/src/lib/features/parser/num_parser.rs:475— uucore::lib::features::parser::num_parser::parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 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.
uucore::lib::features::perms::wrap_chown (cognitive 23) src/uucore/src/lib/features/perms.rs:92— uucore::lib::features::perms::wrap_chown has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uucore::lib::features::format::num_format::format_float_hexadecimal (cognitive 21) src/uucore/src/lib/features/format/num_format.rs:637— uucore::lib::features::format::num_format::format_float_hexadecimal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, match/switch 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.
uucore::lib::features::checksum::compute::perform_checksum_computation (cognitive 20) src/uucore/src/lib/features/checksum/compute.rs:224— uucore::lib::features::checksum::compute::perform_checksum_computation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 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.
uucore::lib::features::format::num_format::format_float_shortest (cognitive 20) src/uucore/src/lib/features/format/num_format.rs:555— uucore::lib::features::format::num_format::format_float_shortest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (4 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.
uucore::lib::features::parser::num_parser::construct_extended_big_decimal (cognitive 20) src/uucore/src/lib/features/parser/num_parser.rs:398— uucore::lib::features::parser::num_parser::construct_extended_big_decimal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 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.
uucore::lib::features::fs::are_files_identical (cognitive 18) src/uucore/src/lib/features/fs.rs:661— uucore::lib::features::fs::are_files_identical has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 2 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uucore::lib::features::format::escape::parse_escape_code (cognitive 17) src/uucore/src/lib/features/format/escape.rs:142— uucore::lib::features::format::escape::parse_escape_code has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (8 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.
uucore::lib::features::version_cmp::remove_file_ending (cognitive 17) src/uucore/src/lib/features/version_cmp.rs:35— uucore::lib::features::version_cmp::remove_file_ending has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, 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.
uu_cp::cp::copy_file (cognitive 85) src/uu/cp/src/cp.rs:2775— uu_cp::cp::copy_file has cognitive complexity 85 (threshold 15). Drivers by points: if/else 37 (68 pts), boolean chains 17 (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.
uu_cp::copydir::copy_directory (cognitive 54) src/uu/cp/src/copydir.rs:351— uu_cp::copydir::copy_directory has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 6 (13 pts), loops 4 (10 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.
uu_cp::platform::linux::copy_on_write (cognitive 45) src/uu/cp/src/platform/linux.rs:292— uu_cp::platform::linux::copy_on_write has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 5 (9 pts) (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
uu_cp::cp::copy (cognitive 39) src/uu/cp/src/cp.rs:1453— uu_cp::cp::copy has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 6, loops 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.
uu_cp::cp::handle_copy_mode (cognitive 36) src/uu/cp/src/cp.rs:2559— uu_cp::cp::handle_copy_mode has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_cp::copydir::copy_direntry (cognitive 30) src/uu/cp/src/copydir.rs:244— uu_cp::copydir::copy_direntry has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_cp::platform::macos::copy_on_write (cognitive 20) src/uu/cp/src/platform/macos.rs:27— uu_cp::platform::macos::copy_on_write has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_cp::cp::construct_dest_path (cognitive 17) src/uu/cp/src/cp.rs:1560— uu_cp::cp::construct_dest_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_cp::cp::copy_helper (cognitive 17) src/uu/cp/src/cp.rs:3135— uu_cp::cp::copy_helper has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
uu_cp::cp::copy_attributes (cognitive 16) src/uu/cp/src/cp.rs:1880— uu_cp::cp::copy_attributes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, 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, 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.
uu_sort::sort::uumain (cognitive 73) src/uu/sort/src/sort.rs:2140— uu_sort::sort::uumain has cognitive complexity 73 (threshold 15). Drivers by points: if/else 35 (46 pts), match/switch 7 (15 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 21). 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.
uu_sort::sort::compare_by (cognitive 56) src/uu/sort/src/sort.rs:2844— uu_sort::sort::compare_by has cognitive complexity 56 (threshold 15). Drivers by points: if/else 29 (49 pts), boolean chains 4, match/switch 1 (2 pts), 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.
uu_sort::sort::emit_debug_warnings (cognitive 50) src/uu/sort/src/sort.rs:1937— uu_sort::sort::emit_debug_warnings has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 17, match/switch 1 (3 pts), loops 1 (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.
uu_sort::sort::get_leading_gen (cognitive 39) src/uu/sort/src/sort.rs:3048— uu_sort::sort::get_leading_gen has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 12, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_sort::chunks::read_to_buffer (cognitive 31) src/uu/sort/src/chunks.rs:357— uu_sort::chunks::read_to_buffer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (26 pts), boolean chains 2, match/switch 1 (2 pts), 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.
uu_sort::numeric_str_cmp::numeric_str_cmp (cognitive 27) src/uu/sort/src/numeric_str_cmp.rs:221— uu_sort::numeric_str_cmp::numeric_str_cmp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_sort::ext_sort::threaded::read_write_loop (cognitive 20) src/uu/sort/src/ext_sort/threaded.rs:211— uu_sort::ext_sort::threaded::read_write_loop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 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.
uu_sort::check::check (cognitive 18) src/uu/sort/src/check.rs:29— uu_sort::check::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_sort::sort::index_legacy_warnings (cognitive 18) src/uu/sort/src/sort.rs:1826— uu_sort::sort::index_legacy_warnings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, 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.
uu_sort::sort::preprocess_legacy_args (cognitive 16) src/uu/sort/src/sort.rs:1764— uu_sort::sort::preprocess_legacy_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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.
uu_ls::display::display_item_name (cognitive 72) src/uu/ls/src/display.rs:715— uu_ls::display::display_item_name has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (47 pts), match/switch 4 (17 pts), boolean chains 8 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
uu_ls::display::display_item_long (cognitive 55) src/uu/ls/src/display.rs:927— uu_ls::display::display_item_long has cognitive complexity 55 (threshold 15). Drivers by points: if/else 33 (52 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_ls::ls::enter_directory (cognitive 31) src/uu/ls/src/ls.rs:1387— uu_ls::ls::enter_directory has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (9 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_ls::colors::parse_indicator_codes (cognitive 27) src/uu/ls/src/colors.rs:737— uu_ls::colors::parse_indicator_codes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (23 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.
uu_ls::config::parse_time_style (cognitive 26) src/uu/ls/src/config.rs:1003— uu_ls::config::parse_time_style has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (10 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.
uu_ls::ls::list_with_output (cognitive 24) src/uu/ls/src/ls.rs:1170— uu_ls::ls::list_with_output has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (4 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.
uu_ls::colors::validate_ls_colors (cognitive 21) src/uu/ls/src/colors.rs:607— uu_ls::colors::validate_ls_colors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_ls::display::calculate_padding_collection (cognitive 20) src/uu/ls/src/display.rs:1315— uu_ls::display::calculate_padding_collection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 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.
uu_ls::colors::parse_funky_string (cognitive 18) src/uu/ls/src/colors.rs:659— uu_ls::colors::parse_funky_string has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (17 pts), loops 1 (nesting depth added 11). 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.
uu_od::parse_formats::parse_type_string (cognitive 37) src/uu/od/src/parse_formats.rs:256— uu_od::parse_formats::parse_type_string has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (9 pts), match/switch 2 (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.
uu_od::parse_formats::parse_format_flags (cognitive 34) src/uu/od/src/parse_formats.rs:108— uu_od::parse_formats::parse_format_flags has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 2 (4 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.
uu_od::input_decoder::u128_to_f64 (cognitive 33) src/uu/od/src/input_decoder.rs:161— uu_od::input_decoder::u128_to_f64 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (33 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.
uu_od::od::odfunc (cognitive 32) src/uu/od/src/od.rs:527— uu_od::od::odfunc has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 1 (2 pts), boolean chains 1, 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.
uu_od::od::extract_strings_from_input (cognitive 28) src/uu/od/src/od.rs:607— uu_od::od::extract_strings_from_input has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_od::parse_inputs::parse_inputs (cognitive 22) src/uu/od/src/parse_inputs.rs:54— uu_od::parse_inputs::parse_inputs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (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.
uu_od::parse_inputs::parse_offset_operand (cognitive 20) src/uu/od/src/parse_inputs.rs:176— uu_od::parse_inputs::parse_offset_operand has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
uu_od::prn_float::format_f64 (cognitive 19) src/uu/od/src/prn_float.rs:216— uu_od::prn_float::format_f64 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
uu_od::multifile_reader::skip_in_file (cognitive 16) src/uu/od/src/multifile_reader.rs:170— uu_od::multifile_reader::skip_in_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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.
uucore::lib::features::checksum::validate::process_checksum_file (cyclomatic 25) src/uucore/src/lib/features/checksum/validate.rs:880— uucore::lib::features::checksum::validate::process_checksum_file 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.
uucore::lib::features::format::escape::parse_escape_code (cyclomatic 24) src/uucore/src/lib/features/format/escape.rs:142— uucore::lib::features::format::escape::parse_escape_code 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.
uucore::lib::features::fs::canonicalize (cyclomatic 23) src/uucore/src/lib/features/fs.rs:349— uucore::lib::features::fs::canonicalize 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.
uucore::lib::features::version_cmp::version_cmp (cyclomatic 20) src/uucore/src/lib/features/version_cmp.rs:64— uucore::lib::features::version_cmp::version_cmp has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
uucore::lib::features::systemd_logind::read_login_records (cyclomatic 19) src/uucore/src/lib/features/systemd_logind.rs:325— uucore::lib::features::systemd_logind::read_login_records 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.
uucore::lib::features::fs::display_permissions_unix (cyclomatic 17) src/uucore/src/lib/features/fs.rs:532— uucore::lib::features::fs::display_permissions_unix 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.
uucore::lib::features::mode::parse_change (cyclomatic 17) src/uucore/src/lib/features/mode.rs:325— uucore::lib::features::mode::parse_change 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.
uucore::lib::features::parser::num_parser::parse (cyclomatic 16) src/uucore/src/lib/features/parser/num_parser.rs:475— uucore::lib::features::parser::num_parser::parse 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.
uu_date::date::uumain (cognitive 72) src/uu/date/src/date.rs:329— uu_date::date::uumain has cognitive complexity 72 (threshold 15). Drivers by points: if/else 37 (59 pts), match/switch 4 (8 pts), boolean chains 4, 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.
uu_date::format_modifiers::apply_modifiers (cognitive 47) src/uu/date/src/format_modifiers.rs:512— uu_date::format_modifiers::apply_modifiers has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 17, match/switch 2 (3 pts), loops 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.
uu_date::format_modifiers::format_with_modifiers (cognitive 23) src/uu/date/src/format_modifiers.rs:216— uu_date::format_modifiers::format_with_modifiers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
uu_date::date::parse_relative_plus (cognitive 21) src/uu/date/src/date.rs:1907— uu_date::date::parse_relative_plus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_date::date::expand_locale_formats (cognitive 20) src/uu/date/src/date.rs:1247— uu_date::date::expand_locale_formats has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_date::date::normalize_european_dates (cognitive 19) src/uu/date/src/date.rs:1671— uu_date::date::normalize_european_dates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7 (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.
uu_date::date::parse_date (cognitive 17) src/uu/date/src/date.rs:2104— uu_date::date::parse_date has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, 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.
MethodTooLong: Config.from_with_program_mode src/uu/ls/src/config.rs:655— MethodTooLong — from_with_program_mode runs 228 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 128 over it, 2.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: Options.from_matches src/uu/cp/src/cp.rs:1078— MethodTooLong — from_matches runs 139 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 39 over it, 1.39× 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: Observer.handle_event REDACTED:316— MethodTooLong — handle_event runs 125 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 25 over it, 1.25× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: FormatOptions.from_str src/uu/numfmt/src/options.rs:222— MethodTooLong — from_str runs 110 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 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Stater.process_token_files src/uu/stat/src/stat.rs:1150— MethodTooLong — process_token_files runs 108 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 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Sequence.solve_set_characters src/uu/tr/src/operation.rs:322— MethodTooLong — solve_set_characters runs 107 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 7 over it, 1.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: EnvAppData.process_all_string_arguments src/uu/env/src/env.rs:581— MethodTooLong — process_all_string_arguments runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
uu_cp::cp::copy_file (cyclomatic 52) src/uu/cp/src/cp.rs:2775— uu_cp::cp::copy_file has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
uu_cp::copydir::copy_directory (cyclomatic 28) src/uu/cp/src/copydir.rs:351— uu_cp::copydir::copy_directory 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.
uu_cp::platform::linux::copy_on_write (cyclomatic 24) src/uu/cp/src/platform/linux.rs:292— uu_cp::platform::linux::copy_on_write 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.
uu_cp::cp::handle_copy_mode (cyclomatic 22) src/uu/cp/src/cp.rs:2559— uu_cp::cp::handle_copy_mode 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.
uu_cp::cp::copy (cyclomatic 18) src/uu/cp/src/cp.rs:1453— uu_cp::cp::copy 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.
uu_cp::copydir::copy_direntry (cyclomatic 17) src/uu/cp/src/copydir.rs:244— uu_cp::copydir::copy_direntry 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.
XxxComment tests/by-util/test_install.rs:758— // XXX: can't tests introspect on their own names? — 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.
XxxComment src/uucore/src/lib/features/fsext/mod.rs:677— // XXX: dunno if this is right — 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.
XxxComment src/uucore/src/lib/features/fsext/mod.rs:740— // XXX: should everything just use statvfs? — 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.
XxxComment src/uucore/src/lib/features/format/num_format.rs:500— // Convert to the form XXX * 10^-p (XXX is precision digit long) — 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.
XxxComment src/uu/mktemp/src/mktemp.rs:173— /// {directory}/{prefix}{XXX}{suffix} — 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.
XxxComment src/uu/hostname/src/hostname.rs:103— // XXX: not sure why this is necessary... — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Duplicated block (10 lines × 2) src/uu/env/src/env.rs:1133— src/uu/env/src/env.rs:1133-1142 | src/uu/env/src/env.rs:1150-1159 — both copies are in the same file, so extract the block into 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/uu/fmt/src/linebreak.rs:275— src/uu/fmt/src/linebreak.rs:275-284 | src/uu/fmt/src/linebreak.rs:324-334 — both copies are in the same file, so extract the block into 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/uu/fold/src/fold.rs:471— src/uu/fold/src/fold.rs:471-480 | src/uu/fold/src/fold.rs:612-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 (10 lines × 2) src/uu/numfmt/src/options.rs:317— src/uu/numfmt/src/options.rs:317-326 | src/uu/numfmt/src/options.rs:351-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 (10 lines × 2) src/uu/id/src/id.rs:534— src/uu/id/src/id.rs:534-543 | src/uu/id/src/id.rs:561-570 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) fuzz/fuzz_targets/fuzz_sort.rs:39— fuzz/fuzz_targets/fuzz_sort.rs:39-48 | fuzz/fuzz_targets/fuzz_split.rs:63-72 — 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) src/uu/date/src/date.rs:904— src/uu/date/src/date.rs:904-910 | src/uu/date/src/date.rs:1136-1143 — both copies are in the same file, so extract the block into 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/uu/dd/src/conversion_tables.rs:21— src/uu/dd/src/conversion_tables.rs:21-27 | src/uu/dd/src/conversion_tables.rs:41-47 — both copies are in the same file, so extract the block into 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/uu/dd/src/parseargs.rs:361— src/uu/dd/src/parseargs.rs:361-367 | src/uu/dd/src/parseargs.rs:392-398 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/uu/hostid/src/hostid.rs:30— src/uu/hostid/src/hostid.rs:30-36 | src/uu/hostid/src/hostid.rs:45-51 — both copies are in the same file, so extract the block into 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/uu/pr/src/pr.rs:774— src/uu/pr/src/pr.rs:774-780 | src/uu/pr/src/pr.rs:787-793 — both copies are in the same file, so extract the block into 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/uucore/src/lib/features/fsext/mod.rs:474— src/uucore/src/lib/features/fsext/mod.rs:474-480 | src/uucore/src/lib/features/fsext/mod.rs:486-492 — both copies are in the same file, so extract the block into 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/uu/csplit/src/csplit.rs:440— src/uu/csplit/src/csplit.rs:440-445 | src/uu/csplit/src/csplit.rs:496-501 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/uu/tr/src/operation.rs:993— src/uu/tr/src/operation.rs:993-998 | src/uu/tr/src/simd.rs:159-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 (6 lines × 2) src/uucore/src/lib/features/format/escape.rs:181— src/uucore/src/lib/features/format/escape.rs:181-186 | src/uucore/src/lib/features/format/escape.rs:188-193 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/uu/sum/src/sum.rs:202— src/uu/sum/src/sum.rs:202-207 | src/uu/unexpand/src/unexpand.rs:289-294 — 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/uu/expand/src/expand.rs:213— src/uu/expand/src/expand.rs:213-218 | src/uu/unexpand/src/unexpand.rs:230-235 — 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/uu/mktemp/src/mktemp.rs:540— src/uu/mktemp/src/mktemp.rs:540-545 | src/uu/mktemp/src/mktemp.rs:568-573 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/uu/base32/src/base_common.rs:208— src/uu/base32/src/base_common.rs:208-212 | src/uu/base32/src/base_common.rs:224-228 — both copies are in the same file, so extract the block into 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/uu/dd/src/parseargs.rs:371— src/uu/dd/src/parseargs.rs:371-375 | src/uu/dd/src/parseargs.rs:402-406 — both copies are in the same file, so extract the block into 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/uu/rm/src/platform/unix.rs:103— src/uu/rm/src/platform/unix.rs:103-107 | src/uu/rm/src/rm.rs:1056-1060 — 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/uu/split/src/strategy.rs:147— src/uu/split/src/strategy.rs:147-151 | src/uu/split/src/strategy.rs:165-169 — both copies are in the same file, so extract the block into 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/uu/base32/src/base32.rs:12— src/uu/base32/src/base32.rs:12-16 | src/uu/base64/src/base64.rs:12-16 — 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/uu/chroot/src/chroot.rs:406— src/uu/chroot/src/chroot.rs:406-410 | src/uu/chroot/src/chroot.rs:422-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.
uu_sort::sort::uumain (cyclomatic 56) src/uu/sort/src/sort.rs:2140— uu_sort::sort::uumain has cyclomatic complexity 56 (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.
uu_sort::sort::emit_debug_warnings (cyclomatic 45) src/uu/sort/src/sort.rs:1937— uu_sort::sort::emit_debug_warnings has cyclomatic complexity 45 (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.
uu_sort::sort::compare_by (cyclomatic 31) src/uu/sort/src/sort.rs:2844— uu_sort::sort::compare_by 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.
uu_sort::sort::get_leading_gen (cyclomatic 25) src/uu/sort/src/sort.rs:3048— uu_sort::sort::get_leading_gen 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.
uu_sort::sort::month_parse (cyclomatic 20) src/uu/sort/src/sort.rs:3303— uu_sort::sort::month_parse has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
uu_ls::display::display_item_long (cyclomatic 30) src/uu/ls/src/display.rs:927— uu_ls::display::display_item_long 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.
uu_ls::display::display_item_name (cyclomatic 28) src/uu/ls/src/display.rs:715— uu_ls::display::display_item_name 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.
uu_ls::config::extract_sort (cyclomatic 21) src/uu/ls/src/config.rs:334— uu_ls::config::extract_sort 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.
uu_ls::colors::parse_funky_string (cyclomatic 18) src/uu/ls/src/colors.rs:659— uu_ls::colors::parse_funky_string 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.
uu_ls::config::parse_time_style (cyclomatic 16) src/uu/ls/src/config.rs:1003— uu_ls::config::parse_time_style 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.
uu_install::install::standard (cognitive 100) src/uu/install/src/install.rs:617— uu_install::install::standard has cognitive complexity 100 (threshold 15). Drivers by points: if/else 31 (70 pts), boolean chains 11, match/switch 3 (10 pts), loops 2 (9 pts) (nesting depth added 53). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
uu_install::install::directory (cognitive 28) src/uu/install/src/install.rs:502— uu_install::install::directory has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_install::install::behavior (cognitive 25) src/uu/install/src/install.rs:379— uu_install::install::behavior has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 6, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
uu_install::install::need_copy (cognitive 21) src/uu/install/src/install.rs:1315— uu_install::install::need_copy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, match/switch 2 (4 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.
uu_install::install::copy_files_into_dir (cognitive 18) src/uu/install/src/install.rs:859— uu_install::install::copy_files_into_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 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.
uu_unexpand::unexpand::unexpand_buf (cognitive 56) src/uu/unexpand/src/unexpand.rs:503— uu_unexpand::unexpand::unexpand_buf has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 8, match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
uu_unexpand::unexpand::parse_tabstops (cognitive 38) src/uu/unexpand/src/unexpand.rs:48— uu_unexpand::unexpand::parse_tabstops has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 5, 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.
uu_unexpand::unexpand::next_tabstop (cognitive 34) src/uu/unexpand/src/unexpand.rs:318— uu_unexpand::unexpand::next_tabstop has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 2 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
uu_unexpand::unexpand::write_tabs (cognitive 24) src/uu/unexpand/src/unexpand.rs:367— uu_unexpand::unexpand::write_tabs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_unexpand::unexpand::expand_shortcuts (cognitive 16) src/uu/unexpand/src/unexpand.rs:197— uu_unexpand::unexpand::expand_shortcuts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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.
uu_rm::platform::unix::safe_remove_dir_recursive_impl (cognitive 53) src/uu/rm/src/platform/unix.rs:467— uu_rm::platform::unix::safe_remove_dir_recursive_impl has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 5 (11 pts), boolean chains 5, 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.
uu_rm::platform::unix::safe_remove_dir_recursive (cognitive 24) src/uu/rm/src/platform/unix.rs:290— uu_rm::platform::unix::safe_remove_dir_recursive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, match/switch 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.
uu_rm::rm::remove (cognitive 21) src/uu/rm/src/rm.rs:554— uu_rm::rm::remove has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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.
uu_rm::rm::uumain (cognitive 20) src/uu/rm/src/rm.rs:238— uu_rm::rm::uumain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 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.
uu_rm::rm::remove_dir_recursive (cognitive 20) src/uu/rm/src/rm.rs:660— uu_rm::rm::remove_dir_recursive has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (8 pts), boolean chains 5, if/else 5, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_fold::fold::process_utf8_chars (cognitive 41) src/uu/fold/src/fold.rs:567— uu_fold::fold::process_utf8_chars has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_fold::fold::process_ascii_line (cognitive 31) src/uu/fold/src/fold.rs:449— uu_fold::fold::process_ascii_line has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (7 pts), boolean chains 3, 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.
uu_fold::fold::fold_file_bytewise (cognitive 17) src/uu/fold/src/fold.rs:275— uu_fold::fold::fold_file_bytewise has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_fold::fold::compute_col_count (cognitive 16) src/uu/fold/src/fold.rs:348— uu_fold::fold::compute_col_count has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 2 (4 pts), if/else 2 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
uu_fold::fold::process_non_utf8_line (cognitive 16) src/uu/fold/src/fold.rs:654— uu_fold::fold::process_non_utf8_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_wc::wc::wc (cognitive 24) src/uu/wc/src/wc.rs:896— uu_wc::wc::wc has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (5 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.
uu_wc::count_fast::count_bytes_fast (cognitive 22) src/uu/wc/src/count_fast.rs:64— uu_wc::count_fast::count_bytes_fast has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (4 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.
uu_wc::count_fast::count_bytes_chars_and_lines_fast (cognitive 22) src/uu/wc/src/count_fast.rs:187— uu_wc::count_fast::count_bytes_chars_and_lines_fast has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_wc::wc::compute_number_width (cognitive 22) src/uu/wc/src/wc.rs:724— uu_wc::wc::compute_number_width has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
uu_wc::wc::process_chunk (cognitive 21) src/uu/wc/src/wc.rs:570— uu_wc::wc::process_chunk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 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.
uu_numfmt::format::parse_suffix (cognitive 18) src/uu/numfmt/src/format.rs:259— uu_numfmt::format::parse_suffix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 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.
uu_numfmt::format::write_formatted_with_whitespace (cognitive 18) src/uu/numfmt/src/format.rs:984— uu_numfmt::format::write_formatted_with_whitespace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 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.
uu_numfmt::format::format_string (cognitive 16) src/uu/numfmt/src/format.rs:805— uu_numfmt::format::format_string has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 5 (6 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.
uu_numfmt::numfmt::format_and_write (cognitive 16) src/uu/numfmt/src/numfmt.rs:45— uu_numfmt::numfmt::format_and_write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 5 (8 pts) (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.
uu_numfmt::numfmt::parse_options (cognitive 16) src/uu/numfmt/src/numfmt.rs:329— uu_numfmt::numfmt::parse_options has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, match/switch 5 (6 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body into named stages: move each independent 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 (8 lines × 2) src/uu/dd/src/dd.rs:324— src/uu/dd/src/dd.rs:324-331 | src/uu/dd/src/dd.rs:710-717 — both copies are in the same file, so extract the block into 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/uu/sort/src/sort.rs:3402— src/uu/sort/src/sort.rs:3402-3409 | src/uu/sort/src/sort.rs:3421-3428 — both copies are in the same file, so extract the block into 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/uucore/src/lib/features/safe_traversal.rs:262— src/uucore/src/lib/features/safe_traversal.rs:262-269 | src/uucore/src/lib/features/safe_traversal.rs:300-307 — both copies are in the same file, so extract the block into 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/bin/uudoc.rs:584— src/bin/uudoc.rs:584-591 | src/bin/uudoc.rs:605-612 — both copies are in the same file, so extract the block into 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/uu/kill/src/kill.rs:176— src/uu/kill/src/kill.rs:176-183 | src/uu/kill/src/kill.rs:226-233 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Stater::process_token_files (cyclomatic 43) src/uu/stat/src/stat.rs:1150— Stater::process_token_files has cyclomatic complexity 43 (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.
Stater::handle_escape_sequences (cyclomatic 18) src/uu/stat/src/stat.rs:887— Stater::handle_escape_sequences has cyclomatic complexity 18 (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.
Stater::handle_percent_case (cyclomatic 17) src/uu/stat/src/stat.rs:777— Stater::handle_percent_case 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.
Stater::do_stat (cyclomatic 16) src/uu/stat/src/stat.rs:1336— Stater::do_stat 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.
uu_rm::platform::unix::safe_remove_dir_recursive_impl (cyclomatic 28) src/uu/rm/src/platform/unix.rs:467— uu_rm::platform::unix::safe_remove_dir_recursive_impl 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.
uu_rm::rm::remove_dir_recursive (cyclomatic 20) src/uu/rm/src/rm.rs:660— uu_rm::rm::remove_dir_recursive has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
uu_rm::rm::uumain (cyclomatic 18) src/uu/rm/src/rm.rs:238— uu_rm::rm::uumain 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.
uu_rm::platform::unix::safe_remove_dir_recursive (cyclomatic 17) src/uu/rm/src/platform/unix.rs:290— uu_rm::platform::unix::safe_remove_dir_recursive 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.
uu_du::du::du_regular (cognitive 94) src/uu/du/src/du.rs:609— uu_du::du::du_regular has cognitive complexity 94 (threshold 15). Drivers by points: if/else 16 (61 pts), match/switch 6 (21 pts), loops 2 (7 pts), boolean chains 5 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_du::du::safe_du (cognitive 60) src/uu/du/src/du.rs:352— uu_du::du::safe_du has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 9 (16 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_du::du::uumain (cognitive 48) src/uu/du/src/du.rs:1054— uu_du::du::uumain has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (3 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.
uu_du::du::parse_time_style (cognitive 16) src/uu/du/src/du.rs:1278— uu_du::du::parse_time_style has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 2 (4 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.
uu_tail::follow::watch::follow (cognitive 54) REDACTED:543— uu_tail::follow::watch::follow has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 6 (16 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_tail::tail::tail_file (cognitive 27) src/uu/tail/src/tail.rs:113— uu_tail::tail::tail_file has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 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.
uu_tail::tail::unbounded_tail (cognitive 18) src/uu/tail/src/tail.rs:499— uu_tail::tail::unbounded_tail has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 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.
uu_tail::tail::uu_tail (cognitive 16) src/uu/tail/src/tail.rs:62— uu_tail::tail::uu_tail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Chmoder::chmod (cognitive 42) src/uu/chmod/src/chmod.rs:460— Chmoder::chmod has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (35 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Chmoder::safe_traverse_dir (cognitive 26) src/uu/chmod/src/chmod.rs:663— Chmoder::safe_traverse_dir has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Chmoder::calculate_new_mode (cognitive 20) src/uu/chmod/src/chmod.rs:323— Chmoder::calculate_new_mode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Chmoder::walk_dir_with_context (cognitive 20) src/uu/chmod/src/chmod.rs:558— Chmoder::walk_dir_with_context has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (9 lines × 2) src/uu/date/src/format_modifiers.rs:321— src/uu/date/src/format_modifiers.rs:321-329 | src/uu/date/src/format_modifiers.rs:397-405 — both copies are in the same file, so extract the block into 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/uucore/src/lib/features/benchmark.rs:364— src/uucore/src/lib/features/benchmark.rs:364-372 | src/uucore/src/lib/features/benchmark.rs:383-391 — both copies are in the same file, so extract the block into 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/uucore/src/lib/features/i18n/decimal.rs:16— src/uucore/src/lib/features/i18n/decimal.rs:16-24 | src/uucore/src/lib/features/i18n/decimal.rs:42-50 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/uu/expand/src/expand.rs:356— src/uu/expand/src/expand.rs:356-366 | src/uu/pr/src/pr.rs:1433-1441 — 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.
Weak hash algorithm src/uucore/src/lib/features/checksum/mod.rs:397— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm src/uucore/src/lib/features/checksum/mod.rs:399— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm src/uucore/src/lib/features/sum.rs:557— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm src/uucore/src/lib/features/sum.rs:559— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Parser::parse (cyclomatic 44) src/uucore/src/lib/features/parser/parse_size.rs:263— Parser::parse 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.
Parser::validate (cyclomatic 22) src/uu/dd/src/parseargs.rs:174— Parser::validate 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.
Parser::parse_expression (cyclomatic 19) src/uu/expr/src/syntax_tree.rs:987— Parser::parse_expression 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.
uu_install::install::standard (cyclomatic 43) src/uu/install/src/install.rs:617— uu_install::install::standard 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.
uu_install::install::need_copy (cyclomatic 20) src/uu/install/src/install.rs:1315— uu_install::install::need_copy 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.
uu_install::install::behavior (cyclomatic 19) src/uu/install/src/install.rs:379— uu_install::install::behavior 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.
uu_du::du::safe_du (cyclomatic 32) src/uu/du/src/du.rs:352— uu_du::du::safe_du 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.
uu_du::du::du_regular (cyclomatic 30) src/uu/du/src/du.rs:609— uu_du::du::du_regular 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.
uu_du::du::uumain (cyclomatic 24) src/uu/du/src/du.rs:1054— uu_du::du::uumain 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.
uu_unexpand::unexpand::unexpand_buf (cyclomatic 28) src/uu/unexpand/src/unexpand.rs:503— uu_unexpand::unexpand::unexpand_buf 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.
uu_unexpand::unexpand::parse_tabstops (cyclomatic 20) src/uu/unexpand/src/unexpand.rs:48— uu_unexpand::unexpand::parse_tabstops 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.
uu_unexpand::unexpand::write_tabs (cyclomatic 17) src/uu/unexpand/src/unexpand.rs:367— uu_unexpand::unexpand::write_tabs 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.
uu_mv::mv::rename (cyclomatic 21) src/uu/mv/src/mv.rs:812— uu_mv::mv::rename 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.
uu_mv::mv::handle_two_paths (cyclomatic 20) src/uu/mv/src/mv.rs:390— uu_mv::mv::handle_two_paths 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.
uu_mv::mv::move_files_into_dir (cyclomatic 17) src/uu/mv/src/mv.rs:687— uu_mv::mv::move_files_into_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.
uu_pr::pr::build_options (cognitive 65) src/uu/pr/src/pr.rs:577— uu_pr::pr::build_options has cognitive complexity 65 (threshold 15). Drivers by points: if/else 38 (40 pts), match/switch 15 (19 pts), boolean chains 6 (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.
uu_pr::pr::write_columns (cognitive 32) src/uu/pr/src/pr.rs:1444— uu_pr::pr::write_columns has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 5 (11 pts), match/switch 1 (3 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.
uu_pr::pr::get_pages (cognitive 29) src/uu/pr/src/pr.rs:1115— uu_pr::pr::get_pages has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_cut::cut::cut_fields_newline_char_delim (cognitive 60) src/uu/cut/src/cut.rs:644— uu_cut::cut::cut_fields_newline_char_delim has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (46 pts), boolean chains 7, loops 3 (7 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.
uu_cut::cut::write_fields_line (cognitive 27) src/uu/cut/src/cut.rs:479— uu_cut::cut::write_fields_line has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), match/switch 1 (3 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.
uu_cut::cut::cut_fields_implicit_out_delim (cognitive 25) src/uu/cut/src/cut.rs:579— uu_cut::cut::cut_fields_implicit_out_delim has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (23 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.
uu_head::head::uu_head (cognitive 54) src/uu/head/src/head.rs:443— uu_head::head::uu_head has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (39 pts), match/switch 3 (9 pts), boolean chains 5, loops 1 (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.
uu_head::take::copy_all_but_n_lines (cognitive 18) src/uu/head/src/take.rs:253— uu_head::take::copy_all_but_n_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_head::head::find_nth_line_from_end (cognitive 17) src/uu/head/src/head.rs:330— uu_head::head::find_nth_line_from_end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 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.
ChownExecutor::traverse (cognitive 39) src/uucore/src/lib/features/perms.rs:296— ChownExecutor::traverse has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 4 (10 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.
ChownExecutor::safe_traverse_dir (cognitive 37) src/uucore/src/lib/features/perms.rs:519— ChownExecutor::safe_traverse_dir has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 3 (6 pts), boolean chains 4, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChownExecutor::dive_into (cognitive 30) src/uucore/src/lib/features/perms.rs:652— ChownExecutor::dive_into has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_mv::mv::rename (cognitive 36) src/uu/mv/src/mv.rs:812— uu_mv::mv::rename has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_mv::mv::move_files_into_dir (cognitive 32) src/uu/mv/src/mv.rs:687— uu_mv::mv::move_files_into_dir has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_mv::mv::handle_two_paths (cognitive 31) src/uu/mv/src/mv.rs:390— uu_mv::mv::handle_two_paths has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 4, 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.
Stater::do_stat (cognitive 34) src/uu/stat/src/stat.rs:1336— Stater::do_stat has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (6 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Stater::handle_percent_case (cognitive 20) src/uu/stat/src/stat.rs:777— Stater::handle_percent_case has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, 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.
Stater::handle_escape_sequences (cognitive 16) src/uu/stat/src/stat.rs:887— Stater::handle_escape_sequences has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (2 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.
Parser::parse (cognitive 25) src/uucore/src/lib/features/parser/parse_size.rs:263— Parser::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Parser::parse_expression (cognitive 23) src/uu/expr/src/syntax_tree.rs:987— Parser::parse_expression has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 4 (10 pts), loops 1 (nesting depth added 14). 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.
Parser::validate (cognitive 18) src/uu/dd/src/parseargs.rs:174— Parser::validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 4 (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.
uu_chcon::chcon::parse_command_line (cognitive 21) src/uu/chcon/src/chcon.rs:313— uu_chcon::chcon::parse_command_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 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.
uu_chcon::chcon::uumain (cognitive 19) src/uu/chcon/src/chcon.rs:66— uu_chcon::chcon::uumain has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
uu_chcon::chcon::apply_context (cognitive 16) src/uu/chcon/src/chcon.rs:698— uu_chcon::chcon::apply_context has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Duplicated block (16 lines × 2) src/uu/ls/src/display.rs:952— src/uu/ls/src/display.rs:952-967 | src/uu/ls/src/display.rs:1382-1397 — both copies are in the same file, so extract the block into 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/uu/split/src/split.rs:170— src/uu/split/src/split.rs:170-185 | src/uu/uniq/src/uniq.rs:564-579 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) src/uu/timeout/src/timeout.rs:326— src/uu/timeout/src/timeout.rs:326-341 | src/uu/timeout/src/timeout.rs:370-385 — both copies are in the same file, so extract the block into 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/uu/cp/src/platform/linux.rs:471— src/uu/cp/src/platform/linux.rs:471-484 | src/uu/cp/src/platform/linux.rs:630-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 (14 lines × 2) src/uu/cp/src/platform/other.rs:25— src/uu/cp/src/platform/other.rs:25-38 | src/uu/cp/src/platform/other_unix.rs:31-44 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) util/compare_test_results.py:60— util/compare_test_results.py:60-73 | util/compare_test_results.py:90-103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `util/compare_test_results.py:60` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 3) src/uu/cp/src/cp.rs:2102— src/uu/cp/src/cp.rs:2102-2109 | src/uu/cp/src/cp.rs:2113-2120 | src/uu/cp/src/cp.rs:2124-2131 — 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/uu/cp/src/platform/macos.rs:142— src/uu/cp/src/platform/macos.rs:142-149 | src/uu/cp/src/platform/other_unix.rs:47-54 | src/uu/cp/src/platform/other_unix.rs:73-80 — 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 (8 lines × 3) src/uucore/src/lib/features/perms.rs:124— src/uucore/src/lib/features/perms.rs:124-131 | src/uucore/src/lib/features/perms.rs:154-161 | src/uucore/src/lib/features/perms.rs:450-457 — 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.
uu_pr::pr::build_options (cyclomatic 56) src/uu/pr/src/pr.rs:577— uu_pr::pr::build_options has cyclomatic complexity 56 (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.
uu_pr::pr::write_columns (cyclomatic 18) src/uu/pr/src/pr.rs:1444— uu_pr::pr::write_columns 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.
uu_date::format_modifiers::apply_modifiers (cyclomatic 45) src/uu/date/src/format_modifiers.rs:512— uu_date::format_modifiers::apply_modifiers has cyclomatic complexity 45 (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.
uu_date::date::uumain (cyclomatic 43) src/uu/date/src/date.rs:329— uu_date::date::uumain 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.
uu_expr::syntax_tree::transpile_bre_to_ere (cyclomatic 40) src/uu/expr/src/syntax_tree.rs:268— uu_expr::syntax_tree::transpile_bre_to_ere 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.
uu_expr::syntax_tree::verify_range_quantifier (cyclomatic 16) src/uu/expr/src/syntax_tree.rs:182— uu_expr::syntax_tree::verify_range_quantifier 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.
uu_head::head::uu_head (cyclomatic 23) src/uu/head/src/head.rs:443— uu_head::head::uu_head 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.
uu_head::parse::process_num_block (cyclomatic 17) src/uu/head/src/parse.rs:51— uu_head::parse::process_num_block 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.
ChownExecutor::safe_traverse_dir (cyclomatic 20) src/uucore/src/lib/features/perms.rs:519— ChownExecutor::safe_traverse_dir 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.
ChownExecutor::traverse (cyclomatic 18) src/uucore/src/lib/features/perms.rs:296— ChownExecutor::traverse 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.
uu_fold::fold::process_utf8_chars (cyclomatic 19) src/uu/fold/src/fold.rs:567— uu_fold::fold::process_utf8_chars 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.
uu_fold::fold::process_ascii_line (cyclomatic 18) src/uu/fold/src/fold.rs:449— uu_fold::fold::process_ascii_line 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.
uu_wc::wc::wc (cyclomatic 17) src/uu/wc/src/wc.rs:896— uu_wc::wc::wc 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: uu_wc::wc::word_count_from_reader (cyclomatic 20) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
uu_wc::count_fast::count_bytes_fast (cyclomatic 16) src/uu/wc/src/count_fast.rs:64— uu_wc::count_fast::count_bytes_fast 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.
uu_od::parse_formats::parse_format_flags (cyclomatic 16) src/uu/od/src/parse_formats.rs:108— uu_od::parse_formats::parse_format_flags 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: uu_od::parse_formats::od_format_type (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.
uu_od::parse_formats::parse_type_string (cyclomatic 16) src/uu/od/src/parse_formats.rs:256— uu_od::parse_formats::parse_type_string 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: uu_od::parse_formats::od_format_type (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.
uu_expr::syntax_tree::transpile_bre_to_ere (cognitive 85) src/uu/expr/src/syntax_tree.rs:268— uu_expr::syntax_tree::transpile_bre_to_ere has cognitive complexity 85 (threshold 15). Drivers by points: if/else 22 (66 pts), boolean chains 10, match/switch 2 (8 pts), loops 1 (nesting depth added 50). 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.
uu_expr::syntax_tree::find_match (cognitive 38) src/uu/expr/src/syntax_tree.rs:436— uu_expr::syntax_tree::find_match has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (37 pts), match/switch 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Observer::handle_event (cognitive 76) REDACTED:316— Observer::handle_event has cognitive complexity 76 (threshold 15). Drivers by points: if/else 28 (63 pts), boolean chains 12, match/switch 1 (nesting depth added 35). 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.
Observer::init_files (cognitive 25) REDACTED:264— Observer::init_files has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_id::id::uumain (cognitive 58) src/uu/id/src/id.rs:116— uu_id::id::uumain has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (47 pts), boolean chains 7, match/switch 1 (3 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_id::id::pretty (cognitive 20) src/uu/id/src/id.rs:466— uu_id::id::pretty has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 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.
uu_expand::expand::tabstops_parse (cognitive 39) src/uu/expand/src/expand.rs:70— uu_expand::expand::tabstops_parse has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 2 (7 pts), loops 2 (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.
uu_expand::expand::expand_buf (cognitive 22) src/uu/expand/src/expand.rs:368— uu_expand::expand::expand_buf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 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.
uu_ln::ln::link (cognitive 38) src/uu/ln/src/ln.rs:397— uu_ln::ln::link has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 5, 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.
uu_ln::ln::link_files_in_dir (cognitive 27) src/uu/ln/src/ln.rs:293— uu_ln::ln::link_files_in_dir has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (6 pts), boolean chains 1, 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.
uu_shred::shred::wipe_file (cognitive 36) src/uu/shred/src/shred.rs:621— uu_shred::shred::wipe_file has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 2 (4 pts), boolean chains 2, 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.
uu_shred::shred::wipe_name (cognitive 17) src/uu/shred/src/shred.rs:849— uu_shred::shred::wipe_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (3 pts), 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.
coreutils::bin::coreutils::main (cognitive 35) src/bin/coreutils.rs:53— coreutils::bin::coreutils::main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 6, loops 1 (3 pts), 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.
coreutils::bin::uudoc::main (cognitive 17) src/bin/uudoc.rs:228— coreutils::bin::uudoc::main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (5 pts), loops 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_base32::base_common::fast_decode::fast_decode_stream (cognitive 33) src/uu/base32/src/base_common.rs:811— uu_base32::base_common::fast_decode::fast_decode_stream has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_base32::base_common::fast_decode::fast_decode_buffer (cognitive 17) src/uu/base32/src/base_common.rs:712— uu_base32::base_common::fast_decode::fast_decode_buffer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_join::join::exec (cognitive 31) src/uu/join/src/join.rs:1044— uu_join::join::exec has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_join::join::parse_settings (cognitive 22) src/uu/join/src/join.rs:775— uu_join::join::parse_settings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 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.
uu_dircolors::dircolors::parse (cognitive 27) src/uu/dircolors/src/dircolors.rs:316— uu_dircolors::dircolors::parse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (2 pts), boolean chains 1, 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.
uu_dircolors::dircolors::uumain (cognitive 20) src/uu/dircolors/src/dircolors.rs:115— uu_dircolors::dircolors::uumain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_split::split::n_chunks_by_line (cognitive 25) src/uu/split/src/split.rs:1100— uu_split::split::n_chunks_by_line has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_split::split::n_chunks_by_byte (cognitive 24) src/uu/split/src/split.rs:967— uu_split::split::n_chunks_by_byte has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, loops 1, 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.
Uniq::write_uniq (cognitive 25) src/uu/uniq/src/uniq.rs:70— Uniq::write_uniq has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 10, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Uniq::skip_fields_offset (cognitive 18) src/uu/uniq/src/uniq.rs:187— Uniq::skip_fields_offset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_csplit::csplit::do_csplit (cognitive 23) src/uu/csplit/src/csplit.rs:167— uu_csplit::csplit::do_csplit has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 3 (7 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_csplit::patterns::extract_patterns (cognitive 22) src/uu/csplit/src/patterns.rs:107— uu_csplit::patterns::extract_patterns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_tac::tac::tac (cognitive 22) src/uu/tac/src/tac.rs:325— uu_tac::tac::tac has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 5 (8 pts), loops 1 (nesting depth added 11). 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.
uu_tac::tac::translate_regex_flavor (cognitive 21) src/uu/tac/src/tac.rs:238— uu_tac::tac::translate_regex_flavor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 6, match/switch 2 (5 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.
State::combine (cognitive 21) src/uu/join/src/join.rs:508— State::combine has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
State::next_line (cognitive 16) src/uu/join/src/join.rs:627— State::next_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FieldSelector::get_range (cognitive 19) src/uu/sort/src/sort.rs:1406— FieldSelector::get_range has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (3 pts) (nesting depth added 6). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (resolve_index). 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.
FieldSelector::parse (cognitive 16) src/uu/sort/src/sort.rs:1263— FieldSelector::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
uu_uniq::uniq::handle_extract_obs_skip_fields (cognitive 17) src/uu/uniq/src/uniq.rs:543— uu_uniq::uniq::handle_extract_obs_skip_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 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.
uu_uniq::uniq::filter_args (cognitive 16) src/uu/uniq/src/uniq.rs:413— uu_uniq::uniq::filter_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (18 lines × 2) src/uu/split/src/split.rs:1011— src/uu/split/src/split.rs:1011-1028 | src/uu/split/src/split.rs:1134-1154 — both copies are in the same file, so extract the block into 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) fuzz/fuzz_targets/fuzz_non_utf8_paths.rs:274— fuzz/fuzz_targets/fuzz_non_utf8_paths.rs:274-291 | fuzz/fuzz_targets/fuzz_non_utf8_paths.rs:294-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 (13–14 lines × 2) src/uu/mv/src/mv.rs:1051— src/uu/mv/src/mv.rs:1051-1063 | src/uu/mv/src/mv.rs:1386-1399 — both copies are in the same file, so extract the block into 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) src/uu/tr/src/operation.rs:954— src/uu/tr/src/operation.rs:954-967 | src/uu/tr/src/simd.rs:123-135 — 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–13 lines × 2) src/uu/date/src/date.rs:2120— src/uu/date/src/date.rs:2120-2131 | src/uu/date/src/date.rs:2156-2168 — both copies are in the same file, so extract the block into 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/uu/du/src/du.rs:386— src/uu/du/src/du.rs:386-397 | src/uu/du/src/du.rs:399-411 — both copies are in the same file, so extract the block into 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/uu/unexpand/src/unexpand.rs:67— src/uu/unexpand/src/unexpand.rs:67-79 | src/uu/unexpand/src/unexpand.rs:85-97 — both copies are in the same file, so extract the block into 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/uucore/src/lib/features/perms.rs:175— src/uucore/src/lib/features/perms.rs:175-187 | src/uucore/src/lib/features/perms.rs:860-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 (11–12 lines × 2) src/uu/sort/src/ext_sort/threaded.rs:141— src/uu/sort/src/ext_sort/threaded.rs:141-152 | src/uu/sort/src/ext_sort/wasi.rs:52-62 — 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–12 lines × 2) src/uucore/src/lib/features/selinux.rs:121— src/uucore/src/lib/features/selinux.rs:121-131 | src/uucore/src/lib/features/selinux.rs:253-264 — both copies are in the same file, so extract the block into 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 × 3) src/uu/cp/src/platform/linux.rs:311— src/uu/cp/src/platform/linux.rs:311-317 | src/uu/cp/src/platform/linux.rs:353-359 | src/uu/cp/src/platform/linux.rs:379-385 — 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/uu/split/src/strategy.rs:137— src/uu/split/src/strategy.rs:137-143 | src/uu/split/src/strategy.rs:155-161 | src/uu/split/src/strategy.rs:173-179 — 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.
Off the main sequence: uucore — uucore: abstractness 0.15, instability 0.01, distance 0.84 — zone of pain — concrete and depended on by 111 project(s), so it's rigid to change.
Off the main sequence: uu_base32 — uu_base32: 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.
uu_stty::stty::stty (cyclomatic 49) src/uu/stty/src/stty.rs:230— uu_stty::stty::stty 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.
Config::from_with_program_mode (cyclomatic 47) src/uu/ls/src/config.rs:655— Config::from_with_program_mode has cyclomatic complexity 47 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Observer::handle_event (cyclomatic 41) REDACTED:316— Observer::handle_event 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.
Options::from_matches (cyclomatic 39) src/uu/cp/src/cp.rs:1078— Options::from_matches has cyclomatic complexity 39 (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.
uu_id::id::uumain (cyclomatic 32) src/uu/id/src/id.rs:116— uu_id::id::uumain 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.
Sequence::solve_set_characters (cyclomatic 31) src/uu/tr/src/operation.rs:322— Sequence::solve_set_characters 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.
FormatOptions::from_str (cyclomatic 30) src/uu/numfmt/src/options.rs:222— FormatOptions::from_str 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.
uu_comm::comm::comm (cyclomatic 28) src/uu/comm/src/comm.rs:184— uu_comm::comm::comm 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.
uu_tail::follow::watch::follow (cyclomatic 28) REDACTED:543— uu_tail::follow::watch::follow 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.
uu_cut::cut::cut_fields_newline_char_delim (cyclomatic 26) src/uu/cut/src/cut.rs:644— uu_cut::cut::cut_fields_newline_char_delim 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.
uu_ln::ln::link (cyclomatic 25) src/uu/ln/src/ln.rs:397— uu_ln::ln::link 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.
EnvAppData::process_all_string_arguments (cyclomatic 23) src/uu/env/src/env.rs:581— EnvAppData::process_all_string_arguments has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
coreutils::bin::coreutils::main (cyclomatic 22) src/bin/coreutils.rs:53— coreutils::bin::coreutils::main has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ParagraphStream::next (cyclomatic 22) src/uu/fmt/src/parasplit.rs:420— ParagraphStream::next 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.
uu_fmt::linebreak::find_kp_breakpoints (cyclomatic 22) src/uu/fmt/src/linebreak.rs:206— uu_fmt::linebreak::find_kp_breakpoints 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.
uu_shred::shred::wipe_file (cyclomatic 22) src/uu/shred/src/shred.rs:621— uu_shred::shred::wipe_file 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.
NumInfo::parse (cyclomatic 22) src/uu/sort/src/numeric_str_cmp.rs:60— NumInfo::parse 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.
uu_dd::dd::dd_copy (cyclomatic 21) src/uu/dd/src/dd.rs:1127— uu_dd::dd::dd_copy 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.
uu_tac::tac::translate_regex_flavor (cyclomatic 21) src/uu/tac/src/tac.rs:238— uu_tac::tac::translate_regex_flavor has cyclomatic complexity 21 (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.
uu_tr::tr::uumain (cyclomatic 21) src/uu/tr/src/tr.rs:38— uu_tr::tr::uumain 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.
Chmoder::chmod (cyclomatic 20) src/uu/chmod/src/chmod.rs:460— Chmoder::chmod 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.
MultiWriter::copy_unbuffered (cyclomatic 19) src/uu/tee/src/tee.rs:146— MultiWriter::copy_unbuffered 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.
Uniq::write_uniq (cyclomatic 19) src/uu/uniq/src/uniq.rs:70— Uniq::write_uniq 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.
SplitWriter::do_to_match (cyclomatic 18) src/uu/csplit/src/csplit.rs:421— SplitWriter::do_to_match 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.
Header::get_headers (cyclomatic 18) src/uu/df/src/table.rs:416— Header::get_headers 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.
uu_expand::expand::tabstops_parse (cyclomatic 18) src/uu/expand/src/expand.rs:70— uu_expand::expand::tabstops_parse 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.
uu_join::join::exec (cyclomatic 18) src/uu/join/src/join.rs:1044— uu_join::join::exec 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.
uu_numfmt::numfmt::parse_options (cyclomatic 18) src/uu/numfmt/src/numfmt.rs:329— uu_numfmt::numfmt::parse_options 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.
uu_dirname::dirname::dirname_string_manipulation (cyclomatic 18) src/uu/dirname/src/dirname.rs:82— uu_dirname::dirname::dirname_string_manipulation 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.
CharCut::write_line (cyclomatic 17) src/uu/cut/src/cut.rs:360— CharCut::write_line 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.
RowFormatter::get_cells (cyclomatic 17) src/uu/df/src/table.rs:350— RowFormatter::get_cells 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.
uu_ptx::ptx::create_word_set (cyclomatic 17) src/uu/ptx/src/ptx.rs:332— uu_ptx::ptx::create_word_set 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.
Suffix::from (cyclomatic 17) src/uu/split/src/filenames.rs:135— Suffix::from 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.
Base58Wrapper::encode_to_vec_deque (cyclomatic 17) src/uucore/src/lib/features/encoding.rs:330— Base58Wrapper::encode_to_vec_deque has cyclomatic complexity 17 (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.
uu_nice::nice::uumain (cyclomatic 17) src/uu/nice/src/nice.rs:104— uu_nice::nice::uumain 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.
uu_base32::base_common::fast_decode::fast_decode_stream (cyclomatic 16) src/uu/base32/src/base_common.rs:811— uu_base32::base_common::fast_decode::fast_decode_stream 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.
uu_dircolors::dircolors::uumain (cyclomatic 16) src/uu/dircolors/src/dircolors.rs:115— uu_dircolors::dircolors::uumain 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.
uu_nl::nl::nl (cyclomatic 16) src/uu/nl/src/nl.rs:414— uu_nl::nl::nl 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.
OdOptions::new (cyclomatic 16) src/uu/od/src/od.rs:110— OdOptions::new 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.
Line::write_debug (cyclomatic 16) src/uu/sort/src/sort.rs:770— Line::write_debug 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.
uu_split::split::n_chunks_by_line (cyclomatic 16) src/uu/split/src/split.rs:1100— uu_split::split::n_chunks_by_line 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.
uu_stty::stty::stty (cognitive 117) src/uu/stty/src/stty.rs:230— uu_stty::stty::stty has cognitive complexity 117 (threshold 15). Drivers by points: if/else 25 (58 pts), match/switch 12 (52 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 75). To reduce it, split the body into named stages: move each independent 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::from_with_program_mode (cognitive 65) src/uu/ls/src/config.rs:655— Config::from_with_program_mode has cognitive complexity 65 (threshold 15). Drivers by points: if/else 42 (49 pts), boolean chains 13, loops 2 (3 pts) (nesting depth added 8). 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.
uu_fmt::linebreak::find_kp_breakpoints (cognitive 56) src/uu/fmt/src/linebreak.rs:206— uu_fmt::linebreak::find_kp_breakpoints has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 3 (5 pts), boolean chains 4, 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.
Sequence::solve_set_characters (cognitive 53) src/uu/tr/src/operation.rs:322— Sequence::solve_set_characters has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 8, loops 4 (7 pts), match/switch 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
FormatOptions::from_str (cognitive 51) src/uu/numfmt/src/options.rs:222— FormatOptions::from_str has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (32 pts), loops 8 (13 pts), match/switch 3 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SplitWriter::do_to_match (cognitive 50) src/uu/csplit/src/csplit.rs:421— SplitWriter::do_to_match has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 6 (16 pts), match/switch 1 (4 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.
NumInfo::parse (cognitive 50) src/uu/sort/src/numeric_str_cmp.rs:60— NumInfo::parse has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (44 pts), boolean chains 5, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Options::from_matches (cognitive 45) src/uu/cp/src/cp.rs:1078— Options::from_matches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 8, match/switch 4 (8 pts), loops 4 (7 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.
uu_comm::comm::comm (cognitive 44) src/uu/comm/src/comm.rs:184— uu_comm::comm::comm has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 9, match/switch 2 (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.
ParagraphStream::next (cognitive 42) src/uu/fmt/src/parasplit.rs:420— ParagraphStream::next has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 7, loops 1, match/switch 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.
EnvAppData::process_all_string_arguments (cognitive 38) src/uu/env/src/env.rs:581— EnvAppData::process_all_string_arguments has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (2 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.
uu_ptx::ptx::create_word_set (cognitive 38) src/uu/ptx/src/ptx.rs:332— uu_ptx::ptx::create_word_set has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MultiWriter::copy_unbuffered (cognitive 35) src/uu/tee/src/tee.rs:146— MultiWriter::copy_unbuffered has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 4 (7 pts), loops 3 (6 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.
uu_dd::dd::dd_copy (cognitive 32) src/uu/dd/src/dd.rs:1127— uu_dd::dd::dd_copy has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_paste::paste::paste (cognitive 31) src/uu/paste/src/paste.rs:89— uu_paste::paste::paste has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (11 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Line::write_debug (cognitive 31) src/uu/sort/src/sort.rs:770— Line::write_debug has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (5 pts), boolean chains 3, 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.
uu_tr::tr::uumain (cognitive 31) src/uu/tr/src/tr.rs:38— uu_tr::tr::uumain has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 6, 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.
uu_touch::touch::touch_file (cognitive 29) src/uu/touch/src/touch.rs:497— uu_touch::touch::touch_file has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (28 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.
BufReadDecoder::next_strict (cognitive 29) src/uu/wc/src/utf8/read.rs:50— BufReadDecoder::next_strict has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 5 (9 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.
CharCut::write_line (cognitive 28) src/uu/cut/src/cut.rs:360— CharCut::write_line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_tsort::parser::for_each_token (cognitive 28) src/uu/tsort/src/parser.rs:9— uu_tsort::parser::for_each_token has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (7 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.
uu_factor::factor::uumain (cognitive 27) src/uu/factor/src/factor.rs:150— uu_factor::factor::uumain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (8 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.
uu_nl::nl::nl (cognitive 27) src/uu/nl/src/nl.rs:414— uu_nl::nl::nl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (8 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_readlink::readlink::uumain (cognitive 27) src/uu/readlink/src/readlink.rs:34— uu_readlink::readlink::uumain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Base58Wrapper::encode_to_vec_deque (cognitive 26) src/uucore/src/lib/features/encoding.rs:330— Base58Wrapper::encode_to_vec_deque has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 6 (11 pts), boolean chains 2 (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.
uu_dirname::dirname::dirname_string_manipulation (cognitive 26) src/uu/dirname/src/dirname.rs:82— uu_dirname::dirname::dirname_string_manipulation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_chroot::chroot::parse_group_list (cognitive 25) src/uu/chroot/src/chroot.rs:78— uu_chroot::chroot::parse_group_list has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_hostname::hostname::display_hostname (cognitive 25) src/uu/hostname/src/hostname.rs:89— uu_hostname::hostname::display_hostname has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Suffix::from (cognitive 23) src/uu/split/src/filenames.rs:135— Suffix::from has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 1, 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.
MDWriter::options (cognitive 22) src/bin/uudoc.rs:575— MDWriter::options has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_cat::cat::print_lines (cognitive 22) src/uu/cat/src/cat.rs:536— uu_cat::cat::print_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_seq::seq::uumain (cognitive 22) src/uu/seq/src/seq.rs:99— uu_seq::seq::uumain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Base64SimdWrapper::decode_into_vec (cognitive 22) src/uucore/src/lib/features/encoding.rs:64— Base64SimdWrapper::decode_into_vec has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 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.
uu_df::blocks::to_magnitude_and_suffix (cognitive 20) src/uu/df/src/blocks.rs:57— uu_df::blocks::to_magnitude_and_suffix has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, 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.
analyze-gnu-results.aggregate_results (cognitive 20) util/analyze-gnu-results.py:49— analyze-gnu-results.aggregate_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), error handling 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.
AstNode::eval_located (cognitive 19) src/uu/expr/src/syntax_tree.rs:661— AstNode::eval_located has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OdOptions::new (cognitive 19) src/uu/od/src/od.rs:110— OdOptions::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
uu_nice::nice::standardize_nice_args (cognitive 19) src/uu/nice/src/nice.rs:56— uu_nice::nice::standardize_nice_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 1 (4 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.
uu_mkdir::mkdir::create_single_dir (cognitive 18) src/uu/mkdir/src/mkdir.rs:270— uu_mkdir::mkdir::create_single_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_mkfifo::mkfifo::uumain (cognitive 18) src/uu/mkfifo/src/mkfifo.rs:23— uu_mkfifo::mkfifo::uumain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FileMerger::write_next (cognitive 17) src/uu/sort/src/merge.rs:402— FileMerger::write_next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ByteChunkWriter::copy (cognitive 17) src/uu/split/src/split.rs:634— ByteChunkWriter::copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 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.
Utmpx::canon_host (cognitive 17) src/uucore/src/lib/features/utmpx.rs:287— Utmpx::canon_host has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts) (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.
Params::from (cognitive 16) src/uu/mktemp/src/mktemp.rs:223— Params::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, match/switch 2 (4 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.
WordFilter::new (cognitive 16) src/uu/ptx/src/ptx.rs:130— WordFilter::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
uu_rmdir::rmdir::uumain (cognitive 16) src/uu/rmdir/src/rmdir.rs:27— uu_rmdir::rmdir::uumain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 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.
uu_shuf::shuf::uumain (cognitive 16) src/uu/shuf/src/shuf.rs:71— uu_shuf::shuf::uumain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (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.
NumberType::from (cognitive 16) src/uu/split/src/strategy.rs:119— NumberType::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 6). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
Snapshot::index_of_value (cognitive 16) src/uucore/src/lib/features/diagnostics.rs:315— Snapshot::index_of_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uu_printf::printf::print_formatted (cognitive 16) src/uu/printf/src/printf.rs:69— uu_printf::printf::print_formatted has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), match/switch 3 (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.
compare_size_results.compare (cognitive 16) util/compare_size_results.py:80— compare_size_results.compare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ClassTooLong: Stater src/uu/stat/src/stat.rs:356— ClassTooLong — 507 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 13 methods, 2 blocks, lines 356-1488. The bar is 400 significant lines; this is 107 over it, 1.27× 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.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×1
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×1
Edited copy of a member (25 corresponding lines) src/uucore/src/lib/features/format/num_format.rs:100— src/uucore/src/lib/features/format/num_format.rs:100-130 | src/uucore/src/lib/features/format/num_format.rs:177-227 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) src/uucore/src/lib/features/systemd_logind.rs:118— src/uucore/src/lib/features/systemd_logind.rs:118-140 | src/uucore/src/lib/features/systemd_logind.rs:145-169 | src/uucore/src/lib/features/systemd_logind.rs:174-198 | src/uucore/src/lib/features/systemd_logind.rs:203-226 | src/uucore/src/lib/features/systemd_logind.rs:231-254 — 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 (35 lines × 2) src/uu/base32/src/base_common.rs:775— src/uu/base32/src/base_common.rs:775-809 | src/uu/base32/src/base_common.rs:896-930 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (27 lines × 2) src/uu/dd/src/dd.rs:449— src/uu/dd/src/dd.rs:449-475 | src/uu/dd/src/dd.rs:1413-1439 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (25 lines × 2) src/uu/base32/src/base_common.rs:749— src/uu/base32/src/base_common.rs:749-773 | src/uu/base32/src/base_common.rs:867-891 — both copies are in the same file, so extract the block into 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–24 lines × 2) src/uu/base32/src/base_common.rs:428— src/uu/base32/src/base_common.rs:428-451 | src/uu/base32/src/base_common.rs:538-555 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–22 lines × 2) src/uu/false/src/false.rs:13— src/uu/false/src/false.rs:13-30 | src/uu/true/src/true.rs:13-34 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (22 lines × 2) src/uu/stdbuf/src/libstdbuf/src/libstdbuf.rs:103— src/uu/stdbuf/src/libstdbuf/src/libstdbuf.rs:103-124 | src/uu/stdbuf/src/libstdbuf/src/libstdbuf.rs:166-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 (18–21 lines × 2) src/uu/chmod/src/chmod.rs:566— src/uu/chmod/src/chmod.rs:566-583 | src/uu/chmod/src/chmod.rs:633-653 — both copies are in the same file, so extract the block into 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/uucore/src/lib/features/safe_traversal.rs:662— src/uucore/src/lib/features/safe_traversal.rs:662-682 | src/uucore/src/lib/features/safe_traversal.rs:685-705 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 3) src/uu/stdbuf/src/libstdbuf/src/libstdbuf.rs:45— src/uu/stdbuf/src/libstdbuf/src/libstdbuf.rs:45-63 | src/uu/stdbuf/src/libstdbuf/src/libstdbuf.rs:108-126 | src/uu/stdbuf/src/libstdbuf/src/libstdbuf.rs:171-189 — 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 (17–18 lines × 2) src/uu/cp/src/platform/linux.rs:498— src/uu/cp/src/platform/linux.rs:498-514 | src/uu/cp/src/platform/linux.rs:519-536 — both copies are in the same file, so extract the block into 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–17 lines × 2) src/uu/od/src/parse_formats.rs:290— src/uu/od/src/parse_formats.rs:290-306 | src/uu/od/src/parse_formats.rs:310-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 (17 lines × 2) src/uu/split/src/platform/unix.rs:171— src/uu/split/src/platform/unix.rs:171-187 | src/uu/split/src/platform/windows.rs:50-66 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (16 lines × 3) src/uucore/src/lib/features/format/num_format.rs:107— src/uucore/src/lib/features/format/num_format.rs:107-122 | src/uucore/src/lib/features/format/num_format.rs:204-219 | src/uucore/src/lib/features/format/num_format.rs:340-355 — 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 (15 lines × 2) src/uu/mv/src/mv.rs:434— src/uu/mv/src/mv.rs:434-448 | src/uu/mv/src/mv.rs:488-502 — both copies are in the same file, so extract the block into 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–14 lines × 5) src/uucore/src/lib/features/systemd_logind.rs:127— src/uucore/src/lib/features/systemd_logind.rs:127-140 | src/uucore/src/lib/features/systemd_logind.rs:159-169 | src/uucore/src/lib/features/systemd_logind.rs:188-198 | src/uucore/src/lib/features/systemd_logind.rs:213-226 | src/uucore/src/lib/features/systemd_logind.rs:241-254 — 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–11 lines × 2) src/uu/split/src/platform/unix.rs:139— src/uu/split/src/platform/unix.rs:139-149 | src/uu/split/src/platform/windows.rs:25-33 — 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/uu/split/src/split.rs:104— src/uu/split/src/split.rs:104-114 | src/uu/uniq/src/uniq.rs:421-431 — 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–9 lines × 2) src/uu/date/src/date.rs:484— src/uu/date/src/date.rs:484-491 | src/uu/date/src/date.rs:535-543 — both copies are in the same file, so extract the block into 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 × 4) src/uu/cp/src/platform/linux.rs:310— src/uu/cp/src/platform/linux.rs:310-316 | src/uu/cp/src/platform/linux.rs:333-340 | src/uu/cp/src/platform/linux.rs:351-358 | src/uu/cp/src/platform/linux.rs:402-408 — 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 (6 lines × 3) src/uucore/src/lib/features/perms.rs:135— src/uucore/src/lib/features/perms.rs:135-140 | src/uucore/src/lib/features/perms.rs:165-170 | src/uucore/src/lib/features/perms.rs:461-466 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 4) src/uucore/src/lib/features/perms.rs:135— src/uucore/src/lib/features/perms.rs:135-139 | src/uucore/src/lib/features/perms.rs:165-169 | src/uucore/src/lib/features/perms.rs:461-465 | src/uucore/src/lib/features/perms.rs:847-852 — 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 (3–5 lines × 3) src/uu/dir/src/dir.rs:23— src/uu/dir/src/dir.rs:23-28 | src/uu/ls/src/ls.rs:130-132 | src/uu/vdir/src/vdir.rs:23-27 — 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 (12 lines × 2) src/bin/uudoc.rs:592— src/bin/uudoc.rs:592-603 | src/bin/uudoc.rs:613-624 — both copies are in the same file, so extract the block into 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) fuzz/fuzz_targets/fuzz_cut.rs:21— fuzz/fuzz_targets/fuzz_cut.rs:21-29 | fuzz/fuzz_targets/fuzz_wc.rs:21-30 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
Orphaned file src/uu/ls/src/output.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uu/csplit/src/split_name.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uucore/src/lib/features/fast_inc.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uu/od/src/prn_char.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uu/dd/src/numbers.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uu/shuf/src/compat_random_source.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uucore/src/lib/features/update_control.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uucore/src/lib/features/ringbuffer.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uucore/src/lib/features/parser/parse_glob.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uucore/src/lib/features/tty.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/uu/wc/src/utf8/mod.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Duplicated predicate src/uu/dd/src/numbers.rs:27— `bases[i + 1] - bases[i] < n && i < suffixes.len()` appears character-identically in 2 files — src/uu/dd/src/numbers.rs, src/uu/df/src/blocks.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/uu/cp/src/cp.rs:2700— `ft.is_char_device() || ft.is_block_device()` appears character-identically in 2 files — src/uu/cp/src/cp.rs, src/uu/ls/src/display.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/uu/rm/src/platform/unix.rs:49— `options.__presume_input_tty.unwrap_or(false) || stdin().is_terminal()` appears character-identically in 2 files — src/uu/rm/src/platform/unix.rs, src/uu/rm/src/rm.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/uu/mkdir/src/mkdir.rs:112— `set_security_context || context.is_some()` appears character-identically in 3 files — src/uu/mkdir/src/mkdir.rs, src/uu/mkfifo/src/mkfifo.rs, src/uu/mknod/src/mknod.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/uu/cp/src/copydir.rs:257— `source_is_symlink && !options.dereference` appears character-identically in 2 files — src/uu/cp/src/copydir.rs, src/uu/cp/src/cp.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/uucore/src/lib/lib.rs:334— `std::env::var("CLICOLOR_FORCE").is_ok() || std::env::var("FORCE_COLOR").is_ok()` appears character-identically in 2 files — src/uucore/src/lib/lib.rs, src/uucore/src/lib/mods/clap_localization.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.
Silent fallback default on Err src/uu/chroot/src/chroot.rs:302— `supplemental_gids` 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/uu/od/src/peek_reader.rs:65— `read_from_tempbuffer` 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/uu/rm/src/rm.rs:540— `count_files_in_directory` 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/uu/test/src/test.rs:362— `isatty` turns every `Err` into `Ok(false)` — 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/uucore/src/lib/features/format/argument.rs:81— `next_char` turns every `Err` into `b'\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/uucore/src/lib/features/fsext/mod.rs:333— `mount_dev_id` 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.
Subsumed condition operand tests/by-util/test_date.rs:2140— `en_us_output.contains("01:00")` can never decide this `||` — every value satisfying `en_us_output.contains("01:00")` also satisfies `en_us_output.contains("1:00")`, 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 src/uu/date/src/locale.rs:265— `expanded.contains("Monday")` can never decide this `||` — every value satisfying `expanded.contains("Monday")` also satisfies `expanded.contains("Mon")`, 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 src/uu/date/src/locale.rs:270— `expanded.contains("January")` can never decide this `||` — every value satisfying `expanded.contains("January")` also satisfies `expanded.contains("Jan")`, 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 src/uu/date/src/locale.rs:275— `expanded.contains("2024")` can never decide this `||` — every value satisfying `expanded.contains("2024")` also satisfies `expanded.contains("24")`, 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, 14 significant file(s) lose their only recent owner: src/uucore/src/lib/features/parser/parse_block_size.rs, src/uu/csplit/src/diagnostics.rs, util/compare_size_results.py, src/uucore/src/lib/features/diagnostics_boundary.rs, src/uucore/src/lib/features/safe_copy.rs, src/uu/numfmt/src/diagnostics.rs, util/analyze-gnu-results.py, src/uucore/src/lib/features/diagnostics_stub.rs (+6 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: src/uucore/src/lib/features/process/windows.rs, src/uucore/src/lib/features/fsext/windows.rs, src/uu/df/src/platform/unix.rs, src/uu/df/src/platform/windows.rs. 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 (22 single-owned of 293 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; 293 of the 495 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (2 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: src/uu/od/src/peek_reader.rs, src/uucore/src/lib/features/lines.rs, src/uu/split/src/cli.rs, src/uu/head/src/cli.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 — 1 of 112 project(s) overshoot their size bounds, lowering Project Cohesion to 9.8/10. The most over is `src/uucore` (35800 LoC, 261 module-visible types across 11 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.
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 11 of 293 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 293 of the 495 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: src/uu/ls/src/output.rs, src/uu/csplit/src/split_name.rs, src/uucore/src/lib/features/fast_inc.rs, src/uu/od/src/prn_char.rs, src/uu/dd/src/numbers.rs, src/uu/shuf/src/compat_random_source.rs, src/uucore/src/lib/features/update_control.rs, src/uucore/src/lib/features/ringbuffer.rs (and 3 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D9 · Test Distribution· Inverted test pyramid · ×1
Inverted test pyramid — Only 18 % of tests are unit tests (1246 unit vs 5710 integration, 0 BDD); a broader unit base gives faster, more localised feedback.
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.
Outdated: crc-fast — `crc-fast` is locked at 1.9.0 but 1.10.0 is the current stable release on crates.io, and it already satisfies the `"1.5.0"` requirement declared in src/uucore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crc-fast` and commit the updated REDACTED.
Outdated: icu_calendar — `icu_calendar` is locked at 2.3.0 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.0.0"` requirement declared in src/uucore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_calendar` and commit the updated REDACTED.
Outdated: icu_collator — `icu_collator` is locked at 2.3.1 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.0.0"` requirement declared in src/uucore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_collator` and commit the updated REDACTED.
Outdated: icu_datetime — `icu_datetime` is locked at 2.3.0 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.0.0"` requirement declared in src/uucore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_datetime` and commit the updated REDACTED.
Outdated: icu_decimal — `icu_decimal` is locked at 2.3.0 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.0.0"` requirement declared in src/uucore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_decimal` and commit the updated REDACTED.
Outdated: icu_locale — `icu_locale` is locked at 2.3.1 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.0.0"` requirement declared in src/uucore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_locale` and commit the updated REDACTED.
Outdated: memmap2 — `memmap2` is locked at 0.9.11 but 0.9.12 is the current stable release on crates.io, and it already satisfies the `"0.9.4"` requirement declared in src/uu/tac/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p memmap2` 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.0.0"` 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.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
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 01a17673-d539-7125-a596-2413b98b5293 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 248 · Warnings: 798 · Recommendations: 42 · Info: 8 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 26-10-2026 @ 04:24 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.