Public report of deavid/unhaunter, published 16 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 16 November 2026, 12:35 UTC · Survey ID cd_a6ac2beab0af47f7a71be9c3bce44813
deavid/unhaunter
Measured 16 November 2026, 12:35 UTC, at code version d0cd638
First survey, so nothing to compare with yet
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 43,948 lines of product code in 28 projects, tests not counted · Estimated rebuild effort: about 0.3 person-years · Weakest lens: Maturity, 42.4
Findings by how serious they are
9 critical622 serious201 minor
12 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
16 November 2026, 12:35 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
51of 51 dimensions measured by tools.
798of 832 findings point to an exact file and line, so you can open each one in the code. The other 34 concern the repository as a whole, such as missing documentation.
51dimensions across 8 lenses, read from 43,948 lines of product code in 28 projects.
deavid/unhaunter falls short of our standard for a preview release because 165 files are no longer known to anyone active in the project and the project keeps no record of its design decisions. It scores 56.9 out of 100 and is rated Adequate, and eight of its nine critical findings are security problems in the build pipeline.
Maturity, at 42.4, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 11.3 points. Making the naming consistent comes next, worth about 10.3 points. Raising Maturity to 62 would lift the score to about 65.8.
Six pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Two pipeline steps install packages that can change without warning, and one set of files in separate parts keeps changing together, which points to a hidden dependency. Pinning each tool to an exact version, pinning what the pipeline installs and making the hidden dependencies explicit would close these risks.
The product code is 43,948 lines, about €45,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Maturity rose from 42.4 to 62, the lowest score rated Strong, the score would rise from 56.9 to about 65.8.
Code composition: what the lines of code are
Product code 100%Tests 0%
Rebuild cost: about €45,000 · Estimate
Cost to rebuild
€15,000 to €75,000, for 250 to 792 hours of work, about 0.3 person-years for one engineer
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 57. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 43,948 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml.
Raises the score by about 11.3 points · Low effort · ADR Quality
2
Resolve the 1 `HintUiState` spells `Ui` where 13 names in the project spell it `UI` finding(s) in Naming Consistency — start with hint_ui_state.rs.
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 €45,000 to build again, about 0.3 person-years of work. Its weakest lens is Maturity, at 42.4 (Weak). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 11.3 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.6 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 6% to 14% on every change. The history of the code shows how much it changes: about 96,562 lines over the last 90 days, which is about 391,613 lines a year. At that pace, the extra work comes to an estimated 59.5 to 357.2 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
334 modules, with 326 dependencies between them. 7 loops run through 15 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 294 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.
uncore.components.board.position uses uncore.components.board.direction, so a change to uncore.components.board.direction can break uncore.components.board.position, while a change to uncore.components.board.position can't break uncore.components.board.direction.
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.
8→11 uncore.components.board.position uses uncore.components.board.boardpositionpart of a loop✕
Connections
1 pair of types, where a type in uncore.components.board.position uses a type in uncore.components.board.boardposition.
uncore.components.board.position uses uncore.components.board.boardposition, so a change to uncore.components.board.boardposition can break uncore.components.board.position, while a change to uncore.components.board.position can't break uncore.components.board.boardposition.
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.
uncore.components.board.direction uses uncore.components.board.position, so a change to uncore.components.board.position can break uncore.components.board.direction, while a change to uncore.components.board.direction can't break uncore.components.board.position.
Position
Below the diagonal: uncore.components.board.direction uses a module listed above it, which is the healthy direction.
ungear.gear_stuff uses uncore.components.board.position, so a change to uncore.components.board.position can break ungear.gear_stuff, while a change to ungear.gear_stuff can't break uncore.components.board.position.
Position
Below the diagonal: ungear.gear_stuff uses a module listed above it, which is the healthy direction.
uncore.components.board.boardposition uses uncore.components.board.position, so a change to uncore.components.board.position can break uncore.components.board.boardposition, while a change to uncore.components.board.boardposition can't break uncore.components.board.position.
Position
Below the diagonal: uncore.components.board.boardposition uses a module listed above it, which is the healthy direction.
uncore.components.board.boardposition uses uncore.components.board.direction, so a change to uncore.components.board.direction can break uncore.components.board.boardposition, while a change to uncore.components.board.boardposition can't break uncore.components.board.direction.
Position
Below the diagonal: uncore.components.board.boardposition uses a module listed above it, which is the healthy direction.
uncore.behavior.component uses uncore.types.tiledmap.map, so a change to uncore.types.tiledmap.map can break uncore.behavior.component, while a change to uncore.behavior.component can't break uncore.types.tiledmap.map.
Position
Below the diagonal: uncore.behavior.component uses a module listed above it, which is the healthy direction.
uncore.behavior.component uses uncore.components.board.boardposition, so a change to uncore.components.board.boardposition can break uncore.behavior.component, while a change to uncore.behavior.component can't break uncore.components.board.boardposition.
Position
Below the diagonal: uncore.behavior.component uses a module listed above it, which is the healthy direction.
12→14 uncore.behavior.component uses uncore.behaviorpart of a loop✕
Connections
2 pairs of types, where a type in uncore.behavior.component uses a type in uncore.behavior.
uncore.behavior.component uses uncore.behavior, so a change to uncore.behavior can break uncore.behavior.component, while a change to uncore.behavior.component can't break uncore.behavior.
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.
uncore.resources.board_data uses uncore.components.board.position, so a change to uncore.components.board.position can break uncore.resources.board_data, while a change to uncore.resources.board_data can't break uncore.components.board.position.
Position
Below the diagonal: uncore.resources.board_data uses a module listed above it, which is the healthy direction.
uncore.resources.board_data uses uncore.components.board.boardposition, so a change to uncore.components.board.boardposition can break uncore.resources.board_data, while a change to uncore.resources.board_data can't break uncore.components.board.boardposition.
Position
Below the diagonal: uncore.resources.board_data uses a module listed above it, which is the healthy direction.
uncore.behavior uses uncore.types.tiledmap.map, so a change to uncore.types.tiledmap.map can break uncore.behavior, while a change to uncore.behavior can't break uncore.types.tiledmap.map.
Position
Below the diagonal: uncore.behavior uses a module listed above it, which is the healthy direction.
uncore.behavior uses uncore.behavior.component, so a change to uncore.behavior.component can break uncore.behavior, while a change to uncore.behavior can't break uncore.behavior.component.
Position
Below the diagonal: uncore.behavior uses a module listed above it, which is the healthy direction.
uncore.types.evidence uses uncore.behavior, so a change to uncore.behavior can break uncore.types.evidence, while a change to uncore.types.evidence can't break uncore.behavior.
Position
Below the diagonal: uncore.types.evidence uses a module listed above it, which is the healthy direction.
15→21 uncore.types.evidence uses uncore.types.gear_kindpart of a loop✕
Connections
1 pair of types, where a type in uncore.types.evidence uses a type in uncore.types.gear_kind.
uncore.types.evidence uses uncore.types.gear_kind, so a change to uncore.types.gear_kind can break uncore.types.evidence, while a change to uncore.types.evidence can't break uncore.types.gear_kind.
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.
uncore.types.ghost.types uses uncore.behavior, so a change to uncore.behavior can break uncore.types.ghost.types, while a change to uncore.types.ghost.types can't break uncore.behavior.
Position
Below the diagonal: uncore.types.ghost.types uses a module listed above it, which is the healthy direction.
unplayer.systems.pathfinding uses uncore.components.board.position, so a change to uncore.components.board.position can break unplayer.systems.pathfinding, while a change to unplayer.systems.pathfinding can't break uncore.components.board.position.
Position
Below the diagonal: unplayer.systems.pathfinding uses a module listed above it, which is the healthy direction.
unplayer.systems.pathfinding uses uncore.components.board.boardposition, so a change to uncore.components.board.boardposition can break unplayer.systems.pathfinding, while a change to unplayer.systems.pathfinding can't break uncore.components.board.boardposition.
Position
Below the diagonal: unplayer.systems.pathfinding uses a module listed above it, which is the healthy direction.
unplayer.systems.pathfinding uses uncore.behavior.component, so a change to uncore.behavior.component can break unplayer.systems.pathfinding, while a change to unplayer.systems.pathfinding can't break uncore.behavior.component.
Position
Below the diagonal: unplayer.systems.pathfinding uses a module listed above it, which is the healthy direction.
unplayer.systems.pathfinding uses uncore.resources.board_data, so a change to uncore.resources.board_data can break unplayer.systems.pathfinding, while a change to unplayer.systems.pathfinding can't break uncore.resources.board_data.
Position
Below the diagonal: unplayer.systems.pathfinding uses a module listed above it, which is the healthy direction.
unplayer.systems.pathfinding uses uncore.behavior, so a change to uncore.behavior can break unplayer.systems.pathfinding, while a change to unplayer.systems.pathfinding can't break uncore.behavior.
Position
Below the diagonal: unplayer.systems.pathfinding uses a module listed above it, which is the healthy direction.
unstd.systemparam.interactivestuff uses uncore.components.board.position, so a change to uncore.components.board.position can break unstd.systemparam.interactivestuff, while a change to unstd.systemparam.interactivestuff can't break uncore.components.board.position.
Position
Below the diagonal: unstd.systemparam.interactivestuff uses a module listed above it, which is the healthy direction.
unstd.systemparam.interactivestuff uses uncore.behavior.component, so a change to uncore.behavior.component can break unstd.systemparam.interactivestuff, while a change to unstd.systemparam.interactivestuff can't break uncore.behavior.component.
Position
Below the diagonal: unstd.systemparam.interactivestuff uses a module listed above it, which is the healthy direction.
unstd.systemparam.interactivestuff uses uncore.behavior, so a change to uncore.behavior can break unstd.systemparam.interactivestuff, while a change to unstd.systemparam.interactivestuff can't break uncore.behavior.
Position
Below the diagonal: unstd.systemparam.interactivestuff uses a module listed above it, which is the healthy direction.
uncore.components.ghost_sprite uses uncore.components.board.position, so a change to uncore.components.board.position can break uncore.components.ghost_sprite, while a change to uncore.components.ghost_sprite can't break uncore.components.board.position.
Position
Below the diagonal: uncore.components.ghost_sprite uses a module listed above it, which is the healthy direction.
uncore.components.ghost_sprite uses uncore.components.board.boardposition, so a change to uncore.components.board.boardposition can break uncore.components.ghost_sprite, while a change to uncore.components.ghost_sprite can't break uncore.components.board.boardposition.
Position
Below the diagonal: uncore.components.ghost_sprite uses a module listed above it, which is the healthy direction.
uncore.components.ghost_sprite uses uncore.types.ghost.types, so a change to uncore.types.ghost.types can break uncore.components.ghost_sprite, while a change to uncore.components.ghost_sprite can't break uncore.types.ghost.types.
Position
Below the diagonal: uncore.components.ghost_sprite uses a module listed above it, which is the healthy direction.
uncore.components.truck_ui_button uses uncore.types.evidence, so a change to uncore.types.evidence can break uncore.components.truck_ui_button, while a change to uncore.components.truck_ui_button can't break uncore.types.evidence.
Position
Below the diagonal: uncore.components.truck_ui_button uses a module listed above it, which is the healthy direction.
uncore.types.gear_kind uses uncore.types.evidence, so a change to uncore.types.evidence can break uncore.types.gear_kind, while a change to uncore.types.gear_kind can't break uncore.types.evidence.
Position
Below the diagonal: uncore.types.gear_kind uses a module listed above it, which is the healthy direction.
unplayer.systems.waypoint uses uncore.components.board.position, so a change to uncore.components.board.position can break unplayer.systems.waypoint, while a change to unplayer.systems.waypoint can't break uncore.components.board.position.
Position
Below the diagonal: unplayer.systems.waypoint uses a module listed above it, which is the healthy direction.
unplayer.systems.waypoint uses uncore.resources.board_data, so a change to uncore.resources.board_data can break unplayer.systems.waypoint, while a change to unplayer.systems.waypoint can't break uncore.resources.board_data.
Position
Below the diagonal: unplayer.systems.waypoint uses a module listed above it, which is the healthy direction.
unplayer.systems.waypoint uses unstd.systemparam.interactivestuff, so a change to unstd.systemparam.interactivestuff can break unplayer.systems.waypoint, while a change to unplayer.systems.waypoint can't break unstd.systemparam.interactivestuff.
Position
Below the diagonal: unplayer.systems.waypoint uses a module listed above it, which is the healthy direction.
uncore.difficulty uses uncore.types.manual, so a change to uncore.types.manual can break uncore.difficulty, while a change to uncore.difficulty can't break uncore.types.manual.
Position
Below the diagonal: uncore.difficulty uses a module listed above it, which is the healthy direction.
uncore.difficulty uses uncore.types.gear_kind, so a change to uncore.types.gear_kind can break uncore.difficulty, while a change to uncore.difficulty can't break uncore.types.gear_kind.
Position
Below the diagonal: uncore.difficulty uses a module listed above it, which is the healthy direction.
ungear.gear_usable uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungear.gear_usable, while a change to ungear.gear_usable can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungear.gear_usable uses a module listed above it, which is the healthy direction.
ungear.gear_usable uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungear.gear_usable, while a change to ungear.gear_usable can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungear.gear_usable uses a module listed above it, which is the healthy direction.
ungear.gear_usable uses uncore.components.board.position, so a change to uncore.components.board.position can break ungear.gear_usable, while a change to ungear.gear_usable can't break uncore.components.board.position.
Position
Below the diagonal: ungear.gear_usable uses a module listed above it, which is the healthy direction.
ungear.gear_usable uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungear.gear_usable, while a change to ungear.gear_usable can't break ungear.gear_stuff.
Position
Below the diagonal: ungear.gear_usable uses a module listed above it, which is the healthy direction.
ungear.gear_usable uses uncore.types.ghost.types, so a change to uncore.types.ghost.types can break ungear.gear_usable, while a change to ungear.gear_usable can't break uncore.types.ghost.types.
Position
Below the diagonal: ungear.gear_usable uses a module listed above it, which is the healthy direction.
ungear.gear_usable uses uncore.components.ghost_sprite, so a change to uncore.components.ghost_sprite can break ungear.gear_usable, while a change to ungear.gear_usable can't break uncore.components.ghost_sprite.
Position
Below the diagonal: ungear.gear_usable uses a module listed above it, which is the healthy direction.
uncampaign.unified_mission_selection uses uncore.types.root.game_assets, so a change to uncore.types.root.game_assets can break uncampaign.unified_mission_selection, while a change to uncampaign.unified_mission_selection can't break uncore.types.root.game_assets.
Position
Below the diagonal: uncampaign.unified_mission_selection uses a module listed above it, which is the healthy direction.
uncampaign.unified_mission_selection uses uncore.types.root.map, so a change to uncore.types.root.map can break uncampaign.unified_mission_selection, while a change to uncampaign.unified_mission_selection can't break uncore.types.root.map.
Position
Below the diagonal: uncampaign.unified_mission_selection uses a module listed above it, which is the healthy direction.
uncampaign.unified_mission_selection uses uncore.difficulty, so a change to uncore.difficulty can break uncampaign.unified_mission_selection, while a change to uncampaign.unified_mission_selection can't break uncore.difficulty.
Position
Below the diagonal: uncampaign.unified_mission_selection uses a module listed above it, which is the healthy direction.
ungear.types.gear uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungear.types.gear, while a change to ungear.types.gear can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungear.types.gear uses a module listed above it, which is the healthy direction.
ungear.types.gear uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungear.types.gear, while a change to ungear.types.gear can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungear.types.gear uses a module listed above it, which is the healthy direction.
ungear.types.gear uses uncore.components.board.position, so a change to uncore.components.board.position can break ungear.types.gear, while a change to ungear.types.gear can't break uncore.components.board.position.
Position
Below the diagonal: ungear.types.gear uses a module listed above it, which is the healthy direction.
ungear.types.gear uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungear.types.gear, while a change to ungear.types.gear can't break ungear.gear_stuff.
Position
Below the diagonal: ungear.types.gear uses a module listed above it, which is the healthy direction.
ungear.types.gear uses uncore.types.ghost.types, so a change to uncore.types.ghost.types can break ungear.types.gear, while a change to ungear.types.gear can't break uncore.types.ghost.types.
Position
Below the diagonal: ungear.types.gear uses a module listed above it, which is the healthy direction.
ungear.types.gear uses uncore.types.gear_kind, so a change to uncore.types.gear_kind can break ungear.types.gear, while a change to ungear.types.gear can't break uncore.types.gear_kind.
Position
Below the diagonal: ungear.types.gear uses a module listed above it, which is the healthy direction.
ungear.types.gear uses ungear.gear_usable, so a change to ungear.gear_usable can break ungear.types.gear, while a change to ungear.types.gear can't break ungear.gear_usable.
Position
Below the diagonal: ungear.types.gear uses a module listed above it, which is the healthy direction.
ungearitems.components.emfmeter uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.emfmeter, while a change to ungearitems.components.emfmeter can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.emfmeter uses a module listed above it, which is the healthy direction.
ungearitems.components.emfmeter uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.emfmeter, while a change to ungearitems.components.emfmeter can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.emfmeter uses a module listed above it, which is the healthy direction.
ungearitems.components.emfmeter uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.emfmeter, while a change to ungearitems.components.emfmeter can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.emfmeter uses a module listed above it, which is the healthy direction.
ungearitems.components.emfmeter uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.emfmeter, while a change to ungearitems.components.emfmeter can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.emfmeter uses a module listed above it, which is the healthy direction.
ungearitems.components.emfmeter uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.emfmeter, while a change to ungearitems.components.emfmeter can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.emfmeter uses a module listed above it, which is the healthy direction.
ungearitems.components.flashlight uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.flashlight, while a change to ungearitems.components.flashlight can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.flashlight uses a module listed above it, which is the healthy direction.
ungearitems.components.flashlight uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.flashlight, while a change to ungearitems.components.flashlight can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.flashlight uses a module listed above it, which is the healthy direction.
ungearitems.components.flashlight uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.flashlight, while a change to ungearitems.components.flashlight can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.flashlight uses a module listed above it, which is the healthy direction.
ungearitems.components.flashlight uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.flashlight, while a change to ungearitems.components.flashlight can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.flashlight uses a module listed above it, which is the healthy direction.
ungearitems.components.flashlight uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.flashlight, while a change to ungearitems.components.flashlight can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.flashlight uses a module listed above it, which is the healthy direction.
ungearitems.components.geigercounter uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.geigercounter, while a change to ungearitems.components.geigercounter can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.geigercounter uses a module listed above it, which is the healthy direction.
ungearitems.components.geigercounter uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.geigercounter, while a change to ungearitems.components.geigercounter can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.geigercounter uses a module listed above it, which is the healthy direction.
ungearitems.components.geigercounter uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.geigercounter, while a change to ungearitems.components.geigercounter can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.geigercounter uses a module listed above it, which is the healthy direction.
ungearitems.components.geigercounter uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.geigercounter, while a change to ungearitems.components.geigercounter can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.geigercounter uses a module listed above it, which is the healthy direction.
ungearitems.components.geigercounter uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.geigercounter, while a change to ungearitems.components.geigercounter can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.geigercounter uses a module listed above it, which is the healthy direction.
ungearitems.components.quartz uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.quartz, while a change to ungearitems.components.quartz can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.quartz uses a module listed above it, which is the healthy direction.
ungearitems.components.quartz uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.quartz, while a change to ungearitems.components.quartz can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.quartz uses a module listed above it, which is the healthy direction.
ungearitems.components.quartz uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.quartz, while a change to ungearitems.components.quartz can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.quartz uses a module listed above it, which is the healthy direction.
ungearitems.components.quartz uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.quartz, while a change to ungearitems.components.quartz can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.quartz uses a module listed above it, which is the healthy direction.
ungearitems.components.quartz uses uncore.components.ghost_sprite, so a change to uncore.components.ghost_sprite can break ungearitems.components.quartz, while a change to ungearitems.components.quartz can't break uncore.components.ghost_sprite.
Position
Below the diagonal: ungearitems.components.quartz uses a module listed above it, which is the healthy direction.
ungearitems.components.quartz uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.quartz, while a change to ungearitems.components.quartz can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.quartz uses a module listed above it, which is the healthy direction.
ungearitems.components.recorder uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.recorder, while a change to ungearitems.components.recorder can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.recorder uses a module listed above it, which is the healthy direction.
ungearitems.components.recorder uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.recorder, while a change to ungearitems.components.recorder can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.recorder uses a module listed above it, which is the healthy direction.
ungearitems.components.recorder uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.recorder, while a change to ungearitems.components.recorder can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.recorder uses a module listed above it, which is the healthy direction.
ungearitems.components.recorder uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.recorder, while a change to ungearitems.components.recorder can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.recorder uses a module listed above it, which is the healthy direction.
ungearitems.components.recorder uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.recorder, while a change to ungearitems.components.recorder can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.recorder uses a module listed above it, which is the healthy direction.
ungearitems.components.redtorch uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.redtorch, while a change to ungearitems.components.redtorch can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.redtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.redtorch uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.redtorch, while a change to ungearitems.components.redtorch can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.redtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.redtorch uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.redtorch, while a change to ungearitems.components.redtorch can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.redtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.redtorch uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.redtorch, while a change to ungearitems.components.redtorch can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.redtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.redtorch uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.redtorch, while a change to ungearitems.components.redtorch can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.redtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.repellentflask uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.repellentflask, while a change to ungearitems.components.repellentflask can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.repellentflask uses a module listed above it, which is the healthy direction.
ungearitems.components.repellentflask uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.repellentflask, while a change to ungearitems.components.repellentflask can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.repellentflask uses a module listed above it, which is the healthy direction.
ungearitems.components.repellentflask uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.repellentflask, while a change to ungearitems.components.repellentflask can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.repellentflask uses a module listed above it, which is the healthy direction.
ungearitems.components.repellentflask uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.repellentflask, while a change to ungearitems.components.repellentflask can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.repellentflask uses a module listed above it, which is the healthy direction.
ungearitems.components.repellentflask uses uncore.types.ghost.types, so a change to uncore.types.ghost.types can break ungearitems.components.repellentflask, while a change to ungearitems.components.repellentflask can't break uncore.types.ghost.types.
Position
Below the diagonal: ungearitems.components.repellentflask uses a module listed above it, which is the healthy direction.
ungearitems.components.repellentflask uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.repellentflask, while a change to ungearitems.components.repellentflask can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.repellentflask uses a module listed above it, which is the healthy direction.
ungearitems.components.sage uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.sage, while a change to ungearitems.components.sage can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.sage uses a module listed above it, which is the healthy direction.
ungearitems.components.sage uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.sage, while a change to ungearitems.components.sage can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.sage uses a module listed above it, which is the healthy direction.
ungearitems.components.sage uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.sage, while a change to ungearitems.components.sage can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.sage uses a module listed above it, which is the healthy direction.
ungearitems.components.sage uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.sage, while a change to ungearitems.components.sage can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.sage uses a module listed above it, which is the healthy direction.
ungearitems.components.sage uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.sage, while a change to ungearitems.components.sage can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.sage uses a module listed above it, which is the healthy direction.
ungearitems.components.salt uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.salt, while a change to ungearitems.components.salt can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.salt uses a module listed above it, which is the healthy direction.
ungearitems.components.salt uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.salt, while a change to ungearitems.components.salt can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.salt uses a module listed above it, which is the healthy direction.
ungearitems.components.salt uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.salt, while a change to ungearitems.components.salt can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.salt uses a module listed above it, which is the healthy direction.
ungearitems.components.salt uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.salt, while a change to ungearitems.components.salt can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.salt uses a module listed above it, which is the healthy direction.
ungearitems.components.salt uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.salt, while a change to ungearitems.components.salt can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.salt uses a module listed above it, which is the healthy direction.
ungearitems.components.spiritbox uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.spiritbox, while a change to ungearitems.components.spiritbox can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.spiritbox uses a module listed above it, which is the healthy direction.
ungearitems.components.spiritbox uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.spiritbox, while a change to ungearitems.components.spiritbox can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.spiritbox uses a module listed above it, which is the healthy direction.
ungearitems.components.spiritbox uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.spiritbox, while a change to ungearitems.components.spiritbox can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.spiritbox uses a module listed above it, which is the healthy direction.
ungearitems.components.spiritbox uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.spiritbox, while a change to ungearitems.components.spiritbox can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.spiritbox uses a module listed above it, which is the healthy direction.
ungearitems.components.spiritbox uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.spiritbox, while a change to ungearitems.components.spiritbox can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.spiritbox uses a module listed above it, which is the healthy direction.
ungearitems.components.thermometer uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.thermometer, while a change to ungearitems.components.thermometer can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.thermometer uses a module listed above it, which is the healthy direction.
ungearitems.components.thermometer uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.thermometer, while a change to ungearitems.components.thermometer can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.thermometer uses a module listed above it, which is the healthy direction.
ungearitems.components.thermometer uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.thermometer, while a change to ungearitems.components.thermometer can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.thermometer uses a module listed above it, which is the healthy direction.
ungearitems.components.thermometer uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.thermometer, while a change to ungearitems.components.thermometer can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.thermometer uses a module listed above it, which is the healthy direction.
ungearitems.components.thermometer uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.thermometer, while a change to ungearitems.components.thermometer can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.thermometer uses a module listed above it, which is the healthy direction.
ungearitems.components.uvtorch uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.uvtorch, while a change to ungearitems.components.uvtorch can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.uvtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.uvtorch uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.uvtorch, while a change to ungearitems.components.uvtorch can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.uvtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.uvtorch uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.uvtorch, while a change to ungearitems.components.uvtorch can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.uvtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.uvtorch uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.uvtorch, while a change to ungearitems.components.uvtorch can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.uvtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.uvtorch uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.uvtorch, while a change to ungearitems.components.uvtorch can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.uvtorch uses a module listed above it, which is the healthy direction.
ungearitems.components.videocam uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungearitems.components.videocam, while a change to ungearitems.components.videocam can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungearitems.components.videocam uses a module listed above it, which is the healthy direction.
ungearitems.components.videocam uses uncore.types.gear.spriteid, so a change to uncore.types.gear.spriteid can break ungearitems.components.videocam, while a change to ungearitems.components.videocam can't break uncore.types.gear.spriteid.
Position
Below the diagonal: ungearitems.components.videocam uses a module listed above it, which is the healthy direction.
ungearitems.components.videocam uses uncore.components.board.position, so a change to uncore.components.board.position can break ungearitems.components.videocam, while a change to ungearitems.components.videocam can't break uncore.components.board.position.
Position
Below the diagonal: ungearitems.components.videocam uses a module listed above it, which is the healthy direction.
ungearitems.components.videocam uses ungear.gear_stuff, so a change to ungear.gear_stuff can break ungearitems.components.videocam, while a change to ungearitems.components.videocam can't break ungear.gear_stuff.
Position
Below the diagonal: ungearitems.components.videocam uses a module listed above it, which is the healthy direction.
ungearitems.components.videocam uses ungear.gear_usable, so a change to ungear.gear_usable can break ungearitems.components.videocam, while a change to ungearitems.components.videocam can't break ungear.gear_usable.
Position
Below the diagonal: ungearitems.components.videocam uses a module listed above it, which is the healthy direction.
ungear.components.playergear uses uncore.types.gear.equipmentposition, so a change to uncore.types.gear.equipmentposition can break ungear.components.playergear, while a change to ungear.components.playergear can't break uncore.types.gear.equipmentposition.
Position
Below the diagonal: ungear.components.playergear uses a module listed above it, which is the healthy direction.
ungear.components.playergear uses uncore.types.ghost.types, so a change to uncore.types.ghost.types can break ungear.components.playergear, while a change to ungear.components.playergear can't break uncore.types.ghost.types.
Position
Below the diagonal: ungear.components.playergear uses a module listed above it, which is the healthy direction.
ungear.components.playergear uses uncore.types.gear_kind, so a change to uncore.types.gear_kind can break ungear.components.playergear, while a change to ungear.components.playergear can't break uncore.types.gear_kind.
Position
Below the diagonal: ungear.components.playergear uses a module listed above it, which is the healthy direction.
ungear.components.playergear uses ungear.types.gear, so a change to ungear.types.gear can break ungear.components.playergear, while a change to ungear.components.playergear can't break ungear.types.gear.
Position
Below the diagonal: ungear.components.playergear uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 75.4 · Adequate · gated by D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2025 — Software Supply Chain Failures
23
Medium
A05:2025 — Injection
12
High / Critical
Roadmap
Top priorities: Resolve the 165 Orphaned file finding(s) in Knowledge Freshness — start with systems.rs (4), mod.rs (3), utils.rs (3); Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml; 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.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml.
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.
Reconcile the README with reality: tools/ghost_list/README.md links to `./DESIGN_CLEAN.md`, but `tools/ghost_list/DESIGN_CLEAN.md` does not exist; tools/ghost_list/README.md links to `./CHANGELOG.md`, but `tools/ghost_list/CHANGELOG.md` does not exist.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
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 — 9
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 — 622
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 — 201
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 12
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 51 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 51 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, 798 of 832 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the Rust half could not be measured — the Cargo suite in repository root did not build, so it was never run. Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo.
D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability not scored — the Python suite (repository root, 1 test file) ran but surfaced no test cases to the runner, so flakiness couldn't be exercised.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (3 contributor(s) across 1088 commit(s) sampled, automation and bot accounts excluded). One of them holds 99% of the history; the other 2 hold 0.5% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `assets/maps/character1.tsx`, `assets/maps/topdown.tsx`, `assets/maps/unhaunter_custom_tileset.tsx`, `assets/maps/unhaunter_spritesheet2.tsx`, `assets/maps/unhaunter_spritesheetA_3x3x3.tsx`, … (+3 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
D44 Platform End-of-Life — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: 9 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P1 CI/CD gates — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A CI pipeline exists and the word "test" appears, but no explicit test-runner invocation (your stack's test command, or a test job) was matched — so either the gate runs tests through a step this pass could not recognise, or "test" is incidental here (a path, "latest", a reporter). Which of the two it is cannot be settled from this dimension's evidence; the coverage dimensions report whether a suite exists at all. You can widen what we reach: name the test runner explicitly in the pipeline step (your stack's test command, or a job named for the suite) so the gate is unambiguous to a reader and to this pass.
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.
X19 Unrestored process-global state — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, Dart, Ruby, Scala, PHP, Go, Swift, Erlang, F# and Visual Basic source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Python, Dart, Ruby, Scala, PHP, Go, Swift, Erlang, F# or Visual Basic 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.
X22 Contradicted release guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# and Visual Basic syntax, and Java, TypeScript/JavaScript, Python, Dart, Ruby, Scala, Kotlin, PHP, F# and Visual Basic source only, and no C# was loaded, and this repository's 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.
X24 Document value interpolated into markup unescaped — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Scala, Ruby and Python source only, and no C# was loaded and no JavaScript/TypeScript, Java, Scala, Ruby or Python 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.
X3 Exception handling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go and JavaScript/TypeScript source only, and no C# was loaded and no PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go, JavaScript or TypeScript 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 — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 58 further occurrence(s) are not listed individually; the score already reflects all 98.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
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.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
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.
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.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
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: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
58 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was unlight::maplight::apply_lighting at 101. A further 13 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being WalkieEvent::to_concept at 74 — they are counted neither in the figure above nor in this dimension's score. 7 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: unwalkiecore/src/events/walkie_content.rs (WalkieEvent::to_concept at 74), uncore/src/types/ghost/types.rs (GhostType::name at 44), uncore/src/behavior/mod.rs (SpriteConfig::set_properties at 34), uncore/src/types/gear_kind.rs (Evidence::try_from at 20), ungearitems/src/from_gearkind.rs (Gear::from_gearkind at 20), and 2 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 15 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with unlight::maplight::apply_lighting (cyclomatic 101). — Refactoring it lifts Cyclomatic Complexity from 4.3 to about 5.3/10.
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.
+ 23 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 55 bodies over 30 down to 30 or less in Cognitive Complexity — start with unlight::maplight::apply_lighting (cognitive 231), untruck::journal::button_system (cognitive 140), unghost::ghost::ghost_movement (cognitive 125). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 55 together lifts Cognitive Complexity from 2.0 to about 5.6/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes6.7 / 10Adequate✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 28 FunctionTooLong finding(s) in God Classes — start with systems.rs (2), ghost.rs (2), unified_mission_selection.rs. — One of this dimension's main actionable groups (28 warning-level).
Resolve the 5 FileTooLong finding(s) in God Classes — start with maplight.rs, unified_mission_selection.rs, ghost.rs. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 2 TooManyFields finding(s) in God Classes — start with image_assets.rs, difficulty.rs. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
117 duplicated block group(s) detected. 10.0 % of the production lines (4,416 of 43,948) are in a reported copy. A further 47 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.
+ 90 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 8 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with templates.rs (2), gear_ui.rs (2), systems.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 7 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with correlation.rs, pause_ui.rs, lighting.rs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 6 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with optimization.rs, templates.rs, ghost.rs. — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling6.6 / 10Adequate✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
28 production modules (Cargo), 0 dependency cycle(s), 4 unstable depended-on module(s). Read from the build's own module declarations; 7 module(s) off the main sequence.
Off the main sequence: unsettings · ×7
Unstable project uncampaign
Unstable project ungame
Unstable project unplayer
Unstable project unwalkie
What to do
Resolve the 7 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 1 Unstable project uncampaign finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project ungame finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
15 outdated, 0 yanked direct Cargo dependencies. 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: anyhow · ×15
✓ On the Gold path — maintain.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 617 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 Apache-2.0, which is its own choice and is not judged here.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 38 Hotspot finding(s) in Churn × Complexity Hotspots — start with maplight.rs, journal.rs, ghost.rs. — One of this dimension's main actionable groups (38 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
51 deducted task-comment markers across 43948 LoC (0.1/KLoC) → score 9.8. 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 34 FixmeComment finding(s) in Explicit Debt — start with consumables_and_defense.rs (6), player_wellbeing.rs (5), locomotion_interaction.rs (4). — One of this dimension's main actionable groups (34 warning-level).
Resolve the 17 TodoComment finding(s) in Explicit Debt — start with evidence_gathering_logic.rs (2), game_ui.rs (2), comparison.rs (2). — One of this dimension's main actionable groups (17 warning-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 6 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: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.
1 naming inconsistencies among 14 declarations measured against a convention their peers follow.
`HintUiState` spells `Ui` where 13 names in the project spell it `UI`uncore/src/resources/hint_ui_state.rs:16
What to do
Resolve the 1 `HintUiState` spells `Ui` where 13 names in the project spell it `UI` finding(s) in Naming Consistency — start with hint_ui_state.rs. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d21_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
12 finding(s): 0 critical, 8 high, 4 medium, 0 low. 6 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 8 file(s) — `assets/maps/character1.tsx` (lines 1–4), `assets/maps/topdown.tsx` (lines 1–16), `assets/maps/unhaunter_custom_tileset.tsx` (lines 1–18), `assets/maps/unhaunter_spritesheet2.tsx` (lines 1–14), `assets/maps/unhaunter_spritesheetA_3x3x3.tsx` (lines 1–1731), … (+3 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 1 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
What to do
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
No action in Static Analysis (SAST) — all 6 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 (6 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Resolve the 7 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED (7). — One of this dimension's main actionable groups (7 warning-level).
Resolve the 6 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED (6). — One of this dimension's main actionable groups (6 warning-level).
Resolve the 3 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 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.
168 of 168 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is unlight/src/maplight.rs. Counted over 168 of the 390 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Most significant orphaned file · ×3unlight/src/maplight.rs:1
Dormant codebase
What to do
Resolve the 165 Orphaned file finding(s) in Knowledge Freshness — start with systems.rs (4), mod.rs (3), utils.rs (3). — One of this dimension's main actionable groups (165 recommendation-level).
Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with maplight.rs, unified_mission_selection.rs, ghost.rs. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 1 Boundary-crossing change coupling finding(s) in Change Coupling — start with prebaked_lighting_data.rs. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 2 Change coupling finding(s) in Change Coupling — start with user_manual_ui.rs, lighting.rs. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
No dependency in any ecosystem this repository declares is published as malicious.
✓ On the Gold path — maintain.
Detailed fixes: d43_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives4.9 / 10Adequate✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. (×26) — assets/maps/unhaunter_spritesheet2.tsx:11, assets/maps/unhaunter_spritesheetA_3x3x3.tsx:419, assets/maps/unhaunter_spritesheetA_6x6x10.tsx:16, …
What to do
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether 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 domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
Other · Code Health — Unreviewed-generation residue in this repository's Rust: functions whose whole body is still `todo!()`/`unimplemented!()` or only panics with a "not implemented" message, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Rust: functions whose body is `todo!()`/`unimplemented!()` or only panics with a "not implemented" message, match arms and branches left as `todo!()`, functions that take inputs and return a constant (`Ok(())`, `None`, `Default::default()`, an empty `Vec`) or do nothing, and impls most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`display_ghost_response` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — tools/ghost_radio/src/console_ui.rs:23
`menu_settings_class_selected` does real work, but one of its branches is `todo!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. (×2) — unmenusettings/src/systems.rs:170, unmenusettings/src/systems.rs:171
`app_setup` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. (×2) — unstd/src/plugins/root.rs:234, unwalkie/src/triggers/tutorial_specific.rs:3
What to do
Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
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.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
tools/ghost_list/README.md links to `./DESIGN_CLEAN.md`, but `tools/ghost_list/DESIGN_CLEAN.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — tools/ghost_list/README.md:194
tools/ghost_list/README.md links to `./CHANGELOG.md`, but `tools/ghost_list/CHANGELOG.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — tools/ghost_list/README.md:195
What to do
Reconcile the README with reality: tools/ghost_list/README.md links to `./DESIGN_CLEAN.md`, but `tools/ghost_list/DESIGN_CLEAN.md` does not exist; tools/ghost_list/README.md links to `./CHANGELOG.md`, but `tools/ghost_list/CHANGELOG.md` does not exist.
Do you agree with this assessment?
P1 · CI/CD gates8.5 / 10Exemplary✓ Tool-verified
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.
What to do
Run the test suite in CI via an explicit runner step (`cargo test` for the toolchain this pipeline already uses) and gate merges on it.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
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.
`Cargo.toml` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — Cargo.toml:41
What to do
Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release. — REDACTED:54
What to do
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
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. Markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. The server controls — HTTPS enforcement, HSTS, cookie flags, input validation — are read from a Rust server this repository starts itself, and its production Rust starts none. What serves its HTTP is outside the Rust source, and only what this card names about it was assessed.
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.
`https://www.googletagmanager.com/gtag/js?id=G-1XQY15JR0H` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. — index.html:8
What to do
Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document3.5 / 10Weak✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`iter` is public and takes a `MapLayerGroup` as its receiver from its caller, and it calls itself at line 123 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `iter` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — uncore/src/types/tiledmap/map.rs:123
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
`image.into_raw()` (line 140) gives up ownership in exchange for a raw handle — the value's `Drop` will no longer run — and nothing in the crate's code ever reclaims a `*` from a raw pointer (`*::from_raw`). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a `free` function that rebuilds the owner with `from_raw` and drops it), or keep the owning value. — unhaunter/src/app.rs:140
What to do
Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
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 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.
`Commands::TestSet.ghosts` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:66
`Commands::AnalyzeSet.ghosts` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:71
`Commands::CompleteSet.ghosts` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:76
`Commands::CompleteSet.requires_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:81
`Commands::CompleteSet.excludes_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:86
`Commands::CompleteSet.max_candidates` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:92
`Commands::ValidateSet.ghosts` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:97
`Commands::ValidateSet.min_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:103
`Commands::FindSets.target_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:108
`Commands::FindSets.max_results` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:116
`Commands::Conflicts.show_all` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:123
`Commands::UniqueCombinations.min_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:128
`Commands::UniqueCombinations.max_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:130
`Commands::Correlate.with` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:137
`Commands::OptimizeSet.balance_factor` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:144
`Commands::OptimizeSet.max_overlap` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:149
`Commands::DiverseSet.min_evidence_coverage` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:156
`Commands::TutorialSet.beginner_friendly` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:167
`Commands::CompareSets.sets` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:172
`Commands::OverlapAnalysis.sets` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:177
`Commands::MergeSets.sets` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:182
`Commands::MergeSets.optimize` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:184
`Commands::DiffSets.old_set` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:189
`Commands::DiffSets.new_set` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — tools/ghost_list/src/cli/mod.rs:191
`Object.weight` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — uncore/src/behavior/mod.rs:194
`DifficultyStruct.temperature_spread_speed` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — uncore/src/difficulty.rs:702
`AchievementData.expelled_first_ghost` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — unprofile/src/data.rs:54
`PlayerProfileData.achievements` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — unprofile/src/data.rs:103
`VideoSettings.window_size` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — unsettings/src/video.rs:9
`VideoSettings.aspect_ratio` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — unsettings/src/video.rs:10
`VideoSettings.ui_scale` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — unsettings/src/video.rs:11
`VideoSettings.font_scale` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — unsettings/src/video.rs:12
What to do
Each finding names the spans that disagree — the knob the caller supplies and the site that ignores it, whether by re-spelling its default, by falling back under the wrong key, by parsing with no format provider at all, or by printing under whatever culture the host supplies. Confirm from those spans, then decide which of the two the type meant: read the knob at the named site, or drop the knob so the signature stops advertising something the type cannot feel. Leaving both is the one option that cannot be right.
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether Rust's absent values are handled rather than forced — `Option` and `Result` make absence a value the caller must handle in every crate, and each `.unwrap()` or `.expect()` that no guard on its path proves present is a panic the first time the value is `None` or `Err`.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
`playergear.as_vec_mut().iter_mut().find(|x|matches!(x.0.kind,GearKind::RepellentFlask))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `craft_repellent` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — untruck/src/craft_repellent.rs:24
`playergear.as_vec_mut().iter_mut().find(|x|matches!(x.0.kind,GearKind::RepellentFlask)).unwrap().0.data.as_mut()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `craft_repellent` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — untruck/src/craft_repellent.rs:28
`q_textcolor.get_mut(children[0])` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `button_system` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — untruck/src/journal.rs:289
`text_query.get_mut(children[1])` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `update_tab_interactions` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — untruck/src/ui.rs:400
`layer.height()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `load_tile_layer_tiles` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — untmxmap/src/load.rs:63
`layer.width()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `load_tile_layer_tiles` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — untmxmap/src/load.rs:64
`path.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `read_from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — untmxmap/src/map_loader.rs:22
`loader.load_tmx_map(path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `load` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — untmxmap/src/map_loader.rs:70
`self.bf.cvo_idx.get(&cvo)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `execute_interaction` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unstd/src/systemparam/interactivestuff.rs:103
`self.commands.get_entity(entity)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `execute_interaction` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unstd/src/systemparam/interactivestuff.rs:107
`self.bf.map_tile.get(other_tuid)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `execute_interaction` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unstd/src/systemparam/interactivestuff.rs:108
`self.materials1.get(&b.material)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `execute_interaction` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unstd/src/systemparam/interactivestuff.rs:143
`player_spawn_points.pop()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `spawn_player` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unmapload/src/entity_spawning.rs:62
`ev.read().next()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `after_level_ready` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unmapload/src/level_finalization.rs:54
`p.texture_atlases.get(handle)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `populate_sprite_db` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unmapload/src/sprite_db.rs:49
`p.sdb.map_tile.get(&(tile.tileset.clone(),tile.tileuid))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `process_and_spawn_tile` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unmapload/src/tile_spawning.rs:56
`p.materials1.get(&b.material)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `process_and_spawn_tile` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unmapload/src/tile_spawning.rs:72
`Array2::from_shape_vec((Self::SZ,Self::SZ),cp.dist.iter().flat_map(|row|row.iter().cloned()).collect(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `new` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unlight/src/cached_board_pos.rs:65
`Array2::from_shape_vec((Self::SZ,Self::SZ),cp.angle.iter().flat_map(|row|row.iter().cloned()).collect(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `new` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unlight/src/cached_board_pos.rs:73
`Array2::from_shape_vec((Self::SZ,Self::SZ),cp.angle_range.iter().flat_map(|row|row.iter().cloned()).collect(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `new` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unlight/src/cached_board_pos.rs:81
`materials1.get(mat)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `apply_lighting` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unlight/src/maplight.rs:640
`materials1.get_mut(mat)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `apply_lighting` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unlight/src/maplight.rs:784
`stored_history.front()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `prebake_lighting_field` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unlight/src/prebake.rs:172
`stored_history.get(stored_history.len()/2)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `prebake_lighting_field` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unlight/src/prebake.rs:175
`Icon::from_rgba(icon_rgba,icon_width,icon_height)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `set_window_icon` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — unhaunter/src/app.rs:143
`gear.data.as_mut()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `update_quartz_and_ghost` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — ungearitems/src/components/quartz.rs:140
`gear_data.gear.data.as_mut()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `update_quartz_and_ghost` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — ungearitems/src/components/quartz.rs:153
`imgnode.texture_atlas.as_ref()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `update_gear_ui` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — ungear/src/systems.rs:148, ungear/src/systems.rs:177
`imgnode.texture_atlas.as_mut()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `update_gear_ui` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — ungear/src/systems.rs:149, ungear/src/systems.rs:178
`flask.0.data.as_ref()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `can_craft_repellent` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — ungear/src/components/playergear.rs:163
`DIAGNOSTIC_CHANNEL.rx.try_lock()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `receive_data` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — uncore/src/metric_recorder.rs:36
`self.rng.as_mut()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `rng` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — uncore/src/random_seed.rs:64
`Self::try_from_tiled(class,tileset.clone(),tileuid,properties).with_context(||{format!("SpriteConfig: error loading sprite from tiled: {}:{} [c:{:?}]",tileset,tileuid,class)})` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `from_tiled` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — uncore/src/behavior/mod.rs:463
`(-0.00035).try_into()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `set_properties` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — uncore/src/behavior/mod.rs:614
`(-0.00005).try_into()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `set_properties` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — uncore/src/behavior/mod.rs:620, uncore/src/behavior/mod.rs:626
`(0.000015).try_into()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `set_properties` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — uncore/src/behavior/mod.rs:629
`(0.000040).try_into()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `set_properties` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — uncore/src/behavior/mod.rs:635
What to do
Each row is a forced `Option`/`Result` no guard on its path proves present. Handle the absent case where it arises rather than forcing it: `?` to hand it to the caller, `if let` / `match` / `let … else` to branch on it, `unwrap_or` / `unwrap_or_default` / `unwrap_or_else` where a default is right. Where the value genuinely cannot be absent, say so in a way a reader can check from the line: test it first (`if x.is_none() { return … }`), look the key up with `contains_key` or the index against `len()`, or construct the value so it cannot be absent.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 5 of 55 WCAG 2.2 Level A/AA success criteria (9%; ≈10% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 50 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 1 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 — 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 — 64 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.
AC2 Forms & labels — No form control/button found in the parsed markup — AC2 not applicable here.
AC3 Page structure — No structural check found in the parsed markup — AC3 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — Not applicable: 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.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — no interface, protocol or abstract type declares an operation an implementer must write
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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 — ~36 lines of test source are present (.py, .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 — No tests discovered
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
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.
D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go 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+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — 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.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 8 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
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.
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not measured — Rust suite
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 27 value object(s); 2 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
ES1 Fold determinism — not applicable — the code was read and holds no event-replay fold, so there is nothing for this check to judge
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P2 Observability — This repository's Rust source (25 module(s), 354 file(s) read) declares no entry point and bootstraps no server, and nothing here deploys a service — it is a library, run inside whatever hosts it, so production observability (structured logging, tracing/metrics, health checks) is N/A. If it grows a binary or a service, the dimension reactivates.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the 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 — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — 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 Rust was read, and no request in it can be cancelled by a caller — 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.
X22 Contradicted release guard — 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
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not 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
X26 Unsynchronised callback handoff — Not applicable: this check looks for a collection written by a callback on one thread while the body waiting on it touches it on another, and in this repository's languages no collection is reachable from two threads at once. Rust's compiler refuses the unsynchronised version: a collection shared between a callback's thread and the waiting body must be `Sync`, which a `Vec`, `VecDeque` or `HashMap` is only behind a `Mutex`/`RwLock`, so the race this check looks for cannot be written in safe Rust. Not a gap in the analyzer and not a finding about your code.
X27 Collection changed while being enumerated — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X3 Exception handling — 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
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.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
Boundary-crossing change coupling: prebaked_lighting_data.rs ↔ lighting.rs uncore/src/types/board/prebaked_lighting_data.rs:1— `uncore/src/types/board/prebaked_lighting_data.rs` (context uncore) and `unlight/src/lighting.rs` (context unlight) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `c07f95fb` Optimize lighting calculation; `2913bf0b` Change lighting to follow the square distance law; `6cfe239c` Enhance lighting system: Add door tracking to prebaked metadata and u… — run `git show` on any of them.
Serious — 622 finding(s)
X5 · Nullable reference types· Symbol treated as nullable, then dereferenced unguarded · ×40
Symbol treated as nullable, then dereferenced unguarded untruck/src/craft_repellent.rs:24— `playergear.as_vec_mut().iter_mut().find(|x|matches!(x.0.kind,GearKind::RepellentFlask))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `craft_repellent` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded untruck/src/craft_repellent.rs:28— `playergear.as_vec_mut().iter_mut().find(|x|matches!(x.0.kind,GearKind::RepellentFlask)).unwrap().0.data.as_mut()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `craft_repellent` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded untruck/src/journal.rs:289— `q_textcolor.get_mut(children[0])` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `button_system` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded untruck/src/ui.rs:400— `text_query.get_mut(children[1])` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `update_tab_interactions` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded untmxmap/src/load.rs:63— `layer.height()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `load_tile_layer_tiles` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded untmxmap/src/load.rs:64— `layer.width()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `load_tile_layer_tiles` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded untmxmap/src/map_loader.rs:22— `path.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `read_from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded untmxmap/src/map_loader.rs:70— `loader.load_tmx_map(path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `load` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unstd/src/systemparam/interactivestuff.rs:103— `self.bf.cvo_idx.get(&cvo)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `execute_interaction` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unstd/src/systemparam/interactivestuff.rs:107— `self.commands.get_entity(entity)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `execute_interaction` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unstd/src/systemparam/interactivestuff.rs:108— `self.bf.map_tile.get(other_tuid)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `execute_interaction` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unstd/src/systemparam/interactivestuff.rs:143— `self.materials1.get(&b.material)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `execute_interaction` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unmapload/src/entity_spawning.rs:62— `player_spawn_points.pop()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `spawn_player` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unmapload/src/level_finalization.rs:54— `ev.read().next()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `after_level_ready` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unmapload/src/sprite_db.rs:49— `p.texture_atlases.get(handle)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `populate_sprite_db` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unmapload/src/tile_spawning.rs:56— `p.sdb.map_tile.get(&(tile.tileset.clone(),tile.tileuid))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `process_and_spawn_tile` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unmapload/src/tile_spawning.rs:72— `p.materials1.get(&b.material)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `process_and_spawn_tile` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unlight/src/cached_board_pos.rs:65— `Array2::from_shape_vec((Self::SZ,Self::SZ),cp.dist.iter().flat_map(|row|row.iter().cloned()).collect(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `new` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unlight/src/cached_board_pos.rs:73— `Array2::from_shape_vec((Self::SZ,Self::SZ),cp.angle.iter().flat_map(|row|row.iter().cloned()).collect(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `new` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unlight/src/cached_board_pos.rs:81— `Array2::from_shape_vec((Self::SZ,Self::SZ),cp.angle_range.iter().flat_map(|row|row.iter().cloned()).collect(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `new` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unlight/src/maplight.rs:640— `materials1.get(mat)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `apply_lighting` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unlight/src/maplight.rs:784— `materials1.get_mut(mat)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `apply_lighting` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unlight/src/prebake.rs:172— `stored_history.front()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `prebake_lighting_field` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unlight/src/prebake.rs:175— `stored_history.get(stored_history.len()/2)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `prebake_lighting_field` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded unhaunter/src/app.rs:143— `Icon::from_rgba(icon_rgba,icon_width,icon_height)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `set_window_icon` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Hotspot: unlight/src/maplight.rs unlight/src/maplight.rs:220— unlight/src/maplight.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in unlight::maplight::apply_lighting at line 220. 4 of those changes were fix/bug commits, and the other 32 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unlight/src/maplight.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: untruck/src/journal.rs untruck/src/journal.rs:64— untruck/src/journal.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in untruck::journal::button_system at line 64. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- untruck/src/journal.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: unghost/src/ghost.rs unghost/src/ghost.rs:59— unghost/src/ghost.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in unghost::ghost::ghost_movement at line 59. 5 of those changes were fix/bug commits, and the other 10 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unghost/src/ghost.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: ungearitems/src/components/thermometer.rs ungearitems/src/components/thermometer.rs:228— ungearitems/src/components/thermometer.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ungearitems::components::thermometer::temperature_update at line 228. 2 of those changes were fix/bug commits, and the other 10 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- ungearitems/src/components/thermometer.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: unwalkie/src/triggers/repellent_expulsion.rs unwalkie/src/triggers/repellent_expulsion.rs:327— unwalkie/src/triggers/repellent_expulsion.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in unwalkie::triggers::repellent_expulsion::trigger_repellent_exhausted_correct_type_system at line 327. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unwalkie/src/triggers/repellent_expulsion.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: unwalkie/src/triggers/basic_gear_usage.rs unwalkie/src/triggers/basic_gear_usage.rs:160— unwalkie/src/triggers/basic_gear_usage.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in unwalkie::triggers::basic_gear_usage::trigger_did_not_switch_starting_gear_in_hotspot_system at line 160. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unwalkie/src/triggers/basic_gear_usage.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: ungearitems/src/components/repellentflask.rs ungearitems/src/components/repellentflask.rs:176— ungearitems/src/components/repellentflask.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ungearitems::components::repellentflask::repellent_update at line 176. 2 of those changes were fix/bug commits, and the other 10 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- ungearitems/src/components/repellentflask.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: unwalkie/src/triggers/evidence_gathering_logic.rs unwalkie/src/triggers/evidence_gathering_logic.rs:341— unwalkie/src/triggers/evidence_gathering_logic.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in unwalkie::triggers::evidence_gathering_logic::trigger_in_truck_with_evidence_no_journal_system at line 341. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unwalkie/src/triggers/evidence_gathering_logic.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: uncampaign/src/unified_mission_selection.rs uncampaign/src/unified_mission_selection.rs:314— uncampaign/src/unified_mission_selection.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in uncampaign::unified_mission_selection::setup_ui at line 314. 2 of those changes were fix/bug commits, and the other 10 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- uncampaign/src/unified_mission_selection.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: unwalkie/src/triggers/locomotion_interaction.rs unwalkie/src/triggers/locomotion_interaction.rs:224— unwalkie/src/triggers/locomotion_interaction.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in unwalkie::triggers::locomotion_interaction::trigger_struggling_with_grab_drop at line 224. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unwalkie/src/triggers/locomotion_interaction.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: unwalkie/src/walkie_play.rs unwalkie/src/walkie_play.rs:34— unwalkie/src/walkie_play.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in unwalkie::walkie_play::walkie_talk at line 34. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unwalkie/src/walkie_play.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: unfog/src/systems.rs unfog/src/systems.rs:295— unfog/src/systems.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in unfog::systems::update_miasma at line 295. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unfog/src/systems.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: untruck/src/systems/truck_ui_systems.rs untruck/src/systems/truck_ui_systems.rs:136— untruck/src/systems/truck_ui_systems.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in untruck::systems::truck_ui_systems::hold_button_system at line 136. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- untruck/src/systems/truck_ui_systems.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: ungearitems/src/components/spiritbox.rs ungearitems/src/components/spiritbox.rs:141— ungearitems/src/components/spiritbox.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SpiritBox::update at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- ungearitems/src/components/spiritbox.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: untruck/src/loadoutui.rs untruck/src/loadoutui.rs:253— untruck/src/loadoutui.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in untruck::loadoutui::update_loadout_buttons at line 253. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- untruck/src/loadoutui.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: ungame/src/systems/game_systems.rs ungame/src/systems/game_systems.rs:58— ungame/src/systems/game_systems.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ungame::systems::game_systems::keyboard at line 58. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- ungame/src/systems/game_systems.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: unwalkie/src/triggers/consumables_and_defense.rs unwalkie/src/triggers/consumables_and_defense.rs:277— unwalkie/src/triggers/consumables_and_defense.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in unwalkie::triggers::consumables_and_defense::trigger_sage_activated_ineffectively_system at line 277. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unwalkie/src/triggers/consumables_and_defense.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: unmapload/src/level_finalization.rs unmapload/src/level_finalization.rs:40— unmapload/src/level_finalization.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in unmapload::level_finalization::after_level_ready at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unmapload/src/level_finalization.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: ungearitems/src/components/geigercounter.rs ungearitems/src/components/geigercounter.rs:125— ungearitems/src/components/geigercounter.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in GeigerCounter::update at line 125. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- ungearitems/src/components/geigercounter.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: ungearitems/src/components/recorder.rs ungearitems/src/components/recorder.rs:126— ungearitems/src/components/recorder.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Recorder::update at line 126. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- ungearitems/src/components/recorder.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: unwalkie/src/triggers/mission_progression_and_truck.rs unwalkie/src/triggers/mission_progression_and_truck.rs:61— unwalkie/src/triggers/mission_progression_and_truck.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in unwalkie::triggers::mission_progression_and_truck::trigger_player_leaves_truck_without_changing_loadout_system at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unwalkie/src/triggers/mission_progression_and_truck.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: uncoremenu/src/scrollbar.rs uncoremenu/src/scrollbar.rs:138— uncoremenu/src/scrollbar.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in uncoremenu::scrollbar::update_scrollbar at line 138. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- uncoremenu/src/scrollbar.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: untruck/src/ui.rs untruck/src/ui.rs:355— untruck/src/ui.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in untruck::ui::update_tab_interactions at line 355. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- untruck/src/ui.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: unwalkie/src/triggers/player_wellbeing.rs unwalkie/src/triggers/player_wellbeing.rs:188— unwalkie/src/triggers/player_wellbeing.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in unwalkie::triggers::player_wellbeing::trigger_sanity_dropped_due_to_ghost_system at line 188. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- unwalkie/src/triggers/player_wellbeing.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: untmxmap/src/bevy.rs untmxmap/src/bevy.rs:34— untmxmap/src/bevy.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in untmxmap::bevy::bevy_load_map at line 34. 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 2025-04-11..2025-07-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-04-11 21:15:46 +01:00' --until='2025-07-10 21:15:46 +01:00' --full-history --no-merges -- untmxmap/src/bevy.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.
FixmeComment unwalkie/src/triggers/basic_gear_usage.rs:465— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/consumables_and_defense.rs:48— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/consumables_and_defense.rs:86— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/consumables_and_defense.rs:176— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/consumables_and_defense.rs:258— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/consumables_and_defense.rs:367— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/consumables_and_defense.rs:500— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/environmental_awareness.rs:189— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/environmental_awareness.rs:238— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/evidence_gathering_logic.rs:158— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/evidence_gathering_logic.rs:411— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/ghost_behavior_and_hunting.rs:104— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/locomotion_interaction.rs:451— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/mission_progression_and_truck.rs:49— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/player_wellbeing.rs:96— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/player_wellbeing.rs:173— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/player_wellbeing.rs:283— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/repellent_expulsion.rs:405— // FIXME: Verification needed: Not sure if this trigger actually fires. Don't recall it having fired in testing. — 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 unwalkie/src/triggers/locomotion_interaction.rs:285— // FIXME: Additional verification and tuning is needed for this trigger. It worked before, but it was too much. — 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 unwalkie/src/triggers/locomotion_interaction.rs:344— // FIXME: Additional verification and tuning is needed for this trigger. — 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 unwalkie/src/triggers/locomotion_interaction.rs:397— // FIXME: Additional verification and tuning is needed for this trigger. — 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 unwalkie/src/triggers/player_wellbeing.rs:109— // FIXME: WTF is "LightLevel"? this does not exist, this seems a hallucination from the original code. — 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 unwalkie/src/triggers/player_wellbeing.rs:304— // FIXME: The LightLevel component seems to be here as a placeholder, we need to understand its purpose. — 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 untmxmap/src/bevy.rs:47— // FIXME: When the images are loaded onto the GPU it seems that we need at least 1 — 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 unplayer/src/systems/grabdrop.rs:266— // FIXME: This code, along with grabbing items are in conflict. It will be — 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.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:66— `Commands::TestSet.ghosts` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:71— `Commands::AnalyzeSet.ghosts` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:76— `Commands::CompleteSet.ghosts` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:81— `Commands::CompleteSet.requires_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:86— `Commands::CompleteSet.excludes_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:92— `Commands::CompleteSet.max_candidates` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:97— `Commands::ValidateSet.ghosts` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:103— `Commands::ValidateSet.min_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:108— `Commands::FindSets.target_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:116— `Commands::FindSets.max_results` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:123— `Commands::Conflicts.show_all` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:128— `Commands::UniqueCombinations.min_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:130— `Commands::UniqueCombinations.max_evidence` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:137— `Commands::Correlate.with` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:144— `Commands::OptimizeSet.balance_factor` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:149— `Commands::OptimizeSet.max_overlap` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:156— `Commands::DiverseSet.min_evidence_coverage` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:167— `Commands::TutorialSet.beginner_friendly` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:172— `Commands::CompareSets.sets` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:177— `Commands::OverlapAnalysis.sets` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:182— `Commands::MergeSets.sets` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:184— `Commands::MergeSets.optimize` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:189— `Commands::DiffSets.old_set` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere tools/ghost_list/src/cli/mod.rs:191— `Commands::DiffSets.new_set` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere uncore/src/behavior/mod.rs:194— `Object.weight` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
FunctionTooLong: uncampaign::unified_mission_selection::setup_ui uncampaign/src/unified_mission_selection.rs:314— FunctionTooLong — uncampaign::unified_mission_selection::setup_ui runs 296 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 196 over it, 2.96× 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: unsummary::summary::setup_ui unsummary/src/summary.rs:84— FunctionTooLong — unsummary::summary::setup_ui runs 280 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 180 over it, 2.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: untruck::ui::setup_ui untruck/src/ui.rs:36— FunctionTooLong — untruck::ui::setup_ui runs 258 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 158 over it, 2.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: unfog::systems::update_miasma unfog/src/systems.rs:295— FunctionTooLong — unfog::systems::update_miasma runs 210 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 110 over it, 2.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: ungame::game_ui::setup_ui ungame/src/game_ui.rs:43— FunctionTooLong — ungame::game_ui::setup_ui runs 206 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 106 over it, 2.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: unghost::ghost::ghost_movement unghost/src/ghost.rs:59— FunctionTooLong — unghost::ghost::ghost_movement runs 192 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 92 over it, 1.92× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: untruck::journalui::setup_journal_ui untruck/src/journalui.rs:12— FunctionTooLong — untruck::journalui::setup_journal_ui runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: walkie_voice_generator::codegen::generate_rust_code tools/text_to_speech/walkie_voice_generator/src/codegen.rs:24— FunctionTooLong — walkie_voice_generator::codegen::generate_rust_code runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: untruck::journal::button_system untruck/src/journal.rs:64— FunctionTooLong — untruck::journal::button_system runs 173 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 73 over it, 1.73× 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: ungearitems::components::repellentflask::repellent_update ungearitems/src/components/repellentflask.rs:176— FunctionTooLong — ungearitems::components::repellentflask::repellent_update 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: unstd::plugins::root::load_assets unstd/src/plugins/root.rs:25— FunctionTooLong — unstd::plugins::root::load_assets 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: unghost::ghost::ghost_enrage unghost/src/ghost.rs:366— FunctionTooLong — unghost::ghost::ghost_enrage runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: unlight::utils::propagate_from_wave_edges unlight/src/utils.rs:253— FunctionTooLong — unlight::utils::propagate_from_wave_edges runs 147 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 47 over it, 1.47× 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: ghost_list::sets::comparison::perform_multi_set_overlap_analysis tools/ghost_list/src/sets/comparison.rs:405— FunctionTooLong — ghost_list::sets::comparison::perform_multi_set_overlap_analysis runs 146 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 46 over it, 1.46× 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: ghost_list::analysis::correlation::handle_correlation_command tools/ghost_list/src/analysis/correlation.rs:9— FunctionTooLong — ghost_list::analysis::correlation::handle_correlation_command 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: unplayer::systems::movement::player_movement_system unplayer/src/systems/movement.rs:40— FunctionTooLong — unplayer::systems::movement::player_movement_system runs 140 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 40 over it, 1.40× 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: ghost_list::sets::optimization::find_scored_ghost_sets tools/ghost_list/src/sets/optimization.rs:13— FunctionTooLong — ghost_list::sets::optimization::find_scored_ghost_sets 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.
FunctionTooLong: unlight::prebake::prebake_lighting_field unlight/src/prebake.rs:23— FunctionTooLong — unlight::prebake::prebake_lighting_field 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: untmxmap::bevy::bevy_load_map untmxmap/src/bevy.rs:34— FunctionTooLong — untmxmap::bevy::bevy_load_map 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: unstd::picking::sprite_picking_backend::custom_sprite_picking unstd/src/picking/sprite_picking_backend.rs:138— FunctionTooLong — unstd::picking::sprite_picking_backend::custom_sprite_picking runs 119 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 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: unmapload::level_setup::load_level_handler unmapload/src/level_setup.rs:80— FunctionTooLong — unmapload::level_setup::load_level_handler runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: unfog::systems::spawn_miasma unfog/src/systems.rs:73— FunctionTooLong — unfog::systems::spawn_miasma runs 112 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 12 over it, 1.12× 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: unwalkie::walkie_play::walkie_talk unwalkie/src/walkie_play.rs:34— FunctionTooLong — unwalkie::walkie_play::walkie_talk runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: walkie_voice_generator::main tools/text_to_speech/walkie_voice_generator/src/main.rs:37— FunctionTooLong — walkie_voice_generator::main 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.
FunctionTooLong: untruck::systems::truck_ui_systems::hold_button_system untruck/src/systems/truck_ui_systems.rs:136— FunctionTooLong — untruck::systems::truck_ui_systems::hold_button_system 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.
+ 3 more in this group — see findings.md.
AC1 · Text alternatives· <object> without a text alternative · ×26
<object> without a text alternative assets/maps/unhaunter_spritesheet2.tsx:11— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_3x3x3.tsx:419— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:16— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:77— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:78— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:79— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:80— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:81— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:82— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:188— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:286— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:690— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:691— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetA_6x6x10.tsx:692— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:16— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:77— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:78— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:79— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:80— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:81— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:82— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:188— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:286— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:730— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<object> without a text alternative assets/maps/unhaunter_spritesheetB_6x6x10.tsx:731— A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
unwalkie::triggers::potential_id_prompt::potential_id_prompt_system (cognitive 105) unwalkie/src/triggers/potential_id_prompt.rs:18— unwalkie::triggers::potential_id_prompt::potential_id_prompt_system has cognitive complexity 105 (threshold 15). Drivers by points: if/else 26 (78 pts), loops 7 (27 pts) (nesting depth added 72). 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.
unwalkie::triggers::consumables_and_defense::trigger_sage_unused_defensively_during_hunt_system (cognitive 75) unwalkie/src/triggers/consumables_and_defense.rs:427— unwalkie::triggers::consumables_and_defense::trigger_sage_unused_defensively_during_hunt_system has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (65 pts), loops 2 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 52). 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.
unwalkie::triggers::evidence_gathering_logic::trigger_in_truck_with_evidence_no_journal_system (cognitive 63) unwalkie/src/triggers/evidence_gathering_logic.rs:341— unwalkie::triggers::evidence_gathering_logic::trigger_in_truck_with_evidence_no_journal_system has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (55 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 41). 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.
unwalkie::triggers::basic_gear_usage::trigger_did_not_switch_starting_gear_in_hotspot_system (cognitive 56) unwalkie/src/triggers/basic_gear_usage.rs:160— unwalkie::triggers::basic_gear_usage::trigger_did_not_switch_starting_gear_in_hotspot_system has cognitive complexity 56 (threshold 15). Drivers by points: if/else 32 (51 pts), boolean chains 3, match/switch 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::triggers::ghost_behavior_and_hunting::trigger_hunt_warning_no_player_evasion_system (cognitive 49) unwalkie/src/triggers/ghost_behavior_and_hunting.rs:17— unwalkie::triggers::ghost_behavior_and_hunting::trigger_hunt_warning_no_player_evasion_system has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (45 pts), boolean chains 3, loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
unwalkie::triggers::repellent_expulsion::trigger_repellent_exhausted_correct_type_system (cognitive 49) unwalkie/src/triggers/repellent_expulsion.rs:327— unwalkie::triggers::repellent_expulsion::trigger_repellent_exhausted_correct_type_system has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (44 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 30). 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.
unwalkie::triggers::basic_gear_usage::trigger_did_not_cycle_to_other_gear_system (cognitive 47) unwalkie/src/triggers/basic_gear_usage.rs:342— unwalkie::triggers::basic_gear_usage::trigger_did_not_cycle_to_other_gear_system has cognitive complexity 47 (threshold 15). Drivers by points: if/else 24 (40 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::triggers::mission_progression_and_truck::trigger_player_leaves_truck_without_changing_loadout_system (cognitive 43) unwalkie/src/triggers/mission_progression_and_truck.rs:61— unwalkie::triggers::mission_progression_and_truck::trigger_player_leaves_truck_without_changing_loadout_system has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 2 (6 pts), boolean chains 5 (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.
unwalkie::triggers::evidence_gathering_logic::trigger_evidence_confirmed_feedback_system (cognitive 41) unwalkie/src/triggers/evidence_gathering_logic.rs:439— unwalkie::triggers::evidence_gathering_logic::trigger_evidence_confirmed_feedback_system has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 2 (5 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
unwalkie::triggers::consumables_and_defense::trigger_sage_activated_ineffectively_system (cognitive 40) unwalkie/src/triggers/consumables_and_defense.rs:277— unwalkie::triggers::consumables_and_defense::trigger_sage_activated_ineffectively_system has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 5, 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.
unwalkie::triggers::basic_gear_usage::trigger_gear_selected_not_activated_system (cognitive 35) unwalkie/src/triggers/basic_gear_usage.rs:25— unwalkie::triggers::basic_gear_usage::trigger_gear_selected_not_activated_system has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::walkie_play::walkie_talk (cognitive 33) unwalkie/src/walkie_play.rs:34— unwalkie::walkie_play::walkie_talk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 3 (7 pts), match/switch 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::triggers::evidence_gathering_logic::trigger_journal_conflicting_evidence_system (cognitive 32) unwalkie/src/triggers/evidence_gathering_logic.rs:96— unwalkie::triggers::evidence_gathering_logic::trigger_journal_conflicting_evidence_system has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
unwalkie::triggers::repellent_feedback::repellent_feedback_trigger_system (cognitive 30) unwalkie/src/triggers/repellent_feedback.rs:24— unwalkie::triggers::repellent_feedback::repellent_feedback_trigger_system has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, loops 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::triggers::evidence_gathering_logic::trigger_clear_evidence_no_action_truck_system (cognitive 29) unwalkie/src/triggers/evidence_gathering_logic.rs:271— unwalkie::triggers::evidence_gathering_logic::trigger_clear_evidence_no_action_truck_system has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::triggers::player_wellbeing::trigger_sanity_dropped_due_to_ghost_system (cognitive 28) unwalkie/src/triggers/player_wellbeing.rs:188— unwalkie::triggers::player_wellbeing::trigger_sanity_dropped_due_to_ghost_system has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, loops 1 (2 pts), 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.
unwalkie::focus_ring_system::focus_ring_showcase_system (cognitive 27) unwalkie/src/focus_ring_system.rs:12— unwalkie::focus_ring_system::focus_ring_showcase_system has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (10 pts), match/switch 1 (2 pts) (nesting depth added 19). 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.
unwalkie::triggers::evidence_gathering_logic::trigger_clear_evidence_no_action_ckey_system (cognitive 27) unwalkie/src/triggers/evidence_gathering_logic.rs:188— unwalkie::triggers::evidence_gathering_logic::trigger_clear_evidence_no_action_ckey_system has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::triggers::repellent_expulsion::trigger_repellent_used_too_far_system (cognitive 25) unwalkie/src/triggers/repellent_expulsion.rs:135— unwalkie::triggers::repellent_expulsion::trigger_repellent_used_too_far_system has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (23 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.
unwalkie::triggers::repellent_expulsion::trigger_repellent_provokes_strong_reaction_system (cognitive 24) unwalkie/src/triggers/repellent_expulsion.rs:222— unwalkie::triggers::repellent_expulsion::trigger_repellent_provokes_strong_reaction_system has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7 (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.
unwalkie::triggers::locomotion_interaction::trigger_struggling_with_grab_drop (cognitive 23) unwalkie/src/triggers/locomotion_interaction.rs:224— unwalkie::triggers::locomotion_interaction::trigger_struggling_with_grab_drop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5 (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.
unwalkie::triggers::environmental_awareness::trigger_thermometer_non_freezing_fixation (cognitive 19) unwalkie/src/triggers/environmental_awareness.rs:198— unwalkie::triggers::environmental_awareness::trigger_thermometer_non_freezing_fixation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (19 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.
unwalkie::triggers::evidence_gathering_logic::trigger_emf_non_emf5_fixation_system (cognitive 19) unwalkie/src/triggers/evidence_gathering_logic.rs:24— unwalkie::triggers::evidence_gathering_logic::trigger_emf_non_emf5_fixation_system has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 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.
unwalkie::triggers::repellent_expulsion::trigger_ghost_expelled_player_lingers_system (cognitive 19) unwalkie/src/triggers/repellent_expulsion.rs:22— unwalkie::triggers::repellent_expulsion::trigger_ghost_expelled_player_lingers_system has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::triggers::truck_craft_prompt::trigger_almost_ready_to_craft_repellent_system (cognitive 19) unwalkie/src/triggers/truck_craft_prompt.rs:12— unwalkie::triggers::truck_craft_prompt::trigger_almost_ready_to_craft_repellent_system has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unwalkie::triggers::basic_gear_usage::trigger_did_not_switch_starting_gear_in_hotspot_system (cyclomatic 35) unwalkie/src/triggers/basic_gear_usage.rs:160— unwalkie::triggers::basic_gear_usage::trigger_did_not_switch_starting_gear_in_hotspot_system has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
unwalkie::triggers::potential_id_prompt::potential_id_prompt_system (cyclomatic 30) unwalkie/src/triggers/potential_id_prompt.rs:18— unwalkie::triggers::potential_id_prompt::potential_id_prompt_system 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.
unwalkie::triggers::basic_gear_usage::trigger_did_not_cycle_to_other_gear_system (cyclomatic 28) unwalkie/src/triggers/basic_gear_usage.rs:342— unwalkie::triggers::basic_gear_usage::trigger_did_not_cycle_to_other_gear_system 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.
unwalkie::triggers::basic_gear_usage::trigger_gear_selected_not_activated_system (cyclomatic 25) unwalkie/src/triggers/basic_gear_usage.rs:25— unwalkie::triggers::basic_gear_usage::trigger_gear_selected_not_activated_system 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.
unwalkie::triggers::consumables_and_defense::trigger_sage_activated_ineffectively_system (cyclomatic 25) unwalkie/src/triggers/consumables_and_defense.rs:277— unwalkie::triggers::consumables_and_defense::trigger_sage_activated_ineffectively_system 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.
unwalkie::triggers::ghost_behavior_and_hunting::trigger_hunt_warning_no_player_evasion_system (cyclomatic 24) unwalkie/src/triggers/ghost_behavior_and_hunting.rs:17— unwalkie::triggers::ghost_behavior_and_hunting::trigger_hunt_warning_no_player_evasion_system 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.
unwalkie::triggers::consumables_and_defense::trigger_sage_unused_defensively_during_hunt_system (cyclomatic 23) unwalkie/src/triggers/consumables_and_defense.rs:427— unwalkie::triggers::consumables_and_defense::trigger_sage_unused_defensively_during_hunt_system 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.
unwalkie::triggers::mission_progression_and_truck::trigger_player_leaves_truck_without_changing_loadout_system (cyclomatic 22) unwalkie/src/triggers/mission_progression_and_truck.rs:61— unwalkie::triggers::mission_progression_and_truck::trigger_player_leaves_truck_without_changing_loadout_system 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.
unwalkie::walkie_play::walkie_talk (cyclomatic 22) unwalkie/src/walkie_play.rs:34— unwalkie::walkie_play::walkie_talk 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.
unwalkie::triggers::evidence_gathering_logic::trigger_in_truck_with_evidence_no_journal_system (cyclomatic 21) unwalkie/src/triggers/evidence_gathering_logic.rs:341— unwalkie::triggers::evidence_gathering_logic::trigger_in_truck_with_evidence_no_journal_system 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.
unwalkie::triggers::evidence_gathering_logic::trigger_evidence_confirmed_feedback_system (cyclomatic 20) unwalkie/src/triggers/evidence_gathering_logic.rs:439— unwalkie::triggers::evidence_gathering_logic::trigger_evidence_confirmed_feedback_system 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.
unwalkie::triggers::repellent_expulsion::trigger_repellent_exhausted_correct_type_system (cyclomatic 20) unwalkie/src/triggers/repellent_expulsion.rs:327— unwalkie::triggers::repellent_expulsion::trigger_repellent_exhausted_correct_type_system 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.
unwalkie::triggers::repellent_expulsion::trigger_repellent_provokes_strong_reaction_system (cyclomatic 19) unwalkie/src/triggers/repellent_expulsion.rs:222— unwalkie::triggers::repellent_expulsion::trigger_repellent_provokes_strong_reaction_system 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.
unwalkie::triggers::evidence_gathering_logic::trigger_journal_conflicting_evidence_system (cyclomatic 17) unwalkie/src/triggers/evidence_gathering_logic.rs:96— unwalkie::triggers::evidence_gathering_logic::trigger_journal_conflicting_evidence_system 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.
unwalkie::triggers::player_wellbeing::trigger_sanity_dropped_due_to_ghost_system (cyclomatic 17) unwalkie/src/triggers/player_wellbeing.rs:188— unwalkie::triggers::player_wellbeing::trigger_sanity_dropped_due_to_ghost_system 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.
unwalkie::triggers::locomotion_interaction::trigger_struggling_with_grab_drop (cyclomatic 16) unwalkie/src/triggers/locomotion_interaction.rs:224— unwalkie::triggers::locomotion_interaction::trigger_struggling_with_grab_drop 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.
unwalkie::triggers::repellent_feedback::repellent_feedback_trigger_system (cyclomatic 16) unwalkie/src/triggers/repellent_feedback.rs:24— unwalkie::triggers::repellent_feedback::repellent_feedback_trigger_system 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.
TodoComment unwalkie/src/triggers/basic_gear_usage.rs:90— // TODO (David): Ensure all activatable evidence-gathering gear (e.g., UVTorch, RedTorch, Videocam) — 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 unwalkie/src/triggers/consumables_and_defense.rs:97— // TODO (David): Add `times_hunted_this_mission: u32` to `GhostSprite` struct — 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 unwalkie/src/triggers/evidence_gathering_logic.rs:157— // TODO: Add PlayerProfileData check here. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment unwalkie/src/triggers/evidence_gathering_logic.rs:481— // TODO: Add PlayerProfileData check here to limit hints for experienced players — 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 untruck/src/systems/journal_blinking_system.rs:110— // TODO: Clear seen_evidence_hints when mission ends - This will be handled by the new system — 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 untmxmap/src/bevy.rs:53— // TODO: Ideally we would prefer to preload, upscale by nearest to 2x or 4x, and — 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 unstd/src/picking/sprite_picking_backend.rs:264— // TODO: Add caching if performance becomes an issue — 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 unstd/src/manual/chapter1/page2.rs:33— // TODO: [F] and [G] keys are to be explained in chapter2. In there we should also explain [T] Swap hands, and the hiding mechanic. — 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 unlight/src/maplight.rs:396— // TODO: Account this from the player's perspective as the payer torch might — 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 ungearitems/src/components/quartz.rs:117— // TODO: Spwan here a red particle from the ghost that travels to the quartz .. — 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 ungearitems/src/components/thermometer.rs:96— // TODO: Add two thresholds: LO: -0.1 and HI: 5.1, with sound effects to notify + — 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 ungame/src/game_ui.rs:213— // TODO: For now disabling the held object UI because it will clash with the looking left gear function. — 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 ungame/src/game_ui.rs:421— // TODO: For now I'm disabling the Held Object UI - it will clash with Shift to look at the left gear. — 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 tools/ghost_list/src/sets/comparison.rs:66— // TODO: Implement overlap analysis. — 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 tools/ghost_list/src/sets/comparison.rs:137— // TODO: If optimize is true, could run some logic from `optimization.rs` — 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 tools/ghost_list/src/sets/mod.rs:27— // TODO: Add actual set testing logic — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tools/ghost_list/src/sets/optimization.rs:365— // TODO: Implement logic for other optimization commands: — 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.
unplayer::systems::movement::player_movement_system (cognitive 64) unplayer/src/systems/movement.rs:40— unplayer::systems::movement::player_movement_system has cognitive complexity 64 (threshold 15). Drivers by points: if/else 24 (56 pts), loops 3 (8 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unplayer::systems::grabdrop::retrieve_gear (cognitive 41) unplayer/src/systems/grabdrop.rs:259— unplayer::systems::grabdrop::retrieve_gear has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (37 pts), loops 2 (4 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
unplayer::systems::waypoint::waypoint_following_system (cognitive 36) unplayer/src/systems/waypoint.rs:189— unplayer::systems::waypoint::waypoint_following_system has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
unplayer::systems::pathfinding::find_path (cognitive 32) unplayer/src/systems/pathfinding.rs:133— unplayer::systems::pathfinding::find_path has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unplayer::systems::waypoint::waypoint_creation_system (cognitive 29) unplayer/src/systems/waypoint.rs:23— unplayer::systems::waypoint::waypoint_creation_system has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unplayer::systems::input::mouse_pathing::find_walkable_target (cognitive 27) unplayer/src/systems/input/mouse_pathing.rs:63— unplayer::systems::input::mouse_pathing::find_walkable_target has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (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.
unplayer::systems::input::mouse_interaction::mouse_hover_interactive_system (cognitive 26) unplayer/src/systems/input/mouse_interaction.rs:87— unplayer::systems::input::mouse_interaction::mouse_hover_interactive_system has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unplayer::systems::keyboard::stairs_player (cognitive 26) unplayer/src/systems/keyboard.rs:8— unplayer::systems::keyboard::stairs_player has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 5, match/switch 1 (2 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.
unplayer::systems::pathfinding::find_path_to_interactive (cognitive 24) unplayer/src/systems/pathfinding.rs:233— unplayer::systems::pathfinding::find_path_to_interactive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unplayer::systems::input::mouse_interaction::mouse_scroll_gear_system (cognitive 23) unplayer/src/systems/input/mouse_interaction.rs:39— unplayer::systems::input::mouse_interaction::mouse_scroll_gear_system has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), 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.
unplayer::systems::pathfinding::calculate_stair_waypoints (cognitive 23) unplayer/src/systems/pathfinding.rs:598— unplayer::systems::pathfinding::calculate_stair_waypoints has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
unplayer::systems::grabdrop::drop_object (cognitive 22) unplayer/src/systems/grabdrop.rs:105— unplayer::systems::grabdrop::drop_object has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
unplayer::systems::input::keyboard::keyboard_input_system (cognitive 22) unplayer/src/systems/input/keyboard.rs:18— unplayer::systems::input::keyboard::keyboard_input_system has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (5 pts) (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.
unplayer::systems::grabdrop::grab_object (cognitive 17) unplayer/src/systems/grabdrop.rs:23— unplayer::systems::grabdrop::grab_object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (15 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.
unplayer::systems::sanityhealth::lose_sanity (cognitive 17) unplayer/src/systems/sanityhealth.rs:23— unplayer::systems::sanityhealth::lose_sanity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unplayer::systems::pathfinding::get_neighbors_to_interactive (cognitive 16) unplayer/src/systems/pathfinding.rs:327— unplayer::systems::pathfinding::get_neighbors_to_interactive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 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.
untruck::journal::button_system (cognitive 140) untruck/src/journal.rs:64— untruck::journal::button_system has cognitive complexity 140 (threshold 15). Drivers by points: if/else 45 (116 pts), boolean chains 9, loops 6 (9 pts), match/switch 2 (6 pts) (nesting depth added 78). 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.
untruck::systems::truck_ui_systems::hold_button_system (cognitive 70) untruck/src/systems/truck_ui_systems.rs:136— untruck::systems::truck_ui_systems::hold_button_system has cognitive complexity 70 (threshold 15). Drivers by points: if/else 16 (54 pts), match/switch 2 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
untruck::loadoutui::button_clicked (cognitive 50) untruck/src/loadoutui.rs:393— untruck::loadoutui::button_clicked has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (45 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
untruck::loadoutui::update_loadout_buttons (cognitive 39) untruck/src/loadoutui.rs:253— untruck::loadoutui::update_loadout_buttons has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 6 (12 pts), boolean chains 4, loops 2 (nesting depth added 11). 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.
untruck::systems::journal_blinking_system::update_journal_ghost_blinking_system (cognitive 39) untruck/src/systems/journal_blinking_system.rs:147— untruck::systems::journal_blinking_system::update_journal_ghost_blinking_system has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (4 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
untruck::evidence::update_evidence_ui (cognitive 37) untruck/src/evidence.rs:13— untruck::evidence::update_evidence_ui has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (29 pts), loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
untruck::systems::journal_blinking_system::update_journal_button_blinking_system (cognitive 35) untruck/src/systems/journal_blinking_system.rs:28— untruck::systems::journal_blinking_system::update_journal_button_blinking_system has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 4 (6 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.
untruck::ui::update_tab_interactions (cognitive 34) untruck/src/ui.rs:355— untruck::ui::update_tab_interactions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, loops 4 (5 pts), 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.
untruck::systems::truck_ui_systems::truckui_event_handle (cognitive 28) untruck/src/systems/truck_ui_systems.rs:323— untruck::systems::truck_ui_systems::truckui_event_handle has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
untruck::evidence::keyboard_evidence (cognitive 25) untruck/src/evidence.rs:60— untruck::evidence::keyboard_evidence has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (4 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.
untruck::systems::truck_ui_systems::update_craft_button_text (cognitive 17) untruck/src/systems/truck_ui_systems.rs:421— untruck::systems::truck_ui_systems::update_craft_button_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ghost_list::sets::optimization::find_scored_ghost_sets (cognitive 111) tools/ghost_list/src/sets/optimization.rs:13— ghost_list::sets::optimization::find_scored_ghost_sets has cognitive complexity 111 (threshold 15). Drivers by points: if/else 28 (76 pts), loops 10 (31 pts), boolean chains 4 (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ghost_list::analysis::correlation::handle_correlation_command (cognitive 66) tools/ghost_list/src/analysis/correlation.rs:9— ghost_list::analysis::correlation::handle_correlation_command has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (47 pts), loops 5 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ghost_list::sets::comparison::perform_multi_set_overlap_analysis (cognitive 57) tools/ghost_list/src/sets/comparison.rs:405— ghost_list::sets::comparison::perform_multi_set_overlap_analysis has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (40 pts), loops 13 (17 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.
ghost_list::sets::comparison::perform_detailed_comparison (cognitive 40) tools/ghost_list/src/sets/comparison.rs:196— ghost_list::sets::comparison::perform_detailed_comparison has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 6 (9 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ghost_list::sets::analyze_set (cognitive 32) tools/ghost_list/src/sets/mod.rs:55— ghost_list::sets::analyze_set has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 6 (12 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.
ghost_list::analysis::combinations::handle_unique_combinations_command (cognitive 23) tools/ghost_list/src/analysis/combinations.rs:12— ghost_list::analysis::combinations::handle_unique_combinations_command has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (7 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.
ghost_list::analysis::conflicts::analyze_all_conflicts (cognitive 18) tools/ghost_list/src/analysis/conflicts.rs:98— ghost_list::analysis::conflicts::analyze_all_conflicts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ghost_list::analysis::stats::show_stats (cognitive 17) tools/ghost_list/src/analysis/stats.rs:7— ghost_list::analysis::stats::show_stats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ghost_list::sets::optimization::handle_tutorial_set_command (cognitive 16) tools/ghost_list/src/sets/optimization.rs:629— ghost_list::sets::optimization::handle_tutorial_set_command has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Duplicated block (8 lines × 2) uncoremenu/src/templates.rs:350— uncoremenu/src/templates.rs:350-357 | uncoremenu/src/templates.rs:370-377 — both copies are in the same file, so extract the 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 `uncoremenu/src/templates.rs:350` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (8 lines × 2) uncoremenu/src/templates.rs:435— uncoremenu/src/templates.rs:435-442 | unstd/src/manual/utils.rs:119-128 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `uncoremenu/src/templates.rs:435` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `unstd/src/manual/utils.rs:118` calls `insert`, `BackgroundColor`, `with_alpha` and `uncoremenu/src/templates.rs:434` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 2) unfog/src/systems.rs:395— unfog/src/systems.rs:395-402 | ungearitems/src/components/thermometer.rs:348-355 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `unfog/src/systems.rs:395` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) ungame/src/gear_ui.rs:54— ungame/src/gear_ui.rs:54-61 | ungame/src/gear_ui.rs:123-130 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ungame/src/gear_ui.rs:54` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) ungame/src/pause_ui.rs:90— ungame/src/pause_ui.rs:90-97 | unnpc/src/npchelp.rs:101-110 — before extracting anything, compare `ungame/src/pause_ui.rs` and `unnpc/src/npchelp.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ungame/src/pause_ui.rs:90` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) unplayer/src/systems/keyboard.rs:31— unplayer/src/systems/keyboard.rs:31-38 | unplayer/src/systems/keyboard.rs:47-54 — both copies are in the same file, so extract the 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 `unplayer/src/systems/keyboard.rs:31` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) ungearitems/src/components/recorder.rs:133— ungearitems/src/components/recorder.rs:133-141 | ungearitems/src/components/spiritbox.rs:147-154 — before extracting anything, compare `ungearitems/src/components/recorder.rs` and `ungearitems/src/components/spiritbox.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) ungame/src/gear_ui.rs:32— ungame/src/gear_ui.rs:32-39 | ungame/src/gear_ui.rs:145-152 — both copies are in the same file, so extract the 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 `ungame/src/gear_ui.rs:32` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
untruck::journal::button_system (cyclomatic 59) untruck/src/journal.rs:64— untruck::journal::button_system has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
untruck::loadoutui::update_loadout_buttons (cyclomatic 28) untruck/src/loadoutui.rs:253— untruck::loadoutui::update_loadout_buttons has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
untruck::systems::truck_ui_systems::hold_button_system (cyclomatic 25) untruck/src/systems/truck_ui_systems.rs:136— untruck::systems::truck_ui_systems::hold_button_system 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.
untruck::ui::update_tab_interactions (cyclomatic 21) untruck/src/ui.rs:355— untruck::ui::update_tab_interactions 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.
untruck::loadoutui::button_clicked (cyclomatic 19) untruck/src/loadoutui.rs:393— untruck::loadoutui::button_clicked 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.
untruck::systems::journal_blinking_system::update_journal_button_blinking_system (cyclomatic 19) untruck/src/systems/journal_blinking_system.rs:28— untruck::systems::journal_blinking_system::update_journal_button_blinking_system 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.
untruck::systems::journal_blinking_system::update_journal_ghost_blinking_system (cyclomatic 19) untruck/src/systems/journal_blinking_system.rs:147— untruck::systems::journal_blinking_system::update_journal_ghost_blinking_system 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.
unlight::maplight::apply_lighting (cognitive 231) unlight/src/maplight.rs:220— unlight::maplight::apply_lighting has cognitive complexity 231 (threshold 15). Drivers by points: if/else 72 (180 pts), loops 18 (35 pts), match/switch 5 (11 pts), boolean chains 5 (nesting depth added 131). 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.
unlight::utils::propagate_from_wave_edges (cognitive 65) unlight/src/utils.rs:253— unlight::utils::propagate_from_wave_edges has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (54 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (3 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.
unlight::maplight::compute_visibility (cognitive 57) unlight/src/maplight.rs:67— unlight::maplight::compute_visibility has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (45 pts), boolean chains 5, match/switch 1 (4 pts), loops 2 (3 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.
unlight::prebake::prebake_lighting_field (cognitive 38) unlight/src/prebake.rs:23— unlight::prebake::prebake_lighting_field has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unlight::lighting::apply_ambient_light_to_walls (cognitive 29) unlight/src/lighting.rs:162— unlight::lighting::apply_ambient_light_to_walls has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 pts), match/switch 1 (3 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.
unlight::prebake::prebake_propagation_data (cognitive 21) unlight/src/prebake.rs:258— unlight::prebake::prebake_propagation_data has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unlight::utils::has_active_light_nearby (cognitive 19) unlight/src/utils.rs:27— unlight::utils::has_active_light_nearby has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×7
Duplicated block (10 lines × 2) tools/ghost_list/src/analysis/correlation.rs:143— tools/ghost_list/src/analysis/correlation.rs:143-152 | tools/ghost_list/src/analysis/correlation.rs:154-163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/analysis/correlation.rs:143` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) ungame/src/pause_ui.rs:73— ungame/src/pause_ui.rs:73-82 | unnpc/src/npchelp.rs:84-93 — before extracting anything, compare `ungame/src/pause_ui.rs` and `unnpc/src/npchelp.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ungame/src/pause_ui.rs:73` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `unnpc/src/npchelp.rs:82` calls `all`, `Px` and `ungame/src/pause_ui.rs:71` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) unlight/src/lighting.rs:195— unlight/src/lighting.rs:195-204 | unlight/src/utils.rs:38-47 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) unmapload/src/sprite_db.rs:69— unmapload/src/sprite_db.rs:69-78 | unmapload/src/sprite_db.rs:93-102 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) unsummary/src/summary.rs:364— unsummary/src/summary.rs:364-373 | unsummary/src/summary.rs:376-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. Read the line range as the matched WINDOW rather than a finished unit: at `unsummary/src/summary.rs:364` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) untruck/src/loadoutui.rs:104— untruck/src/loadoutui.rs:104-113 | untruck/src/loadoutui.rs:149-158 — both copies are in the same file, so extract the 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 `untruck/src/loadoutui.rs:104` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) tools/ghost_list/src/filtering/evidence_parser.rs:4— tools/ghost_list/src/filtering/evidence_parser.rs:4-13 | tools/ghost_list/src/utils/ghost_parser.rs:4-13 — 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.
Off the main sequence: unsettings — unsettings: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 12 project(s), so it's rigid to change.
Off the main sequence: unwalkie_types — unwalkie_types: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: uncore — uncore: abstractness 0.01, instability 0.04, distance 0.95 — zone of pain — concrete and depended on by 23 project(s), so it's rigid to change.
Off the main sequence: unprofile — unprofile: abstractness 0.00, instability 0.08, distance 0.92 — zone of pain — concrete and depended on by 11 project(s), so it's rigid to change.
Off the main sequence: unstd — unstd: abstractness 0.00, instability 0.08, distance 0.92 — zone of pain — concrete and depended on by 11 project(s), so it's rigid to change.
Off the main sequence: uncoremenu — uncoremenu: abstractness 0.00, instability 0.29, distance 0.71 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
Off the main sequence: ungearitems — ungearitems: abstractness 0.07, instability 0.22, distance 0.71 — zone of pain — concrete and depended on by 7 project(s), so it's rigid to change.
ungame::systems::hint_ui_system::hint_ui_event_and_animation_system (cognitive 34) ungame/src/systems/hint_ui_system.rs:92— ungame::systems::hint_ui_system::hint_ui_event_and_animation_system has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ungame::object_charge::check_ghost_proximity (cognitive 26) ungame/src/object_charge.rs:40— ungame::object_charge::check_ghost_proximity has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ungame::systems::game_systems::keyboard (cognitive 25) ungame/src/systems/game_systems.rs:58— ungame::systems::game_systems::keyboard has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ungame::game_ui::toggle_held_object_ui (cognitive 24) ungame/src/game_ui.rs:404— ungame::game_ui::toggle_held_object_ui has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (12 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ungame::systems::hint_acknowledge_system::acknowledge_blinking_gear_hint_system (cognitive 24) ungame/src/systems/hint_acknowledge_system.rs:11— ungame::systems::hint_acknowledge_system::acknowledge_blinking_gear_hint_system has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 1 (3 pts), 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.
ungame::systems::game_systems::keyboard_floor_switch (cognitive 21) ungame/src/systems/game_systems.rs:142— ungame::systems::game_systems::keyboard_floor_switch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
unstd::picking::sprite_picking_backend::pixel_perfect_hit_test (cognitive 32) unstd/src/picking/sprite_picking_backend.rs:337— unstd::picking::sprite_picking_backend::pixel_perfect_hit_test has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unstd::picking::sprite_picking_backend::custom_sprite_picking (cognitive 22) unstd/src/picking/sprite_picking_backend.rs:138— unstd::picking::sprite_picking_backend::custom_sprite_picking has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unstd::manual::preplay_manual_ui::manual_button_system (cognitive 21) unstd/src/manual/preplay_manual_ui.rs:102— unstd::manual::preplay_manual_ui::manual_button_system has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unstd::manual::utils::grid_img_text2 (cognitive 20) unstd/src/manual/utils.rs:13— unstd::manual::utils::grid_img_text2 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (9 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.
unstd::manual::user_manual_ui::user_manual_system (cognitive 19) unstd/src/manual/user_manual_ui.rs:152— unstd::manual::user_manual_ui::user_manual_system has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 1 (5 pts), loops 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.
unstd::manual::preplay_manual_ui::preplay_manual_system (cognitive 16) unstd/src/manual/preplay_manual_ui.rs:49— unstd::manual::preplay_manual_ui::preplay_manual_system has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), 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.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×6
Duplicated block (13 lines × 2) tools/ghost_list/src/sets/optimization.rs:268— tools/ghost_list/src/sets/optimization.rs:268-280 | uncore/src/utils/ghost_setfinder.rs:180-192 — before extracting anything, compare `tools/ghost_list/src/sets/optimization.rs` and `uncore/src/utils/ghost_setfinder.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) uncoremenu/src/templates.rs:53— uncoremenu/src/templates.rs:53-65 | uncoremenu/src/templates.rs:398-410 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `uncoremenu/src/templates.rs:53` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (13 lines × 2) unghost/src/ghost.rs:804— unghost/src/ghost.rs:804-816 | unghost/src/ghost.rs:823-835 — both copies are in the same file, so extract the block into 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) unplayer/src/systems/input/mouse_interaction.rs:96— unplayer/src/systems/input/mouse_interaction.rs:96-108 | unplayer/src/systems/input/mouse_interaction.rs:190-202 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) unwalkie/src/triggers/player_wellbeing.rs:47— unwalkie/src/triggers/player_wellbeing.rs:47-59 | unwalkie/src/triggers/player_wellbeing.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. Read the line range as the matched WINDOW rather than a finished unit: at `unwalkie/src/triggers/player_wellbeing.rs:47` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) untruck/src/sanity.rs:38— untruck/src/sanity.rs:38-50 | untruck/src/sensors.rs:35-47 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) tools/ghost_list/src/sets/completion.rs:21— tools/ghost_list/src/sets/completion.rs:21-29 | tools/ghost_list/src/sets/validation.rs:89-97 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/sets/completion.rs:21` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) uncoremenu/src/scrollbar.rs:367— uncoremenu/src/scrollbar.rs:367-375 | uncoremenu/src/scrollbar.rs:443-451 — both copies are in the same file, so extract the 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 `uncoremenu/src/scrollbar.rs:367` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (9 lines × 2) uncoremenu/src/templates.rs:269— uncoremenu/src/templates.rs:269-277 | uncoremenu/src/templates.rs:317-325 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `uncoremenu/src/templates.rs:269` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) uncoremenu/src/templates.rs:433— uncoremenu/src/templates.rs:433-441 | uncoremenu/src/templates.rs:453-462 — both copies are in the same file, so extract the 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 `uncoremenu/src/templates.rs:433` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) unmapload/src/selection.rs:195— unmapload/src/selection.rs:195-203 | unmapload/src/selection.rs:226-234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unmapload/src/selection.rs:195` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) untruck/src/evidence.rs:26— untruck/src/evidence.rs:26-34 | untruck/src/loadoutui.rs:342-350 — 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.
ghost_list::sets::optimization::find_scored_ghost_sets (cyclomatic 37) tools/ghost_list/src/sets/optimization.rs:13— ghost_list::sets::optimization::find_scored_ghost_sets has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ghost_list::sets::comparison::perform_multi_set_overlap_analysis (cyclomatic 31) tools/ghost_list/src/sets/comparison.rs:405— ghost_list::sets::comparison::perform_multi_set_overlap_analysis 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.
ghost_list::analysis::correlation::handle_correlation_command (cyclomatic 26) tools/ghost_list/src/analysis/correlation.rs:9— ghost_list::analysis::correlation::handle_correlation_command 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.
ghost_list::sets::comparison::perform_detailed_comparison (cyclomatic 20) tools/ghost_list/src/sets/comparison.rs:196— ghost_list::sets::comparison::perform_detailed_comparison 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.
ghost_list::sets::analyze_set (cyclomatic 16) tools/ghost_list/src/sets/mod.rs:55— ghost_list::sets::analyze_set 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.
unghost::ghost::ghost_movement (cognitive 125) unghost/src/ghost.rs:59— unghost::ghost::ghost_movement has cognitive complexity 125 (threshold 15). Drivers by points: if/else 35 (108 pts), loops 3 (9 pts), boolean chains 8 (nesting depth added 79). 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.
unghost::ghost::ghost_enrage (cognitive 90) unghost/src/ghost.rs:366— unghost::ghost::ghost_enrage has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (72 pts), loops 5 (12 pts), boolean chains 6 (nesting depth added 51). 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.
unghost::ghost_events::trigger_ghost_events (cognitive 57) unghost/src/ghost_events.rs:23— unghost::ghost_events::trigger_ghost_events has cognitive complexity 57 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 3 (11 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unghost::ghost_orb::update_ghost_orb_particles (cognitive 30) unghost/src/ghost_orb.rs:87— unghost::ghost_orb::update_ghost_orb_particles has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
unghost::ghost::ghost_fade_out_system (cognitive 19) unghost/src/ghost.rs:696— unghost::ghost::ghost_fade_out_system has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 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.
unmapload::selection::select_influence_objects (cognitive 105) unmapload/src/selection.rs:53— unmapload::selection::select_influence_objects has cognitive complexity 105 (threshold 15). Drivers by points: if/else 19 (68 pts), loops 10 (36 pts), boolean chains 1 (nesting depth added 75). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
unmapload::level_finalization::after_level_ready (cognitive 62) unmapload/src/level_finalization.rs:40— unmapload::level_finalization::after_level_ready has cognitive complexity 62 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 9 (21 pts), boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unmapload::level_setup::load_level_handler (cognitive 19) unmapload/src/level_setup.rs:80— unmapload::level_setup::load_level_handler has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 6 (8 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unmapload::selection::generate_scored_ghost_setup (cognitive 19) unmapload/src/selection.rs:344— unmapload::selection::generate_scored_ghost_setup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (8 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.
unmapload::influence_system::assign_ghost_influence_system (cognitive 17) unmapload/src/influence_system.rs:28— unmapload::influence_system::assign_ghost_influence_system has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 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.
ungearitems::components::thermometer::temperature_update (cognitive 78) ungearitems/src/components/thermometer.rs:228— ungearitems::components::thermometer::temperature_update has cognitive complexity 78 (threshold 15). Drivers by points: if/else 21 (45 pts), loops 8 (15 pts), boolean chains 11, match/switch 4 (7 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ungearitems::components::repellentflask::repellent_update (cognitive 52) ungearitems/src/components/repellentflask.rs:176— ungearitems::components::repellentflask::repellent_update has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (37 pts), loops 9 (14 pts), boolean chains 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.
ungearitems::components::recorder::sound_update (cognitive 21) ungearitems/src/components/recorder.rs:286— ungearitems::components::recorder::sound_update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (8 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.
ungearitems::components::quartz::update_quartz_and_ghost (cognitive 16) ungearitems/src/components/quartz.rs:128— ungearitems::components::quartz::update_quartz_and_ghost has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (5 pts) (nesting depth added 9). 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.
ungearitems::components::sage::sage_smoke_system (cognitive 16) ungearitems/src/components/sage.rs:159— ungearitems::components::sage::sage_smoke_system has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 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.
walkie_voice_generator::codegen::generate_rust_code (cognitive 48) tools/text_to_speech/walkie_voice_generator/src/codegen.rs:24— walkie_voice_generator::codegen::generate_rust_code has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 8 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
walkie_voice_generator::main (cognitive 44) tools/text_to_speech/walkie_voice_generator/src/main.rs:37— walkie_voice_generator::main has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 2 (4 pts), match/switch 2, boolean chains 1 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
walkie_voice_generator::file_processing::cleanup_unused_files (cognitive 30) tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:205— walkie_voice_generator::file_processing::cleanup_unused_files has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
walkie_voice_generator::file_processing::process_audio_generation_task (cognitive 22) tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:442— walkie_voice_generator::file_processing::process_audio_generation_task has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (walkie_voice_generator::file_processing::process_audio_generation_task_single_thread) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
walkie_voice_generator::file_processing::process_audio_generation_task_single_thread (cognitive 22) tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:586— walkie_voice_generator::file_processing::process_audio_generation_task_single_thread has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (walkie_voice_generator::file_processing::process_audio_generation_task) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
FileTooLong: src/maplight.rs unlight/src/maplight.rs— FileTooLong — 756 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 256 over it, 1.51× 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/unified_mission_selection.rs uncampaign/src/unified_mission_selection.rs— FileTooLong — 630 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 130 over it, 1.26× 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/ghost.rs unghost/src/ghost.rs— FileTooLong — 600 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 100 over it, 1.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: sets/optimization.rs tools/ghost_list/src/sets/optimization.rs— FileTooLong — 570 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 70 over it, 1.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/summary.rs unsummary/src/summary.rs— FileTooLong — 535 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 35 over it, 1.07× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Duplicated block (11 lines × 2) tools/ghost_list/src/sets/optimization.rs:99— tools/ghost_list/src/sets/optimization.rs:99-109 | uncore/src/utils/ghost_setfinder.rs:40-50 — before extracting anything, compare `tools/ghost_list/src/sets/optimization.rs` and `uncore/src/utils/ghost_setfinder.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/sets/optimization.rs:99` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11 lines × 2) ungame/src/game_ui.rs:239— ungame/src/game_ui.rs:239-249 | unsummary/src/summary.rs:131-141 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `ungame/src/game_ui.rs:239` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `ungame/src/game_ui.rs:237` calls `insert` and `unsummary/src/summary.rs:130` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 2) ungame/src/gear_ui.rs:16— ungame/src/gear_ui.rs:16-26 | ungame/src/gear_ui.rs:85-95 — both copies are in the same file, so extract the 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 `ungame/src/gear_ui.rs:16` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) ungearitems/src/components/ionmeter.rs:51— ungearitems/src/components/ionmeter.rs:51-61 | ungearitems/src/components/motionsensor.rs:48-58 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind `_gs` to `&mut GearStuff` in one and `&mut super::GearStuff` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (11 lines × 2) ungearitems/src/components/redtorch.rs:97— ungearitems/src/components/redtorch.rs:97-107 | ungearitems/src/components/uvtorch.rs:145-155 — before extracting anything, compare `ungearitems/src/components/redtorch.rs` and `ungearitems/src/components/uvtorch.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
unlight::maplight::apply_lighting (cyclomatic 101) unlight/src/maplight.rs:220— unlight::maplight::apply_lighting has cyclomatic complexity 101 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
unlight::utils::propagate_from_wave_edges (cyclomatic 28) unlight/src/utils.rs:253— unlight::utils::propagate_from_wave_edges 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.
unlight::maplight::compute_visibility (cyclomatic 22) unlight/src/maplight.rs:67— unlight::maplight::compute_visibility 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.
unlight::prebake::prebake_lighting_field (cyclomatic 18) unlight/src/prebake.rs:23— unlight::prebake::prebake_lighting_field 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.
uncore::utils::ghost_setfinder::find_and_score_ghost_sets (cognitive 88) uncore/src/utils/ghost_setfinder.rs:11— uncore::utils::ghost_setfinder::find_and_score_ghost_sets has cognitive complexity 88 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 10 (28 pts), boolean chains 5 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uncore::assets::tmxmap::naive_tmx_loader (cognitive 29) uncore/src/assets/tmxmap.rs:279— uncore::assets::tmxmap::naive_tmx_loader has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uncore::systems::board::sync_map_entity_field (cognitive 27) uncore/src/systems/board.rs:16— uncore::systems::board::sync_map_entity_field has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 4 (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.
uncore::systems::evidence_decay::decay_evidence_clarity_system (cognitive 19) uncore/src/systems/evidence_decay.rs:9— uncore::systems::evidence_decay::decay_evidence_clarity_system has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
uncoremenu::scrollbar::update_scrollbar (cognitive 83) uncoremenu/src/scrollbar.rs:138— uncoremenu::scrollbar::update_scrollbar has cognitive complexity 83 (threshold 15). Drivers by points: if/else 22 (72 pts), match/switch 2 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 56). 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.
uncoremenu::scrollbar::handle_scrollbar_interactions (cognitive 35) uncoremenu/src/scrollbar.rs:276— uncoremenu::scrollbar::handle_scrollbar_interactions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 1 (nesting depth added 19). 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.
uncoremenu::systems::update_menu_item_visuals (cognitive 32) uncoremenu/src/systems.rs:134— uncoremenu::systems::update_menu_item_visuals has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 19). 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.
uncoremenu::scrollbar::ensure_selected_item_visible (cognitive 21) uncoremenu/src/scrollbar.rs:38— uncoremenu::scrollbar::ensure_selected_item_visible has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×4
Members sharing a duplicated core (4 members, 50+ identical tokens) ungearitems/src/components/emfmeter.rs:170— ungearitems/src/components/emfmeter.rs:170-276 | ungearitems/src/components/redtorch.rs:133-158 | ungearitems/src/components/spiritbox.rs:141-258 | ungearitems/src/components/uvtorch.rs:99-126 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) ungearitems/src/components/emfmeter.rs:170— ungearitems/src/components/emfmeter.rs:170-276 | ungearitems/src/components/recorder.rs:126-232 | ungearitems/src/components/spiritbox.rs:141-258 | ungearitems/src/components/thermometer.rs:95-159 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) ungearitems/src/components/geigercounter.rs:237— ungearitems/src/components/geigercounter.rs:237-250 | ungearitems/src/components/redtorch.rs:117-131 | ungearitems/src/components/uvtorch.rs:161-175 | ungearitems/src/components/videocam.rs:95-109 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) unmaphub/src/difficulty_selection.rs:237— unmaphub/src/difficulty_selection.rs:237-354 | unmenusettings/src/menu_ui.rs:29-134 | unmenusettings/src/systems.rs:183-287 | unmenusettings/src/systems.rs:341-446 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×4
Edited copy of a member (6 corresponding lines) tools/ghost_radio/src/main.rs:94— tools/ghost_radio/src/main.rs:94-99 | tools/ghost_radio/src/main.rs:101-109 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) uncore/src/components/board/boardposition.rs:220— uncore/src/components/board/boardposition.rs:220-225 | uncore/src/components/board/boardposition.rs:227-232 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) uncore/src/components/board/boardposition.rs:234— uncore/src/components/board/boardposition.rs:234-239 | uncore/src/components/board/position.rs:131-136 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) unstd/src/manual/chapter1/mod.rs:7— unstd/src/manual/chapter1/mod.rs:7-16 | unstd/src/manual/chapter2/mod.rs:6-11 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (19 lines × 2) uncampaign/src/unified_mission_selection.rs:780— uncampaign/src/unified_mission_selection.rs:780-798 | uncampaign/src/unified_mission_selection.rs:861-879 — both copies are in the same file, so extract the 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 `uncampaign/src/unified_mission_selection.rs:780` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19 lines × 2) unplayer/src/systems/pathfinding.rs:73— unplayer/src/systems/pathfinding.rs:73-91 | unplayer/src/systems/pathfinding.rs:333-351 — both copies are in the same file, so extract the 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 `unplayer/src/systems/pathfinding.rs:73` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19 lines × 2) unplayer/src/systems/waypoint.rs:419— unplayer/src/systems/waypoint.rs:419-437 | unplayer/src/systems/waypoint.rs:493-511 — both copies are in the same file, so extract the 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 `unplayer/src/systems/waypoint.rs:419` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19 lines × 2) unstd/src/manual/preplay_manual_ui.rs:233— unstd/src/manual/preplay_manual_ui.rs:233-251 | unstd/src/manual/user_manual_ui.rs:132-150 — before extracting anything, compare `unstd/src/manual/preplay_manual_ui.rs` and `unstd/src/manual/user_manual_ui.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `unstd/src/manual/preplay_manual_ui.rs:233` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) ungame/src/pause_ui.rs:44— ungame/src/pause_ui.rs:44-60 | unnpc/src/npchelp.rs:54-70 — before extracting anything, compare `ungame/src/pause_ui.rs` and `unnpc/src/npchelp.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ungame/src/pause_ui.rs:44` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) ungearitems/src/components/redtorch.rs:135— ungearitems/src/components/redtorch.rs:135-151 | ungearitems/src/components/uvtorch.rs:101-117 — before extracting anything, compare `ungearitems/src/components/redtorch.rs` and `ungearitems/src/components/uvtorch.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) unmaphub/src/difficulty_selection.rs:102— unmaphub/src/difficulty_selection.rs:102-118 | unmaphub/src/difficulty_selection.rs:165-181 — both copies are in the same file, so extract the 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 `unmaphub/src/difficulty_selection.rs:102` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) unwalkie/src/triggers/repellent_expulsion.rs:157— unwalkie/src/triggers/repellent_expulsion.rs:157-173 | unwalkie/src/triggers/repellent_expulsion.rs:254-270 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unwalkie/src/triggers/repellent_expulsion.rs:157` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (12 lines × 2) unwalkie/src/triggers/base1.rs:41— unwalkie/src/triggers/base1.rs:41-52 | unwalkie/src/triggers/base1.rs:90-101 — both copies are in the same file, so extract the 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 `unwalkie/src/triggers/base1.rs:41` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) untruck/src/journalui.rs:96— untruck/src/journalui.rs:96-107 | untruck/src/journalui.rs:179-190 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `untruck/src/journalui.rs:96` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) tools/ghost_list/src/analysis/correlation.rs:85— tools/ghost_list/src/analysis/correlation.rs:85-96 | tools/ghost_list/src/analysis/correlation.rs:99-110 — both copies are in the same file, so extract the 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 `tools/ghost_list/src/analysis/correlation.rs:85` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) untmxmap/src/bevy.rs:275— untmxmap/src/bevy.rs:275-286 | untmxmap/src/bevy.rs:291-302 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `untmxmap/src/bevy.rs:275` 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.
unghost::ghost::ghost_movement (cyclomatic 42) unghost/src/ghost.rs:59— unghost::ghost::ghost_movement has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
unghost::ghost::ghost_enrage (cyclomatic 39) unghost/src/ghost.rs:366— unghost::ghost::ghost_enrage has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
unghost::ghost_events::trigger_ghost_events (cyclomatic 17) unghost/src/ghost_events.rs:23— unghost::ghost_events::trigger_ghost_events 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.
uncampaign::unified_mission_selection::setup_ui (cognitive 37) uncampaign/src/unified_mission_selection.rs:314— uncampaign::unified_mission_selection::setup_ui has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 7, loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
uncampaign::unified_mission_selection::handle_selection_input (cognitive 32) uncampaign/src/unified_mission_selection.rs:106— uncampaign::unified_mission_selection::handle_selection_input has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 4 (9 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.
uncampaign::unified_mission_selection::update_mission_selection (cognitive 21) uncampaign/src/unified_mission_selection.rs:237— uncampaign::unified_mission_selection::update_mission_selection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (4 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.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×3
Duplicated block (15–16 lines × 2) ungearitems/src/components/emfmeter.rs:124— ungearitems/src/components/emfmeter.rs:124-139 | ungearitems/src/components/geigercounter.rs:82-96 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `ungearitems/src/components/emfmeter.rs:124` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15–16 lines × 2) ungearitems/src/components/recorder.rs:259— ungearitems/src/components/recorder.rs:259-274 | ungearitems/src/components/spiritbox.rs:267-281 — before extracting anything, compare `ungearitems/src/components/recorder.rs` and `ungearitems/src/components/spiritbox.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ungearitems/src/components/recorder.rs:259` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15–16 lines × 2) unlight/src/prebake.rs:126— unlight/src/prebake.rs:126-140 | unlight/src/utils.rs:363-378 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind `bf` to `&mut BoardData` in one and `&BoardData` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (14 lines × 2) ungame/src/systems/game_systems.rs:43— ungame/src/systems/game_systems.rs:43-56 | unmenusettings/src/menu_ui.rs:143-156 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (14 lines × 2) unstd/src/manual/preplay_manual_ui.rs:136— unstd/src/manual/preplay_manual_ui.rs:136-149 | unstd/src/manual/user_manual_ui.rs:23-36 — before extracting anything, compare `unstd/src/manual/preplay_manual_ui.rs` and `unstd/src/manual/user_manual_ui.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `unstd/src/manual/preplay_manual_ui.rs:136` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) unstd/src/manual/user_manual_ui.rs:55— unstd/src/manual/user_manual_ui.rs:55-68 | unstd/src/manual/user_manual_ui.rs:69-82 — both copies are in the same file, so extract the 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 `unstd/src/manual/user_manual_ui.rs:55` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (9 lines × 4) unmaphub/src/difficulty_selection.rs:273— unmaphub/src/difficulty_selection.rs:273-281 | unmenusettings/src/menu_ui.rs:76-84 | unmenusettings/src/systems.rs:236-244 | unmenusettings/src/systems.rs:395-403 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `unmaphub/src/difficulty_selection.rs:273` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `unmaphub/src/difficulty_selection.rs:282` calls `right`, `Px` and `unmenusettings/src/menu_ui.rs:85` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 4) unsummary/src/summary.rs:243— unsummary/src/summary.rs:243-251 | unsummary/src/summary.rs:287-295 | unsummary/src/summary.rs:343-351 | unsummary/src/summary.rs:397-405 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unsummary/src/summary.rs:243` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 4) ungearitems/src/components/emfmeter.rs:267— ungearitems/src/components/emfmeter.rs:267-275 | ungearitems/src/components/redtorch.rs:149-157 | ungearitems/src/components/spiritbox.rs:162-170 | ungearitems/src/components/uvtorch.rs:115-123 — before extracting anything, compare `ungearitems/src/components/redtorch.rs` and `ungearitems/src/components/uvtorch.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ungearitems/src/components/emfmeter.rs:267` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `gs` to `&mut GearStuff` in one and `&mut super::GearStuff` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 2) uncoremenu/src/templates.rs:227— uncoremenu/src/templates.rs:227-233 | uncoremenu/src/templates.rs:252-258 — both copies are in the same file, so extract the 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 `uncoremenu/src/templates.rs:227` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) unwalkie/src/triggers/player_wellbeing.rs:39— unwalkie/src/triggers/player_wellbeing.rs:39-45 | unwalkie/src/triggers/player_wellbeing.rs:77-83 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) uncore/src/resources/walkie.rs:87— uncore/src/resources/walkie.rs:87-93 | unwalkiecore/src/resources.rs:167-173 — 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) tools/ghost_list/src/export/table.rs:7— tools/ghost_list/src/export/table.rs:7-11 | tools/ghost_list/src/sets/completion.rs:89-93 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/export/table.rs:7` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) uncore/src/behavior/mod.rs:700— uncore/src/behavior/mod.rs:700-704 | uncore/src/behavior/mod.rs:706-710 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (5 lines × 2) tools/text_to_speech/walkie_voice_generator/src/codegen.rs:245— tools/text_to_speech/walkie_voice_generator/src/codegen.rs:245-254 | tools/text_to_speech/walkie_voice_generator/src/codegen.rs:270-274 — both copies are in the same file, so extract the 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 `tools/text_to_speech/walkie_voice_generator/src/codegen.rs:245` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
IC1 · Incompleteness & stubs· Empty method body · ×3
Empty method body — does nothing with its inputs tools/ghost_radio/src/console_ui.rs:23— `display_ghost_response` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Empty method body — does nothing with its inputs unstd/src/plugins/root.rs:234— `app_setup` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Empty method body — does nothing with its inputs unwalkie/src/triggers/tutorial_specific.rs:3— `app_setup` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
unfog::systems::update_miasma (cyclomatic 48) unfog/src/systems.rs:295— unfog::systems::update_miasma has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
unfog::systems::spawn_miasma (cyclomatic 18) unfog/src/systems.rs:73— unfog::systems::spawn_miasma 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.
ungearitems::components::thermometer::temperature_update (cyclomatic 45) ungearitems/src/components/thermometer.rs:228— ungearitems::components::thermometer::temperature_update has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ungearitems::components::repellentflask::repellent_update (cyclomatic 26) ungearitems/src/components/repellentflask.rs:176— ungearitems::components::repellentflask::repellent_update 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.
unmapload::selection::select_influence_objects (cyclomatic 31) unmapload/src/selection.rs:53— unmapload::selection::select_influence_objects 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.
unmapload::level_finalization::after_level_ready (cyclomatic 24) unmapload/src/level_finalization.rs:40— unmapload::level_finalization::after_level_ready 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.
uncoremenu::scrollbar::update_scrollbar (cyclomatic 26) uncoremenu/src/scrollbar.rs:138— uncoremenu::scrollbar::update_scrollbar 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.
uncoremenu::scrollbar::handle_scrollbar_interactions (cyclomatic 17) uncoremenu/src/scrollbar.rs:276— uncoremenu::scrollbar::handle_scrollbar_interactions 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.
uncampaign::unified_mission_selection::setup_ui (cyclomatic 24) uncampaign/src/unified_mission_selection.rs:314— uncampaign::unified_mission_selection::setup_ui 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.
uncampaign::unified_mission_selection::handle_selection_input (cyclomatic 18) uncampaign/src/unified_mission_selection.rs:106— uncampaign::unified_mission_selection::handle_selection_input 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.
unplayer::systems::movement::player_movement_system (cyclomatic 23) unplayer/src/systems/movement.rs:40— unplayer::systems::movement::player_movement_system 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.
unplayer::systems::waypoint::waypoint_creation_system (cyclomatic 16) unplayer/src/systems/waypoint.rs:23— unplayer::systems::waypoint::waypoint_creation_system 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.
walkie_voice_generator::codegen::generate_rust_code (cyclomatic 19) tools/text_to_speech/walkie_voice_generator/src/codegen.rs:24— walkie_voice_generator::codegen::generate_rust_code 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.
walkie_voice_generator::main (cyclomatic 17) tools/text_to_speech/walkie_voice_generator/src/main.rs:37— walkie_voice_generator::main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
unfog::systems::update_miasma (cognitive 96) unfog/src/systems.rs:295— unfog::systems::update_miasma has cognitive complexity 96 (threshold 15). Drivers by points: if/else 30 (69 pts), loops 10 (17 pts), boolean chains 10 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unfog::systems::spawn_miasma (cognitive 28) unfog/src/systems.rs:73— unfog::systems::spawn_miasma has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
untmxmap::bevy::bevy_load_map (cognitive 57) untmxmap/src/bevy.rs:34— untmxmap::bevy::bevy_load_map has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (40 pts), loops 8 (16 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
untmxmap::init_maps::tmxmap_preload (cognitive 21) untmxmap/src/init_maps.rs:99— untmxmap::init_maps::tmxmap_preload has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SpiritBox::update (cognitive 29) ungearitems/src/components/spiritbox.rs:141— SpiritBox::update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 5, match/switch 1 (3 pts) (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.
SpiritBox::get_status (cognitive 20) ungearitems/src/components/spiritbox.rs:75— SpiritBox::get_status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Recorder::update (cognitive 24) ungearitems/src/components/recorder.rs:126— Recorder::update has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Recorder::get_status (cognitive 18) ungearitems/src/components/recorder.rs:77— Recorder::get_status has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyFields: ImageAssets uncore/src/types/root/image_assets.rs:4— TooManyFields — 57 stored fields. The bar is 30 stored fields; this is 27 over it, 1.90× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: DifficultyStruct uncore/src/difficulty.rs:685— TooManyFields — 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
MethodTooLong: WalkieEvent.to_concept unwalkiecore/src/events/walkie_content.rs:34— MethodTooLong — to_concept runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: WalkieEvent.get_on_screen_actionable_hint_text unwalkiecore/src/events/walkie_content.rs:275— MethodTooLong — get_on_screen_actionable_hint_text runs 133 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 33 over it, 1.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Change coupling: user_manual_ui.rs ↔ utils.rs unstd/src/manual/user_manual_ui.rs:1— `unstd/src/manual/user_manual_ui.rs` and `unstd/src/manual/utils.rs` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `a571a350` migrate manual as plugin to unstd; `c21c6cbd` Cleanup of old manual stuff (at that commit the files were still `src/manual/user_manual_ui.rs` and `src/manual/utils.rs`); `c7fb3876` Refactor manual (at that commit the files were still `src/manual/user_manual_ui.rs` and `src/manual/utils.rs`) — run `git show` on any of them.
Change coupling: lighting.rs ↔ prebake.rs unlight/src/lighting.rs:1— `unlight/src/lighting.rs` and `unlight/src/prebake.rs` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `c07f95fb` Optimize lighting calculation; `2913bf0b` Change lighting to follow the square distance law; `6cfe239c` Enhance lighting system: Add door tracking to prebaked metadata and u… — run `git show` on any of them.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (5 members, 50+ identical tokens) unplayer/src/systems/waypoint.rs:289— unplayer/src/systems/waypoint.rs:289-306 | unplayer/src/systems/waypoint.rs:314-331 | unplayer/src/systems/waypoint.rs:400-440 | unplayer/src/systems/waypoint.rs:453-518 | unplayer/src/systems/waypoint.rs:528-579 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) unstd/src/manual/chapter1/page1.rs:6— unstd/src/manual/chapter1/page1.rs:6-51 | unstd/src/manual/chapter1/page2.rs:6-52 | unstd/src/manual/chapter1/page3.rs:6-51 | unstd/src/manual/chapter3/page1.rs:6-51 | unstd/src/manual/chapter5/page1.rs:6-40 — 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.
D4 · Code Duplication· Edited copies of one member (3 members, 40+ corresponding lines) · ×2
Edited copies of one member (3 members, 40+ corresponding lines) untruck/src/activity.rs:9— untruck/src/activity.rs:9-48 | untruck/src/sanity.rs:15-59 | untruck/src/sensors.rs:10-56 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 40 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 40+ corresponding lines) unstd/src/manual/chapter2/page1.rs:6— unstd/src/manual/chapter2/page1.rs:6-45 | unstd/src/manual/chapter2/page2.rs:6-45 | unstd/src/manual/chapter4/page1.rs:6-53 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 40 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×2
Edited copy of a member (17 corresponding lines) uncore/src/behavior/mod.rs:827— uncore/src/behavior/mod.rs:827-843 | uncore/src/behavior/mod.rs:848-867 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) unghost/src/ghost.rs:803— unghost/src/ghost.rs:803-819 | unghost/src/ghost.rs:822-838 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (29 corresponding lines) · ×2
Edited copy of a member (29 corresponding lines) unwalkie/src/triggers/consumables_and_defense.rs:27— unwalkie/src/triggers/consumables_and_defense.rs:27-55 | unwalkie/src/triggers/consumables_and_defense.rs:66-95 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (29 corresponding lines) uncoremenu/src/templates.rs:51— uncoremenu/src/templates.rs:51-82 | uncoremenu/src/templates.rs:475-503 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (30 corresponding lines) · ×2
Edited copy of a member (30 corresponding lines) uncoremenu/src/templates.rs:251— uncoremenu/src/templates.rs:251-280 | uncoremenu/src/templates.rs:287-329 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) tools/ghost_list/src/sets/comparison.rs:369— tools/ghost_list/src/sets/comparison.rs:369-403 | tools/ghost_list/src/sets/optimization.rs:881-910 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 28+ corresponding lines) · ×2
Edited copies of one member (3 members, 28+ corresponding lines) unplayer/src/systems/input/mouse_pathing.rs:30— unplayer/src/systems/input/mouse_pathing.rs:30-57 | unplayer/src/systems/mouse.rs:23-61 | unplayer/src/systems/waypoint.rs:361-388 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 28+ corresponding lines) unwalkie/src/triggers/environmental_awareness.rs:34— unwalkie/src/triggers/environmental_awareness.rs:34-63 | unwalkie/src/triggers/player_wellbeing.rs:38-65 | unwalkie/src/triggers/player_wellbeing.rs:76-103 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (20 corresponding lines) · ×2
Edited copy of a member (20 corresponding lines) ungear/src/components/playergear.rs:73— ungear/src/components/playergear.rs:73-92 | ungear/src/components/playergear.rs:95-119 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) tools/ghost_list/src/sets/mod.rs:157— tools/ghost_list/src/sets/mod.rs:157-179 | tools/ghost_list/src/sets/mod.rs:181-200 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×2
Edited copy of a member (7 corresponding lines) ungearitems/src/components/flashlight.rs:204— ungearitems/src/components/flashlight.rs:204-210 | ungearitems/src/components/videocam.rs:82-89 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) unwalkie/src/triggers/tutorial_gear_explanations.rs:14— unwalkie/src/triggers/tutorial_gear_explanations.rs:14-23 | unwalkie/src/triggers/tutorial_introductions.rs:9-15 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (39 lines × 2) unmenusettings/src/systems.rs:245— unmenusettings/src/systems.rs:245-283 | unmenusettings/src/systems.rs:404-442 — both copies are in the same file, so extract the 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 `unmenusettings/src/systems.rs:245` 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 (39 lines × 2) unstd/src/manual/preplay_manual_ui.rs:191— unstd/src/manual/preplay_manual_ui.rs:191-229 | unstd/src/manual/user_manual_ui.rs:90-128 — before extracting anything, compare `unstd/src/manual/preplay_manual_ui.rs` and `unstd/src/manual/user_manual_ui.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `unstd/src/manual/preplay_manual_ui.rs:191` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24 lines × 2) unmapload/src/selection.rs:94— unmapload/src/selection.rs:94-117 | unmapload/src/selection.rs:139-162 — both copies are in the same file, so extract the 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 `unmapload/src/selection.rs:94` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24 lines × 2) unplayer/src/systems/pathfinding.rs:139— unplayer/src/systems/pathfinding.rs:139-162 | unplayer/src/systems/pathfinding.rs:239-262 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (21 lines × 2) ungearitems/src/components/redtorch.rs:48— ungearitems/src/components/redtorch.rs:48-68 | ungearitems/src/components/uvtorch.rs:77-97 — before extracting anything, compare `ungearitems/src/components/redtorch.rs` and `ungearitems/src/components/uvtorch.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (21 lines × 2) unstd/src/manual/preplay_manual_ui.rs:295— unstd/src/manual/preplay_manual_ui.rs:295-315 | unstd/src/manual/user_manual_ui.rs:208-228 — before extracting anything, compare `unstd/src/manual/preplay_manual_ui.rs` and `unstd/src/manual/user_manual_ui.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (18 lines × 2) uncoremenu/src/scrollbar.rs:184— uncoremenu/src/scrollbar.rs:184-201 | uncoremenu/src/scrollbar.rs:209-226 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `uncoremenu/src/scrollbar.rs:184` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) untruck/src/systems/journal_blinking_system.rs:115— untruck/src/systems/journal_blinking_system.rs:115-132 | untruck/src/systems/journal_blinking_system.rs:208-225 — both copies are in the same file, so extract the 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 `untruck/src/systems/journal_blinking_system.rs:115` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–16 lines × 2) tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:226— tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:226-241 | tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:339-352 — both copies are in the same file, so extract the 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 `tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:226` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–16 lines × 2) uncore/src/behavior/mod.rs:829— uncore/src/behavior/mod.rs:829-842 | uncore/src/behavior/mod.rs:850-865 — both copies are in the same file, so extract the 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 `uncore/src/behavior/mod.rs:829` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16 lines × 2) uncampaign/src/unified_mission_selection.rs:264— uncampaign/src/unified_mission_selection.rs:264-279 | uncampaign/src/unified_mission_selection.rs:496-511 — both copies are in the same file, so extract the block into 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) tools/ghost_list/src/sets/comparison.rs:457— tools/ghost_list/src/sets/comparison.rs:457-472 | tools/ghost_list/src/sets/comparison.rs:536-551 — both copies are in the same file, so extract the 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 `tools/ghost_list/src/sets/comparison.rs:457` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 3) ungearitems/src/components/redtorch.rs:119— ungearitems/src/components/redtorch.rs:119-131 | ungearitems/src/components/uvtorch.rs:163-175 | ungearitems/src/components/videocam.rs:97-109 — before extracting anything, compare `ungearitems/src/components/redtorch.rs` and `ungearitems/src/components/uvtorch.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ungearitems/src/components/redtorch.rs:119` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 3) unplayer/src/systems/waypoint.rs:318— unplayer/src/systems/waypoint.rs:318-330 | unplayer/src/systems/waypoint.rs:546-558 | unplayer/src/systems/waypoint.rs:564-576 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unplayer/src/systems/waypoint.rs:318` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11–12 lines × 2) unnpc/src/npchelp.rs:96— unnpc/src/npchelp.rs:96-106 | untruck/src/activity.rs:12-23 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `unnpc/src/npchelp.rs:96` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11–12 lines × 2) unsummary/src/summary.rs:263— unsummary/src/summary.rs:263-274 | unsummary/src/summary.rs:416-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. Read the line range as the matched WINDOW rather than a finished unit: at `unsummary/src/summary.rs:263` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 3) unstd/src/manual/preplay_manual_ui.rs:172— unstd/src/manual/preplay_manual_ui.rs:172-180 | unstd/src/manual/user_manual_ui.rs:64-72 | unstd/src/manual/user_manual_ui.rs:78-86 — before extracting anything, compare `unstd/src/manual/preplay_manual_ui.rs` and `unstd/src/manual/user_manual_ui.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `unstd/src/manual/preplay_manual_ui.rs:172` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 3) tools/ghost_list/src/sets/comparison.rs:334— tools/ghost_list/src/sets/comparison.rs:334-342 | tools/ghost_list/src/sets/optimization.rs:619-627 | tools/ghost_list/src/sets/optimization.rs:912-922 — before extracting anything, compare `tools/ghost_list/src/sets/comparison.rs` and `tools/ghost_list/src/sets/optimization.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `ghost_set` to `&HashSet<GhostType>` in one and `HashSet<GhostType>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Unfinished branch — a todo!() / unimplemented!() arm in a real function unmenusettings/src/systems.rs:170— `menu_settings_class_selected` does real work, but one of its branches is `todo!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function unmenusettings/src/systems.rs:171— `menu_settings_class_selected` does real work, but one of its branches is `todo!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
WalkieEvent::effective_priority (cyclomatic 34) unwalkiecore/src/events/walkie_config.rs:299— WalkieEvent::effective_priority has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: WalkieEvent::time_to_play (cyclomatic 54) 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.
uncore::utils::ghost_setfinder::find_and_score_ghost_sets (cyclomatic 31) uncore/src/utils/ghost_setfinder.rs:11— uncore::utils::ghost_setfinder::find_and_score_ghost_sets 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.
SpiritBox::update (cyclomatic 24) ungearitems/src/components/spiritbox.rs:141— SpiritBox::update has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
untmxmap::bevy::bevy_load_map (cyclomatic 23) untmxmap/src/bevy.rs:34— untmxmap::bevy::bevy_load_map 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.
unstd::picking::sprite_picking_backend::pixel_perfect_hit_test (cyclomatic 21) unstd/src/picking/sprite_picking_backend.rs:337— unstd::picking::sprite_picking_backend::pixel_perfect_hit_test 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.
Recorder::update (cyclomatic 19) ungearitems/src/components/recorder.rs:126— Recorder::update 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.
ungame::systems::game_systems::keyboard (cyclomatic 16) ungame/src/systems/game_systems.rs:58— ungame::systems::game_systems::keyboard 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.
GeigerCounter::update (cyclomatic 16) ungearitems/src/components/geigercounter.rs:125— GeigerCounter::update 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.
ungear::systems::update_gear_ui (cognitive 37) ungear/src/systems.rs:135— ungear::systems::update_gear_ui has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 4 (10 pts), match/switch 2 (8 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InteractiveStuff::execute_interaction (cognitive 31) unstd/src/systemparam/interactivestuff.rs:76— InteractiveStuff::execute_interaction has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 1 (3 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.
TmxMap::calculate_grade_thresholds (cognitive 28) uncore/src/assets/tmxmap.rs:141— TmxMap::calculate_grade_thresholds has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (27 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.
GeigerCounter::update (cognitive 26) ungearitems/src/components/geigercounter.rs:125— GeigerCounter::update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (22 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.
CachedBoardPos::compute_angle (cognitive 24) unlight/src/cached_board_pos.rs:106— CachedBoardPos::compute_angle has cognitive complexity 24 (threshold 15). Drivers by points: loops 10 (19 pts), if/else 1 (5 pts) (nesting depth added 13). 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.
unhaunter::unhaunter::src::report_timer::report_performance (cognitive 23) unhaunter/src/report_timer.rs:8— unhaunter::unhaunter::src::report_timer::report_performance has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 3 (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.
unprofile::dev_tools::validate_schema_snapshots (cognitive 23) unprofile/src/dev_tools.rs:57— unprofile::dev_tools::validate_schema_snapshots has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 2 (11 pts), if/else 5 (9 pts), loops 1 (3 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
WalkieEvent::effective_priority (cognitive 20) unwalkiecore/src/events/walkie_config.rs:299— WalkieEvent::effective_priority has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 11 (19 pts), if/else 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
CollisionHandler::check_floor_collisions (cognitive 18) uncore/src/systemparam/collision_handler.rs:60— CollisionHandler::check_floor_collisions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EMFMeter::update (cognitive 18) ungearitems/src/components/emfmeter.rs:170— EMFMeter::update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
TooManyMethods: Difficulty uncore/src/difficulty.rs:26— TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Difficulty uncore/src/difficulty.rs:26— ClassTooLong — 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 37 methods, 2 blocks, lines 26-678. The bar is 400 significant lines; this is 34 over it, 1.09× 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.
Near-duplicate member pair (95 shared lines) unstd/src/manual/preplay_manual_ui.rs:135— unstd/src/manual/preplay_manual_ui.rs:135-251 | unstd/src/manual/user_manual_ui.rs:22-150 — These two members are variants of one another: 95 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (75 shared lines) unplayer/src/systems/pathfinding.rs:138— unplayer/src/systems/pathfinding.rs:138-227 | unplayer/src/systems/pathfinding.rs:238-323 — These two members are variants of one another: 75 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (67 shared lines) tools/ghost_list/src/sets/optimization.rs:17— tools/ghost_list/src/sets/optimization.rs:17-225 | uncore/src/utils/ghost_setfinder.rs:14-153 — These two members are variants of one another: 67 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (35 shared lines) ungame/src/pause_ui.rs:43— ungame/src/pause_ui.rs:43-125 | unnpc/src/npchelp.rs:53-160 — These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (27 shared lines) ungame/src/gear_ui.rs:8— ungame/src/gear_ui.rs:8-76 | ungame/src/gear_ui.rs:78-166 — These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (26 corresponding lines) · ×1
Edited copy of a member (26 corresponding lines) unwalkie/src/triggers/environmental_awareness.rs:75— unwalkie/src/triggers/environmental_awareness.rs:75-110 | unwalkie/src/triggers/environmental_awareness.rs:122-152 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (123 corresponding lines) · ×1
Edited copy of a member (123 corresponding lines) tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:446— tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:446-583 | tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:590-712 — These two members are one piece of code written twice and then edited apart: 123 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (49 corresponding lines) · ×1
Edited copy of a member (49 corresponding lines) tools/ghost_list/src/sets/comparison.rs:62— tools/ghost_list/src/sets/comparison.rs:62-113 | tools/ghost_list/src/sets/comparison.rs:145-193 — These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (72 corresponding lines) · ×1
Edited copy of a member (72 corresponding lines) unwalkie/src/triggers/consumables_and_defense.rs:110— unwalkie/src/triggers/consumables_and_defense.rs:110-182 | unwalkie/src/triggers/consumables_and_defense.rs:193-264 — These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (43 corresponding lines) · ×1
Edited copy of a member (43 corresponding lines) unwalkie/src/triggers/locomotion_interaction.rs:367— unwalkie/src/triggers/locomotion_interaction.rs:367-409 | unwalkie/src/triggers/locomotion_interaction.rs:422-465 — These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×1
Edited copy of a member (23 corresponding lines) tools/ghost_list/src/sets/completion.rs:7— tools/ghost_list/src/sets/completion.rs:7-29 | tools/ghost_list/src/sets/validation.rs:75-97 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (41 corresponding lines) · ×1
Edited copy of a member (41 corresponding lines) ungearitems/src/components/recorder.rs:77— ungearitems/src/components/recorder.rs:77-117 | ungearitems/src/components/spiritbox.rs:75-118 — These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 32+ corresponding lines) · ×1
Edited copies of one member (3 members, 32+ corresponding lines) ungearitems/src/components/emfmeter.rs:123— ungearitems/src/components/emfmeter.rs:123-157 | ungearitems/src/components/geigercounter.rs:81-112 | ungearitems/src/components/thermometer.rs:60-93 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (31 corresponding lines) · ×1
Edited copy of a member (31 corresponding lines) unplayer/src/systems/pathfinding.rs:72— unplayer/src/systems/pathfinding.rs:72-102 | unplayer/src/systems/pathfinding.rs:332-368 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 17+ corresponding lines) · ×1
Edited copies of one member (4 members, 17+ corresponding lines) ungearitems/src/components/emfmeter.rs:282— ungearitems/src/components/emfmeter.rs:282-298 | ungearitems/src/components/recorder.rs:258-277 | ungearitems/src/components/spiritbox.rs:266-284 | ungearitems/src/components/thermometer.rs:173-196 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×1
Edited copy of a member (13 corresponding lines) uncore/src/components/board/boardposition.rs:56— uncore/src/components/board/boardposition.rs:56-68 | uncore/src/components/board/boardposition.rs:73-86 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×1
Edited copy of a member (10 corresponding lines) uncore/src/behavior/component.rs:31— uncore/src/behavior/component.rs:31-40 | uncore/src/behavior/component.rs:42-56 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×1
Edited copy of a member (14 corresponding lines) untmxmap/src/bevy.rs:273— untmxmap/src/bevy.rs:273-286 | untmxmap/src/bevy.rs:289-302 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×1
Edited copy of a member (16 corresponding lines) ungame/src/systems/game_systems.rs:41— ungame/src/systems/game_systems.rs:41-56 | unmenusettings/src/menu_ui.rs:141-156 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×1
Edited copy of a member (18 corresponding lines) unwalkie/src/triggers/consumables_and_defense.rs:408— unwalkie/src/triggers/consumables_and_defense.rs:408-425 | unwalkie/src/triggers/repellent_expulsion.rs:429-447 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 10+ corresponding lines) · ×1
Edited copies of one member (6 members, 10+ corresponding lines) ungearitems/src/components/compass.rs:27— ungearitems/src/components/compass.rs:27-36 | ungearitems/src/components/estaticmeter.rs:28-37 | ungearitems/src/components/ionmeter.rs:39-49 | ungearitems/src/components/motionsensor.rs:36-46 | ungearitems/src/components/photocam.rs:25-34 | ungearitems/src/components/thermalimager.rs:25-34 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×1
Edited copy of a member (12 corresponding lines) ungearitems/src/components/redtorch.rs:26— ungearitems/src/components/redtorch.rs:26-37 | ungearitems/src/components/uvtorch.rs:54-66 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 5+ corresponding lines) · ×1
Edited copies of one member (3 members, 5+ corresponding lines) uncore/src/assets/index.rs:40— uncore/src/assets/index.rs:40-44 | uncore/src/assets/tmxmap.rs:259-263 | uncore/src/assets/tsxsheet.rs:31-35 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (102–109 lines × 2) tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:458— tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:458-566 | tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:599-700 — both copies are in the same file, so extract the 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 `tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:458` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:567` calls `unwrap` and `tools/text_to_speech/walkie_voice_generator/src/file_processing.rs:701` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (30–31 lines × 2) unmenusettings/src/systems.rs:187— unmenusettings/src/systems.rs:187-216 | unmenusettings/src/systems.rs:345-375 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unmenusettings/src/systems.rs:187` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (26–29 lines × 2) unwalkie/src/triggers/consumables_and_defense.rs:121— unwalkie/src/triggers/consumables_and_defense.rs:121-149 | unwalkie/src/triggers/consumables_and_defense.rs:208-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. Read the line range as the matched WINDOW rather than a finished unit: at `unwalkie/src/triggers/consumables_and_defense.rs:121` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (25–28 lines × 2) unplayer/src/systems/pathfinding.rs:177— unplayer/src/systems/pathfinding.rs:177-201 | unplayer/src/systems/pathfinding.rs:271-298 — both copies are in the same file, so extract the 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 `unplayer/src/systems/pathfinding.rs:177` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (28 lines × 2) untruck/src/journalui.rs:67— untruck/src/journalui.rs:67-94 | untruck/src/journalui.rs:150-177 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `untruck/src/journalui.rs:67` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (26–27 lines × 3) unmenusettings/src/menu_ui.rs:72— unmenusettings/src/menu_ui.rs:72-97 | unmenusettings/src/systems.rs:231-257 | unmenusettings/src/systems.rs:390-416 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `unmenusettings/src/menu_ui.rs:72` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (27 lines × 2) unwalkie/src/triggers/potential_id_prompt.rs:46— unwalkie/src/triggers/potential_id_prompt.rs:46-72 | unwalkie/src/triggers/potential_id_prompt.rs:96-122 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23–26 lines × 2) tools/ghost_list/src/sets/comparison.rs:345— tools/ghost_list/src/sets/comparison.rs:345-367 | tools/ghost_list/src/sets/optimization.rs:854-879 — before extracting anything, compare `tools/ghost_list/src/sets/comparison.rs` and `tools/ghost_list/src/sets/optimization.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (24–26 lines × 2) unwalkie/src/triggers/environmental_awareness.rs:76— unwalkie/src/triggers/environmental_awareness.rs:76-101 | unwalkie/src/triggers/environmental_awareness.rs:123-146 — both copies are in the same file, so extract the 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 `unwalkie/src/triggers/environmental_awareness.rs:76` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (23 lines × 2) unplayer/src/systems/pathfinding.rs:205— unplayer/src/systems/pathfinding.rs:205-227 | unplayer/src/systems/pathfinding.rs:301-323 — both copies are in the same file, so extract the 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 `unplayer/src/systems/pathfinding.rs:205` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21–22 lines × 3) unplayer/src/systems/input/mouse_pathing.rs:37— unplayer/src/systems/input/mouse_pathing.rs:37-57 | unplayer/src/systems/mouse.rs:40-61 | unplayer/src/systems/waypoint.rs:368-388 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `unplayer/src/systems/input/mouse_pathing.rs:37` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19–20 lines × 4) tools/ghost_list/src/sets/optimization.rs:111— tools/ghost_list/src/sets/optimization.rs:111-130 | tools/ghost_list/src/sets/optimization.rs:188-206 | uncore/src/utils/ghost_setfinder.rs:52-71 | uncore/src/utils/ghost_setfinder.rs:121-140 — before extracting anything, compare `tools/ghost_list/src/sets/optimization.rs` and `uncore/src/utils/ghost_setfinder.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/sets/optimization.rs:111` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (18–20 lines × 3) unwalkie/src/triggers/consumables_and_defense.rs:112— unwalkie/src/triggers/consumables_and_defense.rs:112-131 | unwalkie/src/triggers/consumables_and_defense.rs:199-216 | unwalkie/src/triggers/consumables_and_defense.rs:438-455 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unwalkie/src/triggers/consumables_and_defense.rs:112` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `unwalkie/src/triggers/consumables_and_defense.rs:459` calls `default` and `unwalkie/src/triggers/consumables_and_defense.rs:132` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17–18 lines × 2) tools/ghost_list/src/sets/optimization.rs:138— tools/ghost_list/src/sets/optimization.rs:138-154 | uncore/src/utils/ghost_setfinder.rs:79-96 — before extracting anything, compare `tools/ghost_list/src/sets/optimization.rs` and `uncore/src/utils/ghost_setfinder.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/sets/optimization.rs:138` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16–17 lines × 2) untruck/src/sanity.rs:18— untruck/src/sanity.rs:18-33 | untruck/src/sensors.rs:13-29 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `untruck/src/sanity.rs:18` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (14–15 lines × 2) unstd/src/manual/preplay_manual_ui.rs:151— unstd/src/manual/preplay_manual_ui.rs:151-164 | unstd/src/manual/user_manual_ui.rs:44-58 — before extracting anything, compare `unstd/src/manual/preplay_manual_ui.rs` and `unstd/src/manual/user_manual_ui.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `unstd/src/manual/preplay_manual_ui.rs:151` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11–15 lines × 2) unwalkie/src/triggers/environmental_awareness.rs:35— unwalkie/src/triggers/environmental_awareness.rs:35-45 | unwalkie/src/triggers/locomotion_interaction.rs:168-182 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (14 lines × 3) ungearitems/src/components/emfmeter.rs:262— ungearitems/src/components/emfmeter.rs:262-275 | ungearitems/src/components/redtorch.rs:144-157 | ungearitems/src/components/uvtorch.rs:110-123 — before extracting anything, compare `ungearitems/src/components/redtorch.rs` and `ungearitems/src/components/uvtorch.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `gs` to `&mut GearStuff` in one and `&mut super::GearStuff` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (13–14 lines × 2) unmapload/src/entity_spawning.rs:171— unmapload/src/entity_spawning.rs:171-184 | unmapload/src/entity_spawning.rs:200-212 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unmapload/src/entity_spawning.rs:171` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12–13 lines × 3) unsummary/src/summary.rs:248— unsummary/src/summary.rs:248-260 | unsummary/src/summary.rs:292-304 | unsummary/src/summary.rs:402-413 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unsummary/src/summary.rs:248` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10–13 lines × 2) tools/ghost_list/src/sets/optimization.rs:532— tools/ghost_list/src/sets/optimization.rs:532-541 | tools/ghost_list/src/sets/optimization.rs:675-687 — both copies are in the same file, so extract the 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 `tools/ghost_list/src/sets/optimization.rs:532` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12–13 lines × 2) unplayer/src/systems/input/mouse_pathing.rs:209— unplayer/src/systems/input/mouse_pathing.rs:209-221 | unplayer/src/systems/mouse.rs:70-81 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `unplayer/src/systems/input/mouse_pathing.rs:204` calls `just_pressed` and `unplayer/src/systems/mouse.rs:68` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9–12 lines × 4) unplayer/src/systems/waypoint.rs:421— unplayer/src/systems/waypoint.rs:421-429 | unplayer/src/systems/waypoint.rs:495-503 | unplayer/src/systems/waypoint.rs:540-551 | unplayer/src/systems/waypoint.rs:561-569 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unplayer/src/systems/waypoint.rs:421` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 4) ungearitems/src/components/geigercounter.rs:238— ungearitems/src/components/geigercounter.rs:238-247 | ungearitems/src/components/redtorch.rs:118-127 | ungearitems/src/components/uvtorch.rs:162-171 | ungearitems/src/components/videocam.rs:96-105 — before extracting anything, compare `ungearitems/src/components/redtorch.rs` and `ungearitems/src/components/uvtorch.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ungearitems/src/components/geigercounter.rs:238` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) uncoremenu/src/templates.rs:52— uncoremenu/src/templates.rs:52-61 | uncoremenu/src/templates.rs:397-406 | uncoremenu/src/templates.rs:476-485 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `uncoremenu/src/templates.rs:52` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 6) unplayer/src/systems/waypoint.rs:290— unplayer/src/systems/waypoint.rs:290-298 | unplayer/src/systems/waypoint.rs:315-323 | unplayer/src/systems/waypoint.rs:421-429 | unplayer/src/systems/waypoint.rs:495-503 | unplayer/src/systems/waypoint.rs:543-551 | unplayer/src/systems/waypoint.rs:561-569 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unplayer/src/systems/waypoint.rs:290` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8–9 lines × 2) ungear/src/components/playergear.rs:80— ungear/src/components/playergear.rs:80-87 | ungear/src/components/playergear.rs:104-112 — both copies are in the same file, so extract the 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 `ungear/src/components/playergear.rs:80` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `ungear/src/components/playergear.rs:103` calls `rev` and `ungear/src/components/playergear.rs:79` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (3–8 lines × 3) tools/ghost_list/src/sets/comparison.rs:374— tools/ghost_list/src/sets/comparison.rs:374-380 | tools/ghost_list/src/sets/optimization.rs:830-832 | tools/ghost_list/src/sets/optimization.rs:882-889 — before extracting anything, compare `tools/ghost_list/src/sets/comparison.rs` and `tools/ghost_list/src/sets/optimization.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/sets/comparison.rs:374` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6–7 lines × 2) ungearitems/src/components/emfmeter.rs:195— ungearitems/src/components/emfmeter.rs:195-201 | ungearitems/src/components/thermometer.rs:104-109 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `ungearitems/src/components/emfmeter.rs:195` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind `gs` to `&mut GearStuff` in one and `&mut super::GearStuff` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (5 lines × 5) ungearitems/src/components/emfmeter.rs:181— ungearitems/src/components/emfmeter.rs:181-185 | ungearitems/src/components/emfmeter.rs:195-199 | ungearitems/src/components/recorder.rs:164-170 | ungearitems/src/components/spiritbox.rs:181-185 | ungearitems/src/components/thermometer.rs:104-108 — before extracting anything, compare `ungearitems/src/components/recorder.rs` and `ungearitems/src/components/spiritbox.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ungearitems/src/components/emfmeter.rs:181` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `ungearitems/src/components/emfmeter.rs:201` calls `ndidx` and `ungearitems/src/components/spiritbox.rs:186` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 6) uncampaign/src/unified_mission_selection.rs:95— uncampaign/src/unified_mission_selection.rs:95-103 | ungame/src/game_ui.rs:21-29 | unmenu/src/mainmenu.rs:127-134 | unstd/src/manual/preplay_manual_ui.rs:276-284 | unstd/src/manual/user_manual_ui.rs:299-309 | unsummary/src/summary.rs:27-37 — before extracting anything, compare `unstd/src/manual/preplay_manual_ui.rs` and `unstd/src/manual/user_manual_ui.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `uncampaign/src/unified_mission_selection.rs:95` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `qc` to `Query<Entity, With<MCamera>>` in one and `Query<Entity, With<SCamera>>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 3) ungearitems/src/components/redtorch.rs:70— ungearitems/src/components/redtorch.rs:70-76 | ungearitems/src/components/uvtorch.rs:128-135 | ungearitems/src/components/videocam.rs:53-59 — before extracting anything, compare `ungearitems/src/components/redtorch.rs` and `ungearitems/src/components/uvtorch.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 5) unstd/src/manual/chapter1/page1.rs:37— unstd/src/manual/chapter1/page1.rs:37-48 | unstd/src/manual/chapter1/page2.rs:38-49 | unstd/src/manual/chapter1/page3.rs:37-48 | unstd/src/manual/chapter3/page1.rs:37-48 | unstd/src/manual/chapter5/page1.rs:9-37 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. Read the line range as the matched WINDOW rather than a finished unit: at `unstd/src/manual/chapter1/page1.rs:37` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (29–31 lines × 2) tools/ghost_list/src/sets/comparison.rs:78— tools/ghost_list/src/sets/comparison.rs:78-106 | tools/ghost_list/src/sets/comparison.rs:159-189 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/sets/comparison.rs:159` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12 lines × 3) unmapload/src/entity_spawning.rs:231— unmapload/src/entity_spawning.rs:231-243 | unmapload/src/entity_spawning.rs:244-255 | unmapload/src/entity_spawning.rs:262-273 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unmapload/src/entity_spawning.rs:231` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 3) untruck/src/journalui.rs:91— untruck/src/journalui.rs:91-101 | untruck/src/journalui.rs:174-184 | untruck/src/loadoutui.rs:211-221 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `untruck/src/journalui.rs:91` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 3) uncoremenu/src/templates.rs:357— uncoremenu/src/templates.rs:357-364 | uncoremenu/src/templates.rs:377-384 | unsummary/src/summary.rs:180-189 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `uncoremenu/src/templates.rs:357` 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 (1–9 lines × 3) tools/ghost_list/src/analysis/conflicts.rs:83— tools/ghost_list/src/analysis/conflicts.rs:83-91 | tools/ghost_list/src/analysis/conflicts.rs:133-141 | tools/ghost_list/src/sets/validation.rs:37-37 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `tools/ghost_list/src/analysis/conflicts.rs:83` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 5) unsummary/src/summary.rs:191— unsummary/src/summary.rs:191-198 | unsummary/src/summary.rs:201-208 | unsummary/src/summary.rs:212-219 | unsummary/src/summary.rs:222-229 | unsummary/src/summary.rs:232-239 — 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 (6 lines × 3) unplayer/src/systems/pathfinding.rs:149— unplayer/src/systems/pathfinding.rs:149-154 | unplayer/src/systems/pathfinding.rs:165-170 | unplayer/src/systems/pathfinding.rs:249-254 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `unplayer/src/systems/pathfinding.rs:149` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Third-party script without Subresource Integrity index.html:8— `https://www.googletagmanager.com/gtag/js?id=G-1XQY15JR0H` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×1
Recursive walk over a caller-supplied document has no depth cap uncore/src/types/tiledmap/map.rs:123— `iter` is public and takes a `MapLayerGroup` as its receiver from its caller, and it calls itself at line 123 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `iter` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
X18 · Disposal-pattern correctness· Raw handle taken from an owned value and never reclaimed · ×1
Raw handle taken from an owned value and never reclaimed unhaunter/src/app.rs:140— `image.into_raw()` (line 140) gives up ownership in exchange for a raw handle — the value's `Drop` will no longer run — and nothing in the crate's code ever reclaims a `*` from a raw pointer (`*::from_raw`). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a `free` function that rebuilds the owner with `from_raw` and drops it), or keep the owning value.
Orphaned file tools/ghost_list/src/sets/optimization.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 uncore/src/difficulty.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 uncore/src/behavior/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.
Orphaned file unsummary/src/summary.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 tools/text_to_speech/walkie_voice_generator/src/file_processing.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 unwalkiecore/src/events/walkie_content.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 unfog/src/systems.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 unplayer/src/systems/pathfinding.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 uncoremenu/src/templates.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 unlight/src/utils.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 unwalkie/src/triggers/evidence_gathering_logic.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 unwalkiecore/src/events/walkie_config.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 unwalkie/src/triggers/repellent_expulsion.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 tools/ghost_list/src/sets/comparison.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 ungearitems/src/components/thermometer.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 unwalkie/src/triggers/consumables_and_defense.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 unplayer/src/systems/waypoint.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 unmenusettings/src/systems.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 unmapload/src/selection.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 uncoremenu/src/scrollbar.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 unstd/src/picking/sprite_picking_backend.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 untruck/src/systems/truck_ui_systems.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 ungame/src/game_ui.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 unwalkie/src/triggers/locomotion_interaction.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 untruck/src/loadoutui.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 ungearitems/src/components/redtorch.rs:83— `self.battery_level > 0.0 && self.display_glitch_timer <= 0.01` appears character-identically in 2 files — ungearitems/src/components/redtorch.rs, ungearitems/src/components/uvtorch.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 ungearitems/src/components/redtorch.rs:79— `self.enabled && self.battery_level > 0.0 && self.display_glitch_timer <= 0.01` appears character-identically in 2 files — ungearitems/src/components/redtorch.rs, ungearitems/src/components/uvtorch.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 ungearitems/src/components/emfmeter.rs:86— `self.enabled && self.display_glitch_timer <= 0.0` appears character-identically in 4 files — ungearitems/src/components/emfmeter.rs, ungearitems/src/components/geigercounter.rs, ungearitems/src/components/redtorch.rs, ungearitems/src/components/uvtorch.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 ungearitems/src/components/emfmeter.rs:128— `self.enabled && self.display_glitch_timer > 0.0` appears character-identically in 7 files — ungearitems/src/components/emfmeter.rs, ungearitems/src/components/geigercounter.rs, ungearitems/src/components/recorder.rs, ungearitems/src/components/redtorch.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.
D34 · Knowledge Freshness· Most significant orphaned file · ×3
Most significant orphaned file unlight/src/maplight.rs:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file uncampaign/src/unified_mission_selection.rs:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file unghost/src/ghost.rs:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
README/code drift tools/ghost_list/README.md:194— tools/ghost_list/README.md links to `./DESIGN_CLEAN.md`, but `tools/ghost_list/DESIGN_CLEAN.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift tools/ghost_list/README.md:195— tools/ghost_list/README.md links to `./CHANGELOG.md`, but `tools/ghost_list/CHANGELOG.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
No ADRs found Cargo.toml:131— 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/`. ADRs are expected here because `Cargo.toml` makes this repository a deployable product (line 131).
D21 · Naming Consistency· `HintUiState` spells `Ui` where 13 names in the project spell it `UI` · ×1
`HintUiState` spells `Ui` where 13 names in the project spell it `UI` uncore/src/resources/hint_ui_state.rs:16— 13 of 14 names in project uncore spell the token `UI` (13 of 14; unit: names in project uncore containing `UI`). Peers: uncore.components.game_ui.EvidenceUI (uncore/src/components/game_ui.rs:4); uncore.components.game_ui.GameUI (uncore/src/components/game_ui.rs:7); uncore.components.game_ui.ElementObjectUI (uncore/src/components/game_ui.rs:10); uncore.components.game_ui.HeldObjectUI (uncore/src/components/game_ui.rs:27); uncore.components.game_ui.RightSideGearUI (uncore/src/components/game_ui.rs:29). Rename to `HintUIState`. [rule N6]
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion uncore/Cargo.toml:1— `uncore` (7268 LoC, 212 module-visible types across 17 directories) overshoots its size bounds. 1 of 28 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 9.3/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
Dormant codebase — 168 of 168 significant files have no living knowledge — the codebase as a whole is dormant, not 168 separate risks. Counted over 168 of the 390 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change.
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.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
No dependency-update automation Cargo.toml:41— `Cargo.toml` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
No release approval gate REDACTED:54— The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
Outdated: anyhow — `anyhow` is locked at 1.0.98 but 1.0.104 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p anyhow` and commit the updated REDACTED.
Outdated: clap — `clap` is locked at 4.5.40 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4.5"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
Outdated: csv — `csv` is locked at 1.3.1 but 1.4.0 is the current stable release on crates.io, and it already satisfies the `"1.1"` requirement declared in tools/ghost_list/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p csv` and commit the updated REDACTED.
Outdated: enum-iterator — `enum-iterator` is locked at 2.1.0 but 2.3.0 is the current stable release on crates.io, and it already satisfies the `"2.0"` requirement declared in uncore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p enum-iterator` and commit the updated REDACTED.
Outdated: glob — `glob` is locked at 0.3.2 but 0.3.4 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in untmxmap/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p glob` and commit the updated REDACTED.
Outdated: image — `image` is locked at 0.25.6 but 0.25.10 is the current stable release on crates.io, and it already satisfies the `"0.25"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p image` and commit the updated REDACTED.
Outdated: normalize-path — `normalize-path` is locked at 0.2.1 but 0.2.2 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in untmxmap/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p normalize-path` and commit the updated REDACTED.
Outdated: ordered-float — `ordered-float` is locked at 5.0.0 but 5.5.1 is the current stable release on crates.io, and it already satisfies the `"5.0"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ordered-float` and commit the updated REDACTED.
Outdated: rayon — `rayon` is locked at 1.10.0 but 1.12.0 is the current stable release on crates.io, and it already satisfies the `"1.7"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p rayon` and commit the updated REDACTED.
Outdated: regex — `regex` is locked at 1.11.1 but 1.13.1 is the current stable release on crates.io, and it already satisfies the `"1.7"` requirement declared in unmaphub/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p regex` and commit the updated REDACTED.
Outdated: serde — `serde` is locked at 1.0.219 but 1.0.229 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde` and commit the updated REDACTED.
Outdated: serde_json — `serde_json` is locked at 1.0.140 but 1.0.154 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in uncore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde_json` and commit the updated REDACTED.
Outdated: thiserror — `thiserror` is locked at 2.0.12 but 2.0.21 is the current stable release on crates.io, and it already satisfies the `"2.0"` requirement declared in uncore/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p thiserror` and commit the updated REDACTED.
Outdated: wasm-bindgen — `wasm-bindgen` is locked at 0.2.100 but 0.2.130 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p wasm-bindgen` and commit the updated REDACTED.
Outdated: winit — `winit` is locked at 0.30.11 but 0.30.13 is the current stable release on crates.io, and it already satisfies the `"0.30"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p winit` 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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 8 file(s) — `assets/maps/character1.tsx`, `assets/maps/topdown.tsx`, `assets/maps/unhaunter_custom_tileset.tsx`, `assets/maps/unhaunter_spritesheet2.tsx`, `assets/maps/unhaunter_spritesheetA_3x3x3.tsx`, … (+3 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
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 01a1e45a-9d7f-78ab-aebf-4d8131278062 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 9 · Warnings: 622 · Recommendations: 186 · Info: 15 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 16-11-2026 @ 12:35 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.