Public report of gleam-lang/gleam, published 26 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 26 October 2026, 03:38 UTC · Survey ID cd_6218b9fe0a0a487aa94e228112781d3d
gleam-lang/gleam
Measured 26 October 2026, 03:30 UTC, at code version 7f97af0
No regression since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
Down 1 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 149,606 lines of product code in 12 projects, tests not counted · Estimated rebuild effort: about 1.3 person-years · Weakest lens: Accessibility, 28
Findings by how serious they are
21 critical729 serious40 minor
14 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
26 October 2026, 03:30 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
72of 72 dimensions measured by tools.
773of 790 findings point to an exact file and line, so you can open each one in the code. The other 17 concern the repository as a whole, such as missing documentation.
72dimensions across 7 lenses, read from 149,606 lines of product code in 12 projects.
gleam-lang/gleam falls short of our standard for production, held back most by its Accessibility lens, the interface's usability with a keyboard or assistive technology. It scores 40 out of 100 and is rated Weak, and 13 of its 21 critical findings are security problems in its servers and containers and in the build pipeline.
Accessibility, at 28, is the weakest lens and counts most in the score. The best first step for the work it takes is recording design decisions, worth about 4 points. Making the controls keyboard-usable would lift Accessibility itself, worth about 5 points. Raising Accessibility to 70 would lift the score to about 50.
Ten settings leave the servers or containers unsafe. Two pipeline steps run downloads nobody checks, and five sets of files in separate parts keep changing together, which points to hidden dependencies. Correcting the unsafe settings, checking each download against a checksum and making the hidden dependencies explicit would close these risks. The pipeline step that installs packages without pinning their versions needs the packages it installs pinned to exact versions. The button or link with no name needs a name, even when it only shows an icon.
The product code is 149,606 lines, about €180,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.
Visual & motion safety · Focus outline removed in CSS without a :focus replacement compiler-core/templates/docs-css/index.css
Visual & motion safety · Animation without a prefers-reduced-motion guard compiler-core/templates/docs-css/index.css
Visual & motion safety · Animation without a prefers-reduced-motion guard compiler-core/templates/docs-css/index.css
Visual & motion safety · Animation without a prefers-reduced-motion guard compiler-core/templates/docs-css/index.css
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 12 findings
These 12 critical or serious findings were in the previous survey, on 12 October 2026, and are gone from this one.
Code Duplication · Members sharing a duplicated core (11 members, 50+ identical tokens) compiler-core/src/ast.rs
Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) compiler-core/src/ast.rs
Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) hexpm/src/lib.rs
Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) compiler-core/src/parse.rs
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) compiler-core/src/erlang.rs
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) compiler-core/src/parse.rs
€61,000 to €300,000, for 1,010 to 3,203 hours of work, about 1.3 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 40. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 149,606 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 4 points · Low effort · ADR Quality
2
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
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 €180,000 to build again, about 1.3 person-years of work. Its weakest lens is Accessibility, at 28 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility 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 4 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
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.
139 modules, with 522 dependencies between them. 2 loops run through 53 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 99 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.
gleam_core.io uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.io, while a change to gleam_core.io can't break gleam_core.bit_array.
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.
gleam_core.warning uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.warning, while a change to gleam_core.warning can't break gleam_core.type_.error.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
2→14 gleam_core.warning uses gleam_core.exhaustivenesspart of a loop✕
Connections
1 pair of types, where a type in gleam_core.warning uses a type in gleam_core.exhaustiveness.
gleam_core.warning uses gleam_core.exhaustiveness, so a change to gleam_core.exhaustiveness can break gleam_core.warning, while a change to gleam_core.warning can't break gleam_core.exhaustiveness.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
3→32 pretty_arena uses gleam_formatpart of a loop✕
Connections
1 pair of types, where a type in pretty_arena uses a type in gleam_format.
src_span uses gleam_core.javascript.expression, so a change to gleam_core.javascript.expression can break src_span, while a change to src_span can't break gleam_core.javascript.expression.
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.
gleam_core.ast.untyped uses src_span, so a change to src_span can break gleam_core.ast.untyped, while a change to gleam_core.ast.untyped can't break src_span.
Position
Below the diagonal: gleam_core.ast.untyped uses a module listed above it, which is the healthy direction.
5→27 gleam_core.ast.untyped uses gleam_core.astpart of a loop✕
Connections
2 pairs of types, where a type in gleam_core.ast.untyped uses a type in gleam_core.ast.
gleam_core.ast.untyped uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.ast.untyped, while a change to gleam_core.ast.untyped can't break gleam_core.ast.
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.
gleam_core.javascript.expression uses pretty_arena, so a change to pretty_arena can break gleam_core.javascript.expression, while a change to gleam_core.javascript.expression can't break pretty_arena.
Position
Below the diagonal: gleam_core.javascript.expression uses a module listed above it, which is the healthy direction.
gleam_core.javascript.expression uses src_span, so a change to src_span can break gleam_core.javascript.expression, while a change to gleam_core.javascript.expression can't break src_span.
Position
Below the diagonal: gleam_core.javascript.expression uses a module listed above it, which is the healthy direction.
gleam_core.javascript.expression uses gleam_core.ast.untyped, so a change to gleam_core.ast.untyped can break gleam_core.javascript.expression, while a change to gleam_core.javascript.expression can't break gleam_core.ast.untyped.
Position
Below the diagonal: gleam_core.javascript.expression uses a module listed above it, which is the healthy direction.
6→24 gleam_core.javascript.expression uses gleam_core.type_part of a loop✕
Connections
4 pairs of types, where a type in gleam_core.javascript.expression uses a type in gleam_core.type_.
gleam_core.javascript.expression uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.javascript.expression, while a change to gleam_core.javascript.expression can't break gleam_core.type_.
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.
6→26 gleam_core.javascript.expression uses gleam_core.ast.typedpart of a loop✕
Connections
3 pairs of types, where a type in gleam_core.javascript.expression uses a type in gleam_core.ast.typed.
gleam_core.javascript.expression uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_core.javascript.expression, while a change to gleam_core.javascript.expression can't break gleam_core.ast.typed.
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.
6→27 gleam_core.javascript.expression uses gleam_core.astpart of a loop✕
Connections
4 pairs of types, where a type in gleam_core.javascript.expression uses a type in gleam_core.ast.
gleam_core.javascript.expression uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.javascript.expression, while a change to gleam_core.javascript.expression can't break gleam_core.ast.
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.
gleam_core.parse uses gleam_core.warning, so a change to gleam_core.warning can break gleam_core.parse, while a change to gleam_core.parse can't break gleam_core.warning.
Position
Below the diagonal: gleam_core.parse uses a module listed above it, which is the healthy direction.
gleam_core.parse uses gleam_core.ast.untyped, so a change to gleam_core.ast.untyped can break gleam_core.parse, while a change to gleam_core.parse can't break gleam_core.ast.untyped.
Position
Below the diagonal: gleam_core.parse uses a module listed above it, which is the healthy direction.
gleam_core.parse uses gleam_core.javascript.expression, so a change to gleam_core.javascript.expression can break gleam_core.parse, while a change to gleam_core.parse can't break gleam_core.javascript.expression.
Position
Below the diagonal: gleam_core.parse uses a module listed above it, which is the healthy direction.
7→10 gleam_core.parse uses gleam_core.type_.errorpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.parse uses a type in gleam_core.type_.error.
gleam_core.parse uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.parse, while a change to gleam_core.parse can't break gleam_core.type_.error.
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.
7→24 gleam_core.parse uses gleam_core.type_part of a loop✕
Connections
1 pair of types, where a type in gleam_core.parse uses a type in gleam_core.type_.
gleam_core.parse uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.parse, while a change to gleam_core.parse can't break gleam_core.type_.
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.
7→27 gleam_core.parse uses gleam_core.astpart of a loop✕
Connections
6 pairs of types, where a type in gleam_core.parse uses a type in gleam_core.ast.
gleam_core.parse uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.parse, while a change to gleam_core.parse can't break gleam_core.ast.
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.
hexpm.version uses gleam_core.javascript.expression, so a change to gleam_core.javascript.expression can break hexpm.version, while a change to hexpm.version can't break gleam_core.javascript.expression.
Position
Below the diagonal: hexpm.version uses a module listed above it, which is the healthy direction.
8→9 hexpm.version uses gleam_core.configpart of a loop✕
Connections
1 pair of types, where a type in hexpm.version uses a type in gleam_core.config.
hexpm.version uses gleam_core.config, so a change to gleam_core.config can break hexpm.version, while a change to hexpm.version can't break gleam_core.config.
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→32 hexpm.version uses gleam_formatpart of a loop✕
Connections
4 pairs of types, where a type in hexpm.version uses a type in gleam_format.
gleam_core.config uses pretty_arena, so a change to pretty_arena can break gleam_core.config, while a change to gleam_core.config can't break pretty_arena.
Position
Below the diagonal: gleam_core.config uses a module listed above it, which is the healthy direction.
gleam_core.config uses hexpm.version, so a change to hexpm.version can break gleam_core.config, while a change to gleam_core.config can't break hexpm.version.
Position
Below the diagonal: gleam_core.config uses a module listed above it, which is the healthy direction.
9→32 gleam_core.config uses gleam_formatpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.config uses a type in gleam_format.
gleam_core.config uses gleam_format, so a change to gleam_format can break gleam_core.config, while a change to gleam_core.config can't break gleam_format.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
9→33 gleam_core.config uses gleam_core.manifestpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.config uses a type in gleam_core.manifest.
gleam_core.config uses gleam_core.manifest, so a change to gleam_core.manifest can break gleam_core.config, while a change to gleam_core.config can't break gleam_core.manifest.
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.
9→37 gleam_core.config uses gleam_clipart of a loop✕
Connections
1 pair of types, where a type in gleam_core.config uses a type in gleam_cli.
The types involved
gleam_core.config.PackageConfig → gleam_cli.Docs
Direction
gleam_core.config uses gleam_cli, so a change to gleam_cli can break gleam_core.config, while a change to gleam_core.config can't break gleam_cli.
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.
gleam_core.type_.error uses src_span, so a change to src_span can break gleam_core.type_.error, while a change to gleam_core.type_.error can't break src_span.
Position
Below the diagonal: gleam_core.type_.error uses a module listed above it, which is the healthy direction.
gleam_core.type_.error uses gleam_core.parse, so a change to gleam_core.parse can break gleam_core.type_.error, while a change to gleam_core.type_.error can't break gleam_core.parse.
Position
Below the diagonal: gleam_core.type_.error uses a module listed above it, which is the healthy direction.
gleam_core.type_.error uses hexpm.version, so a change to hexpm.version can break gleam_core.type_.error, while a change to gleam_core.type_.error can't break hexpm.version.
Position
Below the diagonal: gleam_core.type_.error uses a module listed above it, which is the healthy direction.
10→15 gleam_core.type_.error uses gleam_core.type_.expressionpart of a loop✕
Connections
2 pairs of types, where a type in gleam_core.type_.error uses a type in gleam_core.type_.expression.
gleam_core.type_.error uses gleam_core.type_.expression, so a change to gleam_core.type_.expression can break gleam_core.type_.error, while a change to gleam_core.type_.error can't break gleam_core.type_.expression.
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.
10→24 gleam_core.type_.error uses gleam_core.type_part of a loop✕
Connections
1 pair of types, where a type in gleam_core.type_.error uses a type in gleam_core.type_.
gleam_core.type_.error uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.type_.error, while a change to gleam_core.type_.error can't break gleam_core.type_.
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.
10→25 gleam_core.type_.error uses gleam_core.bit_arraypart of a loop✕
Connections
3 pairs of types, where a type in gleam_core.type_.error uses a type in gleam_core.bit_array.
gleam_core.type_.error uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.type_.error, while a change to gleam_core.type_.error can't break gleam_core.bit_array.
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.
10→27 gleam_core.type_.error uses gleam_core.astpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.type_.error uses a type in gleam_core.ast.
gleam_core.type_.error uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.type_.error, while a change to gleam_core.type_.error can't break gleam_core.ast.
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.
gleam_core.type_.fields uses src_span, so a change to src_span can break gleam_core.type_.fields, while a change to gleam_core.type_.fields can't break src_span.
Position
Below the diagonal: gleam_core.type_.fields uses a module listed above it, which is the healthy direction.
gleam_core.type_.fields uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.type_.fields, while a change to gleam_core.type_.fields can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_core.type_.fields uses a module listed above it, which is the healthy direction.
11→27 gleam_core.type_.fields uses gleam_core.astpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.type_.fields uses a type in gleam_core.ast.
gleam_core.type_.fields uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.type_.fields, while a change to gleam_core.type_.fields can't break gleam_core.ast.
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.
gleam_core.analyse uses gleam_core.warning, so a change to gleam_core.warning can break gleam_core.analyse, while a change to gleam_core.analyse can't break gleam_core.warning.
Position
Below the diagonal: gleam_core.analyse uses a module listed above it, which is the healthy direction.
gleam_core.analyse uses hexpm.version, so a change to hexpm.version can break gleam_core.analyse, while a change to gleam_core.analyse can't break hexpm.version.
Position
Below the diagonal: gleam_core.analyse uses a module listed above it, which is the healthy direction.
gleam_core.analyse uses gleam_core.config, so a change to gleam_core.config can break gleam_core.analyse, while a change to gleam_core.analyse can't break gleam_core.config.
Position
Below the diagonal: gleam_core.analyse uses a module listed above it, which is the healthy direction.
gleam_core.analyse uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.analyse, while a change to gleam_core.analyse can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_core.analyse uses a module listed above it, which is the healthy direction.
gleam_core.analyse uses gleam_core.type_.fields, so a change to gleam_core.type_.fields can break gleam_core.analyse, while a change to gleam_core.analyse can't break gleam_core.type_.fields.
Position
Below the diagonal: gleam_core.analyse uses a module listed above it, which is the healthy direction.
12→13 gleam_core.analyse uses gleam_core.type_.environmentpart of a loop✕
Connections
2 pairs of types, where a type in gleam_core.analyse uses a type in gleam_core.type_.environment.
gleam_core.analyse uses gleam_core.type_.environment, so a change to gleam_core.type_.environment can break gleam_core.analyse, while a change to gleam_core.analyse can't break gleam_core.type_.environment.
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.
12→24 gleam_core.analyse uses gleam_core.type_part of a loop✕
Connections
4 pairs of types, where a type in gleam_core.analyse uses a type in gleam_core.type_.
gleam_core.analyse uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.analyse, while a change to gleam_core.analyse can't break gleam_core.type_.
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.
12→25 gleam_core.analyse uses gleam_core.bit_arraypart of a loop✕
Connections
1 pair of types, where a type in gleam_core.analyse uses a type in gleam_core.bit_array.
gleam_core.analyse uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.analyse, while a change to gleam_core.analyse can't break gleam_core.bit_array.
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.
12→27 gleam_core.analyse uses gleam_core.astpart of a loop✕
Connections
5 pairs of types, where a type in gleam_core.analyse uses a type in gleam_core.ast.
gleam_core.analyse uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.analyse, while a change to gleam_core.analyse can't break gleam_core.ast.
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.
gleam_core.type_.environment uses src_span, so a change to src_span can break gleam_core.type_.environment, while a change to gleam_core.type_.environment can't break src_span.
Position
Below the diagonal: gleam_core.type_.environment uses a module listed above it, which is the healthy direction.
gleam_core.type_.environment uses hexpm.version, so a change to hexpm.version can break gleam_core.type_.environment, while a change to gleam_core.type_.environment can't break hexpm.version.
Position
Below the diagonal: gleam_core.type_.environment uses a module listed above it, which is the healthy direction.
gleam_core.type_.environment uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.type_.environment, while a change to gleam_core.type_.environment can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_core.type_.environment uses a module listed above it, which is the healthy direction.
gleam_core.type_.environment uses gleam_core.analyse, so a change to gleam_core.analyse can break gleam_core.type_.environment, while a change to gleam_core.type_.environment can't break gleam_core.analyse.
Position
Below the diagonal: gleam_core.type_.environment uses a module listed above it, which is the healthy direction.
13→16 gleam_core.type_.environment uses gleam_core.package_interfacepart of a loop✕
Connections
1 pair of types, where a type in gleam_core.type_.environment uses a type in gleam_core.package_interface.
gleam_core.type_.environment uses gleam_core.package_interface, so a change to gleam_core.package_interface can break gleam_core.type_.environment, while a change to gleam_core.type_.environment can't break gleam_core.package_interface.
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.
13→23 gleam_core.type_.environment uses gleam_core.docspart of a loop✕
Connections
1 pair of types, where a type in gleam_core.type_.environment uses a type in gleam_core.docs.
gleam_core.type_.environment uses gleam_core.docs, so a change to gleam_core.docs can break gleam_core.type_.environment, while a change to gleam_core.type_.environment can't break gleam_core.docs.
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.
13→24 gleam_core.type_.environment uses gleam_core.type_part of a loop✕
Connections
9 pairs of types, where a type in gleam_core.type_.environment uses a type in gleam_core.type_.
gleam_core.type_.environment uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.type_.environment, while a change to gleam_core.type_.environment can't break gleam_core.type_.
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.
13→27 gleam_core.type_.environment uses gleam_core.astpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.type_.environment uses a type in gleam_core.ast.
gleam_core.type_.environment uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.type_.environment, while a change to gleam_core.type_.environment can't break gleam_core.ast.
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.
gleam_core.exhaustiveness uses src_span, so a change to src_span can break gleam_core.exhaustiveness, while a change to gleam_core.exhaustiveness can't break src_span.
Position
Below the diagonal: gleam_core.exhaustiveness uses a module listed above it, which is the healthy direction.
gleam_core.exhaustiveness uses gleam_core.type_.environment, so a change to gleam_core.type_.environment can break gleam_core.exhaustiveness, while a change to gleam_core.exhaustiveness can't break gleam_core.type_.environment.
Position
Below the diagonal: gleam_core.exhaustiveness uses a module listed above it, which is the healthy direction.
14→24 gleam_core.exhaustiveness uses gleam_core.type_part of a loop✕
Connections
8 pairs of types, where a type in gleam_core.exhaustiveness uses a type in gleam_core.type_.
gleam_core.exhaustiveness uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.exhaustiveness, while a change to gleam_core.exhaustiveness can't break gleam_core.type_.
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.
14→27 gleam_core.exhaustiveness uses gleam_core.astpart of a loop✕
Connections
5 pairs of types, where a type in gleam_core.exhaustiveness uses a type in gleam_core.ast.
gleam_core.exhaustiveness uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.exhaustiveness, while a change to gleam_core.exhaustiveness can't break gleam_core.ast.
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.
gleam_core.type_.expression uses src_span, so a change to src_span can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break src_span.
Position
Below the diagonal: gleam_core.type_.expression uses a module listed above it, which is the healthy direction.
gleam_core.type_.expression uses gleam_core.ast.untyped, so a change to gleam_core.ast.untyped can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.ast.untyped.
Position
Below the diagonal: gleam_core.type_.expression uses a module listed above it, which is the healthy direction.
gleam_core.type_.expression uses gleam_core.parse, so a change to gleam_core.parse can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.parse.
Position
Below the diagonal: gleam_core.type_.expression uses a module listed above it, which is the healthy direction.
gleam_core.type_.expression uses hexpm.version, so a change to hexpm.version can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break hexpm.version.
Position
Below the diagonal: gleam_core.type_.expression uses a module listed above it, which is the healthy direction.
gleam_core.type_.expression uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_core.type_.expression uses a module listed above it, which is the healthy direction.
gleam_core.type_.expression uses gleam_core.type_.fields, so a change to gleam_core.type_.fields can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.type_.fields.
Position
Below the diagonal: gleam_core.type_.expression uses a module listed above it, which is the healthy direction.
gleam_core.type_.expression uses gleam_core.type_.environment, so a change to gleam_core.type_.environment can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.type_.environment.
Position
Below the diagonal: gleam_core.type_.expression uses a module listed above it, which is the healthy direction.
gleam_core.type_.expression uses gleam_core.exhaustiveness, so a change to gleam_core.exhaustiveness can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.exhaustiveness.
Position
Below the diagonal: gleam_core.type_.expression uses a module listed above it, which is the healthy direction.
15→24 gleam_core.type_.expression uses gleam_core.type_part of a loop✕
Connections
8 pairs of types, where a type in gleam_core.type_.expression uses a type in gleam_core.type_.
gleam_core.type_.expression uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.type_.
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.
15→25 gleam_core.type_.expression uses gleam_core.bit_arraypart of a loop✕
Connections
1 pair of types, where a type in gleam_core.type_.expression uses a type in gleam_core.bit_array.
gleam_core.type_.expression uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.bit_array.
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.
15→26 gleam_core.type_.expression uses gleam_core.ast.typedpart of a loop✕
Connections
3 pairs of types, where a type in gleam_core.type_.expression uses a type in gleam_core.ast.typed.
gleam_core.type_.expression uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.ast.typed.
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.
15→27 gleam_core.type_.expression uses gleam_core.astpart of a loop✕
Connections
11 pairs of types, where a type in gleam_core.type_.expression uses a type in gleam_core.ast.
gleam_core.type_.expression uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.type_.expression, while a change to gleam_core.type_.expression can't break gleam_core.ast.
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.
gleam_core.package_interface uses gleam_core.type_.expression, so a change to gleam_core.type_.expression can break gleam_core.package_interface, while a change to gleam_core.package_interface can't break gleam_core.type_.expression.
Position
Below the diagonal: gleam_core.package_interface uses a module listed above it, which is the healthy direction.
16→22 gleam_core.package_interface uses hexpmpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.package_interface uses a type in hexpm.
gleam_core.package_interface uses hexpm, so a change to hexpm can break gleam_core.package_interface, while a change to gleam_core.package_interface can't break hexpm.
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.
16→24 gleam_core.package_interface uses gleam_core.type_part of a loop✕
Connections
4 pairs of types, where a type in gleam_core.package_interface uses a type in gleam_core.type_.
gleam_core.package_interface uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.package_interface, while a change to gleam_core.package_interface can't break gleam_core.type_.
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.
gleam_core.build.package_compiler uses gleam_core.io, so a change to gleam_core.io can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break gleam_core.io.
Position
Below the diagonal: gleam_core.build.package_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.package_compiler uses gleam_core.warning, so a change to gleam_core.warning can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break gleam_core.warning.
Position
Below the diagonal: gleam_core.build.package_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.package_compiler uses pretty_arena, so a change to pretty_arena can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break pretty_arena.
Position
Below the diagonal: gleam_core.build.package_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.package_compiler uses src_span, so a change to src_span can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break src_span.
Position
Below the diagonal: gleam_core.build.package_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.package_compiler uses gleam_core.config, so a change to gleam_core.config can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break gleam_core.config.
Position
Below the diagonal: gleam_core.build.package_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.package_compiler uses gleam_core.analyse, so a change to gleam_core.analyse can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break gleam_core.analyse.
Position
Below the diagonal: gleam_core.build.package_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.package_compiler uses gleam_core.package_interface, so a change to gleam_core.package_interface can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break gleam_core.package_interface.
Position
Below the diagonal: gleam_core.build.package_compiler uses a module listed above it, which is the healthy direction.
17→18 gleam_core.build.package_compiler uses gleam_core.build.package_loaderpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.build.package_compiler uses a type in gleam_core.build.package_loader.
gleam_core.build.package_compiler uses gleam_core.build.package_loader, so a change to gleam_core.build.package_loader can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break gleam_core.build.package_loader.
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.
17→27 gleam_core.build.package_compiler uses gleam_core.astpart of a loop✕
Connections
3 pairs of types, where a type in gleam_core.build.package_compiler uses a type in gleam_core.ast.
gleam_core.build.package_compiler uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.build.package_compiler, while a change to gleam_core.build.package_compiler can't break gleam_core.ast.
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.
gleam_core.build.package_loader uses gleam_core.warning, so a change to gleam_core.warning can break gleam_core.build.package_loader, while a change to gleam_core.build.package_loader can't break gleam_core.warning.
Position
Below the diagonal: gleam_core.build.package_loader uses a module listed above it, which is the healthy direction.
gleam_core.build.package_loader uses pretty_arena, so a change to pretty_arena can break gleam_core.build.package_loader, while a change to gleam_core.build.package_loader can't break pretty_arena.
Position
Below the diagonal: gleam_core.build.package_loader uses a module listed above it, which is the healthy direction.
gleam_core.build.package_loader uses gleam_core.build.package_compiler, so a change to gleam_core.build.package_compiler can break gleam_core.build.package_loader, while a change to gleam_core.build.package_loader can't break gleam_core.build.package_compiler.
Position
Below the diagonal: gleam_core.build.package_loader uses a module listed above it, which is the healthy direction.
18→25 gleam_core.build.package_loader uses gleam_core.bit_arraypart of a loop✕
Connections
1 pair of types, where a type in gleam_core.build.package_loader uses a type in gleam_core.bit_array.
gleam_core.build.package_loader uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.build.package_loader, while a change to gleam_core.build.package_loader can't break gleam_core.bit_array.
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.
18→36 gleam_core.build.package_loader uses gleam_core.pathspart of a loop✕
Connections
1 pair of types, where a type in gleam_core.build.package_loader uses a type in gleam_core.paths.
gleam_core.build.package_loader uses gleam_core.paths, so a change to gleam_core.paths can break gleam_core.build.package_loader, while a change to gleam_core.build.package_loader can't break gleam_core.paths.
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.
gleam_core.build.project_compiler uses gleam_core.io, so a change to gleam_core.io can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break gleam_core.io.
Position
Below the diagonal: gleam_core.build.project_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.project_compiler uses gleam_core.warning, so a change to gleam_core.warning can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break gleam_core.warning.
Position
Below the diagonal: gleam_core.build.project_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.project_compiler uses pretty_arena, so a change to pretty_arena can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break pretty_arena.
Position
Below the diagonal: gleam_core.build.project_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.project_compiler uses hexpm.version, so a change to hexpm.version can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break hexpm.version.
Position
Below the diagonal: gleam_core.build.project_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.project_compiler uses gleam_core.config, so a change to gleam_core.config can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break gleam_core.config.
Position
Below the diagonal: gleam_core.build.project_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.project_compiler uses gleam_core.analyse, so a change to gleam_core.analyse can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break gleam_core.analyse.
Position
Below the diagonal: gleam_core.build.project_compiler uses a module listed above it, which is the healthy direction.
gleam_core.build.project_compiler uses gleam_core.build.package_loader, so a change to gleam_core.build.package_loader can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break gleam_core.build.package_loader.
Position
Below the diagonal: gleam_core.build.project_compiler uses a module listed above it, which is the healthy direction.
19→22 gleam_core.build.project_compiler uses hexpmpart of a loop✕
Connections
1 pair of types, where a type in gleam_core.build.project_compiler uses a type in hexpm.
gleam_core.build.project_compiler uses hexpm, so a change to hexpm can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break hexpm.
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.
19→25 gleam_core.build.project_compiler uses gleam_core.bit_arraypart of a loop✕
Connections
1 pair of types, where a type in gleam_core.build.project_compiler uses a type in gleam_core.bit_array.
gleam_core.build.project_compiler uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break gleam_core.bit_array.
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.
19→33 gleam_core.build.project_compiler uses gleam_core.manifestpart of a loop✕
Connections
2 pairs of types, where a type in gleam_core.build.project_compiler uses a type in gleam_core.manifest.
gleam_core.build.project_compiler uses gleam_core.manifest, so a change to gleam_core.manifest can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break gleam_core.manifest.
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.
19→36 gleam_core.build.project_compiler uses gleam_core.pathspart of a loop✕
Connections
1 pair of types, where a type in gleam_core.build.project_compiler uses a type in gleam_core.paths.
gleam_core.build.project_compiler uses gleam_core.paths, so a change to gleam_core.paths can break gleam_core.build.project_compiler, while a change to gleam_core.build.project_compiler can't break gleam_core.paths.
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.
gleam_language_server.compiler uses gleam_core.warning, so a change to gleam_core.warning can break gleam_language_server.compiler, while a change to gleam_language_server.compiler can't break gleam_core.warning.
Position
Below the diagonal: gleam_language_server.compiler uses a module listed above it, which is the healthy direction.
gleam_language_server.compiler uses src_span, so a change to src_span can break gleam_language_server.compiler, while a change to gleam_language_server.compiler can't break src_span.
Position
Below the diagonal: gleam_language_server.compiler uses a module listed above it, which is the healthy direction.
gleam_language_server.compiler uses gleam_core.config, so a change to gleam_core.config can break gleam_language_server.compiler, while a change to gleam_language_server.compiler can't break gleam_core.config.
Position
Below the diagonal: gleam_language_server.compiler uses a module listed above it, which is the healthy direction.
gleam_language_server.compiler uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_language_server.compiler, while a change to gleam_language_server.compiler can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_language_server.compiler uses a module listed above it, which is the healthy direction.
gleam_language_server.compiler uses gleam_core.package_interface, so a change to gleam_core.package_interface can break gleam_language_server.compiler, while a change to gleam_language_server.compiler can't break gleam_core.package_interface.
Position
Below the diagonal: gleam_language_server.compiler uses a module listed above it, which is the healthy direction.
gleam_language_server.compiler uses gleam_core.build.project_compiler, so a change to gleam_core.build.project_compiler can break gleam_language_server.compiler, while a change to gleam_language_server.compiler can't break gleam_core.build.project_compiler.
Position
Below the diagonal: gleam_language_server.compiler uses a module listed above it, which is the healthy direction.
20→33 gleam_language_server.compiler uses gleam_core.manifestpart of a loop✕
Connections
1 pair of types, where a type in gleam_language_server.compiler uses a type in gleam_core.manifest.
gleam_language_server.compiler uses gleam_core.manifest, so a change to gleam_core.manifest can break gleam_language_server.compiler, while a change to gleam_language_server.compiler can't break gleam_core.manifest.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
20→36 gleam_language_server.compiler uses gleam_core.pathspart of a loop✕
Connections
1 pair of types, where a type in gleam_language_server.compiler uses a type in gleam_core.paths.
gleam_language_server.compiler uses gleam_core.paths, so a change to gleam_core.paths can break gleam_language_server.compiler, while a change to gleam_language_server.compiler can't break gleam_core.paths.
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.
gleam_language_server.engine uses src_span, so a change to src_span can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break src_span.
Position
Below the diagonal: gleam_language_server.engine uses a module listed above it, which is the healthy direction.
gleam_language_server.engine uses gleam_core.javascript.expression, so a change to gleam_core.javascript.expression can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.javascript.expression.
Position
Below the diagonal: gleam_language_server.engine uses a module listed above it, which is the healthy direction.
gleam_language_server.engine uses hexpm.version, so a change to hexpm.version can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break hexpm.version.
Position
Below the diagonal: gleam_language_server.engine uses a module listed above it, which is the healthy direction.
gleam_language_server.engine uses gleam_core.config, so a change to gleam_core.config can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.config.
Position
Below the diagonal: gleam_language_server.engine uses a module listed above it, which is the healthy direction.
gleam_language_server.engine uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_language_server.engine uses a module listed above it, which is the healthy direction.
gleam_language_server.engine uses gleam_core.package_interface, so a change to gleam_core.package_interface can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.package_interface.
Position
Below the diagonal: gleam_language_server.engine uses a module listed above it, which is the healthy direction.
gleam_language_server.engine uses gleam_language_server.compiler, so a change to gleam_language_server.compiler can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_language_server.compiler.
Position
Below the diagonal: gleam_language_server.engine uses a module listed above it, which is the healthy direction.
21→23 gleam_language_server.engine uses gleam_core.docspart of a loop✕
Connections
1 pair of types, where a type in gleam_language_server.engine uses a type in gleam_core.docs.
gleam_language_server.engine uses gleam_core.docs, so a change to gleam_core.docs can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.docs.
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.
21→24 gleam_language_server.engine uses gleam_core.type_part of a loop✕
Connections
3 pairs of types, where a type in gleam_language_server.engine uses a type in gleam_core.type_.
gleam_language_server.engine uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.type_.
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.
21→25 gleam_language_server.engine uses gleam_core.bit_arraypart of a loop✕
Connections
2 pairs of types, where a type in gleam_language_server.engine uses a type in gleam_core.bit_array.
gleam_language_server.engine uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.bit_array.
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.
21→26 gleam_language_server.engine uses gleam_core.ast.typedpart of a loop✕
Connections
1 pair of types, where a type in gleam_language_server.engine uses a type in gleam_core.ast.typed.
gleam_language_server.engine uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.ast.typed.
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.
21→27 gleam_language_server.engine uses gleam_core.astpart of a loop✕
Connections
5 pairs of types, where a type in gleam_language_server.engine uses a type in gleam_core.ast.
gleam_language_server.engine uses gleam_core.ast, so a change to gleam_core.ast can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.ast.
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.
21→36 gleam_language_server.engine uses gleam_core.pathspart of a loop✕
Connections
1 pair of types, where a type in gleam_language_server.engine uses a type in gleam_core.paths.
gleam_language_server.engine uses gleam_core.paths, so a change to gleam_core.paths can break gleam_language_server.engine, while a change to gleam_language_server.engine can't break gleam_core.paths.
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.
hexpm uses gleam_language_server.engine, so a change to gleam_language_server.engine can break hexpm, while a change to hexpm can't break gleam_language_server.engine.
Position
Below the diagonal: hexpm uses a module listed above it, which is the healthy direction.
gleam_core.docs uses gleam_core.io, so a change to gleam_core.io can break gleam_core.docs, while a change to gleam_core.docs can't break gleam_core.io.
Position
Below the diagonal: gleam_core.docs uses a module listed above it, which is the healthy direction.
gleam_core.docs uses hexpm.version, so a change to hexpm.version can break gleam_core.docs, while a change to gleam_core.docs can't break hexpm.version.
Position
Below the diagonal: gleam_core.docs uses a module listed above it, which is the healthy direction.
gleam_core.docs uses gleam_core.config, so a change to gleam_core.config can break gleam_core.docs, while a change to gleam_core.docs can't break gleam_core.config.
Position
Below the diagonal: gleam_core.docs uses a module listed above it, which is the healthy direction.
gleam_core.docs uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.docs, while a change to gleam_core.docs can't break gleam_core.ast.
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.
23→36 gleam_core.docs uses gleam_core.pathspart of a loop✕
Connections
1 pair of types, where a type in gleam_core.docs uses a type in gleam_core.paths.
gleam_core.docs uses gleam_core.paths, so a change to gleam_core.paths can break gleam_core.docs, while a change to gleam_core.docs can't break gleam_core.paths.
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.
gleam_core.type_ uses hexpm.version, so a change to hexpm.version can break gleam_core.type_, while a change to gleam_core.type_ can't break hexpm.version.
Position
Below the diagonal: gleam_core.type_ uses a module listed above it, which is the healthy direction.
gleam_core.type_ uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.type_, while a change to gleam_core.type_ can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_core.type_ uses a module listed above it, which is the healthy direction.
gleam_core.type_ uses gleam_core.type_.fields, so a change to gleam_core.type_.fields can break gleam_core.type_, while a change to gleam_core.type_ can't break gleam_core.type_.fields.
Position
Below the diagonal: gleam_core.type_ uses a module listed above it, which is the healthy direction.
gleam_core.type_ uses gleam_core.type_.environment, so a change to gleam_core.type_.environment can break gleam_core.type_, while a change to gleam_core.type_ can't break gleam_core.type_.environment.
Position
Below the diagonal: gleam_core.type_ uses a module listed above it, which is the healthy direction.
gleam_core.type_ uses gleam_core.type_.expression, so a change to gleam_core.type_.expression can break gleam_core.type_, while a change to gleam_core.type_ can't break gleam_core.type_.expression.
Position
Below the diagonal: gleam_core.type_ uses a module listed above it, which is the healthy direction.
gleam_core.type_ uses gleam_core.docs, so a change to gleam_core.docs can break gleam_core.type_, while a change to gleam_core.type_ can't break gleam_core.docs.
Position
Below the diagonal: gleam_core.type_ uses a module listed above it, which is the healthy direction.
24→27 gleam_core.type_ uses gleam_core.astpart of a loop✕
Connections
8 pairs of types, where a type in gleam_core.type_ uses a type in gleam_core.ast.
gleam_core.type_ uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.type_, while a change to gleam_core.type_ can't break gleam_core.ast.
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.
gleam_core.bit_array uses src_span, so a change to src_span can break gleam_core.bit_array, while a change to gleam_core.bit_array can't break src_span.
Position
Below the diagonal: gleam_core.bit_array uses a module listed above it, which is the healthy direction.
gleam_core.bit_array uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.bit_array, while a change to gleam_core.bit_array can't break gleam_core.type_.
Position
Below the diagonal: gleam_core.bit_array uses a module listed above it, which is the healthy direction.
25→27 gleam_core.bit_array uses gleam_core.astpart of a loop✕
Connections
2 pairs of types, where a type in gleam_core.bit_array uses a type in gleam_core.ast.
gleam_core.bit_array uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.bit_array, while a change to gleam_core.bit_array can't break gleam_core.ast.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
1 pair of types, where a type in gleam_core.ast.typed uses a type in src_span.
The types involved
gleam_core.ast.typed.TypedExpr → src_span.SrcSpan
Direction
gleam_core.ast.typed uses src_span, so a change to src_span can break gleam_core.ast.typed, while a change to gleam_core.ast.typed can't break src_span.
Position
Below the diagonal: gleam_core.ast.typed uses a module listed above it, which is the healthy direction.
gleam_core.ast.typed uses gleam_core.type_.fields, so a change to gleam_core.type_.fields can break gleam_core.ast.typed, while a change to gleam_core.ast.typed can't break gleam_core.type_.fields.
Position
Below the diagonal: gleam_core.ast.typed uses a module listed above it, which is the healthy direction.
gleam_core.ast.typed uses gleam_core.type_.expression, so a change to gleam_core.type_.expression can break gleam_core.ast.typed, while a change to gleam_core.ast.typed can't break gleam_core.type_.expression.
Position
Below the diagonal: gleam_core.ast.typed uses a module listed above it, which is the healthy direction.
gleam_core.ast.typed uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.ast.typed, while a change to gleam_core.ast.typed can't break gleam_core.type_.
Position
Below the diagonal: gleam_core.ast.typed uses a module listed above it, which is the healthy direction.
gleam_core.ast.typed uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.ast.typed, while a change to gleam_core.ast.typed can't break gleam_core.bit_array.
Position
Below the diagonal: gleam_core.ast.typed uses a module listed above it, which is the healthy direction.
26→27 gleam_core.ast.typed uses gleam_core.astpart of a loop✕
Connections
2 pairs of types, where a type in gleam_core.ast.typed uses a type in gleam_core.ast.
gleam_core.ast.typed uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.ast.typed, while a change to gleam_core.ast.typed can't break gleam_core.ast.
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.
38 pairs of types, where a type in gleam_core.ast uses a type in src_span. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
gleam_core.ast uses gleam_core.exhaustiveness, so a change to gleam_core.exhaustiveness can break gleam_core.ast, while a change to gleam_core.ast can't break gleam_core.exhaustiveness.
Position
Below the diagonal: gleam_core.ast uses a module listed above it, which is the healthy direction.
gleam_core.ast uses gleam_core.type_.expression, so a change to gleam_core.type_.expression can break gleam_core.ast, while a change to gleam_core.ast can't break gleam_core.type_.expression.
Position
Below the diagonal: gleam_core.ast uses a module listed above it, which is the healthy direction.
gleam_core.ast uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.ast, while a change to gleam_core.ast can't break gleam_core.type_.
Position
Below the diagonal: gleam_core.ast uses a module listed above it, which is the healthy direction.
gleam_core.ast uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_core.ast, while a change to gleam_core.ast can't break gleam_core.ast.typed.
Position
Below the diagonal: gleam_core.ast uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses src_span, so a change to src_span can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break src_span.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses gleam_core.ast.untyped, so a change to gleam_core.ast.untyped can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break gleam_core.ast.untyped.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses gleam_core.parse, so a change to gleam_core.parse can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break gleam_core.parse.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses gleam_core.analyse, so a change to gleam_core.analyse can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break gleam_core.analyse.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses gleam_core.exhaustiveness, so a change to gleam_core.exhaustiveness can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break gleam_core.exhaustiveness.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break gleam_core.type_.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break gleam_core.ast.typed.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.ast.visit uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.ast.visit, while a change to gleam_core.ast.visit can't break gleam_core.ast.
Position
Below the diagonal: gleam_core.ast.visit uses a module listed above it, which is the healthy direction.
gleam_core.docs.printer uses pretty_arena, so a change to pretty_arena can break gleam_core.docs.printer, while a change to gleam_core.docs.printer can't break pretty_arena.
Position
Below the diagonal: gleam_core.docs.printer uses a module listed above it, which is the healthy direction.
gleam_core.docs.printer uses gleam_core.docs, so a change to gleam_core.docs can break gleam_core.docs.printer, while a change to gleam_core.docs.printer can't break gleam_core.docs.
Position
Below the diagonal: gleam_core.docs.printer uses a module listed above it, which is the healthy direction.
gleam_core.docs.printer uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.docs.printer, while a change to gleam_core.docs.printer can't break gleam_core.type_.
Position
Below the diagonal: gleam_core.docs.printer uses a module listed above it, which is the healthy direction.
gleam_core.docs.printer uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.docs.printer, while a change to gleam_core.docs.printer can't break gleam_core.ast.
Position
Below the diagonal: gleam_core.docs.printer uses a module listed above it, which is the healthy direction.
gleam_core.error uses hexpm.version, so a change to hexpm.version can break gleam_core.error, while a change to gleam_core.error can't break hexpm.version.
Position
Below the diagonal: gleam_core.error uses a module listed above it, which is the healthy direction.
gleam_core.error uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.error, while a change to gleam_core.error can't break gleam_core.type_.
Position
Below the diagonal: gleam_core.error uses a module listed above it, which is the healthy direction.
gleam_core.error uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.error, while a change to gleam_core.error can't break gleam_core.bit_array.
Position
Below the diagonal: gleam_core.error uses a module listed above it, which is the healthy direction.
gleam_core.error uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.error, while a change to gleam_core.error can't break gleam_core.ast.
Position
Below the diagonal: gleam_core.error uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses src_span, so a change to src_span can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break src_span.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.javascript.expression, so a change to gleam_core.javascript.expression can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.javascript.expression.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.parse, so a change to gleam_core.parse can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.parse.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses hexpm.version, so a change to hexpm.version can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break hexpm.version.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.type_.fields, so a change to gleam_core.type_.fields can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.type_.fields.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.type_.environment, so a change to gleam_core.type_.environment can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.type_.environment.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.type_.expression, so a change to gleam_core.type_.expression can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.type_.expression.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.type_.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.bit_array.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.ast.typed.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_core.type_.pattern uses gleam_core.ast, so a change to gleam_core.ast can break gleam_core.type_.pattern, while a change to gleam_core.type_.pattern can't break gleam_core.ast.
Position
Below the diagonal: gleam_core.type_.pattern uses a module listed above it, which is the healthy direction.
gleam_format uses gleam_core.ast.untyped, so a change to gleam_core.ast.untyped can break gleam_format, while a change to gleam_format can't break gleam_core.ast.untyped.
Position
Below the diagonal: gleam_format uses a module listed above it, which is the healthy direction.
gleam_format uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_format, while a change to gleam_format can't break gleam_core.type_.
Position
Below the diagonal: gleam_format uses a module listed above it, which is the healthy direction.
gleam_core.manifest uses hexpm.version, so a change to hexpm.version can break gleam_core.manifest, while a change to gleam_core.manifest can't break hexpm.version.
Position
Below the diagonal: gleam_core.manifest uses a module listed above it, which is the healthy direction.
gleam_core.manifest uses gleam_format, so a change to gleam_format can break gleam_core.manifest, while a change to gleam_core.manifest can't break gleam_format.
Position
Below the diagonal: gleam_core.manifest uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses src_span, so a change to src_span can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break src_span.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.ast.untyped, so a change to gleam_core.ast.untyped can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.ast.untyped.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.javascript.expression, so a change to gleam_core.javascript.expression can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.javascript.expression.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses hexpm.version, so a change to hexpm.version can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break hexpm.version.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.type_.fields, so a change to gleam_core.type_.fields can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.type_.fields.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.package_interface, so a change to gleam_core.package_interface can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.package_interface.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_language_server.compiler, so a change to gleam_language_server.compiler can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_language_server.compiler.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.docs, so a change to gleam_core.docs can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.docs.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.type_.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.ast.typed.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.ast, so a change to gleam_core.ast can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.ast.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.completer uses gleam_core.ast.visit, so a change to gleam_core.ast.visit can break gleam_language_server.completer, while a change to gleam_language_server.completer can't break gleam_core.ast.visit.
Position
Below the diagonal: gleam_language_server.completer uses a module listed above it, which is the healthy direction.
gleam_language_server.reference uses src_span, so a change to src_span can break gleam_language_server.reference, while a change to gleam_language_server.reference can't break src_span.
Position
Below the diagonal: gleam_language_server.reference uses a module listed above it, which is the healthy direction.
gleam_language_server.reference uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_language_server.reference, while a change to gleam_language_server.reference can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_language_server.reference uses a module listed above it, which is the healthy direction.
gleam_language_server.reference uses gleam_core.package_interface, so a change to gleam_core.package_interface can break gleam_language_server.reference, while a change to gleam_language_server.reference can't break gleam_core.package_interface.
Position
Below the diagonal: gleam_language_server.reference uses a module listed above it, which is the healthy direction.
gleam_language_server.reference uses gleam_language_server.compiler, so a change to gleam_language_server.compiler can break gleam_language_server.reference, while a change to gleam_language_server.reference can't break gleam_language_server.compiler.
Position
Below the diagonal: gleam_language_server.reference uses a module listed above it, which is the healthy direction.
gleam_language_server.reference uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_language_server.reference, while a change to gleam_language_server.reference can't break gleam_core.type_.
Position
Below the diagonal: gleam_language_server.reference uses a module listed above it, which is the healthy direction.
gleam_language_server.reference uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_language_server.reference, while a change to gleam_language_server.reference can't break gleam_core.ast.typed.
Position
Below the diagonal: gleam_language_server.reference uses a module listed above it, which is the healthy direction.
gleam_language_server.reference uses gleam_core.ast, so a change to gleam_core.ast can break gleam_language_server.reference, while a change to gleam_language_server.reference can't break gleam_core.ast.
Position
Below the diagonal: gleam_language_server.reference uses a module listed above it, which is the healthy direction.
gleam_language_server.reference uses gleam_core.ast.visit, so a change to gleam_core.ast.visit can break gleam_language_server.reference, while a change to gleam_language_server.reference can't break gleam_core.ast.visit.
Position
Below the diagonal: gleam_language_server.reference uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in gleam_core.paths uses a type in pretty_arena.
The types involved
gleam_core.paths.ProjectPaths → pretty_arena.Mode
Direction
gleam_core.paths uses pretty_arena, so a change to pretty_arena can break gleam_core.paths, while a change to gleam_core.paths can't break pretty_arena.
Position
Below the diagonal: gleam_core.paths uses a module listed above it, which is the healthy direction.
gleam_core.paths uses gleam_core.manifest, so a change to gleam_core.manifest can break gleam_core.paths, while a change to gleam_core.paths can't break gleam_core.manifest.
Position
Below the diagonal: gleam_core.paths uses a module listed above it, which is the healthy direction.
105 pairs of types, where a type in gleam_language_server.code_action uses a type in src_span. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
gleam_language_server.code_action uses src_span, so a change to src_span can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break src_span.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.ast.untyped, so a change to gleam_core.ast.untyped can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.ast.untyped.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses hexpm.version, so a change to hexpm.version can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break hexpm.version.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.config, so a change to gleam_core.config can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.config.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.type_.fields, so a change to gleam_core.type_.fields can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.type_.fields.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.analyse, so a change to gleam_core.analyse can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.analyse.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.exhaustiveness, so a change to gleam_core.exhaustiveness can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.exhaustiveness.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_language_server.compiler, so a change to gleam_language_server.compiler can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_language_server.compiler.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
57 pairs of types, where a type in gleam_language_server.code_action uses a type in gleam_core.type_. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
gleam_language_server.code_action uses gleam_core.type_, so a change to gleam_core.type_ can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.type_.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.bit_array.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.ast.typed, so a change to gleam_core.ast.typed can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.ast.typed.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
104 pairs of types, where a type in gleam_language_server.code_action uses a type in gleam_core.ast. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
gleam_language_server.code_action uses gleam_core.ast, so a change to gleam_core.ast can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.ast.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
45 pairs of types, where a type in gleam_language_server.code_action uses a type in gleam_core.ast.visit. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
gleam_language_server.code_action uses gleam_core.ast.visit, so a change to gleam_core.ast.visit can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.ast.visit.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.docs.printer, so a change to gleam_core.docs.printer can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.docs.printer.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_language_server.code_action uses gleam_core.paths, so a change to gleam_core.paths can break gleam_language_server.code_action, while a change to gleam_language_server.code_action can't break gleam_core.paths.
Position
Below the diagonal: gleam_language_server.code_action uses a module listed above it, which is the healthy direction.
gleam_cli.fs uses gleam_core.warning, so a change to gleam_core.warning can break gleam_cli.fs, while a change to gleam_cli.fs can't break gleam_core.warning.
Position
Below the diagonal: gleam_cli.fs uses a module listed above it, which is the healthy direction.
gleam_cli.fs uses gleam_core.type_.error, so a change to gleam_core.type_.error can break gleam_cli.fs, while a change to gleam_cli.fs can't break gleam_core.type_.error.
Position
Below the diagonal: gleam_cli.fs uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in gleam_cli.fs uses a type in gleam_core.error.
The types involved
gleam_cli.fs.fs$module → gleam_core.error.OS
Direction
gleam_cli.fs uses gleam_core.error, so a change to gleam_core.error can break gleam_cli.fs, while a change to gleam_cli.fs can't break gleam_core.error.
Position
Below the diagonal: gleam_cli.fs uses a module listed above it, which is the healthy direction.
gleam_cli.fs uses gleam_core.paths, so a change to gleam_core.paths can break gleam_cli.fs, while a change to gleam_cli.fs can't break gleam_core.paths.
Position
Below the diagonal: gleam_cli.fs uses a module listed above it, which is the healthy direction.
gleam_cli.dependencies uses gleam_core.io, so a change to gleam_core.io can break gleam_cli.dependencies, while a change to gleam_cli.dependencies can't break gleam_core.io.
Position
Below the diagonal: gleam_cli.dependencies uses a module listed above it, which is the healthy direction.
gleam_cli.dependencies uses hexpm.version, so a change to hexpm.version can break gleam_cli.dependencies, while a change to gleam_cli.dependencies can't break hexpm.version.
Position
Below the diagonal: gleam_cli.dependencies uses a module listed above it, which is the healthy direction.
gleam_cli.dependencies uses gleam_core.config, so a change to gleam_core.config can break gleam_cli.dependencies, while a change to gleam_cli.dependencies can't break gleam_core.config.
Position
Below the diagonal: gleam_cli.dependencies uses a module listed above it, which is the healthy direction.
gleam_cli.dependencies uses gleam_core.bit_array, so a change to gleam_core.bit_array can break gleam_cli.dependencies, while a change to gleam_cli.dependencies can't break gleam_core.bit_array.
Position
Below the diagonal: gleam_cli.dependencies uses a module listed above it, which is the healthy direction.
gleam_cli.dependencies uses gleam_core.manifest, so a change to gleam_core.manifest can break gleam_cli.dependencies, while a change to gleam_cli.dependencies can't break gleam_core.manifest.
Position
Below the diagonal: gleam_cli.dependencies uses a module listed above it, which is the healthy direction.
gleam_cli.dependencies uses gleam_core.paths, so a change to gleam_core.paths can break gleam_cli.dependencies, while a change to gleam_cli.dependencies can't break gleam_core.paths.
Position
Below the diagonal: gleam_cli.dependencies uses a module listed above it, which is the healthy direction.
gleam_cli.dependencies uses gleam_cli, so a change to gleam_cli can break gleam_cli.dependencies, while a change to gleam_cli.dependencies can't break gleam_cli.
Position
Below the diagonal: gleam_cli.dependencies uses a module listed above it, which is the healthy direction.
gleam_cli.dependencies uses gleam_cli.fs, so a change to gleam_cli.fs can break gleam_cli.dependencies, while a change to gleam_cli.dependencies can't break gleam_cli.fs.
Position
Below the diagonal: gleam_cli.dependencies uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 35% · Weak · gated by R1, R2, R3, X3 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
25
High / Critical
A02:2025 — Security Misconfiguration
19
High / Critical
A03:2025 — Software Supply Chain Failures
8
Medium
Roadmap
First, ensure all custom controls are fully keyboard-operable and anchors have valid hrefs to fix immediate interaction barriers. Next, improve visual safety by maintaining visible focus styles, respecting reduced motion preferences, and correcting low-contrast colors. Then, address the missing architectural decision record and enforce accessibility checks in your test suite to prevent future regressions. Finally, split the largest source files into smaller, focused modules to improve maintainability.
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.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
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.
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 — 21
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 — 729
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 — 40
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 14
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 72 of 72 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 72 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, 773 of 790 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.rs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 172 test files), but it was not re-run: its build outgrew the 6 GB scratch ceiling (6.049 GB measured) and was stopped; its suite was not run. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D19 Documentation Quality — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This 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.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via Dockerfile (REDACTED). docker build failed (exit 1) — ------ REDACTED:1 -------------------- 1 | >>> FROM elixir:alpine 2 | 3 | ARG TARGETARCH -------------------- ERROR: failed to solve: elixir:alpine: failed to resolve source metadata for docker.io/library/elixir:alpine: failed to do request: Head "https://registry-1.docker.io/v2/library/elixir/manifests/alpine": Forbidden; runtime evidence skipped.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Erlang, Rust is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Erlang, Rust is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
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.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python and Rust source only, and no C# was loaded, and no named async function in this repository's JavaScript/TypeScript, nor any Go, PHP or Dart function or Kotlin suspend function, makes a request that can be cancelled (fetch, axios, ky, ofetch; net/http, net.Dial; amphp; Dio; Ktor, OkHttp), so there is nothing to judge, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's 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.
X7 Silent fallback defaults — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. X7 measured the part of this repository it reads (C#, Python, TypeScript/JavaScript, Rust, Go, Java, Kotlin, Scala, PHP, Ruby, Swift and Dart), and its Erlang source is outside the check's reach, so the card covers only part of the product. That is a gap in this analyzer's language reach — not a finding that the unread source is free of silent defaults.
Repo exclusion declarations: 1 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
63 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was gleam_core::error::failed_module_diagnostics at 160. A further 33 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 Token::fmt at 71 — they are counted neither in the figure above nor in this dimension's score. 5 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: compiler-core/src/parse/token.rs (Token::fmt at 71), compiler-cli/src/lib.rs (Command::run at 38), compiler-core/src/ast/visit.rs (gleam_core::ast::visit::visit_typed_expr at 24), format/src/lib.rs (Formatter::expr at 23), compiler-core/src/ast_folder.rs (UntypedExprFolder::update_expr at 21). 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.
+ 28 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 6 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with gleam_core::error::failed_module_diagnostics (cyclomatic 160), Error::to_diagnostics (cyclomatic 124), Warning::to_diagnostic (cyclomatic 99). — 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 6 together lifts Cyclomatic Complexity from 5.5 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 42 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 6 bodies over 60 down to 60 or less in Cognitive Complexity — start with gleam_core::error::failed_module_diagnostics (cognitive 133), PatternTyper::unify (cognitive 88), Warning::to_diagnostic (cognitive 88). — 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 6 together lifts Cognitive Complexity from 5.6 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.4 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 44 MethodTooLong finding(s) in God Classes — start with expression.rs (10), analyse.rs (4), engine.rs (4). — One of this dimension's main actionable groups (44 warning-level).
Resolve the 41 FileTooLong finding(s) in God Classes — start with lib.rs (5), error.rs (3), expression.rs (2). — One of this dimension's main actionable groups (41 warning-level).
Resolve the 19 ClassTooLong finding(s) in God Classes — start with expression.rs (2), lib.rs, erlang.rs. — One of this dimension's main actionable groups (19 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
217 duplicated block group(s) detected. A further 14 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 101 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 16 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with echo.rs (7), erlang.rs (2), code_action.rs (2). — One of this dimension's main actionable groups (16 warning-level).
Resolve the 15 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with warning.rs (3), constant.rs (2), erlang.rs (2). — One of this dimension's main actionable groups (15 warning-level).
Resolve the 12 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with erlang.rs (2), echo.rs (2), prelude.rs (2). — One of this dimension's main actionable groups (12 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.0 / 10Strong✓ 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.
12 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 3 module(s) off the main sequence, with abstractness counted on 10 of the 12 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: erlang-term-format · ×3
What to do
Resolve the 3 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (3 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
6277 test methods: 6277 unit, 0 integration, 0 BDD, 0 e2e. The Rust suite contributes 6277 `#[test]` function(s) across 172 file(s) declaring at least one; its unit/integration split is Cargo's own — 0 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
2 outdated, 0 yanked direct Cargo dependencies. 73 of 74 direct crates were graded against crates.io (0 not published there, 1 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Outdated: pulldown-cmark · ×2
✓ 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 459 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.
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 24 Hotspot finding(s) in Churn × Complexity Hotspots — start with lib.rs (4), error.rs (2), expression.rs (2). — One of this dimension's main actionable groups (24 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor9.7 / 10Exemplary✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
4 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is erlang-term-format/src/tests.rs. Counted over 144 of the 162 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)
✓ On the Gold path — maintain.
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
113 deducted task-comment markers across 149606 LoC (0.1/KLoC) → score 9.9. 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 112 TodoComment finding(s) in Explicit Debt — start with project_compiler.rs (15), tests.rs (12), lib.rs (11). — One of this dimension's main actionable groups (112 warning-level).
Resolve the 1 FixmeComment finding(s) in Explicit Debt — start with io.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
1 of 11 build units (Cargo) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
27 finding(s): 0 critical, 3 high, 24 medium, 0 low. semgrep hit a parse error in 2 file(s) — `REDACTED` (lines 1–4), `REDACTED` (lines 1–8, lines 15–17, lines 24–27, …) — 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 4 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 13 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (10), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 2 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 10 High IaC finding(s) in IaC & Container Security — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (10 issue-level).
Resolve the 9 Medium IaC finding(s) in IaC & Container Security — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (9 warning-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 144 of the 162 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 5 Boundary-crossing change coupling finding(s) in Change Coupling — start with compile_package.rs, call_graph.rs, ast_folder.rs. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 4 Change coupling finding(s) in Change Coupling — start with ast_folder.rs, tests.rs, call_graph.rs. — One of this dimension's main actionable groups (4 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.
Build pipeline generates provenance, signs artifacts and produces an SBOM.
REDACTED
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
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.
AC2 · Forms & labels6.0 / 10Adequate✓ Tool-verified
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). — REDACTED:106
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). — REDACTED:5
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".
A positive tabindex forces a manual tab order that fights the DOM and is fragile. Use tabindex="0" (or restructure the DOM). — REDACTED:201
An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action. — REDACTED:243
A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler. — REDACTED:244
What to do
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
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.
`.page-header` sets color: #fdf1d4 on background-color: #ffaff3 — 1.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — compiler-core/templates/docs-css/index.css:302
`.search-input:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — compiler-core/templates/docs-css/index.css:963
`.sidebar` moves (`transition: transform 0.5s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — compiler-core/templates/docs-css/index.css:438
`.search-input-wrap` moves (`transition: height linear 200ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — compiler-core/templates/docs-css/index.css:923
`.search-input-wrap` moves (`transition: width ease 400ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — compiler-core/templates/docs-css/index.css:934
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 4 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
The root README is 90 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise — or with no heading at all — is not seen and this row may understate what the document covers.
What to do
Expand the README with getting-started, architecture overview and a project map.
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 16 of 17 project(s) that lack one — worth up to 1.9 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
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 README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability5.5 / 10Adequate✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 4/8 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `format`, `gleam-bin`, `src-span`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
R1 · Type Safety2.0 / 10Critical✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
3 typed · 12 plain JS — the untyped files are compiler-core/templates/docs-js/highlightjs-gleam.js, REDACTED, compiler-core/templates/echo.mjs, compiler-core/templates/prelude.mjs, test/external_only_javascript/src/external_only_javascript_ffi.mjs, test/hello_world/src/nest/bird.js (+6 more).
What to do
Migrate the remaining .js/.jsx files to TypeScript.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
compiler-core/templates/prelude.mjs:969 · compiler-core/templates/prelude.mjs:1091 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — compiler-core/templates/prelude.mjs:969
compiler-core/templates/prelude.mjs:874 · compiler-core/templates/prelude.mjs:921 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — compiler-core/templates/prelude.mjs:874
compiler-core/templates/prelude.mjs:1056 · compiler-core/templates/prelude.mjs:1178 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — compiler-core/templates/prelude.mjs:1056
compiler-core/templates/prelude.mjs:1036 · compiler-core/templates/prelude.mjs:1158 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — compiler-core/templates/prelude.mjs:1036
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
addResult has cyclomatic complexity 22 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:290
inspect has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/echo.mjs:65
isEqual has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/prelude.mjs:1481
toBitArray has cyclomatic complexity 17 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/prelude.mjs:560
sizedInt has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/prelude.mjs:740
intFromUnalignedSliceUsingNumber has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/prelude.mjs:986
intFromUnalignedSliceUsingBigInt has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/prelude.mjs:1108
equals has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/prelude.mjs:200
(anonymous) has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:515
numberToFp16Uint has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/prelude.mjs:1248
bitArraySliceToFloat has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/prelude.mjs:399
#string has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — compiler-core/templates/echo.mjs:188
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files0.0 / 10Critical✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
compiler-core/templates/prelude.mjs has 1377 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — compiler-core/templates/prelude.mjs:1
REDACTED has 582 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage2.5 / 10Weak✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
test/language/test/ffi_javascript.mjs:4 imports './gleam.mjs', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — test/language/test/ffi_javascript.mjs:4
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×3) — REDACTED:1, compiler-core/templates/echo.mjs:1, compiler-core/templates/docs-js/highlightjs-gleam.js:1
What to do
Add tests that import the unreached modules (directly or through their public entry).
Do you agree with this assessment?
R7 · Dead Code10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped1.6 / 10Critical✓ Tool-verified
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
`config.values.reduce((acc,item,index)=>{const tooltip=item.label?`alt="${item.label}" title="${item.label}"`:"";let i…` is text this program did not author, and it is written into the text of an element through `insertAdjacentHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:86
`searchItem.parentTitle` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:309
`searchItem.title` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:316
`text.substring(index,position[0])` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:464
`text.substring(position[0],index)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:469
`text.substring(index,end)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:473
`title.innerHTML.replace(/([A-Z])|([_/])/g,"$2<wbr>$1",)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:631
What to do
Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
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.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a walk over an ETS table leaves the key it stands on alone — Erlang's own lists and maps are values no body can change, but an ETS key traversal asks the table for the key after the current one, so on a `set`, `bag` or `duplicate_bag` that is not fixed with `ets:safe_fixtable/2`, deleting the current key and then calling `ets:next/2` (or `ets:prev/2`) from it raises `badarg` and the rest of the table is never visited.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×4) — compiler-core/templates/prelude.mjs:1505, REDACTED:20, REDACTED:130, …
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`trace!` at line 45 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:45
`trace!` at line 57 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:57
`trace!` at line 70 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:70
`trace!` at line 75 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:75
`trace!` at line 80 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:80
`trace!` at line 91 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:91
`info!` at line 96 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:96
`trace!` at line 101 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:101
`trace!` at line 106 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:106
`trace!` at line 111 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-wasm/src/wasm_filesystem.rs:111
`info!` at line 44 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-core/src/hex.rs:44
`info!` at line 83 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-core/src/hex.rs:83
`info!` at line 106 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-core/src/hex.rs:106
`debug!` at line 128 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-core/src/build/elixir_libraries.rs:128
`trace!` at line 1755 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-core/src/build/package_loader.rs:1755
`trace!` at line 1841 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-core/src/build/package_loader.rs:1841
`debug!` at line 487 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-core/src/build/project_compiler.rs:487
`debug!` at line 521 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-core/src/build/project_compiler.rs:521
`debug!` at line 322 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-cli/src/fs.rs:322
`debug!` at line 331 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-cli/src/fs.rs:331
`warn!` at line 118 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-cli/src/http.rs:118
`info!` at line 47 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — compiler-cli/src/shell.rs:47
Statically assessed 12 of 55 WCAG 2.2 Level A/AA success criteria (22%; ≈24% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 43 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 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 — 6 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 — 58 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — Not applicable: the BEAM has no dependency-injection container — state lives in processes, and no process is handed an instance whose lifetime another one scopes; this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; 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 — Not applicable: Erlang processes share no mutable memory — state lives in a process's own mailbox — so there is no shared object to race on. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — no exported interface declares behaviour
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — ------ REDACTED:1 -------------------- 1 | >>> FROM elixir:alpine 2 | 3 | ARG TARGETARCH -------------------- ERROR: failed to solve: elixir:alpine: failed to resolve source metadata for docker.io/library/elixir:alpine: failed to do request: Head "https://registry-1.docker.io/v2/library/elixir/manifests/alpine": Forbidden; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~64669 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D19 Documentation Quality — D19 reads .NET projects as units only; 18 folder(s) declared by Cargo.toml were not judged for an overview, an example or the map.
D21 Naming Consistency — Naming consistency is measured on C# only; Erlang, JavaScript, Rust, TypeScript, html not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .erl, .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
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.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
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 included — suite not readable by the collector
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (23 value object(s))
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Erlang, JavaScript/TypeScript, Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R5 Dependency Freshness — no package-lock.json — dependency freshness not measured (would require an npm lockfile); JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
R6 Tooling — no package.json in the repository — test/lint/typecheck wiring is read from package.json scripts (corroborated against CI), so this project's own toolchain isn't measured here
R8 Dependency Hygiene — Not measured — no package.json declares any dependency, so there is nothing to check imports against (imports may resolve through a host runtime rather than node).
S1 Web-Security Posture — No web surface: 127 Rust file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
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. Erlang processes share no heap: a value sent to another process arrives as a copy, so no collection is reachable from two processes 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. TypeScript/JavaScript runs every callback on the one thread that owns its objects: a callback runs only when the body waiting on it has yielded, never alongside it, and a worker thread receives a COPY of what it is sent. A SharedArrayBuffer carries raw bytes, never an Array, Map or Set, so no collection is reachable from two threads at once. Not a gap in the analyzer and not a finding about your code.
X31 Test-only surface in a production module — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score.
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: compile_package.rs ↔ project_compiler.rs compiler-cli/src/compile_package.rs:1— `compiler-cli/src/compile_package.rs` (context compiler-cli) and `compiler-core/src/build/project_compiler.rs` (context compiler-core) sit in DIFFERENT parts of the tree yet change together 64% of the time (37 of the 58 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 37 shared commits counted here, the most recent 3 are `aaa383fd` revert: stop reading manifest.toml in compile-package; `de2e1431` generate .app file for compile-package, fix native module list on war…; `8d21c119` address review comment — run `git show` on any of them.
Boundary-crossing change coupling: call_graph.rs ↔ lib.rs compiler-core/src/call_graph.rs:1— `compiler-core/src/call_graph.rs` (context compiler-core) and `format/src/lib.rs` (context format) sit in DIFFERENT parts of the tree yet change together 60% of the time (50 of the 83 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 50 shared commits counted here, the most recent 3 are `e8dea6d2` rename variant; `564272b1` PipeLine -> Pipeline; `46511d11` allow binops to be parsed in constants — run `git show` on any of them.
Boundary-crossing change coupling: ast_folder.rs ↔ lib.rs compiler-core/src/ast_folder.rs:1— `compiler-core/src/ast_folder.rs` (context compiler-core) and `format/src/lib.rs` (context format) sit in DIFFERENT parts of the tree yet change together 60% of the time (43 of the 72 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 43 shared commits counted here, the most recent 3 are `a96cd7cc` use `#[expect(...)]` instead of `#[allow(...)]`; `17d56f57` ls: make `discard unused variable` properly discard left side assignm…; `564272b1` PipeLine -> Pipeline — run `git show` on any of them.
Boundary-crossing change coupling: pretty.rs ↔ lib.rs compiler-core/src/type_/pretty.rs:1— `compiler-core/src/type_/pretty.rs` (context compiler-core) and `format/src/lib.rs` (context format) sit in DIFFERENT parts of the tree yet change together 52% of the time (11 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `4567b001` t -> type_ (at that commit the file was still `compiler-core/src/format.rs`); `8f9c752d` Replace String with EcoString (at that commit the file was still `compiler-core/src/format.rs`); `6ca13948` Replace constructor with builder function (at that commit the file was still `compiler-core/src/format.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: wasm_filesystem.rs ↔ files.rs compiler-wasm/src/wasm_filesystem.rs:1— `compiler-wasm/src/wasm_filesystem.rs` (context compiler-wasm) and `language-server/src/files.rs` (context language-server) sit in DIFFERENT parts of the tree yet change together 50% of the time (15 of the 30 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — 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 15 shared commits counted here, the most recent 3 are `b35eceaf` remove unused result; `cf46796a` Copy source files for source maps; `87f26706` introduce `Command` struct and split `run` to make it easier to test (at that commit the file was still `compiler-core/src/language_server/files.rs`) — run `git show` on any of them.
AC2 · Forms & labels· <button> with no accessible text · ×1
<button> with no accessible text REDACTED:106— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<html> without a lang REDACTED:5— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
AC4 · Keyboard semantics· Click handler on a non-interactive <footer> · ×1
Click handler on a non-interactive <footer> REDACTED:244— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
TodoComment language-server/src/code_action.rs:2897— // todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/code_action.rs:6607— /// todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/code_action.rs:9776— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/code_action.rs:10379— // _, _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/code_action.rs:12043— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/code_action.rs:12064— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/code_action.rs:12081— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/code_action.rs:12099— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment compiler-core/src/exhaustiveness.rs:1228— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment compiler-core/src/exhaustiveness.rs:2179— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment compiler-core/src/exhaustiveness.rs:2211— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment compiler-core/src/exhaustiveness.rs:2343— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment compiler-core/src/javascript/decision.rs:1402— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment compiler-core/src/javascript/decision.rs:2377— /// _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/engine.rs:380— // todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment language-server/src/engine.rs:1335— // TODO: test. Ensure hover doesn't report as compiled — 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 language-server/src/engine.rs:1364— // TODO: hover for statement — 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 language-server/src/feedback.rs:121— // TODO: avoid clobbering warnings. They should be preserved rather than — 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 language-server/src/server.rs:678— // TODO: Redesign the diagnostic type so that we can be sure there is always — 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 hexpm/src/version/parser.rs:153— // TODO: Borrow? — 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 format/src/lib.rs:1209— // todo to make it explicit it has an unimplemented callback. — 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 format/src/lib.rs:2641— // -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment format/src/lib.rs:2716— // | _, _ -> todo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment format/src/lib.rs:3875— // todo as — 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 format/src/lib.rs:3937— // todo as — 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.
MethodTooLong: Error.to_diagnostics compiler-core/src/error.rs:1092— MethodTooLong — to_diagnostics runs 1194 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 1094 over it, 11.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Warning.to_diagnostic compiler-core/src/warning.rs:271— MethodTooLong — to_diagnostic runs 986 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 886 over it, 9.86× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ConstantTyper.do_infer compiler-core/src/type_/constant.rs:45— MethodTooLong — do_infer runs 348 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 248 over it, 3.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: FunctionGenerator.expression compiler-core/src/erlang.rs:881— MethodTooLong — expression runs 212 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 112 over it, 2.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.
MethodTooLong: TypedExpr.syntactically_eq compiler-core/src/ast/typed.rs:1536— MethodTooLong — syntactically_eq runs 200 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 100 over it, 2.00× 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: UntypedExprFolder.walk_expr compiler-core/src/ast_folder.rs:370— MethodTooLong — walk_expr runs 191 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 91 over it, 1.91× 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: TypedExpr.find_node compiler-core/src/ast/typed.rs:257— MethodTooLong — find_node runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ModuleAnalyzer.infer_function compiler-core/src/analyse.rs:526— MethodTooLong — infer_function runs 182 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 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: GuardTyper.do_infer compiler-core/src/type_/guard.rs:30— MethodTooLong — do_infer runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ExprTyper.infer_record_update_arguments compiler-core/src/type_/expression.rs:2826— MethodTooLong — infer_record_update_arguments runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: LanguageServerEngine.hover language-server/src/engine.rs:1350— MethodTooLong — hover runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Variables.runtime_check compiler-core/src/javascript/decision.rs:1497— MethodTooLong — runtime_check runs 160 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 60 over it, 1.60× 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: FunctionGenerator.assert compiler-core/src/erlang.rs:1503— MethodTooLong — assert 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.
MethodTooLong: RemapIds.constant compiler-core/src/metadata.rs:286— MethodTooLong — constant 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.
MethodTooLong: Completer.completion_values language-server/src/completer.rs:881— MethodTooLong — completion_values runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ModuleAnalyzer.register_values_from_custom_type compiler-core/src/analyse.rs:1126— MethodTooLong — register_values_from_custom_type runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Hydrator.type_from_ast compiler-core/src/type_/hydrator.rs:114— MethodTooLong — type_from_ast runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Command.run compiler-cli/src/lib.rs:457— MethodTooLong — run runs 150 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 50 over it, 1.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PatternTyper.infer_pattern_segment compiler-core/src/type_/pattern.rs:452— MethodTooLong — infer_pattern_segment runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ConstantTyper.infer_record compiler-core/src/type_/constant.rs:598— MethodTooLong — infer_record runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PatternGenerator.pattern compiler-core/src/erlang/pattern.rs:131— MethodTooLong — pattern runs 143 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 43 over it, 1.43× 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: ExprTyper.do_infer_call_with_known_fun compiler-core/src/type_/expression.rs:3718— MethodTooLong — do_infer_call_with_known_fun runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ModuleAnalyzer.infer_module compiler-core/src/analyse.rs:215— MethodTooLong — infer_module runs 134 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 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Generator.assert_check compiler-core/src/javascript/expression.rs:1299— MethodTooLong — assert_check runs 132 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 32 over it, 1.32× 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: LanguageServerEngine.find_references_in_scope language-server/src/engine.rs:1094— MethodTooLong — find_references_in_scope runs 131 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 31 over it, 1.31× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FileTooLong: src/code_action.rs language-server/src/code_action.rs— FileTooLong — 7873 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 32 free functions. The bar is 500 significant lines; this is 7373 over it, 15.75× 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/error.rs compiler-core/src/error.rs— FileTooLong — 4038 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 3538 over it, 8.08× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/parse.rs compiler-core/src/parse.rs— FileTooLong — 3527 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 3027 over it, 7.05× 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: type_/expression.rs compiler-core/src/type_/expression.rs— FileTooLong — 3333 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 83% of them inside a single declaration: ExprTyper (2 blocks, 278-4471). The bar is 500 significant lines; this is 2833 over it, 6.67× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/lib.rs format/src/lib.rs— FileTooLong — 3123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 87% of them inside a single declaration: Formatter (2 blocks, 107-4023). The bar is 500 significant lines; this is 2623 over it, 6.25× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/ast.rs compiler-core/src/ast.rs— FileTooLong — 2998 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 2498 over it, 6.00× 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: javascript/expression.rs compiler-core/src/javascript/expression.rs— FileTooLong — 2756 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 87% of them inside a single declaration: Generator (2 blocks, 227-3561). The bar is 500 significant lines; this is 2256 over it, 5.51× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/lib.rs erlang-generation/src/lib.rs— FileTooLong — 2635 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 2135 over it, 5.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/erlang.rs compiler-core/src/erlang.rs— FileTooLong — 2626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 67% of them inside a single declaration: FunctionGenerator (2 blocks, 125-3429). The bar is 500 significant lines; this is 2126 over it, 5.25× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/exhaustiveness.rs compiler-core/src/exhaustiveness.rs— FileTooLong — 2066 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 1566 over it, 4.13× 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/engine.rs language-server/src/engine.rs— FileTooLong — 1720 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 1220 over it, 3.44× 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: ast/visit.rs compiler-core/src/ast/visit.rs— FileTooLong — 1704 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 82 free functions. The bar is 500 significant lines; this is 1204 over it, 3.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/analyse.rs compiler-core/src/analyse.rs— FileTooLong — 1515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 70% of them inside a single declaration: ModuleAnalyzer (2 blocks, 193-1767). The bar is 500 significant lines; this is 1015 over it, 3.03× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: javascript/decision.rs compiler-core/src/javascript/decision.rs— FileTooLong — 1426 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 926 over it, 2.85× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: erlang/echo.rs compiler-core/src/erlang/echo.rs— FileTooLong — 1358 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 858 over it, 2.72× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ast/typed.rs compiler-core/src/ast/typed.rs— FileTooLong — 1337 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 98% of them inside a single declaration: TypedExpr (5 blocks, 15-1929). The bar is 500 significant lines; this is 837 over it, 2.67× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/ast_folder.rs compiler-core/src/ast_folder.rs— FileTooLong — 1325 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 825 over it, 2.65× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/dependencies.rs compiler-cli/src/dependencies.rs— FileTooLong — 1149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 45 free functions. The bar is 500 significant lines; this is 649 over it, 2.30× 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/warning.rs compiler-core/src/warning.rs— FileTooLong — 1149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 88% of them inside a single declaration: Warning (2 blocks, 162-1617). The bar is 500 significant lines; this is 649 over it, 2.30× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: type_/error.rs compiler-core/src/type_/error.rs— FileTooLong — 1144 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 644 over it, 2.29× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/javascript.rs compiler-core/src/javascript.rs— FileTooLong — 1114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 72% of them inside a single declaration: Generator (2 blocks, 96-1294). The bar is 500 significant lines; this is 614 over it, 2.23× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/type_.rs compiler-core/src/type_.rs— FileTooLong — 1113 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 613 over it, 2.23× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: type_/pattern.rs compiler-core/src/type_/pattern.rs— FileTooLong — 1074 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 95% of them inside a single declaration: PatternTyper (2 blocks, 27-1636). The bar is 500 significant lines; this is 574 over it, 2.15× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/lib.rs hexpm/src/lib.rs— FileTooLong — 1011 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 55 free functions. The bar is 500 significant lines; this is 511 over it, 2.02× 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/completer.rs language-server/src/completer.rs— FileTooLong — 937 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 71% of them inside a single declaration: Completer (2 blocks, 323-1420). The bar is 500 significant lines; this is 437 over it, 1.87× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
Hotspot: compiler-core/src/error.rs compiler-core/src/error.rs:2772— compiler-core/src/error.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 160 in gleam_core::error::failed_module_diagnostics at line 2772. 5 of those changes were fix/bug commits, and the other 25 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/error.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: compiler-core/src/parse.rs compiler-core/src/parse.rs:518— compiler-core/src/parse.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Parser::parse_expression_unit at line 518. 3 of those changes were fix/bug commits, and the other 21 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/parse.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: compiler-core/src/erlang.rs compiler-core/src/erlang.rs:881— compiler-core/src/erlang.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in FunctionGenerator::expression at line 881. 7 of those changes were fix/bug commits, and the other 26 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/erlang.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: compiler-core/src/type_/expression.rs compiler-core/src/type_/expression.rs:5012— compiler-core/src/type_/expression.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in gleam_core::type_::expression::static_compare at line 5012. 3 of those changes were fix/bug commits, and the other 31 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/type_/expression.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: compiler-cli/src/lib.rs compiler-cli/src/lib.rs:457— compiler-cli/src/lib.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Command::run at line 457. 5 of those changes were fix/bug commits, and the other 16 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-cli/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: language-server/src/reference.rs language-server/src/reference.rs:90— language-server/src/reference.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in gleam_language_server::reference::reference_for_ast_node at line 90. 1 of those changes was a fix/bug commit, and the other 13 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- language-server/src/reference.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: compiler-core/src/type_/constant.rs compiler-core/src/type_/constant.rs:45— compiler-core/src/type_/constant.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ConstantTyper::do_infer at line 45. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/type_/constant.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: compiler-core/src/javascript/expression.rs compiler-core/src/javascript/expression.rs:2671— compiler-core/src/javascript/expression.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Generator::constant_expression at line 2671. 3 of those changes were fix/bug commits, and the other 12 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/javascript/expression.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: erlang-generation/src/lib.rs erlang-generation/src/lib.rs:4745— erlang-generation/src/lib.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ErlangBinaryBuilder::bit_array_segment_specifiers at line 4745. 2 of those changes were fix/bug commits, and the other 26 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- erlang-generation/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: compiler-core/src/warning.rs compiler-core/src/warning.rs:271— compiler-core/src/warning.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in Warning::to_diagnostic at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/warning.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: compiler-core/src/type_/pattern.rs compiler-core/src/type_/pattern.rs:671— compiler-core/src/type_/pattern.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in PatternTyper::unify at line 671. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/type_/pattern.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: compiler-core/src/exhaustiveness.rs compiler-core/src/exhaustiveness.rs:222— compiler-core/src/exhaustiveness.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Branch::move_unconditional_patterns at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/exhaustiveness.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: language-server/src/engine.rs language-server/src/engine.rs:1350— language-server/src/engine.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in LanguageServerEngine::hover at line 1350. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- language-server/src/engine.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: format/src/lib.rs format/src/lib.rs:1268— format/src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Formatter::expr at line 1268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- format/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: compiler-core/src/analyse.rs compiler-core/src/analyse.rs:215— compiler-core/src/analyse.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ModuleAnalyzer::infer_module at line 215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/analyse.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: compiler-core/src/type_/guard.rs compiler-core/src/type_/guard.rs:30— compiler-core/src/type_/guard.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in GuardTyper::do_infer at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/type_/guard.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: compiler-core/src/erlang/pattern.rs compiler-core/src/erlang/pattern.rs:131— compiler-core/src/erlang/pattern.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in PatternGenerator::pattern at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/erlang/pattern.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: compiler-core/src/javascript.rs compiler-core/src/javascript.rs:201— compiler-core/src/javascript.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Generator::compile at line 201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/javascript.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: compiler-core/src/javascript/decision.rs compiler-core/src/javascript/decision.rs:555— compiler-core/src/javascript/decision.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CasePrinter::switch at line 555. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/javascript/decision.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: compiler-core/src/ast_folder.rs compiler-core/src/ast_folder.rs:370— compiler-core/src/ast_folder.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in UntypedExprFolder::walk_expr at line 370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/ast_folder.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: compiler-core/src/parse/error.rs compiler-core/src/parse/error.rs:897— compiler-core/src/parse/error.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LexicalError::to_parse_error_info at line 897. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/parse/error.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: pretty-arena/src/lib.rs pretty-arena/src/lib.rs:1184— pretty-arena/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in pretty_arena::format at line 1184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- pretty-arena/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: compiler-core/src/type_/hydrator.rs compiler-core/src/type_/hydrator.rs:114— compiler-core/src/type_/hydrator.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Hydrator::type_from_ast at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- compiler-core/src/type_/hydrator.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: hexpm/src/version/lexer.rs hexpm/src/version/lexer.rs:212— hexpm/src/version/lexer.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Lexer::next at line 212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 12:15:17 +01:00' --until='2026-10-24 12:15:17 +01:00' --full-history --no-merges -- hexpm/src/version/lexer.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.
ClassTooLong: ExprTyper compiler-core/src/type_/expression.rs:278— ClassTooLong — 2757 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 78 methods, 2 blocks, lines 278-4471. The bar is 400 significant lines; this is 2357 over it, 6.89× 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: Formatter format/src/lib.rs:107— ClassTooLong — 2710 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 91 methods, 2 blocks, lines 107-4023. The bar is 400 significant lines; this is 2310 over it, 6.78× 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: Generator compiler-core/src/javascript/expression.rs:227— ClassTooLong — 2385 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 69 methods, 2 blocks, lines 227-3561. The bar is 400 significant lines; this is 1985 over it, 5.96× 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: FunctionGenerator compiler-core/src/erlang.rs:125— ClassTooLong — 1764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 49 methods, 2 blocks, lines 125-3429. The bar is 400 significant lines; this is 1364 over it, 4.41× 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: Error compiler-core/src/error.rs:130— ClassTooLong — 1524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 10 methods, 3 blocks, lines 130-2753. The bar is 400 significant lines; this is 1124 over it, 3.81× 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: TypedExpr compiler-core/src/ast/typed.rs:15— ClassTooLong — 1315 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, 5 blocks, lines 15-1929. The bar is 400 significant lines; this is 915 over it, 3.29× 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: ModuleAnalyzer compiler-core/src/analyse.rs:193— ClassTooLong — 1061 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 20 methods, 2 blocks, lines 193-1767. The bar is 400 significant lines; this is 661 over it, 2.65× 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: PatternTyper compiler-core/src/type_/pattern.rs:27— ClassTooLong — 1021 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 27-1636. The bar is 400 significant lines; this is 621 over it, 2.55× 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: Warning compiler-core/src/warning.rs:162— ClassTooLong — 1014 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 3 methods, 2 blocks, lines 162-1617. The bar is 400 significant lines; this is 614 over it, 2.54× 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: Generator compiler-core/src/javascript.rs:96— ClassTooLong — 802 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 2 blocks, lines 96-1294. The bar is 400 significant lines; this is 402 over it, 2.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: TypeScriptGenerator compiler-core/src/javascript/typescript.rs:187— ClassTooLong — 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 28 methods, 2 blocks, lines 187-1260. The bar is 400 significant lines; this is 335 over it, 1.84× 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: Variables compiler-core/src/javascript/decision.rs:1204— ClassTooLong — 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 30 methods, 2 blocks, lines 1204-2356. The bar is 400 significant lines; this is 278 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Completer language-server/src/completer.rs:323— ClassTooLong — 668 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 323-1420. The bar is 400 significant lines; this is 268 over it, 1.67× 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: ConstantTyper compiler-core/src/type_/constant.rs:32— ClassTooLong — 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 10 methods, 2 blocks, lines 32-1043. The bar is 400 significant lines; this is 262 over it, 1.66× 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: Environment compiler-core/src/type_/environment.rs:50— ClassTooLong — 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 39 methods, 3 blocks, lines 50-1073. The bar is 400 significant lines; this is 224 over it, 1.56× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Printer compiler-core/src/docs/printer.rs:44— ClassTooLong — 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 24 methods, 2 blocks, lines 44-874. The bar is 400 significant lines; this is 162 over it, 1.41× 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: Visit compiler-core/src/ast/visit.rs:75— ClassTooLong — 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 82 methods. The bar is 400 significant lines; this is 143 over it, 1.36× 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: UntypedExprFolder compiler-core/src/ast_folder.rs:246— ClassTooLong — 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 32 methods. The bar is 400 significant lines; this is 138 over it, 1.35× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: RemapIds compiler-core/src/metadata.rs:40— ClassTooLong — 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 16 methods, 2 blocks, lines 40-670. The bar is 400 significant lines; this is 130 over it, 1.33× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (8 lines × 2) compiler-cli/src/fs.rs:390— compiler-cli/src/fs.rs:390-397 | compiler-cli/src/fs.rs:434-441 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/erlang.rs:1671— compiler-core/src/erlang.rs:1671-1678 | language-server/src/code_action.rs:6890-6897 — before extracting anything, compare `compiler-core/src/erlang.rs` and `language-server/src/code_action.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) compiler-core/src/erlang.rs:2896— compiler-core/src/erlang.rs:2896-2903 | compiler-core/src/erlang.rs:2979-2986 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/erlang/echo.rs:813— compiler-core/src/erlang/echo.rs:813-820 | compiler-core/src/erlang/echo.rs:1311-1319 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/erlang/echo.rs:1395— compiler-core/src/erlang/echo.rs:1395-1402 | compiler-core/src/erlang/echo.rs:1499-1506 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/erlang/echo.rs:1442— compiler-core/src/erlang/echo.rs:1442-1449 | compiler-core/src/erlang/echo.rs:1569-1576 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/javascript/decision.rs:845— compiler-core/src/javascript/decision.rs:845-852 | compiler-core/src/javascript/decision.rs:876-883 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/javascript/expression.rs:3590— compiler-core/src/javascript/expression.rs:3590-3597 | compiler-core/src/javascript/expression.rs:3623-3630 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) hexpm/src/lib.rs:239— hexpm/src/lib.rs:239-246 | hexpm/src/lib.rs:271-278 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/erlang/echo.rs:494— compiler-core/src/erlang/echo.rs:494-503 | compiler-core/src/erlang/echo.rs:570-577 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/parse/lexer.rs:991— compiler-core/src/parse/lexer.rs:991-998 | compiler-core/src/parse/lexer.rs:1021-1028 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/erlang/echo.rs:521— compiler-core/src/erlang/echo.rs:521-528 | compiler-core/src/erlang/echo.rs:710-717 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) language-server/src/code_action.rs:8718— language-server/src/code_action.rs:8718-8725 | language-server/src/code_action.rs:8816-8823 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/erlang/echo.rs:321— compiler-core/src/erlang/echo.rs:321-328 | compiler-core/src/erlang/echo.rs:894-901 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) language-server/src/code_action.rs:9575— language-server/src/code_action.rs:9575-9582 | language-server/src/code_action.rs:9626-9633 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) compiler-core/src/erlang/echo.rs:1020— compiler-core/src/erlang/echo.rs:1020-1027 | compiler-core/src/erlang/echo.rs:1624-1631 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/ast.rs:4376— compiler-core/src/ast.rs:4376-4386 | compiler-core/src/ast.rs:4400-4410 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/ast/constant.rs:626— compiler-core/src/ast/constant.rs:626-636 | compiler-core/src/ast/constant.rs:644-654 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/erlang.rs:503— compiler-core/src/erlang.rs:503-513 | compiler-core/src/type_/pattern.rs:563-573 — before extracting anything, compare `compiler-core/src/erlang.rs` and `compiler-core/src/type_/pattern.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) compiler-core/src/erlang.rs:1781— compiler-core/src/erlang.rs:1781-1791 | compiler-core/src/erlang.rs:1800-1811 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/io/memory.rs:244— compiler-core/src/io/memory.rs:244-254 | compiler-core/src/io/memory.rs:266-276 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/javascript/expression.rs:1409— compiler-core/src/javascript/expression.rs:1409-1419 | compiler-core/src/javascript/expression.rs:1915-1925 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/javascript/expression.rs:2111— compiler-core/src/javascript/expression.rs:2111-2121 | compiler-core/src/javascript/expression.rs:2154-2164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/type_/constant.rs:1013— compiler-core/src/type_/constant.rs:1013-1026 | compiler-core/src/type_/expression.rs:4330-4340 — before extracting anything, compare `compiler-core/src/type_/constant.rs` and `compiler-core/src/type_/expression.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) compiler-core/src/warning.rs:570— compiler-core/src/warning.rs:570-580 | compiler-core/src/warning.rs:1069-1079 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/warning.rs:1049— compiler-core/src/warning.rs:1049-1059 | compiler-core/src/warning.rs:1444-1454 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) language-server/src/code_action.rs:11317— language-server/src/code_action.rs:11317-11327 | language-server/src/code_action.rs:11408-11418 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) language-server/src/reference.rs:1032— language-server/src/reference.rs:1032-1042 | language-server/src/reference.rs:1125-1135 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/erlang/echo.rs:353— compiler-core/src/erlang/echo.rs:353-363 | compiler-core/src/erlang/echo.rs:935-948 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/warning.rs:442— compiler-core/src/warning.rs:442-452 | compiler-core/src/warning.rs:1321-1333 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) compiler-core/src/erlang/echo.rs:1213— compiler-core/src/erlang/echo.rs:1213-1224 | compiler-core/src/erlang/echo.rs:1257-1267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
FunctionTooLong: gleam_language_server::reference::reference_for_ast_node language-server/src/reference.rs:90— FunctionTooLong — gleam_language_server::reference::reference_for_ast_node runs 382 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 282 over it, 3.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gleam_core::erlang::echo::inspect_maybe_gleam_atom compiler-core/src/erlang/echo.rs:1292— FunctionTooLong — gleam_core::erlang::echo::inspect_maybe_gleam_atom runs 304 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 204 over it, 3.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gleam_core::type_::prelude::build_prelude compiler-core/src/type_/prelude.rs:221— FunctionTooLong — gleam_core::type_::prelude::build_prelude runs 251 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 151 over it, 2.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gleam_core::docs::generate_html compiler-core/src/docs.rs:69— FunctionTooLong — gleam_core::docs::generate_html runs 247 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 147 over it, 2.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: gleam_core::ast::pattern_and_expression_are_the_same compiler-core/src/ast.rs:2231— FunctionTooLong — gleam_core::ast::pattern_and_expression_are_the_same runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gleam_core::ast::visit::visit_typed_expr compiler-core/src/ast/visit.rs:1296— FunctionTooLong — gleam_core::ast::visit::visit_typed_expr runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gleam_core::bit_array::type_options compiler-core/src/bit_array.rs:97— FunctionTooLong — gleam_core::bit_array::type_options 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: gleam_core::type_::expression::static_compare compiler-core/src/type_/expression.rs:5012— FunctionTooLong — gleam_core::type_::expression::static_compare runs 132 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 32 over it, 1.32× 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: gleam_core::erlang::echo::echo_inspect compiler-core/src/erlang/echo.rs:145— FunctionTooLong — gleam_core::erlang::echo::echo_inspect runs 122 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 22 over it, 1.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gleam_cli::publish::do_build_hex_tarball compiler-cli/src/publish.rs:408— FunctionTooLong — gleam_cli::publish::do_build_hex_tarball 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: gleam_core::erlang::echo::inspect_list_loop compiler-core/src/erlang/echo.rs:1157— FunctionTooLong — gleam_core::erlang::echo::inspect_list_loop runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gleam_core::type_::expression::invalid_constant_with_annotated_type compiler-core/src/type_/expression.rs:4502— FunctionTooLong — gleam_core::type_::expression::invalid_constant_with_annotated_type runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Duplicated block (9 lines × 2) compiler-cli/src/fs.rs:509— compiler-cli/src/fs.rs:509-517 | compiler-cli/src/fs.rs:529-537 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) compiler-core/src/erlang.rs:1402— compiler-core/src/erlang.rs:1402-1410 | compiler-core/src/erlang.rs:1975-1983 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) compiler-core/src/erlang.rs:2742— compiler-core/src/erlang.rs:2742-2750 | compiler-core/src/type_/constant.rs:198-206 — before extracting anything, compare `compiler-core/src/erlang.rs` and `compiler-core/src/type_/constant.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) compiler-core/src/erlang/echo.rs:1177— compiler-core/src/erlang/echo.rs:1177-1186 | compiler-core/src/erlang/echo.rs:1196-1204 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) compiler-core/src/parse.rs:3631— compiler-core/src/parse.rs:3631-3639 | compiler-core/src/parse.rs:3662-3670 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) compiler-core/src/type_/environment.rs:405— compiler-core/src/type_/environment.rs:405-413 | compiler-core/src/type_/environment.rs:427-435 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) compiler-core/src/type_/prelude.rs:477— compiler-core/src/type_/prelude.rs:477-485 | compiler-core/src/type_/prelude.rs:495-503 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) erlang-generation/src/lib.rs:4474— erlang-generation/src/lib.rs:4474-4482 | erlang-generation/src/lib.rs:4513-4521 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) compiler-core/src/warning.rs:975— compiler-core/src/warning.rs:975-983 | compiler-core/src/warning.rs:1048-1056 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) language-server/src/code_action.rs:4748— language-server/src/code_action.rs:4748-4756 | language-server/src/code_action.rs:5402-5410 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) compiler-core/src/type_/prelude.rs:467— compiler-core/src/type_/prelude.rs:467-475 | compiler-core/src/type_/prelude.rs:485-493 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) compiler-core/src/erlang/echo.rs:625— compiler-core/src/erlang/echo.rs:625-633 | compiler-core/src/erlang/echo.rs:642-650 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
gleam_core::error::failed_module_diagnostics (cognitive 133) compiler-core/src/error.rs:2772— gleam_core::error::failed_module_diagnostics has cognitive complexity 133 (threshold 15). Drivers by points: if/else 42 (73 pts), match/switch 22 (43 pts), loops 6 (16 pts), boolean chains 1 (nesting depth added 62). 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.
gleam_core::bit_array::type_options (cognitive 41) compiler-core/src/bit_array.rs:97— gleam_core::bit_array::type_options has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 7 (11 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_core::error::edit_distance (cognitive 34) compiler-core/src/error.rs:840— gleam_core::error::edit_distance has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_core::type_::expression::static_compare (cognitive 33) compiler-core/src/type_/expression.rs:5012— gleam_core::type_::expression::static_compare has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 6 (12 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_core::type_::environment::unify (cognitive 26) compiler-core/src/type_/environment.rs:1091— gleam_core::type_::environment::unify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_core::analyse::get_compatible_record_fields (cognitive 25) compiler-core/src/analyse.rs:2085— gleam_core::analyse::get_compatible_record_fields has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (10 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_core::strings::convert_string_escape_chars (cognitive 20) compiler-core/src/strings.rs:11— gleam_core::strings::convert_string_escape_chars has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 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.
gleam_core::error::break_line (cognitive 17) compiler-core/src/error.rs:5593— gleam_core::error::break_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_core::ast::pattern_and_expression_are_the_same (cognitive 16) compiler-core/src/ast.rs:2231— gleam_core::ast::pattern_and_expression_are_the_same has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (11 pts), boolean chains 5 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TooManyMethods: Parser compiler-core/src/parse.rs:228— TooManyMethods — 92 methods. The bar is 30 methods; this is 62 over it, 3.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Formatter format/src/lib.rs:107— TooManyMethods — 91 methods. The bar is 30 methods; this is 61 over it, 3.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ExprTyper compiler-core/src/type_/expression.rs:278— TooManyMethods — 78 methods. The bar is 30 methods; this is 48 over it, 2.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Generator compiler-core/src/javascript/expression.rs:227— TooManyMethods — 69 methods. The bar is 30 methods; this is 39 over it, 2.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: FunctionGenerator compiler-core/src/erlang.rs:125— TooManyMethods — 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Environment compiler-core/src/type_/environment.rs:50— TooManyMethods — 39 methods. The bar is 30 methods; this is 9 over it, 1.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: TypedExpr compiler-core/src/ast/typed.rs:15— TooManyMethods — 37 methods, declared across 2 files: ast/typed.rs (36), javascript/expression.rs (1). The bar is 30 methods; this is 7 over it, 1.23× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Type compiler-core/src/type_.rs:57— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: LanguageServer language-server/src/server.rs:44— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (13 lines × 2) compiler-cli/src/text_layout.rs:40— compiler-cli/src/text_layout.rs:40-52 | compiler-cli/src/text_layout.rs:71-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.
Duplicated block (13 lines × 2) compiler-core/src/ast/untyped.rs:264— compiler-core/src/ast/untyped.rs:264-276 | compiler-core/src/type_/expression.rs:3615-3627 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) compiler-core/src/ast_folder.rs:456— compiler-core/src/ast_folder.rs:456-468 | compiler-core/src/ast_folder.rs:584-596 — both copies are in the same file, so extract the block into 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) compiler-core/src/build/native_file_copier.rs:226— compiler-core/src/build/native_file_copier.rs:226-238 | compiler-core/src/build/native_file_copier.rs:274-286 — both copies are in the same file, so extract the block into 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) compiler-core/src/erlang.rs:2185— compiler-core/src/erlang.rs:2185-2197 | compiler-core/src/erlang.rs:2243-2255 — both copies are in the same file, so extract the block into 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) compiler-core/src/parse.rs:694— compiler-core/src/parse.rs:694-706 | compiler-core/src/parse.rs:3557-3569 — both copies are in the same file, so extract the block into 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) compiler-core/src/warning.rs:814— compiler-core/src/warning.rs:814-826 | compiler-core/src/warning.rs:829-841 — both copies are in the same file, so extract the block into 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) erlang-generation/src/lib.rs:2151— erlang-generation/src/lib.rs:2151-2163 | erlang-generation/src/lib.rs:2175-2187 — both copies are in the same file, so extract the block into 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) compiler-core/src/parse/extra.rs:46— compiler-core/src/parse/extra.rs:46-58 | format/src/lib.rs:139-151 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) compiler-cli/src/fix.rs:55— compiler-cli/src/fix.rs:55-61 | compiler-cli/src/remove.rs:18-24 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) compiler-core/src/analyse.rs:1681— compiler-core/src/analyse.rs:1681-1687 | compiler-core/src/analyse.rs:1970-1976 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) compiler-core/src/erlang.rs:1555— compiler-core/src/erlang.rs:1555-1564 | compiler-core/src/erlang.rs:1568-1574 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) compiler-core/src/erlang/echo.rs:971— compiler-core/src/erlang/echo.rs:971-977 | compiler-core/src/erlang/echo.rs:1038-1044 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) compiler-core/src/javascript/expression.rs:2726— compiler-core/src/javascript/expression.rs:2726-2732 | compiler-core/src/javascript/expression.rs:3372-3378 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) compiler-core/src/type_/environment.rs:1184— compiler-core/src/type_/environment.rs:1184-1190 | compiler-core/src/type_/environment.rs:1200-1206 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) language-server/src/code_action.rs:1146— language-server/src/code_action.rs:1146-1154 | language-server/src/completer.rs:1614-1620 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) compiler-core/src/erlang/echo.rs:82— compiler-core/src/erlang/echo.rs:82-88 | compiler-core/src/erlang/echo.rs:279-289 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) compiler-core/src/erlang/echo.rs:73— compiler-core/src/erlang/echo.rs:73-79 | compiler-core/src/erlang/echo.rs:148-155 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) compiler-core/src/ast/typed.rs:754— compiler-core/src/ast/typed.rs:754-765 | compiler-core/src/ast/typed.rs:783-794 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) compiler-core/src/erlang.rs:2908— compiler-core/src/erlang.rs:2908-2919 | compiler-core/src/erlang.rs:2991-3002 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) compiler-core/src/erlang/echo.rs:395— compiler-core/src/erlang/echo.rs:395-409 | compiler-core/src/erlang/echo.rs:832-843 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) compiler-core/src/erlang/echo.rs:1360— compiler-core/src/erlang/echo.rs:1360-1371 | compiler-core/src/erlang/echo.rs:1390-1401 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) compiler-core/src/erlang/echo.rs:1693— compiler-core/src/erlang/echo.rs:1693-1704 | compiler-core/src/erlang/echo.rs:1719-1730 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) hexpm/src/version.rs:91— hexpm/src/version.rs:91-102 | hexpm/src/version.rs:108-119 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) compiler-core/src/build/project_compiler.rs:368— compiler-core/src/build/project_compiler.rs:368-379 | compiler-core/src/build/project_compiler.rs:441-452 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) compiler-core/src/warning.rs:962— compiler-core/src/warning.rs:962-973 | compiler-core/src/warning.rs:1104-1115 — both copies are in the same file, so extract the block into 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) compiler-cli/src/fs.rs:551— compiler-cli/src/fs.rs:551-560 | compiler-cli/src/fs.rs:568-577 — both copies are in the same file, so extract the block into 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) compiler-core/src/ast/typed.rs:769— compiler-core/src/ast/typed.rs:769-778 | compiler-core/src/ast/typed.rs:797-806 — both copies are in the same file, so extract the block into 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) compiler-core/src/ast/typed.rs:1633— compiler-core/src/ast/typed.rs:1633-1642 | compiler-core/src/ast/typed.rs:1802-1811 — both copies are in the same file, so extract the block into 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) compiler-core/src/ast/untyped.rs:203— compiler-core/src/ast/untyped.rs:203-212 | compiler-core/src/ast/untyped.rs:229-238 — both copies are in the same file, so extract the block into 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) erlang-generation/src/lib.rs:4062— erlang-generation/src/lib.rs:4062-4071 | erlang-generation/src/lib.rs:4083-4092 — both copies are in the same file, so extract the block into 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) format/src/lib.rs:2586— format/src/lib.rs:2586-2595 | format/src/lib.rs:2997-3006 — both copies are in the same file, so extract the block into 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) language-server/src/server.rs:178— language-server/src/server.rs:178-188 | language-server/src/server.rs:249-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.
Duplicated block (10 lines × 2) compiler-core/src/warning.rs:1067— compiler-core/src/warning.rs:1067-1076 | compiler-core/src/warning.rs:1344-1353 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
gleam_core::error::failed_module_diagnostics (cyclomatic 160) compiler-core/src/error.rs:2772— gleam_core::error::failed_module_diagnostics has cyclomatic complexity 160 (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.
gleam_core::ast::pattern_and_expression_are_the_same (cyclomatic 35) compiler-core/src/ast.rs:2231— gleam_core::ast::pattern_and_expression_are_the_same has cyclomatic complexity 35 (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.
gleam_core::bit_array::type_options (cyclomatic 32) compiler-core/src/bit_array.rs:97— gleam_core::bit_array::type_options has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gleam_core::type_::expression::static_compare (cyclomatic 30) compiler-core/src/type_/expression.rs:5012— gleam_core::type_::expression::static_compare has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gleam_core::type_::environment::unify (cyclomatic 21) compiler-core/src/type_/environment.rs:1091— gleam_core::type_::environment::unify has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
gleam_core::error::edit_distance (cyclomatic 18) compiler-core/src/error.rs:840— gleam_core::error::edit_distance has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: gleam_core::error::hint_alternative_operator (cyclomatic 19) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
gleam_core::strings::convert_string_escape_chars (cyclomatic 16) compiler-core/src/strings.rs:11— gleam_core::strings::convert_string_escape_chars 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.
Parser::parse_expression_unit (cognitive 86) compiler-core/src/parse.rs:518— Parser::parse_expression_unit has cognitive complexity 86 (threshold 15). Drivers by points: if/else 17 (48 pts), match/switch 13 (36 pts), boolean chains 1, loops 1 (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Parser::parse_pattern (cognitive 57) compiler-core/src/parse.rs:1319— Parser::parse_pattern has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 14 (34 pts), if/else 9 (22 pts), boolean chains 1 (nesting depth added 33). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Parser::parse_const_value_unit (cognitive 38) compiler-core/src/parse.rs:3440— Parser::parse_const_value_unit has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 5 (17 pts), boolean chains 3 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Parser::parse_case_clause_guard_unit (cognitive 19) compiler-core/src/parse.rs:1883— Parser::parse_case_clause_guard_unit has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (17 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Parser::parse_import (cognitive 18) compiler-core/src/parse.rs:3130— Parser::parse_import has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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.
Parser::parse_const_record_finish (cognitive 17) compiler-core/src/parse.rs:3692— Parser::parse_const_record_finish has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 pts) (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Parser::parse_bit_array_option (cognitive 16) compiler-core/src/parse.rs:3992— Parser::parse_bit_array_option has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
X24 · Document value interpolated into markup unescaped· Untrusted text written into markup unescaped · ×7
Untrusted text written into markup unescaped REDACTED:86— `config.values.reduce((acc,item,index)=>{const tooltip=item.label?`alt="${item.label}" title="${item.label}"`:"";let i…` is text this program did not author, and it is written into the text of an element through `insertAdjacentHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:309— `searchItem.parentTitle` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:316— `searchItem.title` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:464— `text.substring(index,position[0])` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:469— `text.substring(position[0],index)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:473— `text.substring(index,end)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:631— `title.innerHTML.replace(/([A-Z])|([_/])/g,"$2<wbr>$1",)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
ExprTyper::infer_record_update_arguments (cognitive 31) compiler-core/src/type_/expression.rs:2826— ExprTyper::infer_record_update_arguments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (4 pts), loops 2, 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.
ExprTyper::do_infer_call_with_known_fun (cognitive 30) compiler-core/src/type_/expression.rs:3718— ExprTyper::do_infer_call_with_known_fun has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (7 pts), boolean chains 5, match/switch 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.
ExprTyper::infer_bit_segment (cognitive 22) compiler-core/src/type_/expression.rs:1718— ExprTyper::infer_bit_segment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExprTyper::infer_fn_with_known_types (cognitive 19) compiler-core/src/type_/expression.rs:4096— ExprTyper::infer_fn_with_known_types has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExprTyper::infer_binop (cognitive 17) compiler-core/src/type_/expression.rs:1837— ExprTyper::infer_binop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExprTyper::infer_field_access (cognitive 16) compiler-core/src/type_/expression.rs:1389— ExprTyper::infer_field_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_language_server::rename::rename_module_occurrences (cognitive 21) language-server/src/rename.rs:653— gleam_language_server::rename::rename_module_occurrences has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_language_server::code_action::code_action_add_missing_patterns (cognitive 20) language-server/src/code_action.rs:1416— gleam_language_server::code_action::code_action_add_missing_patterns has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_language_server::rename::alias_references_in_module (cognitive 20) language-server/src/rename.rs:341— gleam_language_server::rename::alias_references_in_module has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_language_server::reference::reference_for_ast_node (cognitive 19) language-server/src/reference.rs:90— gleam_language_server::reference::reference_for_ast_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 5 (9 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gleam_language_server::code_action::code_action_inexhaustive_let_to_case (cognitive 16) language-server/src/code_action.rs:523— gleam_language_server::code_action::code_action_inexhaustive_let_to_case has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_language_server::signature_help::active_parameter_index (cognitive 16) language-server/src/signature_help.rs:168— gleam_language_server::signature_help::active_parameter_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (15 lines × 2) compiler-core/src/erlang/echo.rs:1082— compiler-core/src/erlang/echo.rs:1082-1096 | compiler-core/src/erlang/echo.rs:1103-1117 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) compiler-core/src/erlang/echo.rs:1536— compiler-core/src/erlang/echo.rs:1536-1550 | compiler-core/src/erlang/echo.rs:1606-1620 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) compiler-core/src/parse.rs:447— compiler-core/src/parse.rs:447-461 | compiler-core/src/parse.rs:3388-3402 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) compiler-core/src/parse.rs:1410— compiler-core/src/parse.rs:1410-1424 | compiler-core/src/parse.rs:1467-1481 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) compiler-core/src/reference.rs:651— compiler-core/src/reference.rs:651-665 | compiler-core/src/reference.rs:684-698 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) format/src/lib.rs:3740— format/src/lib.rs:3740-3754 | format/src/lib.rs:3775-3789 — both copies are in the same file, so extract the block into 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) compiler-core/src/docs/printer.rs:586— compiler-core/src/docs/printer.rs:586-601 | compiler-core/src/type_/printer.rs:561-576 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) compiler-core/src/erlang.rs:1671— compiler-core/src/erlang.rs:1671-1686 | compiler-core/src/javascript/expression.rs:1412-1427 — before extracting anything, compare `compiler-core/src/erlang.rs` and `compiler-core/src/javascript/expression.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) compiler-core/src/erlang.rs:1900— compiler-core/src/erlang.rs:1900-1915 | compiler-core/src/erlang.rs:1936-1951 — both copies are in the same file, so extract the block into 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) compiler-core/src/reference.rs:492— compiler-core/src/reference.rs:492-507 | compiler-core/src/reference.rs:526-541 — both copies are in the same file, so extract the block into 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) language-server/src/code_action.rs:2556— language-server/src/code_action.rs:2556-2571 | language-server/src/code_action.rs:2593-2608 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) compiler-core/src/ast/typed.rs:407— compiler-core/src/ast/typed.rs:407-412 | compiler-core/src/ast/typed.rs:425-430 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) compiler-core/src/erlang/echo.rs:767— compiler-core/src/erlang/echo.rs:767-772 | compiler-core/src/erlang/echo.rs:897-902 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) language-server/src/engine.rs:2037— language-server/src/engine.rs:2037-2042 | language-server/src/engine.rs:2050-2055 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) compiler-core/src/erlang/echo.rs:1205— compiler-core/src/erlang/echo.rs:1205-1210 | compiler-core/src/erlang/echo.rs:1268-1274 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) compiler-core/src/erlang/echo.rs:1419— compiler-core/src/erlang/echo.rs:1419-1424 | compiler-core/src/erlang/echo.rs:1643-1648 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Lexer::lex_string (cognitive 57) compiler-core/src/parse/lexer.rs:1297— Lexer::lex_string has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (44 pts), loops 2 (6 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Lexer::consume_character (cognitive 46) compiler-core/src/parse/lexer.rs:155— Lexer::consume_character has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 8 (15 pts), loops 2 (6 pts) (nesting depth added 24). 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.
Lexer::lex_lt (cognitive 23) compiler-core/src/parse/lexer.rs:849— Lexer::lex_lt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 13). 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.
Lexer::lex_gt (cognitive 23) compiler-core/src/parse/lexer.rs:922— Lexer::lex_gt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 13). 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.
Change coupling: ast_folder.rs ↔ expression.rs compiler-core/src/ast_folder.rs:1— `compiler-core/src/ast_folder.rs` and `compiler-core/src/type_/expression.rs` change together 67% of the time (48 of the 72 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 48 shared commits counted here, the most recent 3 are `564272b1` PipeLine -> Pipeline; `46511d11` allow binops to be parsed in constants; `28131be9` refactor: store only the arguments start position for Constant::Record — run `git show` on any of them.
Change coupling: tests.rs ↔ tests.rs compiler-core/src/build/module_loader/tests.rs:1— `compiler-core/src/build/module_loader/tests.rs` and `compiler-core/src/build/package_loader/tests.rs` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `9c9bb80e` store a set of files that had partial compilations done instead of al…; `75f8b8fb` Fingerprint gleam.toml; `bfc3d96f` read and write line numbers to cache — run `git show` on any of them.
Change coupling: call_graph.rs ↔ expression.rs compiler-core/src/call_graph.rs:1— `compiler-core/src/call_graph.rs` and `compiler-core/src/type_/expression.rs` change together 52% of the time (43 of the 83 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 43 shared commits counted here, the most recent 3 are `564272b1` PipeLine -> Pipeline; `46511d11` allow binops to be parsed in constants; `e210c37d` make constant records with no arguments not an error — run `git show` on any of them.
Change coupling: visit.rs ↔ ast_folder.rs compiler-core/src/ast/visit.rs:1— `compiler-core/src/ast/visit.rs` and `compiler-core/src/ast_folder.rs` change together 50% of the time (36 of the 72 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 36 shared commits counted here, the most recent 3 are `a96cd7cc` use `#[expect(...)]` instead of `#[allow(...)]`; `17d56f57` ls: make `discard unused variable` properly discard left side assignm…; `46511d11` allow binops to be parsed in constants — run `git show` on any of them.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×4
Members sharing a duplicated core (4 members, 50+ identical tokens) compiler-cli/src/docs.rs:24— compiler-cli/src/docs.rs:24-45 | compiler-cli/src/owner.rs:11-30 | compiler-cli/src/owner.rs:32-62 | compiler-cli/src/publish.rs:30-143 — 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) compiler-core/src/ast/typed.rs:695— compiler-core/src/ast/typed.rs:695-722 | compiler-core/src/ast/typed.rs:724-751 | compiler-core/src/ast/untyped.rs:191-215 | compiler-core/src/ast/untyped.rs:217-241 — 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) compiler-core/src/erlang.rs:1331— compiler-core/src/erlang.rs:1331-1422 | compiler-core/src/erlang.rs:1883-1915 | compiler-core/src/erlang.rs:1925-1951 | compiler-core/src/erlang.rs:1960-1988 — 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) compiler-core/src/parse.rs:2129— compiler-core/src/parse.rs:2129-2179 | compiler-core/src/parse.rs:2498-2585 | compiler-core/src/parse.rs:3812-3868 | compiler-core/src/parse.rs:3872-3940 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (25 lines × 2) compiler-core/src/erlang/echo.rs:1510— compiler-core/src/erlang/echo.rs:1510-1534 | compiler-core/src/erlang/echo.rs:1580-1604 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (25 lines × 2) compiler-core/src/javascript/expression.rs:710— compiler-core/src/javascript/expression.rs:710-734 | compiler-core/src/javascript/expression.rs:3008-3032 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (25 lines × 2) compiler-core/src/javascript/expression.rs:754— compiler-core/src/javascript/expression.rs:754-778 | compiler-core/src/javascript/expression.rs:3054-3078 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (25 lines × 2) compiler-core/src/javascript/typescript.rs:791— compiler-core/src/javascript/typescript.rs:791-815 | compiler-core/src/javascript/typescript.rs:822-846 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 3) compiler-core/src/ast.rs:1959— compiler-core/src/ast.rs:1959-1969 | compiler-core/src/type_/pipe.rs:419-429 | format/src/lib.rs:3002-3012 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/type_/pipe.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) compiler-core/src/javascript/expression.rs:1511— compiler-core/src/javascript/expression.rs:1511-1521 | compiler-core/src/type_/expression.rs:4353-4363 | language-server/src/code_action.rs:9679-9689 — `compiler-core/src/javascript/expression.rs` and `compiler-core/src/type_/expression.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 11 separate duplicated blocks between them, totalling at least 100 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (11 lines × 3) compiler-core/src/parse/lexer.rs:199— compiler-core/src/parse/lexer.rs:199-209 | compiler-core/src/parse/lexer.rs:871-881 | compiler-core/src/parse/lexer.rs:941-951 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) compiler-core/src/type_/pattern.rs:548— compiler-core/src/type_/pattern.rs:548-558 | compiler-core/src/type_/pattern.rs:598-608 | compiler-core/src/type_/pattern.rs:640-650 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) compiler-core/src/ast.rs:1955— compiler-core/src/ast.rs:1955-1964 | compiler-core/src/type_/expression.rs:3611-3620 | compiler-core/src/type_/pipe.rs:415-424 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/type_/expression.rs` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 3) compiler-core/src/javascript/expression.rs:2110— compiler-core/src/javascript/expression.rs:2110-2119 | compiler-core/src/javascript/expression.rs:2153-2162 | compiler-core/src/javascript/expression.rs:2191-2200 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) compiler-core/src/type_/constant.rs:1012— compiler-core/src/type_/constant.rs:1012-1021 | compiler-core/src/type_/expression.rs:4329-4338 | compiler-core/src/type_/pattern.rs:1568-1577 — before extracting anything, compare `compiler-core/src/type_/constant.rs` and `compiler-core/src/type_/expression.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 3) compiler-core/src/warning.rs:1088— compiler-core/src/warning.rs:1088-1097 | compiler-core/src/warning.rs:1246-1255 | compiler-core/src/warning.rs:1563-1572 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) compiler-core/src/erlang.rs:1759— compiler-core/src/erlang.rs:1759-1768 | compiler-core/src/erlang.rs:1772-1779 | compiler-core/src/erlang.rs:1841-1849 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) format/src/lib.rs:2997— format/src/lib.rs:2997-3004 | format/src/lib.rs:3383-3390 | format/src/lib.rs:3425-3432 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) compiler-core/src/javascript.rs:1423— compiler-core/src/javascript.rs:1423-1430 | compiler-core/src/javascript/typescript.rs:131-138 | compiler-core/src/javascript/typescript.rs:146-153 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8 lines × 3) compiler-core/src/erlang/echo.rs:1467— compiler-core/src/erlang/echo.rs:1467-1474 | compiler-core/src/erlang/echo.rs:1540-1547 | compiler-core/src/erlang/echo.rs:1610-1617 — 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.
Swallowed exception (empty catch) compiler-core/templates/prelude.mjs:1505— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:20— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:130— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:144— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×3
Animation without a prefers-reduced-motion guard compiler-core/templates/docs-css/index.css:438— `.sidebar` moves (`transition: transform 0.5s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard compiler-core/templates/docs-css/index.css:923— `.search-input-wrap` moves (`transition: height linear 200ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard compiler-core/templates/docs-css/index.css:934— `.search-input-wrap` moves (`transition: width ease 400ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Lexer::consume_character (cyclomatic 78) compiler-core/src/parse/lexer.rs:155— Lexer::consume_character has cyclomatic complexity 78 (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.
Lexer::next (cyclomatic 19) hexpm/src/version/lexer.rs:212— Lexer::next has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Lexer::lex_string (cyclomatic 18) compiler-core/src/parse/lexer.rs:1297— Lexer::lex_string has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: gleam_core::parse::lexer::string_to_keyword (cyclomatic 23) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
TypedExpr::syntactically_eq (cyclomatic 70) compiler-core/src/ast/typed.rs:1536— TypedExpr::syntactically_eq has cyclomatic complexity 70 (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.
TypedExpr::find_node (cyclomatic 35) compiler-core/src/ast/typed.rs:257— TypedExpr::find_node 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.
TypedExpr::find_statement (cyclomatic 28) compiler-core/src/ast/typed.rs:529— TypedExpr::find_statement has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
Parser::parse_expression_unit (cyclomatic 47) compiler-core/src/parse.rs:518— Parser::parse_expression_unit has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Parser::parse_pattern (cyclomatic 37) compiler-core/src/parse.rs:1319— Parser::parse_pattern has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Parser::parse_const_value_unit (cyclomatic 29) compiler-core/src/parse.rs:3440— Parser::parse_const_value_unit has cyclomatic complexity 29 (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.
Generator::compile (cyclomatic 36) compiler-core/src/javascript.rs:201— Generator::compile has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Generator::constant_expression (cyclomatic 31) compiler-core/src/javascript/expression.rs:2671— Generator::constant_expression has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Generator::guard_expression (cyclomatic 25) compiler-core/src/javascript/expression.rs:3080— Generator::guard_expression has cyclomatic complexity 25 (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: Generator::expression (cyclomatic 29) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
ExprTyper::infer_binop (cyclomatic 32) compiler-core/src/type_/expression.rs:1837— ExprTyper::infer_binop has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ExprTyper::do_infer_call_with_known_fun (cyclomatic 24) compiler-core/src/type_/expression.rs:3718— ExprTyper::do_infer_call_with_known_fun 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. This is NOT this file's highest cyclomatic complexity: ExprTyper::check_for_redundant_comparison (cyclomatic 25) 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.
ExprTyper::infer_record_update_arguments (cyclomatic 17) compiler-core/src/type_/expression.rs:2826— ExprTyper::infer_record_update_arguments has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: ExprTyper::check_for_redundant_comparison (cyclomatic 25) 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.
LanguageServerEngine::hover (cyclomatic 30) language-server/src/engine.rs:1350— LanguageServerEngine::hover has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
LanguageServerEngine::folding_range (cyclomatic 19) language-server/src/engine.rs:735— LanguageServerEngine::folding_range 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. This is NOT this file's highest cyclomatic complexity: LanguageServerEngine::completion (cyclomatic 28) 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.
LanguageServerEngine::find_references_in_scope (cyclomatic 16) language-server/src/engine.rs:1094— LanguageServerEngine::find_references_in_scope has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: LanguageServerEngine::completion (cyclomatic 28) 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.
ErlangSourceBuilder::new_expression (cyclomatic 27) erlang-generation/src/lib.rs:2701— ErlangSourceBuilder::new_expression has cyclomatic complexity 27 (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.
ErlangSourceBuilder::close_currently_open_item (cyclomatic 23) erlang-generation/src/lib.rs:3126— ErlangSourceBuilder::close_currently_open_item has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ErlangSourceBuilder::bit_array_segment_specifiers (cyclomatic 20) erlang-generation/src/lib.rs:2362— ErlangSourceBuilder::bit_array_segment_specifiers has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Completer::completion_values (cognitive 56) language-server/src/completer.rs:881— Completer::completion_values has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 8 (15 pts), match/switch 2 (5 pts), boolean chains 3 (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.
Completer::completion_types (cognitive 39) language-server/src/completer.rs:718— Completer::completion_types has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 7 (13 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Completer::unqualified_completions_from_module (cognitive 25) language-server/src/completer.rs:546— Completer::unqualified_completions_from_module has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 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.
TypedExpr::find_node (cognitive 42) compiler-core/src/ast/typed.rs:257— TypedExpr::find_node has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 21). 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.
TypedExpr::find_statement (cognitive 30) compiler-core/src/ast/typed.rs:529— TypedExpr::find_statement has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TypedExpr::syntactically_eq (cognitive 25) compiler-core/src/ast/typed.rs:1536— TypedExpr::syntactically_eq has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, match/switch 6 (11 pts) (nesting depth added 5). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Generator::compile (cognitive 36) compiler-core/src/javascript.rs:201— Generator::compile has cognitive complexity 36 (threshold 15). Drivers by points: if/else 29, boolean chains 6, loops 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Generator::constant_expression (cognitive 28) compiler-core/src/javascript/expression.rs:2671— Generator::constant_expression has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 5 (10 pts), boolean chains 4 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Generator::record_constructor (cognitive 22) compiler-core/src/javascript/expression.rs:3413— Generator::record_constructor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_cli::text_layout::space_table (cognitive 35) compiler-cli/src/text_layout.rs:19— gleam_cli::text_layout::space_table has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 6 (8 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.
gleam_cli::add::command (cognitive 17) compiler-cli/src/add.rs:20— gleam_cli::add::command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gleam_cli::export::escript (cognitive 16) compiler-cli/src/export.rs:26— gleam_cli::export::escript has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (18 lines × 2) compiler-cli/src/docs.rs:70— compiler-cli/src/docs.rs:70-87 | compiler-cli/src/docs.rs:196-213 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) format/src/lib.rs:820— format/src/lib.rs:820-837 | format/src/lib.rs:1642-1659 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) pretty-arena/src/lib.rs:1302— pretty-arena/src/lib.rs:1302-1319 | pretty-arena/src/lib.rs:1519-1536 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) compiler-core/src/call_graph.rs:52— compiler-core/src/call_graph.rs:52-65 | compiler-core/src/call_graph.rs:74-87 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) erlang-generation/src/lib.rs:1893— erlang-generation/src/lib.rs:1893-1906 | erlang-generation/src/lib.rs:1921-1934 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) language-server/src/code_action.rs:4132— language-server/src/code_action.rs:4132-4145 | language-server/src/code_action.rs:4342-4355 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 3) compiler-core/src/erlang/echo.rs:1521— compiler-core/src/erlang/echo.rs:1521-1532 | compiler-core/src/erlang/echo.rs:1591-1602 | compiler-core/src/erlang/echo.rs:1631-1642 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 3) compiler-core/src/warning.rs:860— compiler-core/src/warning.rs:860-871 | compiler-core/src/warning.rs:893-904 | compiler-core/src/warning.rs:928-939 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 3) compiler-cli/src/run.rs:218— compiler-cli/src/run.rs:218-229 | compiler-cli/src/run.rs:242-253 | compiler-cli/src/run.rs:342-353 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 8) compiler-core/src/ast.rs:1844— compiler-core/src/ast.rs:1844-1853 | compiler-core/src/ast/typed.rs:984-993 | compiler-core/src/ast/typed.rs:1491-1500 | compiler-core/src/type_/expression.rs:2730-2739 | compiler-core/src/type_/expression.rs:3540-3549 | compiler-core/src/type_/pattern.rs:371-380 | language-server/src/completer.rs:1223-1232 | language-server/src/signature_help.rs:80-89 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 8) compiler-core/src/ast.rs:1963— compiler-core/src/ast.rs:1963-1972 | compiler-core/src/type_/pipe.rs:211-220 | compiler-core/src/type_/pipe.rs:423-432 | format/src/lib.rs:1989-1998 | format/src/lib.rs:3006-3015 | format/src/lib.rs:3391-3400 | format/src/lib.rs:3433-3442 | format/src/lib.rs:3599-3608 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/type_/pipe.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 8) compiler-core/src/ast.rs:3938— compiler-core/src/ast.rs:3938-3947 | compiler-core/src/ast.rs:4188-4197 | compiler-core/src/ast.rs:4347-4356 | compiler-core/src/ast.rs:4372-4381 | compiler-core/src/ast.rs:4396-4405 | compiler-core/src/erlang.rs:506-515 | compiler-core/src/metadata.rs:501-510 | compiler-core/src/type_/pattern.rs:566-575 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/erlang.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 3) compiler-core/src/build/package_loader.rs:232— compiler-core/src/build/package_loader.rs:232-240 | compiler-core/src/build/package_loader.rs:247-255 | compiler-core/src/build/package_loader.rs:260-268 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) language-server/src/code_action.rs:2012— language-server/src/code_action.rs:2012-2021 | language-server/src/code_action.rs:2049-2057 | language-server/src/code_action.rs:2120-2128 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) compiler-core/src/warning.rs:392— compiler-core/src/warning.rs:392-400 | compiler-core/src/warning.rs:442-451 | compiler-core/src/warning.rs:1321-1332 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) compiler-core/src/ast/typed.rs:758— compiler-core/src/ast/typed.rs:758-763 | compiler-core/src/ast/typed.rs:787-792 | compiler-core/src/ast/untyped.rs:171-176 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (6 lines × 3) compiler-core/src/ast/typed.rs:772— compiler-core/src/ast/typed.rs:772-777 | compiler-core/src/ast/typed.rs:800-805 | compiler-core/src/ast/typed.rs:871-876 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) compiler-core/src/erlang.rs:1402— compiler-core/src/erlang.rs:1402-1407 | compiler-core/src/erlang.rs:1902-1907 | compiler-core/src/erlang.rs:1938-1943 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Off the main sequence: erlang-term-format — erlang-term-format: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: src-span — src-span: 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: hexpm — hexpm: abstractness 0.05, instability 0.00, distance 0.95 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
R4 · Test Coverage· No test reaches this file · ×3
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file compiler-core/templates/echo.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file compiler-core/templates/docs-js/highlightjs-gleam.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
PatternTyper::unify (cyclomatic 49) compiler-core/src/type_/pattern.rs:671— PatternTyper::unify has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PatternTyper::infer_pattern_segment (cyclomatic 18) compiler-core/src/type_/pattern.rs:452— PatternTyper::infer_pattern_segment has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ConstantTyper::do_infer (cyclomatic 44) compiler-core/src/type_/constant.rs:45— ConstantTyper::do_infer has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ConstantTyper::infer_record (cyclomatic 21) compiler-core/src/type_/constant.rs:598— ConstantTyper::infer_record has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
CallGraphBuilder::expression (cyclomatic 35) compiler-core/src/call_graph.rs:183— CallGraphBuilder::expression has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
CallGraphBuilder::constant (cyclomatic 17) compiler-core/src/call_graph.rs:460— CallGraphBuilder::constant has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
FunctionGenerator::expression (cyclomatic 34) compiler-core/src/erlang.rs:881— FunctionGenerator::expression 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.
FunctionGenerator::inlined_constant (cyclomatic 22) compiler-core/src/erlang.rs:2433— FunctionGenerator::inlined_constant has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: FunctionGenerator::clause_guard (cyclomatic 26) 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.
Completer::completion_values (cyclomatic 30) language-server/src/completer.rs:881— Completer::completion_values 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.
Completer::completion_types (cyclomatic 20) language-server/src/completer.rs:718— Completer::completion_types 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.
pretty_arena::format (cyclomatic 26) pretty-arena/src/lib.rs:1184— pretty_arena::format has cyclomatic complexity 26 (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.
pretty_arena::fits (cyclomatic 22) pretty-arena/src/lib.rs:1381— pretty_arena::fits has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
PatternTyper::unify (cognitive 88) compiler-core/src/type_/pattern.rs:671— PatternTyper::unify has cognitive complexity 88 (threshold 15). Drivers by points: if/else 17 (48 pts), match/switch 12 (24 pts), loops 3 (12 pts), boolean chains 4 (nesting depth added 52). 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.
PatternTyper::infer_pattern_segment (cognitive 19) compiler-core/src/type_/pattern.rs:452— PatternTyper::infer_pattern_segment has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (12 pts), boolean chains 3, if/else 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ConstantTyper::do_infer (cognitive 73) compiler-core/src/type_/constant.rs:45— ConstantTyper::do_infer has cognitive complexity 73 (threshold 15). Drivers by points: if/else 18 (43 pts), match/switch 11 (23 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 39). 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.
ConstantTyper::infer_record (cognitive 26) compiler-core/src/type_/constant.rs:598— ConstantTyper::infer_record has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 5 (6 pts), loops 3 (5 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.
CallGraphBuilder::expression (cognitive 45) compiler-core/src/call_graph.rs:183— CallGraphBuilder::expression has cognitive complexity 45 (threshold 15). Drivers by points: loops 11 (24 pts), if/else 8 (20 pts), match/switch 1 (nesting depth added 25). 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.
CallGraphBuilder::constant (cognitive 18) compiler-core/src/call_graph.rs:460— CallGraphBuilder::constant has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (4 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.
pretty_arena::format (cognitive 36) pretty-arena/src/lib.rs:1184— pretty_arena::format has cognitive complexity 36 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 4 (12 pts), if/else 4 (8 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.
pretty_arena::fits (cognitive 30) pretty-arena/src/lib.rs:1381— pretty_arena::fits has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ModuleAnalyzer::register_values_from_custom_type (cognitive 29) compiler-core/src/analyse.rs:1126— ModuleAnalyzer::register_values_from_custom_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ModuleAnalyzer::infer_module (cognitive 21) compiler-core/src/analyse.rs:215— ModuleAnalyzer::infer_module has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (12 pts), match/switch 4 (6 pts), if/else 2 (3 pts) (nesting depth added 6). 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.
LanguageServerEngine::folding_range (cognitive 27) language-server/src/engine.rs:735— LanguageServerEngine::folding_range has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8 (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.
LanguageServerEngine::hover (cognitive 16) language-server/src/engine.rs:1350— LanguageServerEngine::hover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FunctionGenerator::inlined_constant (cognitive 26) compiler-core/src/erlang.rs:2433— FunctionGenerator::inlined_constant has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (13 pts), match/switch 6 (13 pts) (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
FunctionGenerator::expression (cognitive 18) compiler-core/src/erlang.rs:881— FunctionGenerator::expression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Formatter::module (cognitive 17) format/src/lib.rs:234— Formatter::module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Formatter::list (cognitive 16) format/src/lib.rs:2747— Formatter::list has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 4 (5 pts), loops 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×2
REDACTED
REDACTED
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (7 members, 50+ identical tokens) compiler-core/src/ast.rs:1551— compiler-core/src/ast.rs:1551-1575 | compiler-core/src/erlang.rs:2437-2619 | compiler-core/src/error.rs:5484-5530 | compiler-core/src/javascript/expression.rs:1305-1471 | compiler-core/src/javascript/expression.rs:2676-2868 | compiler-core/src/javascript/expression.rs:3847-3872 | compiler-core/src/type_/constant.rs:45-557 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
Members sharing a duplicated core (7 members, 50+ identical tokens) hexpm/src/lib.rs:482— hexpm/src/lib.rs:482-492 | hexpm/src/lib.rs:519-529 | hexpm/src/lib.rs:600-611 | hexpm/src/lib.rs:660-670 | hexpm/src/lib.rs:695-705 | hexpm/src/lib.rs:726-736 | hexpm/src/lib.rs:1226-1237 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
Duplicated block (23 lines × 2) compiler-core/src/type_/expression.rs:4287— compiler-core/src/type_/expression.rs:4287-4309 | compiler-core/src/type_/pattern.rs:1526-1548 — before extracting anything, compare `compiler-core/src/type_/expression.rs` and `compiler-core/src/type_/pattern.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 125 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 (23 lines × 2) format/src/lib.rs:770— format/src/lib.rs:770-792 | format/src/lib.rs:2836-2858 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–20 lines × 2) compiler-core/src/parse.rs:672— compiler-core/src/parse.rs:672-689 | compiler-core/src/parse.rs:3534-3553 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–20 lines × 2) language-server/src/code_action.rs:3705— language-server/src/code_action.rs:3705-3724 | language-server/src/code_action.rs:12648-12665 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) compiler-core/src/type_/pretty.rs:140— compiler-core/src/type_/pretty.rs:140-159 | compiler-core/src/type_/printer.rs:579-598 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (20 lines × 2) format/src/lib.rs:1946— format/src/lib.rs:1946-1965 | format/src/lib.rs:2001-2020 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17–18 lines × 2) compiler-core/src/warning.rs:296— compiler-core/src/warning.rs:296-313 | compiler-core/src/warning.rs:321-337 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17–18 lines × 2) language-server/src/code_action.rs:538— language-server/src/code_action.rs:538-555 | language-server/src/code_action.rs:1431-1447 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) compiler-core/src/analyse/imports.rs:238— compiler-core/src/analyse/imports.rs:238-254 | compiler-core/src/analyse/imports.rs:260-276 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) compiler-core/src/warning.rs:628— compiler-core/src/warning.rs:628-644 | compiler-core/src/warning.rs:658-674 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–12 lines × 2) compiler-core/src/erlang/echo.rs:558— compiler-core/src/erlang/echo.rs:558-567 | compiler-core/src/erlang/echo.rs:750-761 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–12 lines × 2) format/src/lib.rs:705— format/src/lib.rs:705-714 | format/src/lib.rs:2762-2773 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–12 lines × 2) format/src/lib.rs:2191— format/src/lib.rs:2191-2201 | format/src/lib.rs:2209-2220 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–12 lines × 2) hexpm/src/lib.rs:367— hexpm/src/lib.rs:367-378 | hexpm/src/lib.rs:447-457 — both copies are in the same file, so extract the block into 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 × 5) compiler-core/src/warning.rs:860— compiler-core/src/warning.rs:860-870 | compiler-core/src/warning.rs:893-903 | compiler-core/src/warning.rs:928-938 | compiler-core/src/warning.rs:1049-1058 | compiler-core/src/warning.rs:1444-1453 — 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 (10 lines × 5) compiler-core/src/warning.rs:555— compiler-core/src/warning.rs:555-564 | compiler-core/src/warning.rs:571-580 | compiler-core/src/warning.rs:589-598 | compiler-core/src/warning.rs:1070-1079 | compiler-core/src/warning.rs:1347-1356 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–10 lines × 2) compiler-core/src/parse.rs:3244— compiler-core/src/parse.rs:3244-3253 | compiler-core/src/parse.rs:3262-3270 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–10 lines × 2) language-server/src/code_action.rs:9106— language-server/src/code_action.rs:9106-9114 | language-server/src/code_action.rs:10206-10215 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 8) compiler-core/src/ast.rs:1847— compiler-core/src/ast.rs:1847-1855 | compiler-core/src/ast/typed.rs:1494-1502 | compiler-core/src/erlang.rs:3750-3758 | compiler-core/src/type_/expression.rs:2733-2741 | compiler-core/src/type_/expression.rs:3543-3551 | compiler-core/src/type_/pattern.rs:374-382 | language-server/src/completer.rs:1226-1234 | language-server/src/signature_help.rs:83-91 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 8) compiler-core/src/warning.rs:296— compiler-core/src/warning.rs:296-306 | compiler-core/src/warning.rs:321-330 | compiler-core/src/warning.rs:342-350 | compiler-core/src/warning.rs:364-373 | compiler-core/src/warning.rs:411-420 | compiler-core/src/warning.rs:1085-1094 | compiler-core/src/warning.rs:1243-1252 | compiler-core/src/warning.rs:1580-1589 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–9 lines × 8) compiler-core/src/ast.rs:1966— compiler-core/src/ast.rs:1966-1973 | compiler-core/src/type_/expression.rs:3621-3628 | compiler-core/src/type_/pipe.rs:214-221 | compiler-core/src/type_/pipe.rs:426-433 | format/src/lib.rs:1992-1999 | format/src/lib.rs:2597-2604 | format/src/lib.rs:3009-3016 | format/src/lib.rs:3602-3610 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/type_/expression.rs` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8–9 lines × 8) compiler-core/src/ast.rs:1965— compiler-core/src/ast.rs:1965-1973 | compiler-core/src/type_/pipe.rs:213-221 | compiler-core/src/type_/pipe.rs:425-433 | format/src/lib.rs:1991-1999 | format/src/lib.rs:2596-2604 | format/src/lib.rs:3008-3016 | format/src/lib.rs:3435-3442 | format/src/lib.rs:3601-3609 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/type_/pipe.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 6) compiler-core/src/parse/lexer.rs:221— compiler-core/src/parse/lexer.rs:221-227 | compiler-core/src/parse/lexer.rs:247-253 | compiler-core/src/parse/lexer.rs:273-279 | compiler-core/src/parse/lexer.rs:325-331 | compiler-core/src/parse/lexer.rs:345-351 | compiler-core/src/parse/lexer.rs:365-371 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 6) compiler-core/src/warning.rs:631— compiler-core/src/warning.rs:631-637 | compiler-core/src/warning.rs:661-667 | compiler-core/src/warning.rs:678-684 | compiler-core/src/warning.rs:723-729 | compiler-core/src/warning.rs:739-745 | compiler-core/src/warning.rs:755-761 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) compiler-core/src/type_/constant.rs:1000— compiler-core/src/type_/constant.rs:1000-1006 | compiler-core/src/type_/expression.rs:4317-4323 | compiler-core/src/type_/pattern.rs:1556-1562 — before extracting anything, compare `compiler-core/src/type_/constant.rs` and `compiler-core/src/type_/expression.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) compiler-core/src/erlang/echo.rs:523— compiler-core/src/erlang/echo.rs:523-529 | compiler-core/src/erlang/echo.rs:712-718 | compiler-core/src/erlang/echo.rs:848-854 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 2) compiler-cli/src/fs.rs:689— compiler-cli/src/fs.rs:689-694 | compiler-cli/src/fs.rs:703-707 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) compiler-cli/src/hex.rs:39— compiler-cli/src/hex.rs:39-43 | compiler-cli/src/hex.rs:102-106 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Positive tabindex (1) REDACTED:201— A positive tabindex forces a manual tab order that fights the DOM and is fragile. Use tabindex="0" (or restructure the DOM).
AC4 · Keyboard semantics· Anchor without href · ×1
Anchor without href REDACTED:243— An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
Low contrast colour pair in CSS (1.5:1) compiler-core/templates/docs-css/index.css:302— `.page-header` sets color: #fdf1d4 on background-color: #ffaff3 — 1.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×1
Focus outline removed in CSS without a :focus replacement compiler-core/templates/docs-css/index.css:963— `.search-input:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 4 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
Error::to_diagnostics (cyclomatic 124) compiler-core/src/error.rs:1092— Error::to_diagnostics has cyclomatic complexity 124 (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.
Warning::to_diagnostic (cyclomatic 99) compiler-core/src/warning.rs:271— Warning::to_diagnostic has cyclomatic complexity 99 (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.
ParseErrorType::details (cyclomatic 75) compiler-core/src/parse/error.rs:209— ParseErrorType::details has cyclomatic complexity 75 (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.
gleam_language_server::reference::reference_for_ast_node (cyclomatic 38) language-server/src/reference.rs:90— gleam_language_server::reference::reference_for_ast_node has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
GuardTyper::do_infer (cyclomatic 34) compiler-core/src/type_/guard.rs:30— GuardTyper::do_infer has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Variables::runtime_check (cyclomatic 27) compiler-core/src/javascript/decision.rs:1497— Variables::runtime_check has cyclomatic complexity 27 (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.
PatternGenerator::pattern (cyclomatic 25) compiler-core/src/erlang/pattern.rs:131— PatternGenerator::pattern has cyclomatic complexity 25 (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.
Hydrator::type_from_ast (cyclomatic 23) compiler-core/src/type_/hydrator.rs:114— Hydrator::type_from_ast has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
Echo$Inspector.inspect (cyclomatic 22) compiler-core/templates/echo.mjs:65— Echo$Inspector.inspect has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
(anonymous)::searchLoaded::update::addResult (cyclomatic 22) REDACTED:290— (anonymous)::searchLoaded::update::addResult 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.
Printer::print (cyclomatic 21) compiler-core/src/exhaustiveness/printer.rs:53— Printer::print 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.
prelude.toBitArray (cyclomatic 21) compiler-core/templates/prelude.mjs:560— prelude.toBitArray has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CasePrinter::switch (cyclomatic 19) compiler-core/src/javascript/decision.rs:555— CasePrinter::switch 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.
Branch::move_unconditional_patterns (cyclomatic 18) compiler-core/src/exhaustiveness.rs:222— Branch::move_unconditional_patterns has cyclomatic complexity 18 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
JsonEncoderPrinter::encoder_for (cyclomatic 18) language-server/src/code_action.rs:5430— JsonEncoderPrinter::encoder_for 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.
prelude.isEqual (cyclomatic 18) compiler-core/templates/prelude.mjs:1481— prelude.isEqual 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.
gleam_cli::text_layout::space_table (cyclomatic 17) compiler-cli/src/text_layout.rs:19— gleam_cli::text_layout::space_table 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.
ModuleAnalyzer::infer_module (cyclomatic 16) compiler-core/src/analyse.rs:215— ModuleAnalyzer::infer_module has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file's highest cyclomatic complexity: gleam_core::analyse::infer_bit_array_option (cyclomatic 17) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
prelude.sizedInt (cyclomatic 16) compiler-core/templates/prelude.mjs:740— prelude.sizedInt 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.
FixmeComment compiler-core/src/io.rs:423— // FIXME: The reader types are restrictive here. We should be more generic — 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.
Warning::to_diagnostic (cognitive 88) compiler-core/src/warning.rs:271— Warning::to_diagnostic has cognitive complexity 88 (threshold 15). Drivers by points: if/else 22 (46 pts), match/switch 16 (42 pts) (nesting depth added 50). 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.
GuardTyper::do_infer (cognitive 61) compiler-core/src/type_/guard.rs:30— GuardTyper::do_infer has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (44 pts), match/switch 7 (15 pts), boolean chains 2 (nesting depth added 36). 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.
(anonymous)::searchLoaded::update::addResult (cognitive 58) REDACTED:290— (anonymous)::searchLoaded::update::addResult has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 7 (19 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Error::to_diagnostics (cognitive 57) compiler-core/src/error.rs:1092— Error::to_diagnostics has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 13 (27 pts), boolean chains 2 (nesting depth added 24). 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.
Printer::print (cognitive 40) compiler-core/src/exhaustiveness/printer.rs:53— Printer::print has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 23). 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.
prelude.toBitArray (cognitive 40) compiler-core/templates/prelude.mjs:560— prelude.toBitArray has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (36 pts), loops 3, boolean chains 1 (nesting depth added 15). Of this number, 34 points are the body's own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prelude.sizedInt (cognitive 36) compiler-core/templates/prelude.mjs:740— prelude.sizedInt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 4 (12 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Hydrator::type_from_ast (cognitive 34) compiler-core/src/type_/hydrator.rs:114— Hydrator::type_from_ast has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 6 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
PatternGenerator::pattern (cognitive 32) compiler-core/src/erlang/pattern.rs:131— PatternGenerator::pattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (9 pts), match/switch 4 (9 pts) (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
JsonEncoderPrinter::encoder_for (cognitive 30) language-server/src/code_action.rs:5430— JsonEncoderPrinter::encoder_for has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CasePrinter::switch (cognitive 28) compiler-core/src/javascript/decision.rs:555— CasePrinter::switch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (22 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Variables::runtime_check (cognitive 28) compiler-core/src/javascript/decision.rs:1497— Variables::runtime_check has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 6 (12 pts), boolean chains 2 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
isEqual (cognitive 28) compiler-core/templates/prelude.mjs:1481— isEqual has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 8, error handling 1 (3 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.
prelude.intFromUnalignedSliceUsingNumber (cognitive 27) compiler-core/templates/prelude.mjs:986— prelude.intFromUnalignedSliceUsingNumber has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (8 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. This shape REPEATS in the file: one other method here (prelude.intFromUnalignedSliceUsingBigInt) 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.
prelude.intFromUnalignedSliceUsingBigInt (cognitive 27) compiler-core/templates/prelude.mjs:1108— prelude.intFromUnalignedSliceUsingBigInt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (8 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. This shape REPEATS in the file: one other method here (prelude.intFromUnalignedSliceUsingNumber) 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.
TypeAst::print (cognitive 25) compiler-core/src/ast.rs:666— TypeAst::print has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (7 pts), match/switch 2 (3 pts) (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Branch::move_unconditional_patterns (cognitive 24) compiler-core/src/exhaustiveness.rs:222— Branch::move_unconditional_patterns has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 3 (9 pts), loops 2 (4 pts) (nesting depth added 16). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
BitArray.equals (cognitive 24) compiler-core/templates/prelude.mjs:200— BitArray.equals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Echo$Inspector.inspect (cognitive 23) compiler-core/templates/echo.mjs:65— Echo$Inspector.inspect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, loops 1 (2 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ErlangSourceBuilder::new_expression (cognitive 21) erlang-generation/src/lib.rs:2701— ErlangSourceBuilder::new_expression has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DependencyManager::resolve_and_download_versions (cognitive 20) compiler-cli/src/dependencies/dependency_manager.rs:152— DependencyManager::resolve_and_download_versions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FieldMap::reorder (cognitive 20) compiler-core/src/type_/fields.rs:48— FieldMap::reorder has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CollapseNestedCase::code_actions (cognitive 20) language-server/src/code_action.rs:9907— CollapseNestedCase::code_actions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Manifest::to_toml (cognitive 19) compiler-core/src/manifest.rs:31— Manifest::to_toml has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PackageCompiler::compile (cognitive 17) compiler-core/src/build/package_compiler.rs:122— PackageCompiler::compile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
CaseToCompile::bit_array_to_tests (cognitive 17) compiler-core/src/exhaustiveness.rs:3831— CaseToCompile::bit_array_to_tests has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
gleam_format::printed_comments (cognitive 17) format/src/lib.rs:4421— gleam_format::printed_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TypeScriptGenerator::collect_imports (cognitive 16) compiler-core/src/javascript/typescript.rs:238— TypeScriptGenerator::collect_imports has cognitive complexity 16 (threshold 15). Drivers by points: loops 9 (14 pts), match/switch 1 (2 pts) (nesting depth added 6). 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.
ConvertFromUse::code_actions (cognitive 16) language-server/src/code_action.rs:2881— ConvertFromUse::code_actions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
RemoveUnreachableCaseClauses::visit_typed_expr_case (cognitive 16) language-server/src/code_action.rs:10295— RemoveUnreachableCaseClauses::visit_typed_expr_case has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyFunctions: gleam_cli::cli compiler-cli/src/cli.rs:69— TooManyFunctions — 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×1
D4 · Code Duplication· Near-duplicate member family (6 members, 19 shared lines) · ×1
Near-duplicate member family (6 members, 19 shared lines) compiler-core/src/ast/typed.rs:931— compiler-core/src/ast/typed.rs:931-964 | compiler-core/src/ast/typed.rs:1253-1293 | compiler-core/src/ast/typed.rs:1298-1338 | compiler-core/src/ast/typed.rs:1343-1382 | compiler-core/src/ast/typed.rs:1388-1423 | compiler-core/src/javascript/expression.rs:1477-1532 — These 6 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Near-duplicate member family (5 members, 23 shared lines) · ×1
Near-duplicate member family (5 members, 23 shared lines) compiler-core/src/ast/typed.rs:1253— compiler-core/src/ast/typed.rs:1253-1293 | compiler-core/src/ast/typed.rs:1298-1338 | compiler-core/src/javascript/expression.rs:2287-2376 | language-server/src/code_action.rs:7627-7671 | language-server/src/engine.rs:2426-2473 — These 5 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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· Near-duplicate member family (5 members, 20 shared lines) · ×1
Near-duplicate member family (5 members, 20 shared lines) compiler-core/src/ast/typed.rs:1253— compiler-core/src/ast/typed.rs:1253-1293 | compiler-core/src/ast/typed.rs:1298-1338 | compiler-core/src/ast/typed.rs:1343-1382 | compiler-core/src/ast/typed.rs:1388-1423 | language-server/src/engine.rs:2426-2473 — These 5 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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.
Near-duplicate member pair (76 shared lines) format/src/lib.rs:698— format/src/lib.rs:698-806 | format/src/lib.rs:2753-2872 — These two members are variants of one another: 76 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 (44 shared lines) compiler-core/src/erlang.rs:2849— compiler-core/src/erlang.rs:2849-2919 | compiler-core/src/erlang.rs:2928-3002 — These two members are variants of one another: 44 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 (20 corresponding lines) · ×1
Edited copy of a member (20 corresponding lines) pretty-arena/src/lib.rs:1188— pretty-arena/src/lib.rs:1188-1379 | pretty-arena/src/lib.rs:1385-1541 — 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· Members sharing a duplicated core (11 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (11 members, 50+ identical tokens) compiler-core/src/ast.rs:1952— compiler-core/src/ast.rs:1952-1976 | compiler-core/src/ast/untyped.rs:251-279 | compiler-core/src/type_/expression.rs:3576-3635 | compiler-core/src/type_/pipe.rs:84-236 | compiler-core/src/type_/pipe.rs:408-436 | format/src/lib.rs:1973-2020 | format/src/lib.rs:2581-2607 | format/src/lib.rs:2976-3019 | format/src/lib.rs:3375-3409 | format/src/lib.rs:3415-3447 | format/src/lib.rs:3585-3613 — These 11 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 11 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 11 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) compiler-core/src/parse.rs:4254— compiler-core/src/parse.rs:4254-4345 | compiler-core/src/parse.rs:4348-4431 | compiler-core/src/parse.rs:4945-5023 | compiler-core/src/parse.rs:5025-5103 | compiler-core/src/parse/token.rs:193-272 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Duplicated block (24–36 lines × 2) compiler-core/src/erlang.rs:2860— compiler-core/src/erlang.rs:2860-2883 | compiler-core/src/erlang.rs:2939-2974 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (36 lines × 2) language-server/src/completer.rs:812— language-server/src/completer.rs:812-847 | language-server/src/completer.rs:1084-1119 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (33 lines × 5) compiler-core/src/parse.rs:4308— compiler-core/src/parse.rs:4308-4340 | compiler-core/src/parse.rs:4394-4426 | compiler-core/src/parse.rs:4988-5020 | compiler-core/src/parse.rs:5068-5100 | compiler-core/src/parse/error.rs:555-587 — there are 5 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (29–33 lines × 2) format/src/lib.rs:740— format/src/lib.rs:740-768 | format/src/lib.rs:2802-2834 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (30–31 lines × 5) compiler-core/src/parse.rs:4289— compiler-core/src/parse.rs:4289-4319 | compiler-core/src/parse.rs:4375-4405 | compiler-core/src/parse.rs:5049-5079 | compiler-core/src/parse/error.rs:536-566 | compiler-core/src/parse/token.rs:240-269 — before extracting anything, compare `compiler-core/src/parse.rs` and `compiler-core/src/parse/token.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) compiler-core/src/ast.rs:1882— compiler-core/src/ast.rs:1882-1908 | compiler-core/src/ast.rs:1922-1948 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24 lines × 2) compiler-core/src/ast/typed.rs:699— compiler-core/src/ast/typed.rs:699-722 | compiler-core/src/ast/typed.rs:728-751 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22 lines × 2) compiler-core/src/parse/lexer.rs:860— compiler-core/src/parse/lexer.rs:860-881 | compiler-core/src/parse/lexer.rs:930-951 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (21 lines × 3) compiler-core/src/analyse.rs:1731— compiler-core/src/analyse.rs:1731-1751 | compiler-core/src/type_/expression.rs:4292-4312 | compiler-core/src/type_/pattern.rs:1531-1551 — before extracting anything, compare `compiler-core/src/type_/expression.rs` and `compiler-core/src/type_/pattern.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 125 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 (21 lines × 2) compiler-core/src/ast/visit.rs:1998— compiler-core/src/ast/visit.rs:1998-2018 | compiler-core/src/ast/visit.rs:2284-2304 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19–21 lines × 2) compiler-core/src/erlang.rs:1772— compiler-core/src/erlang.rs:1772-1790 | compiler-core/src/erlang.rs:1841-1861 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17–19 lines × 6) compiler-core/src/ast.rs:1554— compiler-core/src/ast.rs:1554-1572 | compiler-core/src/erlang.rs:2589-2605 | compiler-core/src/error.rs:5510-5527 | compiler-core/src/javascript/expression.rs:1349-1367 | compiler-core/src/javascript/expression.rs:2830-2846 | compiler-core/src/type_/constant.rs:472-488 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/erlang.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18–19 lines × 3) compiler-core/src/parse.rs:4270— compiler-core/src/parse.rs:4270-4288 | compiler-core/src/parse.rs:4356-4374 | compiler-core/src/parse/token.rs:222-239 — before extracting anything, compare `compiler-core/src/parse.rs` and `compiler-core/src/parse/token.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) format/src/lib.rs:2426— format/src/lib.rs:2426-2444 | format/src/lib.rs:2462-2480 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 3) format/src/lib.rs:4240— format/src/lib.rs:4240-4257 | format/src/lib.rs:4262-4279 | format/src/lib.rs:4284-4301 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (16–18 lines × 2) compiler-core/src/ast/typed.rs:1356— compiler-core/src/ast/typed.rs:1356-1371 | compiler-core/src/ast/typed.rs:1395-1412 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 5) compiler-core/src/erlang.rs:2586— compiler-core/src/erlang.rs:2586-2601 | compiler-core/src/error.rs:5507-5522 | compiler-core/src/javascript/expression.rs:2827-2842 | compiler-core/src/javascript/expression.rs:3849-3864 | compiler-core/src/type_/constant.rs:469-484 — before extracting anything, compare `compiler-core/src/erlang.rs` and `compiler-core/src/javascript/expression.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 3) compiler-core/src/erlang.rs:1587— compiler-core/src/erlang.rs:1587-1602 | compiler-core/src/erlang.rs:1643-1658 | compiler-core/src/erlang.rs:1695-1710 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14–16 lines × 2) format/src/lib.rs:722— format/src/lib.rs:722-735 | format/src/lib.rs:2782-2797 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 7) compiler-core/src/ast/typed.rs:1496— compiler-core/src/ast/typed.rs:1496-1510 | compiler-core/src/ast/typed.rs:1872-1886 | compiler-core/src/type_/expression.rs:2735-2749 | compiler-core/src/type_/expression.rs:3545-3559 | language-server/src/completer.rs:1228-1242 | language-server/src/engine.rs:2455-2469 | language-server/src/signature_help.rs:85-99 — before extracting anything, compare `compiler-core/src/ast/typed.rs` and `compiler-core/src/type_/expression.rs` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 123 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–14 lines × 6) compiler-core/src/erlang/echo.rs:1345— compiler-core/src/erlang/echo.rs:1345-1358 | compiler-core/src/erlang/echo.rs:1375-1388 | compiler-core/src/erlang/echo.rs:1402-1414 | compiler-core/src/erlang/echo.rs:1423-1435 | compiler-core/src/erlang/echo.rs:1449-1461 | compiler-core/src/erlang/echo.rs:1479-1492 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (13–14 lines × 5) compiler-core/src/erlang/echo.rs:1350— compiler-core/src/erlang/echo.rs:1350-1363 | compiler-core/src/erlang/echo.rs:1454-1466 | compiler-core/src/erlang/echo.rs:1484-1497 | compiler-core/src/erlang/echo.rs:1554-1567 | compiler-core/src/erlang/echo.rs:1596-1609 — 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 (14 lines × 3) compiler-core/src/erlang/echo.rs:1504— compiler-core/src/erlang/echo.rs:1504-1517 | compiler-core/src/erlang/echo.rs:1574-1587 | compiler-core/src/erlang/echo.rs:1616-1629 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12–14 lines × 2) compiler-core/src/exhaustiveness/printer.rs:87— compiler-core/src/exhaustiveness/printer.rs:87-98 | compiler-core/src/type_/printer.rs:485-498 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13–14 lines × 2) compiler-core/src/type_/expression.rs:1810— compiler-core/src/type_/expression.rs:1810-1822 | compiler-core/src/type_/expression.rs:3654-3667 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 3) compiler-core/src/parse.rs:4969— compiler-core/src/parse.rs:4969-4981 | compiler-core/src/parse.rs:5032-5044 | compiler-core/src/parse/token.rs:218-230 — before extracting anything, compare `compiler-core/src/parse.rs` and `compiler-core/src/parse/token.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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 (3–13 lines × 4) compiler-core/src/parse.rs:2130— compiler-core/src/parse.rs:2130-2133 | compiler-core/src/parse.rs:2500-2510 | compiler-core/src/parse.rs:3815-3827 | compiler-core/src/parse.rs:3875-3877 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12–13 lines × 2) compiler-core/src/warning.rs:1183— compiler-core/src/warning.rs:1183-1195 | compiler-core/src/warning.rs:1223-1234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 5) compiler-core/src/parse/lexer.rs:231— compiler-core/src/parse/lexer.rs:231-242 | compiler-core/src/parse/lexer.rs:257-268 | compiler-core/src/parse/lexer.rs:288-299 | compiler-core/src/parse/lexer.rs:309-320 | compiler-core/src/parse/lexer.rs:382-393 — 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 (11–12 lines × 4) compiler-core/src/erlang/echo.rs:1380— compiler-core/src/erlang/echo.rs:1380-1391 | compiler-core/src/erlang/echo.rs:1407-1417 | compiler-core/src/erlang/echo.rs:1428-1438 | compiler-core/src/erlang/echo.rs:1526-1537 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 4) format/src/lib.rs:1985— format/src/lib.rs:1985-1996 | format/src/lib.rs:3387-3398 | format/src/lib.rs:3429-3440 | format/src/lib.rs:3595-3606 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10–11 lines × 2) compiler-core/src/ast/typed.rs:1265— compiler-core/src/ast/typed.rs:1265-1275 | language-server/src/engine.rs:2447-2456 — before extracting anything, compare `compiler-core/src/ast/typed.rs` and `language-server/src/engine.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 89 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 (4–11 lines × 3) compiler-core/src/javascript/decision.rs:1584— compiler-core/src/javascript/decision.rs:1584-1587 | compiler-core/src/javascript/decision.rs:2176-2186 | compiler-core/src/javascript/decision.rs:2219-2228 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 23) compiler-core/src/ast.rs:1853— compiler-core/src/ast.rs:1853-1862 | compiler-core/src/ast.rs:2434-2443 | compiler-core/src/ast/typed.rs:950-959 | compiler-core/src/ast/typed.rs:1188-1197 | compiler-core/src/ast/typed.rs:1233-1242 | compiler-core/src/ast/typed.rs:1278-1287 | compiler-core/src/ast/typed.rs:1323-1332 | compiler-core/src/ast/typed.rs:1367-1376 | compiler-core/src/ast/typed.rs:1408-1417 | compiler-core/src/erlang.rs:1679-1688 | compiler-core/src/erlang.rs:3756-3765 | compiler-core/src/javascript/expression.rs:886-895 | compiler-core/src/javascript/expression.rs:1420-1429 | compiler-core/src/javascript/expression.rs:1514-1523 | compiler-core/src/javascript/expression.rs:1928-1937 | compiler-core/src/javascript/expression.rs:2361-2370 | compiler-core/src/type_/expression.rs:4356-4365 | compiler-core/src/type_/expression.rs:4746-4755 | compiler-core/src/type_/pattern.rs:380-389 | language-server/src/code_action.rs:6900-6909 | language-server/src/code_action.rs:9682-9691 | language-server/src/code_action.rs:10215-10224 | language-server/src/code_action.rs:11596-11605 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 13) compiler-core/src/ast.rs:2425— compiler-core/src/ast.rs:2425-2434 | compiler-core/src/ast/typed.rs:941-950 | compiler-core/src/ast/typed.rs:1224-1233 | compiler-core/src/ast/typed.rs:1269-1278 | compiler-core/src/ast/typed.rs:1314-1323 | compiler-core/src/ast/typed.rs:1867-1876 | compiler-core/src/javascript/expression.rs:1919-1928 | compiler-core/src/javascript/expression.rs:2352-2361 | compiler-core/src/type_/expression.rs:1209-1218 | compiler-core/src/type_/expression.rs:4737-4746 | language-server/src/code_action.rs:6891-6900 | language-server/src/code_action.rs:7648-7657 | language-server/src/engine.rs:2450-2459 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 9) compiler-core/src/ast/typed.rs:1284— compiler-core/src/ast/typed.rs:1284-1293 | compiler-core/src/ast/typed.rs:1329-1338 | compiler-core/src/ast/typed.rs:1373-1382 | compiler-core/src/ast/typed.rs:1414-1423 | compiler-core/src/javascript/expression.rs:2367-2376 | compiler-core/src/type_/pattern.rs:386-395 | language-server/src/code_action.rs:7662-7671 | language-server/src/completer.rs:1237-1246 | language-server/src/engine.rs:2464-2473 — before extracting anything, compare `compiler-core/src/ast/typed.rs` and `compiler-core/src/javascript/expression.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8–9 lines × 30) compiler-core/src/ast.rs:1857— compiler-core/src/ast.rs:1857-1865 | compiler-core/src/ast.rs:2438-2446 | compiler-core/src/ast/typed.rs:1192-1200 | compiler-core/src/ast/typed.rs:1237-1245 | compiler-core/src/ast/typed.rs:1282-1290 | compiler-core/src/ast/typed.rs:1327-1335 | compiler-core/src/ast/typed.rs:1371-1379 | compiler-core/src/ast/typed.rs:1412-1420 | compiler-core/src/ast/typed.rs:1503-1511 | compiler-core/src/ast/typed.rs:1879-1887 | compiler-core/src/erlang.rs:1683-1691 | compiler-core/src/erlang.rs:3760-3768 | compiler-core/src/javascript/expression.rs:890-898 | compiler-core/src/javascript/expression.rs:1424-1432 | compiler-core/src/javascript/expression.rs:1932-1940 | compiler-core/src/javascript/expression.rs:2365-2373 | compiler-core/src/type_/expression.rs:2742-2750 | compiler-core/src/type_/expression.rs:3552-3560 | compiler-core/src/type_/expression.rs:4360-4368 | compiler-core/src/type_/expression.rs:4750-4758 | compiler-core/src/type_/pattern.rs:384-392 | language-server/src/code_action.rs:6904-6912 | language-server/src/code_action.rs:7660-7668 | language-server/src/code_action.rs:9116-9124 | language-server/src/code_action.rs:9686-9694 | language-server/src/code_action.rs:10219-10227 | language-server/src/code_action.rs:11600-11608 | language-server/src/completer.rs:1235-1243 | language-server/src/engine.rs:2462-2470 | language-server/src/signature_help.rs:92-99 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 24) compiler-core/src/ast.rs:1855— compiler-core/src/ast.rs:1855-1863 | compiler-core/src/ast.rs:2436-2444 | compiler-core/src/ast/typed.rs:952-960 | compiler-core/src/ast/typed.rs:1190-1198 | compiler-core/src/ast/typed.rs:1235-1243 | compiler-core/src/ast/typed.rs:1280-1288 | compiler-core/src/ast/typed.rs:1325-1333 | compiler-core/src/ast/typed.rs:1369-1377 | compiler-core/src/ast/typed.rs:1410-1418 | compiler-core/src/erlang.rs:1681-1689 | compiler-core/src/erlang.rs:3758-3766 | compiler-core/src/javascript/expression.rs:888-896 | compiler-core/src/javascript/expression.rs:1422-1430 | compiler-core/src/javascript/expression.rs:1516-1524 | compiler-core/src/javascript/expression.rs:1930-1938 | compiler-core/src/javascript/expression.rs:2363-2371 | compiler-core/src/type_/expression.rs:4358-4366 | compiler-core/src/type_/expression.rs:4748-4756 | compiler-core/src/type_/pattern.rs:382-390 | language-server/src/code_action.rs:6902-6910 | language-server/src/code_action.rs:7658-7666 | language-server/src/code_action.rs:9684-9692 | language-server/src/code_action.rs:10217-10225 | language-server/src/code_action.rs:11598-11606 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 16) compiler-core/src/ast.rs:1850— compiler-core/src/ast.rs:1850-1858 | compiler-core/src/ast.rs:2431-2439 | compiler-core/src/ast/typed.rs:947-955 | compiler-core/src/ast/typed.rs:1230-1238 | compiler-core/src/ast/typed.rs:1275-1283 | compiler-core/src/ast/typed.rs:1320-1328 | compiler-core/src/erlang.rs:3753-3761 | compiler-core/src/javascript/expression.rs:883-891 | compiler-core/src/javascript/expression.rs:1925-1933 | compiler-core/src/javascript/expression.rs:2358-2366 | compiler-core/src/type_/expression.rs:1215-1223 | compiler-core/src/type_/expression.rs:4743-4751 | compiler-core/src/type_/pattern.rs:377-385 | language-server/src/code_action.rs:6897-6905 | language-server/src/code_action.rs:10212-10220 | language-server/src/code_action.rs:11593-11601 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 14) compiler-core/src/ast.rs:2424— compiler-core/src/ast.rs:2424-2432 | compiler-core/src/ast/typed.rs:940-948 | compiler-core/src/ast/typed.rs:1223-1231 | compiler-core/src/ast/typed.rs:1268-1276 | compiler-core/src/ast/typed.rs:1313-1321 | compiler-core/src/ast/typed.rs:1866-1874 | compiler-core/src/javascript/expression.rs:1505-1513 | compiler-core/src/javascript/expression.rs:1918-1926 | compiler-core/src/javascript/expression.rs:2351-2359 | compiler-core/src/type_/expression.rs:1208-1216 | compiler-core/src/type_/expression.rs:4736-4744 | language-server/src/code_action.rs:6890-6898 | language-server/src/code_action.rs:7647-7655 | language-server/src/engine.rs:2449-2457 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 13) compiler-core/src/ast.rs:2428— compiler-core/src/ast.rs:2428-2436 | compiler-core/src/ast/typed.rs:944-952 | compiler-core/src/ast/typed.rs:1227-1235 | compiler-core/src/ast/typed.rs:1272-1280 | compiler-core/src/ast/typed.rs:1317-1325 | compiler-core/src/ast/typed.rs:1870-1878 | compiler-core/src/javascript/expression.rs:1922-1930 | compiler-core/src/javascript/expression.rs:2355-2363 | compiler-core/src/type_/expression.rs:1212-1220 | compiler-core/src/type_/expression.rs:4740-4748 | language-server/src/code_action.rs:6894-6902 | language-server/src/code_action.rs:10209-10217 | language-server/src/engine.rs:2453-2461 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7–9 lines × 7) compiler-core/src/ast.rs:3935— compiler-core/src/ast.rs:3935-3943 | compiler-core/src/ast.rs:4186-4193 | compiler-core/src/ast.rs:4251-4257 | compiler-core/src/ast.rs:4345-4352 | compiler-core/src/ast.rs:4370-4377 | compiler-core/src/ast.rs:4394-4401 | compiler-core/src/metadata.rs:499-506 — there are 7 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 7 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8–9 lines × 4) compiler-core/src/ast/typed.rs:711— compiler-core/src/ast/typed.rs:711-719 | compiler-core/src/ast/typed.rs:740-748 | compiler-core/src/ast/untyped.rs:205-212 | compiler-core/src/ast/untyped.rs:231-238 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (9 lines × 4) compiler-core/src/type_/pattern.rs:478— compiler-core/src/type_/pattern.rs:478-486 | compiler-core/src/type_/pattern.rs:551-559 | compiler-core/src/type_/pattern.rs:601-609 | compiler-core/src/type_/pattern.rs:643-651 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–9 lines × 2) language-server/src/code_action.rs:11192— language-server/src/code_action.rs:11192-11200 | language-server/src/code_action.rs:11262-11269 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 25) compiler-core/src/ast.rs:1856— compiler-core/src/ast.rs:1856-1863 | compiler-core/src/ast.rs:2437-2444 | compiler-core/src/ast/typed.rs:953-960 | compiler-core/src/ast/typed.rs:1191-1198 | compiler-core/src/ast/typed.rs:1236-1243 | compiler-core/src/ast/typed.rs:1281-1288 | compiler-core/src/ast/typed.rs:1326-1333 | compiler-core/src/ast/typed.rs:1370-1377 | compiler-core/src/ast/typed.rs:1411-1418 | compiler-core/src/erlang.rs:1682-1689 | compiler-core/src/erlang.rs:3759-3766 | compiler-core/src/javascript/expression.rs:889-896 | compiler-core/src/javascript/expression.rs:1423-1430 | compiler-core/src/javascript/expression.rs:1517-1524 | compiler-core/src/javascript/expression.rs:1931-1938 | compiler-core/src/javascript/expression.rs:2364-2371 | compiler-core/src/type_/expression.rs:4359-4366 | compiler-core/src/type_/expression.rs:4749-4756 | compiler-core/src/type_/pattern.rs:383-390 | language-server/src/code_action.rs:6903-6910 | language-server/src/code_action.rs:7659-7666 | language-server/src/code_action.rs:9115-9122 | language-server/src/code_action.rs:9685-9692 | language-server/src/code_action.rs:10218-10225 | language-server/src/code_action.rs:11599-11606 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 15) compiler-core/src/ast.rs:2429— compiler-core/src/ast.rs:2429-2436 | compiler-core/src/ast/typed.rs:945-952 | compiler-core/src/ast/typed.rs:1228-1235 | compiler-core/src/ast/typed.rs:1273-1280 | compiler-core/src/ast/typed.rs:1318-1325 | compiler-core/src/ast/typed.rs:1871-1878 | compiler-core/src/erlang.rs:3913-3920 | compiler-core/src/javascript/expression.rs:1923-1930 | compiler-core/src/javascript/expression.rs:2356-2363 | compiler-core/src/type_/expression.rs:1213-1220 | compiler-core/src/type_/expression.rs:4741-4748 | language-server/src/code_action.rs:6895-6902 | language-server/src/code_action.rs:10210-10217 | language-server/src/code_action.rs:11591-11598 | language-server/src/engine.rs:2454-2461 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/ast/typed.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 9) compiler-core/src/ast.rs:1965— compiler-core/src/ast.rs:1965-1972 | compiler-core/src/type_/pipe.rs:213-220 | compiler-core/src/type_/pipe.rs:425-432 | format/src/lib.rs:1991-1998 | format/src/lib.rs:2596-2603 | format/src/lib.rs:3008-3015 | format/src/lib.rs:3393-3400 | format/src/lib.rs:3435-3442 | format/src/lib.rs:3601-3608 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/type_/pipe.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 8) compiler-core/src/ast/typed.rs:940— compiler-core/src/ast/typed.rs:940-947 | compiler-core/src/ast/typed.rs:1268-1275 | compiler-core/src/ast/typed.rs:1313-1320 | compiler-core/src/ast/typed.rs:1358-1365 | compiler-core/src/ast/typed.rs:1399-1406 | compiler-core/src/javascript/expression.rs:1505-1512 | compiler-core/src/type_/expression.rs:1208-1215 | language-server/src/engine.rs:2449-2456 — before extracting anything, compare `compiler-core/src/ast/typed.rs` and `compiler-core/src/javascript/expression.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 5) compiler-core/src/ast.rs:2424— compiler-core/src/ast.rs:2424-2431 | compiler-core/src/javascript/expression.rs:1409-1419 | compiler-core/src/javascript/expression.rs:1915-1925 | compiler-core/src/javascript/expression.rs:2351-2358 | language-server/src/code_action.rs:7647-7654 — before extracting anything, compare `compiler-core/src/ast.rs` and `compiler-core/src/javascript/expression.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 5) hexpm/src/lib.rs:483— hexpm/src/lib.rs:483-489 | hexpm/src/lib.rs:601-607 | hexpm/src/lib.rs:661-667 | hexpm/src/lib.rs:696-702 | hexpm/src/lib.rs:727-733 — 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 × 6) hexpm/src/lib.rs:487— hexpm/src/lib.rs:487-492 | hexpm/src/lib.rs:524-529 | hexpm/src/lib.rs:665-670 | hexpm/src/lib.rs:700-705 | hexpm/src/lib.rs:731-736 | hexpm/src/lib.rs:1232-1237 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (3–6 lines × 4) compiler-cli/src/docs.rs:25— compiler-cli/src/docs.rs:25-27 | compiler-cli/src/owner.rs:12-14 | compiler-cli/src/owner.rs:42-47 | compiler-cli/src/publish.rs:84-89 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 3) compiler-core/src/analyse.rs:779— compiler-core/src/analyse.rs:779-783 | compiler-core/src/analyse.rs:1683-1687 | compiler-core/src/analyse.rs:1972-1976 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15 lines × 5) compiler-core/src/error.rs:1413— compiler-core/src/error.rs:1413-1427 | compiler-core/src/error.rs:1431-1445 | compiler-core/src/error.rs:1449-1464 | compiler-core/src/error.rs:1468-1483 | compiler-core/src/error.rs:1512-1527 — 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 (11 lines × 5) compiler-core/src/warning.rs:302— compiler-core/src/warning.rs:302-313 | compiler-core/src/warning.rs:326-337 | compiler-core/src/warning.rs:346-357 | compiler-core/src/warning.rs:369-381 | compiler-core/src/warning.rs:416-426 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 9) compiler-core/src/warning.rs:605— compiler-core/src/warning.rs:605-613 | compiler-core/src/warning.rs:681-689 | compiler-core/src/warning.rs:709-718 | compiler-core/src/warning.rs:726-734 | compiler-core/src/warning.rs:742-750 | compiler-core/src/warning.rs:758-766 | compiler-core/src/warning.rs:817-825 | compiler-core/src/warning.rs:832-840 | compiler-core/src/warning.rs:1034-1042 — all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 6) language-server/src/code_action.rs:9743— language-server/src/code_action.rs:9743-9750 | language-server/src/code_action.rs:10284-10291 | language-server/src/code_action.rs:10471-10478 | language-server/src/code_action.rs:10553-10562 | language-server/src/code_action.rs:12373-12380 | language-server/src/code_action.rs:13078-13085 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 5) compiler-core/src/warning.rs:798— compiler-core/src/warning.rs:798-807 | compiler-core/src/warning.rs:815-823 | compiler-core/src/warning.rs:830-838 | compiler-core/src/warning.rs:1031-1040 | compiler-core/src/warning.rs:1463-1471 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 7) compiler-core/src/warning.rs:465— compiler-core/src/warning.rs:465-473 | compiler-core/src/warning.rs:535-543 | compiler-core/src/warning.rs:555-563 | compiler-core/src/warning.rs:571-579 | compiler-core/src/warning.rs:589-597 | compiler-core/src/warning.rs:1070-1078 | compiler-core/src/warning.rs:1347-1355 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 4) language-server/src/code_action.rs:3477— language-server/src/code_action.rs:3477-3484 | language-server/src/code_action.rs:4234-4241 | language-server/src/code_action.rs:9080-9087 | language-server/src/code_action.rs:11068-11075 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 12) language-server/src/code_action.rs:1774— language-server/src/code_action.rs:1774-1781 | language-server/src/code_action.rs:3040-3047 | language-server/src/code_action.rs:3190-3197 | language-server/src/code_action.rs:4425-4432 | language-server/src/code_action.rs:7868-7875 | language-server/src/code_action.rs:8267-8274 | language-server/src/code_action.rs:8496-8503 | language-server/src/code_action.rs:8721-8728 | language-server/src/code_action.rs:8819-8826 | language-server/src/code_action.rs:10080-10087 | language-server/src/code_action.rs:10621-10628 | language-server/src/code_action.rs:12137-12144 — all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (17 lines × 2 locations) compiler-core/templates/prelude.mjs:969— compiler-core/templates/prelude.mjs:969 · compiler-core/templates/prelude.mjs:1091 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (14 lines × 2 locations) compiler-core/templates/prelude.mjs:874— compiler-core/templates/prelude.mjs:874 · compiler-core/templates/prelude.mjs:921 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (12 lines × 2 locations) compiler-core/templates/prelude.mjs:1056— compiler-core/templates/prelude.mjs:1056 · compiler-core/templates/prelude.mjs:1178 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (11 lines × 2 locations) compiler-core/templates/prelude.mjs:1036— compiler-core/templates/prelude.mjs:1036 · compiler-core/templates/prelude.mjs:1158 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Complex function addResult (cyclomatic 22, cognitive 58) REDACTED:290— addResult has cyclomatic complexity 22 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function inspect (cyclomatic 22, cognitive 23) compiler-core/templates/echo.mjs:65— inspect has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function isEqual (cyclomatic 18, cognitive 28) compiler-core/templates/prelude.mjs:1481— isEqual has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function toBitArray (cyclomatic 17, cognitive 34) compiler-core/templates/prelude.mjs:560— toBitArray has cyclomatic complexity 17 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function sizedInt (cyclomatic 16, cognitive 36) compiler-core/templates/prelude.mjs:740— sizedInt has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function intFromUnalignedSliceUsingNumber (cyclomatic 12, cognitive 27) compiler-core/templates/prelude.mjs:986— intFromUnalignedSliceUsingNumber has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function intFromUnalignedSliceUsingBigInt (cyclomatic 12, cognitive 27) compiler-core/templates/prelude.mjs:1108— intFromUnalignedSliceUsingBigInt has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function equals (cyclomatic 12, cognitive 24) compiler-core/templates/prelude.mjs:200— equals has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 11, cognitive 21) REDACTED:515— (anonymous) has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function numberToFp16Uint (cyclomatic 11, cognitive 15) compiler-core/templates/prelude.mjs:1248— numberToFp16Uint has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function bitArraySliceToFloat (cyclomatic 11, cognitive 11) compiler-core/templates/prelude.mjs:399— bitArraySliceToFloat has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function #string (cyclomatic 11, cognitive 9) compiler-core/templates/echo.mjs:188— #string has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· compiler-core/templates/prelude.mjs · ×1
compiler-core/templates/prelude.mjs: 1377 lines of code compiler-core/templates/prelude.mjs:1— compiler-core/templates/prelude.mjs has 1377 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 582 lines of code REDACTED:1— REDACTED has 582 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R4 · Test Coverage· This test file cannot be loaded · ×1
This test file cannot be loaded test/language/test/ffi_javascript.mjs:4— test/language/test/ffi_javascript.mjs:4 imports './gleam.mjs', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:45— `trace!` at line 45 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:57— `trace!` at line 57 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:70— `trace!` at line 70 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:75— `trace!` at line 75 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:80— `trace!` at line 80 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:91— `trace!` at line 91 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:96— `info!` at line 96 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:101— `trace!` at line 101 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:106— `trace!` at line 106 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-wasm/src/wasm_filesystem.rs:111— `trace!` at line 111 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-core/src/hex.rs:44— `info!` at line 44 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-core/src/hex.rs:83— `info!` at line 83 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-core/src/hex.rs:106— `info!` at line 106 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-core/src/build/elixir_libraries.rs:128— `debug!` at line 128 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-core/src/build/package_loader.rs:1755— `trace!` at line 1755 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-core/src/build/package_loader.rs:1841— `trace!` at line 1841 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-core/src/build/project_compiler.rs:487— `debug!` at line 487 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-core/src/build/project_compiler.rs:521— `debug!` at line 521 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-cli/src/fs.rs:322— `debug!` at line 322 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-cli/src/fs.rs:331— `debug!` at line 331 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-cli/src/http.rs:118— `warn!` at line 118 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging compiler-cli/src/shell.rs:47— `info!` at line 47 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Duplicated predicate compiler-core/src/type_/constant.rs:780— `argument.label_location && argument.implicit.is_none()` appears character-identically in 2 files — compiler-core/src/type_/constant.rs, compiler-core/src/type_/expression.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 compiler-core/src/ast.rs:2767— `index == other_index && tuple.syntactically_eq(other_tuple)` appears character-identically in 2 files — compiler-core/src/ast.rs, compiler-core/src/ast/typed.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 compiler-core/src/ast.rs:2793— `label == other_label && module_alias == other_module_alias` appears character-identically in 2 files — compiler-core/src/ast.rs, compiler-core/src/ast/typed.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 compiler-core/src/ast.rs:3053— `operator == other_operator && left.syntactically_eq(other_left) && right.syntactically_eq(other_right)` appears character-identically in 3 files — compiler-core/src/ast.rs, compiler-core/src/ast/constant.rs, compiler-core/src/ast/typed.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 compiler-core/src/javascript.rs:1002— `package == self.module.type_info.package || package.is_empty()` appears character-identically in 2 files — compiler-core/src/javascript.rs, compiler-core/src/javascript/typescript.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 compiler-core/src/javascript.rs:511— `self.module.type_info.accessors.get(name) && !accessors_map.shared_accessors.is_empty() && constructors.len() != 1 && constructor_publicity.…` appears character-identically in 2 files — compiler-core/src/javascript.rs, compiler-core/src/javascript/typescript.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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: erlang-term-format/src/tests.rs, compiler-core/src/tests.rs, compiler-cli/src/text_layout.rs. Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (4 single-owned of 144 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 144 of the 162 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: hexpm/src/version/tests.rs.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 11 project(s) overshoot their size bounds, lowering Project Cohesion to 8.2/10. The most over is `compiler-core` (95909 LoC, 420 module-visible types across 14 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
Thin README — The root README is 90 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise — or with no heading at all — is not seen and this row may understate what the document covers.
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.
Logging is not universal — Only 4/8 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `format`, `gleam-bin`, `src-span`.
Outdated: pulldown-cmark — `pulldown-cmark` is locked at 0.13.4 but 0.13.5 is the current stable release on crates.io, and it already satisfies the `"0"` requirement declared in compiler-core/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p pulldown-cmark` and commit the updated REDACTED.
Outdated: tokio — `tokio` is locked at 1.53.3 but 1.54.1 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in compiler-cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tokio` and commit the updated REDACTED.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
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 01a17642-c6b3-73ae-a35e-d12d502a0fd3 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 21 · Warnings: 729 · Recommendations: 38 · Info: 2 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 26-10-2026 @ 03:30 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.