Public report of ValeLang/Vale, published 14 November 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 14 November 2026, 07:13 UTC · Survey ID cd_ce7c5e6fd9cd473cbac66f5fcd3a7acc

ValeLang/Vale

Measured 14 November 2026, 07:12 UTC, at code version 3e985c6

Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.

CAI score 49out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Down 6 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 medium codebase: 61,586 lines of product code in 3 projects, tests not counted · Estimated rebuild effort: about 0.5 person-years · Weakest lens: Production Readiness, 35

Findings by how serious they are

29 critical 498 serious 25 minor

21 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 07:12 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that implements it, and today the Canine Code Analyzer is the only one that does.

The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

38of 38 dimensions measured by tools.
541of 552 findings point to an exact file and line, so you can open each one in the code. The other 11 concern the repository as a whole, such as missing documentation.
38dimensions across 5 lenses, read from 61,586 lines of product code in 3 projects.
Chapters

Executive summary

ValeLang/Vale falls short of our standard for a preview release because we found no logging, tracing or health checks in the code and no automated security scanning of the code, its secrets or its dependencies. It scores 49 out of 100 and is rated Adequate, and 27 of its 29 critical findings are security problems.

Production Readiness, at 35, is the weakest lens and counts most in the score. The best first steps are adding a diagnostic log and adding automated security scanning, each worth about 8 points. Raising Production Readiness to 62 would lift the score to about 59.

Eleven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Eleven weaknesses in the code could be used by an attacker, and five settings leave the servers or containers unsafe. Pinning each tool to an exact version, fixing the weaknesses the scanner points to and correcting the unsafe settings would close these risks. The two parts of the code nobody has worked on for a long time need someone to learn and document them before anyone changes them.

The product code is 61,586 lines, about €71,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 for The 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.
Production Readiness 35 · counts for 47%Code Health 52 · counts for 26%Maturity 65 · counts for 14%Security and Compliance 65 · counts for 8%Architecture 90 · counts for 4%

If Production Readiness rose from 35 to 62, the lowest score rated Strong, the score would rise from 49 to about 59.

Code composition: what the lines of code are
Product code 79%Tests 21%
New since the last survey: 94 findings

These 94 critical or serious findings weren't in the previous survey, on 26 October 2026.

  • Code Duplication · Near-duplicate member pair (62 shared lines) ValeRuster/src/resolve.rs
  • Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala
  • Code Duplication · Edited copy of a member (77 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala
  • Code Duplication · Edited copy of a member (77 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala
  • Code Duplication · Edited copy of a member (83 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala
  • Code Duplication · Edited copy of a member (75 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala
  • Code Duplication · Edited copy of a member (98 corresponding lines) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala
  • Code Duplication · Edited copy of a member (44 corresponding lines) Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala
  • Code Duplication · Edited copy of a member (60 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala
  • Code Duplication · Edited copy of a member (78 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala
  • Code Duplication · Edited copy of a member (61 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copies of one member (3 members, 54+ corresponding lines) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala
  • Code Duplication · Edited copy of a member (58 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala
  • Code Duplication · Edited copy of a member (40 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala
  • Code Duplication · Edited copies of one member (3 members, 55+ corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala
  • Code Duplication · Edited copy of a member (44 corresponding lines) Frontend/Von/src/dev/vale/von/VonPrinter.scala
  • Code Duplication · Edited copy of a member (41 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala
  • Code Duplication · Edited copy of a member (44 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala
  • Code Duplication · Edited copy of a member (27 corresponding lines) Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala
  • Code Duplication · Edited copy of a member (33 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala
  • Code Duplication · Edited copy of a member (53 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala
  • Code Duplication · Edited copy of a member (26 corresponding lines) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala
  • Code Duplication · Edited copy of a member (24 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompiler.scala
  • Code Duplication · Edited copy of a member (33 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala
  • Code Duplication · Edited copies of one member (3 members, 23+ corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala
  • Code Duplication · Edited copy of a member (30 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala
  • Code Duplication · Edited copy of a member (20 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/TypeHammer.scala
  • Code Duplication · Edited copies of one member (3 members, 27+ corresponding lines) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala
  • Code Duplication · Edited copy of a member (18 corresponding lines) Frontend/Von/src/dev/vale/von/VonPrinter.scala
  • Code Duplication · Edited copies of one member (3 members, 34+ corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala
  • Code Duplication · Edited copy of a member (18 corresponding lines) Frontend/Von/src/dev/vale/von/VonPrinter.scala
  • Code Duplication · Edited copies of one member (3 members, 16+ corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala
  • Code Duplication · Edited copy of a member (14 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copy of a member (26 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala
  • Code Duplication · Edited copy of a member (17 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala
  • Code Duplication · Edited copy of a member (14 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala
  • Code Duplication · Edited copy of a member (11 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copies of one member (3 members, 18+ corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala
  • Code Duplication · Edited copy of a member (15 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerClosureOrLightLayer.scala
  • Code Duplication · Edited copy of a member (17 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copy of a member (19 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala
  • Code Duplication · Edited copy of a member (17 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSADropIntoMacro.scala
  • Code Duplication · Edited copy of a member (12 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala
  • Code Duplication · Edited copy of a member (11 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala
  • Code Duplication · Edited copy of a member (14 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala
  • Code Duplication · Edited copy of a member (22 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ParseUtils.scala
  • Code Duplication · Edited copy of a member (31 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala
  • Code Duplication · Edited copy of a member (11 corresponding lines) Frontend/Utils/src/dev/vale/Utils.scala
  • Code Duplication · Edited copy of a member (16 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala
  • Code Duplication · Edited copy of a member (17 corresponding lines) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala
  • Code Duplication · Edited copies of one member (6 members, 14+ corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala
  • Code Duplication · Edited copy of a member (20 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/BlockHammer.scala
  • Code Duplication · Edited copy of a member (13 corresponding lines) Frontend/LexingPass/src/dev/vale/lexing/LexingIterator.scala
  • Code Duplication · Edited copy of a member (12 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala
  • Code Duplication · Edited copies of one member (3 members, 14+ corresponding lines) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala
  • Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copy of a member (9 corresponding lines) Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala
  • Code Duplication · Edited copies of one member (6 members, 14+ corresponding lines) Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala
  • Code Duplication · Edited copy of a member (17 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala
  • Code Duplication · Edited copy of a member (13 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala
  • Code Duplication · Edited copy of a member (16 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala
  • Code Duplication · Edited copy of a member (7 corresponding lines) Frontend/HigherTypingPass/src/dev/vale/highertyping/ast.scala
  • Code Duplication · Edited copy of a member (9 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala
  • Code Duplication · Edited copies of one member (4 members, 10+ corresponding lines) Frontend/TypingPass/src/dev/vale/typing/macros/SameInstanceMacro.scala
  • Code Duplication · Edited copy of a member (11 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala
  • Code Duplication · Edited copy of a member (10 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/citizens.scala
  • Code Duplication · Edited copy of a member (10 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala
  • Code Duplication · Edited copy of a member (9 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copy of a member (9 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copy of a member (4 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala
  • Code Duplication · Edited copy of a member (6 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala
  • Code Duplication · Edited copy of a member (7 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copy of a member (4 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala
  • Code Duplication · Edited copy of a member (7 corresponding lines) Frontend/Utils/src/dev/vale/CodeHierarchy.scala
  • Code Duplication · Edited copy of a member (6 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala
  • Code Duplication · Duplicated block (20 lines × 2) ValeRuster/src/resolve.rs
  • Code Duplication · Duplicated block (16 lines × 2) ValeRuster/src/resolve.rs
  • Code Duplication · Duplicated block (6 lines × 2) ValeRuster/src/main.rs
  • Code Duplication · Duplicated block (5 lines × 2) ValeRuster/src/main.rs
  • Code Duplication · Members sharing a duplicated core (20 members, 50+ identical tokens) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala
  • Code Duplication · Edited copy of a member (33 corresponding lines) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala
  • Code Duplication · Edited copy of a member (22 corresponding lines) Frontend/TestVM/src/dev/vale/testvm/Heap.scala
  • Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala
  • Code Duplication · Edited copies of one member (3 members, 10+ corresponding lines) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala
  • Code Duplication · Edited copy of a member (13 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala
  • Code Duplication · Edited copy of a member (11 corresponding lines) Frontend/TestVM/src/dev/vale/testvm/Heap.scala

We compare 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: 11 findings

These 11 critical or serious findings were in the previous survey, on 26 October 2026, and are gone from this one.

  • Code Duplication · Near-duplicate member pair (62 shared lines) ValeRuster/src/resolve.rs
  • Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala
  • Code Duplication · Duplicated block (11 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala
  • Code Duplication · Duplicated block (10 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala
  • Code Duplication · Duplicated block (20 lines × 2) ValeRuster/src/resolve.rs
  • Code Duplication · Duplicated block (16 lines × 2) ValeRuster/src/resolve.rs
  • Code Duplication · Duplicated block (6 lines × 2) ValeRuster/src/main.rs
  • Code Duplication · Duplicated block (5 lines × 3) ValeRuster/src/main.rs
  • Code Duplication · Members sharing a duplicated core (20 members, 50+ identical tokens) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala
Rebuild cost: about €71,000 · Estimate
Cost to rebuild€24,000 to €120,000, for 395 to 1,253 hours of work, about 0.5 person-years for one engineer
Difficulty of the problemStandard, 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 49. 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.
SizeMedium: 61,586 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 8 points · Medium effort · Observability
2
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Raises the score by about 8 points · Medium effort · Security & performance tooling
3
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.rs.
Raises the score by about 2 points · Low effort · ADR Quality

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €71,000 to build again, about 0.5 person-years of work. Its weakest lens is Production Readiness, at 35 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Of all the actions in this report, it raises the score most for the work it takes: about 8 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.6 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 4% to 8% on every change.
How this is estimated: It rests on an assumption of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4)
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: 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.

48 modules, with 226 dependencies between them. 3 loops run through 18 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 8 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.
uses →1 dev.vale2 dev.vale.options3 dev.vale.von4 ValeRuster.indexer5 dev.vale.finalast6 dev.vale.lexing7 dev.vale.solver8 ValeRuster9 dev.vale.parsing.ast10 dev.vale.solver.OptimizedSolverState11 dev.vale.solver.SimpleSolverState12 ValeRuster.resolve13 dev.vale.highlighter14 dev.vale.parsing15 dev.vale.postparsing.rules16 dev.vale.parsing.templex17 dev.vale.postparsing.patterns18 dev.vale.postparsing19 dev.vale.highertyping20 dev.vale.typing.templata21 dev.vale.typing.names22 dev.vale.typing.OverloadResolver23 dev.vale.typing.macros24 dev.vale.typing.function25 dev.vale.typing.citizen26 dev.vale.typing.expression27 dev.vale.typing.infer28 dev.vale.typing29 dev.vale.typing.ast30 dev.vale.typing.macros.citizen31 dev.vale.typing.env32 dev.vale.typing.types33 dev.vale.instantiating.ast34 dev.vale.typing.TemplataCompiler35 dev.vale.typing.macros.rsa36 dev.vale.typing.macros.ssa37 dev.vale.instantiating.RegionCounter38 dev.vale.simplifying39 dev.vale.instantiating40 dev.vale.passmanager
1 dev.vale
2 dev.vale.options
3 dev.vale.von
4 ValeRuster.indexer2
5 dev.vale.finalast33
6 dev.vale.lexing9
7 dev.vale.solver5
8 ValeRuster1
9 dev.vale.parsing.ast2125
10 dev.vale.solver.OptimizedSolverState12
11 dev.vale.solver.SimpleSolverState12
12 ValeRuster.resolve13
13 dev.vale.highlighter324
14 dev.vale.parsing251225100
15 dev.vale.postparsing.rules31719
16 dev.vale.parsing.templex1181
17 dev.vale.postparsing.patterns1124
18 dev.vale.postparsing1745626393
19 dev.vale.highertyping251212156
20 dev.vale.typing.templata142511115512
21 dev.vale.typing.names666652429
22 dev.vale.typing.OverloadResolver7113114
23 dev.vale.typing.macros162101411181587
24 dev.vale.typing.function1023261620119242119
25 dev.vale.typing.citizen8222511141127910
26 dev.vale.typing.expression72222122227211921
27 dev.vale.typing.infer12751494126224
28 dev.vale.typing941171364822902251214501962
29 dev.vale.typing.ast1688726772
30 dev.vale.typing.macros.citizen323431211
31 dev.vale.typing.env8298135673220
32 dev.vale.typing.types321161
33 dev.vale.instantiating.ast42102
34 dev.vale.typing.TemplataCompiler111112
35 dev.vale.typing.macros.rsa1477771477
36 dev.vale.typing.macros.ssa42222422
37 dev.vale.instantiating.RegionCounter2
38 dev.vale.simplifying131193132290
39 dev.vale.instantiating8212233941
40 dev.vale.passmanager7113122212
Uses a module listed above itPart of a loopThe module itself
1 dev.vale2 dev.vale.options3 dev.vale.von4 ValeRuster.indexer5 dev.vale.finalast6 dev.vale.lexing7 dev.vale.solver8 ValeRuster9 dev.vale.parsing.ast10 dev.vale.solver.OptimizedSolverState11 dev.vale.solver.SimpleSolverState12 ValeRuster.resolve13 dev.vale.highlighter14 dev.vale.parsing15 dev.vale.postparsing.rules16 dev.vale.parsing.templex17 dev.vale.postparsing.patterns18 dev.vale.postparsing19 dev.vale.highertyping20 dev.vale.typing.templata21 dev.vale.typing.names22 dev.vale.typing.OverloadResolver23 dev.vale.typing.macros24 dev.vale.typing.function25 dev.vale.typing.citizen26 dev.vale.typing.expression27 dev.vale.typing.infer28 dev.vale.typing29 dev.vale.typing.ast30 dev.vale.typing.macros.citizen31 dev.vale.typing.env32 dev.vale.typing.types33 dev.vale.instantiating.ast34 dev.vale.typing.TemplataCompiler35 dev.vale.typing.macros.rsa36 dev.vale.typing.macros.ssa37 dev.vale.instantiating.RegionCounter38 dev.vale.simplifying39 dev.vale.instantiating40 dev.vale.passmanagerdev.vale1dev.vale.options2dev.vale.von3ValeRuster.indexer4dev.vale.finalast5dev.vale.lexing6dev.vale.solver7ValeRuster8dev.vale.parsing.ast9dev.vale.solver.OptimizedSolverState10dev.vale.solver.SimpleSolverState11ValeRuster.resolve12dev.vale.highlighter13dev.vale.parsing14dev.vale.postparsing.rules15dev.vale.parsing.templex16dev.vale.postparsing.patterns17dev.vale.postparsing18dev.vale.highertyping19dev.vale.typing.templata20dev.vale.typing.names21dev.vale.typing.OverloadResolver22dev.vale.typing.macros23dev.vale.typing.function24dev.vale.typing.citizen25dev.vale.typing.expression26dev.vale.typing.infer27dev.vale.typing28dev.vale.typing.ast29dev.vale.typing.macros.citizen30dev.vale.typing.env31dev.vale.typing.types32dev.vale.instantiating.ast33dev.vale.typing.TemplataCompiler34dev.vale.typing.macros.rsa35dev.vale.typing.macros.ssa36dev.vale.instantiating.RegionCounter37dev.vale.simplifying38dev.vale.instantiating39dev.vale.passmanager4023395121251212133242512251003171911811124174562639325121215614251111551266665242971131141621014111815871023261620119242119822251114112791072222122227211921127514941262249411713648229022512145019621688726772323431211829813567322032116142102111112147777147742222422213119313229082122339417113122212+8 more modules (most-connected shown)

At a glance — Code Health · 52% · Adequate · gated by X5 ·

At a glance — Architecture · 90% · Adequate · gated by D26 ·

At a glance — Maturity · 65% · Adequate · gated by M2 ·

At a glance — Readiness · 35% · Weak · gated by P2, P3 ·

At a glance — Security · 65% · Adequate · gated by D29 ·

Security & Compliance — OWASP Top-10 mapping

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 categoryFindingsSeverity
A05:2025 — Injection25High / Critical
A02:2025 — Security Misconfiguration6High / Critical
A03:2025 — Software Supply Chain Failures2Medium

Roadmap

Top priorities: Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce; Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing; On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.+8.0 ptsMediumObservability
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.+8.0 ptsMediumSecurity & performance tooling
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.rs.+2.4 ptsLowADR Quality
On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.+4.7 ptsMediumNullable reference types
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.+2.9 ptsMediumDeployment & Rollback
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.+2.9 ptsMediumRelease Hygiene
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.+1.8 ptsMediumArchitecture documentation
Resolve the 9 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (2), REDACTED (2).+0.9 ptsLowStatic Analysis (SAST)

File quality

Per-file score 0–10 — a quality signature. Of 111 files carrying findings, judged against the Preview bar: 2% slop · 21% mixed · 77% near-clean.

FileScoreBandWorst signal
REDACTED0.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopIaC & Container Security: High IaC: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala5.7MixedGod Classes: TooManyMethods: ParsedLoader
Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala5.7MixedCode Duplication: Edited copy of a member (83 corresponding lines)
Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala6.0MixedExplicit Debt: TodoComment
Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala6.0MixedExplicit Debt: TodoComment
ValeRuster/src/main.rs6.0MixedExplicit Debt: TodoComment
Frontend/TypingPass/src/dev/vale/typing/Compiler.scala6.0MixedExplicit Debt: TodoComment
ValeRuster/src/resolve.rs6.0MixedExplicit Debt: TodoComment
Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala6.0MixedExplicit Debt: TodoComment
ValeRuster/src/indexer.rs6.0MixedExplicit Debt: TodoComment
Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala6.0MixedExplicit Debt: TodoComment
Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala6.0MixedExplicit Debt: TodoComment
ValeRuster/src/resolve_id.rs6.0MixedExplicit Debt: TodoComment
Frontend/Solver/src/dev/vale/solver/Solver.scala6.0MixedExplicit Debt: TodoComment
Frontend/TypingPass/src/dev/vale/typing/function/FunctionBodyCompiler.scala6.0MixedExplicit Debt: TodoComment
Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala6.0MixedExplicit Debt: TodoComment
Frontend/Utils/src/dev/vale/Utils.scala6.0MixedExplicit Debt: TodoComment

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 29

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 — 498

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 — 25

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 21

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 38 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.

Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.

What we checked — 38 dimensions across the health lenses
D1D2D3D4D5D6D12D13D14D15D17D19D20D26D28D29D30D31D34D35D43AX10AX3AX4AX9M1M2M3M4P1P2P3P4P6X21X27X30X5

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
  1. 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, 541 of 552 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.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. 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.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic

Every finding is locatable in findings.md. Run 01a1d8e6-e8ce-728c-bc92-4185fecaebd6.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

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.

  • D4 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 130 duplicated block group(s) on this row were found in the languages this pass could tokenize, and they do NOT cover all of this repository's production source: .cpp (44,984 lines, 38% of production source), .c (12,977 lines, 11% of production source) went unread, because no language model this pass could load exposed a clone-unit token stream for those file kinds. Duplication in that source is UNMEASURED — its absence from the count above is a gap in this analyzer's language coverage, not a finding that the code is free of duplication.
  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.scala) 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.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.scala) and this repository declares an sbt build (Frontend, 81 test files), but it was not re-run: the analyzer environment could not run it. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares an sbt build (build.sbt), but the licence verdict published here was taken over its crate dependencies. Nothing was read about its sbt dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (18 contributor(s) across 1185 commit(s) sampled, automation and bot accounts excluded). One of them holds 88% of the history; the other 17 hold 0.7% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: it declares a published package (ValeRuster/Cargo.toml), but no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D26 Project Cohesion — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Project size and spread are measured over build units whose source a code model reads. This repository's .cpp, .c source is a material share of its production lines and was read by none, so the score is a verdict about the units that were read. Not a finding that the unread source is cohesive — it is unmeasured.
  • D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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.
  • D44 Platform End-of-Life — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a REDACTED) is simply not read here yet.
  • AX1 Captive dependencies — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository defines its own container in Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala, whose lifetimes are not modelled 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.
  • AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via REDACTED (REDACTED). docker build failed (exit 1) — 26 | 27 | # Install dependencies needed to build the compiler sources -------------------- ERROR: failed to solve: failed to compute cache key: failed to calculate checksum of ref becada51-761a-4e2d-8a11-efc32a8f8848::lk1vjqahqkepzsa90vlxh9myc: "/scripts/ubuntu/install-compiler-prereqs.sh": not found; runtime evidence skipped.
  • C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Python, Rust, c, cpp 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Python, Rust, c, cpp is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • 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.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
  • X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X17 Uncapped recursion over a caller-supplied document — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X18 Disposal-pattern correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X21 Side-effecting pattern guard — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • X24 Document value interpolated into markup unescaped — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X27 Collection changed while being enumerated — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • X3 Exception handling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X30 Support guard that admits what it rejects — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • 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.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity5.7 / 10Adequate✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 5.7 / 10 · rule-coverage 100% · ceiling Prevented

61 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was ExpressionCompiler.evaluate at 137. A further 32 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 ParseErrorHumanizer.humanize at 53 — they are counted neither in the figure above nor in this dimension's score. 12 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: Frontend/ParsingPass/src/dev/vale/parsing/ParseErrorHumanizer.scala (ParseErrorHumanizer.humanize at 53), Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala (PostParserErrorHumanizer.humanizeRune at 52), Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala (VonHammer.vonifyExpression at 51), Frontend/Highlighter/src/dev/vale/highlighter/Spanner.scala (Spanner.forExpression at 38), Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala (ParsedLoader.loadExpression at 38), and 7 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

ValeRuster::list_struct_and_methods (cyclomatic 63) · ×13ValeRuster/src/main.rs:1402
ExpressionCompiler.evaluate (cyclomatic 137)Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:457
FunctionScout.scoutFunction (cyclomatic 93)Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala:59
ExpressionScout.scoutExpression (cyclomatic 79)Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:235
CompilerRuleSolver.solveRule (cyclomatic 75)Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:557

+ 44 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 1 body over 120 down to 120 or less in Cyclomatic Complexity — start with ExpressionCompiler.evaluate (cyclomatic 137). — Refactoring it lifts Cyclomatic Complexity from 5.7 to about 5.8/10.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity5.6 / 10Adequate✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 5.6 / 10 · rule-coverage 100% · ceiling Prevented

69 method(s) exceeded the cognitive complexity threshold of 15; the worst was ExpressionCompiler.evaluate at 149.

ValeRuster::main (cognitive 134) · ×18ValeRuster/src/main.rs:133
ExpressionCompiler.evaluate (cognitive 149)Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:457
CompilerRuleSolver.solveRule (cognitive 121)Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:557
FunctionScout.scoutFunction (cognitive 89)Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala:59
Compiler.evaluate (cognitive 85)Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:733

+ 47 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 10 bodies over 60 down to 60 or less in Cognitive Complexity — start with ExpressionCompiler.evaluate (cognitive 149), ValeRuster::main (cognitive 134), CompilerRuleSolver.solveRule (cognitive 121). — 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 10 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.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

D3 · God Classes7.7 / 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.

Maturity: Documented → Verified → Prevented · effective 7.7 / 10 · rule-coverage 100% · ceiling Prevented

41 god class(es) detected.

FileTooLong: instantiating/Instantiator.scala · ×21Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala
ClassTooLong: ExpressionCompiler · ×10Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:70
TooManyMethods: Instantiator · ×7Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:111
FunctionTooLong: ValeRuster::resolve::extend_and_resolve · ×2ValeRuster/src/resolve.rs:187
MethodTooLong: CompilerErrorHumanizer.humanizeFrontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:26

What to do

  1. Resolve the 21 FileTooLong finding(s) in God Classes — start with Instantiator.scala, main.rs, ExpressionCompiler.scala. — One of this dimension's main actionable groups (21 warning-level).
  2. Resolve the 10 ClassTooLong finding(s) in God Classes — start with ExpressionCompiler.scala, VonHammer.scala, ExpressionHammer.scala. — One of this dimension's main actionable groups (10 warning-level).
  3. Resolve the 7 TooManyMethods finding(s) in God Classes — start with Instantiator.scala, ParsedLoader.scala, ParserVonifier.scala. — One of this dimension's main actionable groups (7 warning-level).

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication6.0 / 10Adequate✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Verified

130 duplicated block group(s) detected. 10.1 % of the production lines (6,232 of 61,586) are in a reported copy. A further 91 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 27 of the 221 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population. Measured on part of this repository only: .cpp, .c (48% of production source) was not exposed to the token comparison, so duplication there is unmeasured and is not in this count.

Duplicated block (7 lines × 2) · ×15Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:152
Duplicated block (6 lines × 2) · ×14Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:765
Duplicated block (8 lines × 2) · ×12Frontend/Builtins/src/dev/vale/Builtins.scala:79
Duplicated block (9 lines × 2) · ×10Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467
Duplicated block (10 lines × 2) · ×8Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:120

+ 97 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 15 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with VivemExterns.scala (5), RegionCollapserConsistent.scala (2), ParserVonifier.scala. — One of this dimension's main actionable groups (15 warning-level).
  2. Resolve the 14 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with ExpressionParser.scala (4), main.rs (3), Compiler.scala (2). — One of this dimension's main actionable groups (14 warning-level).
  3. Resolve the 12 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with ExpressionVivem.scala (2), Builtins.scala, Instantiator.scala. — One of this dimension's main actionable groups (12 warning-level).

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

D5 · Coupling10.0 / 10Exemplary✓ 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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

3 production modules (Cargo+sbt+CMake), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; a dependsOn spread (deps: _*) and a project whose directory a helper computes are not visible there; 0 module(s) off the main sequence, with abstractness counted on 1 of the 3 (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).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.1 / 10Stronggated by 3 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.1 / 10 · rule-coverage 100% · ceiling Verified

3 of 40 classes have LCOM4 above 3.

Low cohesion: ArrayCompiler (LCOM4 8) · ×3Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:28

What to do

  1. Resolve the 3 Low cohesion finding(s) in Cohesion (LCOM4) — start with ArrayCompiler.scala, StructCompilerGenericArgsLayer.scala, ExpressionCompiler.scala. — One of this dimension's main actionable groups (3 warning-level).

Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.

D12 · Dependency Hygiene9.8 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Verified

4 outdated, 0 yanked direct Cargo dependencies. Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.

Outdated: anyhow · ×4

✓ On the Gold path — maintain.

Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 56 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. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares an sbt build (build.sbt), and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D17 · Explicit Debt9.7 / 10Stronggated by 93 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Prevented

93 deducted task-comment markers across 61586 LoC (0.1/KLoC) → score 9.7. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoComment · ×93ValeRuster/src/indexer.rs:94

What to do

  1. Resolve the 93 TodoComment finding(s) in Explicit Debt — start with main.rs (25), Instantiator.scala (14), instructions.scala (6). — One of this dimension's main actionable groups (93 warning-level).

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 1 documentation facets pass in full. 178 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs foundValeRuster/src/main.rs:1

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with main.rs. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 2 build units (Cargo, sbt) flagged as possibly oversized/incoherent. This repository's .cpp, .c source was read by no build unit, so this covers part of the tree, not all of it.

Projects may be oversized for their cohesion

What to do

  1. 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.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)1.3 / 10Critical✓ Tool-verified

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).

Maturity: Documented → Verified → Prevented · effective 1.3 / 10 · rule-coverage 100% · ceiling Documented

25 finding(s): 0 critical, 22 high, 3 medium, 0 low. 11 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 3 file(s) — `Utils/src/command2/native/subprocess.h` (line 78, line 95, line 107, …), `docs/old/Vale Module System_ When to Include What Code-comm.html`, `stdlib/src/command/native/subprocess.h` (line 78, line 94, line 106, …) — 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.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 9 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (9 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) — all 11 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (11 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

D30 · Dependency Vulnerabilities9.6 / 10Stronggated by 2 serious findings✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 9.6 / 10 · rule-coverage 100% · ceiling Documented

2 finding(s): 0 critical, 0 high, 2 medium, 0 low.

REDACTED
REDACTED

What to do

  1. 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).
  2. Resolve the 1 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.

D31 · IaC & Container Security8.2 / 10Adequategated by 5 critical findings✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 8.2 / 10 · rule-coverage 100% · ceiling Documented

6 finding(s): 0 critical, 5 high, 1 medium, 0 low.

REDACTED
REDACTED

What to do

  1. Resolve the 5 High IaC finding(s) in IaC & Container Security — start with REDACTED (5). — One of this dimension's main actionable groups (5 issue-level).
  2. Resolve the 1 Medium IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.

D34 · Knowledge Freshness9.2 / 10Adequategated by 2 critical findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.2 / 10 · rule-coverage 100% · ceiling Documented

11 of 144 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala. Counted over 144 of the 184 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledge · ×2Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala:1
Orphaned file · ×9Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:1
Further orphaned files (smaller)

What to do

  1. Resolve the 2 Orphaned knowledge finding(s) in Knowledge Freshness — start with expressions.scala, names.scala. — One of this dimension's main actionable groups (2 issue-level).
  2. Resolve the 9 Orphaned file finding(s) in Knowledge Freshness — start with RegionCollapserIndividual.scala, RegionCounter.scala, RegionCollapserConsistent.scala. — One of this dimension's main actionable groups (9 recommendation-level).
  3. Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.

D35 · Change Coupling9.9 / 10Stronggated by 2 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: ParsedLoader.scala↔ParserVonifier.scala 73%; ExpressionParser.scala↔ParserVonifier.scala 67%

Change coupling: ParsedLoader.scala ↔ ParserVonifier.scala · ×2Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:1

What to do

  1. Resolve the 2 Change coupling finding(s) in Change Coupling — start with ParsedLoader.scala, ExpressionParser.scala. — One of this dimension's main actionable groups (2 warning-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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.

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

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.

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

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.

M1 · Documentation (README)6.7 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation2.0 / 10Weak✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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.

P2 · Observability0.0 / 10Critical✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

  • No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.

What to do

  • Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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.

  • No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:6

What to do

  • Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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.

What to do

  • Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

  • No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

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.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen. Whether a `for` comprehension or `foreach` leaves the mutable collection it is walking alone — an `ArrayBuffer` or `ListBuffer` counts its changes and its iterator checks the count, an `ArrayDeque` (and `mutable.Queue`/`mutable.Stack`) is walked by index up to its starting length, and a `java.util` collection walked through `asScala` is fail-fast, so a body that adds to or removes from the very collection the loop is walking makes a later step throw `ConcurrentModificationException` (`IndexOutOfBoundsException` for a deque) and the remaining elements are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

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.

X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

Other · Code Health — Whether Scala's null is held to the type system and not undermined by assertions — a file compiled with `-Yexplicit-nulls` is one where `String` excludes null and `String | Null` admits it, a file under WartRemover's `Null` wart or Scalafix's `DisableSyntax.noNulls` is one whose code cannot write `null` and must say `Option`, and each `.nn`, `import scala.language.unsafeNulls` or null-lint suppression is the author overruling that.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

  • No build over this repository's 169 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.

What to do

  • On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health52%Adequate — gated by X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture90%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity65%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness35%Weak — gated by P2, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security65%Adequate — gated by D29Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Unscored — 2 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.

  • D36 Supply-chain Provenance & Signing — 1 observation(s) recorded · The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
  • X10 Duplicated predicate — 4 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 75 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 web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — 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
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. No class in this Scala code is a Play controller, a Cask routes object, a Scalatra servlet, a Finatra controller, an Akka/Pekko HTTP routes holder or a JSR-330/Spring singleton, so no instance is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written.
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — AX6 reached only 49% of this repository's production lines — cpp (45,124 lines), c (12,977 lines), rust (3,519 lines), python (2 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — docker build failed (exit 1) — 26 | 27 | # Install dependencies needed to build the compiler sources -------------------- ERROR: failed to solve: failed to compute cache key: failed to calculate checksum of ref becada51-761a-4e2d-8a11-efc32a8f8848::lk1vjqahqkepzsa90vlxh9myc: "/scripts/ubuntu/install-compiler-prereqs.sh": not found; 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 — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, a MongoDB or Cassandra driver, JDBC) imported 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, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported 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, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~15892 lines of test source are present (.scala) 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 .scala suite was found but not re-run
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D21 Naming Consistency — D21 withholds its case and prefix conventions rows: 4 candidate(s) found and not reported.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .py, .rs, .scala, 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 reads resolved call sites in the languages it reads only — this repository's production source is .c, .cpp, .py, .rs, which was left unread. 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.
  • 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 — applicable but not scored (2 signals for this style, 2 needed — the count is met but a required primary signal is absent): 825 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • 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 JVM, Python, Rust source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
  • S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X12 Unreachable branch — X12 reached only 49% of this repository's production lines — cpp (45,124 lines), c (12,977 lines), rust (3,519 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — X16 reached only 49% of this repository's production lines — cpp (45,124 lines), c (12,977 lines), rust (3,519 lines), python (2 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X17 Uncapped recursion over a caller-supplied document — X17 reached only 49% of this repository's production lines — cpp (45,124 lines), c (12,977 lines), rust (3,519 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X18 Disposal-pattern correctness — X18 reached only 49% of this repository's production lines — cpp (45,124 lines), c (12,977 lines), rust (3,519 lines), python (2 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no C# was loaded; this repository's Scala, Python and Rust were read, and no request in it can be cancelled by a caller — a Scala request takes no token: a Future cannot be cancelled, and cats-effect, ZIO and Monix interrupt the fiber that made the request from outside the call, not through a parameter; a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation; a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — X24 reached only 49% of this repository's production lines — cpp (45,124 lines), c (12,977 lines), rust (3,519 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — X3 reached only 49% of this repository's production lines — cpp (45,124 lines), c (12,977 lines), rust (3,519 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Scala was read, and it logs through none that an interpolated message defeats: scala-logging takes an `s"…"` message apart into SLF4J's pattern and arguments at compile time, and log4s, grizzled-slf4j, Play's Logger, Akka's LoggingAdapter, sbt's Logger and Spark's Logging take one finished message (as log4net does in C#). Calls made straight through SLF4J (`org.slf4j.Logger`) would be judged.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 29 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · High IaC · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Orphaned knowledge · ×2
  • Orphaned knowledge Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 498 finding(s)
D17 · Explicit Debt · TodoComment · ×93
  • TodoComment ValeRuster/src/indexer.rs:94 — // TODO: resultify all these panics — 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 ValeRuster/src/indexer.rs:229 — // TODO: optimize: expensive clones — 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 ValeRuster/src/indexer.rs:230 — // TODO: optimize: memoize results, use past calculations — 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 ValeRuster/src/indexer.rs:424 — // // TODO: use a better resolution approach — 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 ValeRuster/src/indexer.rs:495 — // TODO: use a better resolution approach — 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 ValeRuster/src/main.rs:33 — // TODO: optimize: All over the place we're calling .keys() and .collect() — 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 ValeRuster/src/main.rs:80 — // TODO: rename — 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 ValeRuster/src/main.rs:357 — // TODO: Expensive call to string_path — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ValeRuster/src/main.rs:379 — // TODO: check duplicates, i think we're doing extra work here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ValeRuster/src/main.rs:397 — // TODO: check duplicates, i think we're doing extra work here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ValeRuster/src/main.rs:431 — // TODO: check duplicates, i think we're doing extra work here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ValeRuster/src/main.rs:422 — // TODO: dedupe — 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 ValeRuster/src/main.rs:446 — // TODO: O(n^2) lol — 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 ValeRuster/src/main.rs:528 — // TODO: dedupe with other call to instantiate_struct — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ValeRuster/src/main.rs:568 — // &needle_type.valtype.name.as_ref().map(|x| x.to_string()).unwrap_or("Tup".to_string()); // 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 ValeRuster/src/main.rs:807 — // TODO: Is it okay to use u8 here instead of c_char? — 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 ValeRuster/src/main.rs:881 — // TODO: maybe dedup with instantiate_func's — 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 ValeRuster/src/main.rs:888 — // TODO: dedup with instantiate_func's — 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 ValeRuster/src/main.rs:926 — // TODO: Resultify — 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 ValeRuster/src/main.rs:973 — // TODO: do result or something? — 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 ValeRuster/src/main.rs:1099 — // TODO: optimize: super expensive — 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 ValeRuster/src/main.rs:1100 — // TODO: look for impls in other crates — 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 ValeRuster/src/main.rs:1164 — // TODO: doc better — 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 ValeRuster/src/main.rs:1426 — // TODO: stop using ResolvedPath's name, it's inconsistent and we have an ID instead — 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 ValeRuster/src/main.rs:1655 — // TODO: prevent parsing 'staticky or something — 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.
  • + 68 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×21
  • FileTooLong: instantiating/Instantiator.scala Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala — FileTooLong — 2452 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1952 over it, 4.90× 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/main.rs ValeRuster/src/main.rs — FileTooLong — 1601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 43 free functions. The bar is 500 significant lines; this is 1101 over it, 3.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: expression/ExpressionCompiler.scala Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala — FileTooLong — 1482 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: ExpressionCompiler (70-2012). The bar is 500 significant lines; this is 982 over it, 2.96× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: parsing/ExpressionParser.scala Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala — FileTooLong — 1199 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: ExpressionParser (239-1933). The bar is 500 significant lines; this is 699 over it, 2.40× 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: typing/Compiler.scala Frontend/TypingPass/src/dev/vale/typing/Compiler.scala — FileTooLong — 1128 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: Compiler (72-1600). The bar is 500 significant lines; this is 628 over it, 2.26× 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: parsing/ParserVonifier.scala Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala — FileTooLong — 917 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 417 over it, 1.83× 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: typing/TemplataCompiler.scala Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala — FileTooLong — 882 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 382 over it, 1.76× 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: simplifying/VonHammer.scala Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala — FileTooLong — 815 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VonHammer (11-978). The bar is 500 significant lines; this is 315 over it, 1.63× 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: lexing/Lexer.scala Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala — FileTooLong — 794 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 294 over it, 1.59× 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: simplifying/ExpressionHammer.scala Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala — FileTooLong — 764 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ExpressionHammer (10-1115). The bar is 500 significant lines; this is 264 over it, 1.53× 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: infer/CompilerSolver.scala Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala — FileTooLong — 762 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: CompilerRuleSolver (347-1412). The bar is 500 significant lines; this is 262 over it, 1.52× 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: postparsing/PostParser.scala Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala — FileTooLong — 655 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: PostParser (373-920). The bar is 500 significant lines; this is 155 over it, 1.31× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: parsing/ParsedLoader.scala Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala — FileTooLong — 642 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ParsedLoader (9-878). The bar is 500 significant lines; this is 142 over it, 1.28× 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: typing/CompilerErrorHumanizer.scala Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala — FileTooLong — 633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 133 over it, 1.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: postparsing/ExpressionScout.scala Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala — FileTooLong — 613 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ExpressionScout (53-892). The bar is 500 significant lines; this is 113 over it, 1.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: highertyping/HigherTypingPass.scala Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala — FileTooLong — 586 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: HigherTypingPass (197-791). The bar is 500 significant lines; this is 86 over it, 1.17× 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: typing/InferCompiler.scala Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala — FileTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12× 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: env/FunctionEnvironmentT.scala Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala — FileTooLong — 540 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 40 over it, 1.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: parsing/Parser.scala Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala — FileTooLong — 539 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: Parser (18-697). The bar is 500 significant lines; this is 39 over it, 1.08× 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: ast/expressions.scala Frontend/TypingPass/src/dev/vale/typing/ast/expressions.scala — FileTooLong — 530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 30 over it, 1.06× 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: postparsing/FunctionScout.scala Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala — FileTooLong — 522 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: FunctionScout (38-747). The bar is 500 significant lines; this is 22 over it, 1.04× 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.
D2 · Cognitive Complexity · ValeRuster · ×18
  • ValeRuster::main (cognitive 134) ValeRuster/src/main.rs:133 — ValeRuster::main has cognitive complexity 134 (threshold 15). Drivers by points: if/else 31 (82 pts), loops 10 (31 pts), match/switch 5 (17 pts), boolean chains 4 (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValeRuster::indexer::genealogize (cognitive 100) ValeRuster/src/indexer.rs:16 — ValeRuster::indexer::genealogize has cognitive complexity 100 (threshold 15). Drivers by points: match/switch 13 (44 pts), if/else 8 (32 pts), loops 9 (24 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValeRuster::resolve::extend_and_resolve (cognitive 95) ValeRuster/src/resolve.rs:187 — ValeRuster::resolve::extend_and_resolve has cognitive complexity 95 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 9 (26 pts), match/switch 8 (24 pts), boolean chains 1 (nesting depth added 57). 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.
  • ValeRuster::resolve_id::resolve_uid (cognitive 63) ValeRuster/src/resolve_id.rs:7 — ValeRuster::resolve_id::resolve_uid has cognitive complexity 63 (threshold 15). Drivers by points: if/else 7 (30 pts), match/switch 7 (20 pts), loops 3 (12 pts), boolean chains 1 (nesting depth added 45). 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.
  • ValeRuster::resolve::resolve (cognitive 62) ValeRuster/src/resolve.rs:11 — ValeRuster::resolve::resolve has cognitive complexity 62 (threshold 15). Drivers by points: if/else 7 (26 pts), match/switch 7 (20 pts), loops 4 (15 pts), boolean chains 1 (nesting depth added 43). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • ValeRuster::get_impl_children (cognitive 44) ValeRuster/src/main.rs:1143 — ValeRuster::get_impl_children has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 3 (8 pts), match/switch 2 (6 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • ValeRuster::indexer::infer_missing_owners (cognitive 42) ValeRuster/src/indexer.rs:287 — ValeRuster::indexer::infer_missing_owners has cognitive complexity 42 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 5 (14 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValeRuster::list_struct_and_methods (cognitive 33) ValeRuster/src/main.rs:1402 — ValeRuster::list_struct_and_methods has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 3 (12 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValeRuster::parse_type_path_step (cognitive 33) ValeRuster/src/main.rs:1744 — ValeRuster::parse_type_path_step has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValeRuster::rustify_simple_valtype (cognitive 30) ValeRuster/src/main.rs:1937 — ValeRuster::rustify_simple_valtype has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
  • ValeRuster::resolve_id::extend_and_resolve_uid (cognitive 30) ValeRuster/src/resolve_id.rs:143 — ValeRuster::resolve_id::extend_and_resolve_uid has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 4 (7 pts), loops 3 (7 pts) (nesting depth added 16). 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.
  • ValeRuster::simplify_type (cognitive 28) ValeRuster/src/main.rs:2169 — ValeRuster::simplify_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (9 pts), loops 2 (6 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.
  • ValeRuster::mangle_simple_type (cognitive 24) ValeRuster/src/main.rs:1860 — ValeRuster::mangle_simple_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValeRuster::get_concrete_impls (cognitive 20) ValeRuster/src/main.rs:1102 — ValeRuster::get_concrete_impls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValeRuster::impl_from_matches_generic_args (cognitive 19) ValeRuster/src/main.rs:903 — ValeRuster::impl_from_matches_generic_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ValeRuster::mangle_simple_valtype (cognitive 19) ValeRuster/src/main.rs:2090 — ValeRuster::mangle_simple_valtype has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
  • ValeRuster::match_generic_arg_valtype (cognitive 17) ValeRuster/src/main.rs:1001 — ValeRuster::match_generic_arg_valtype has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • ValeRuster::rustify_simple_type (cognitive 16) ValeRuster/src/main.rs:2045 — ValeRuster::rustify_simple_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×15
  • Duplicated block (7 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:152 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:152-158 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:177-183 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:152` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:180 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:180-186 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:203-209 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:180` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:854 — Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:854-860 | Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:864-870 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:854` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:426 — Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:426-432 | Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:449-455 — both copies are in the same file, so extract the block into 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) Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:142 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:142-148 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:170-176 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:142` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/Von/src/dev/vale/von/VonPrinter.scala:86 — Frontend/Von/src/dev/vale/von/VonPrinter.scala:86-92 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:138-144 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/Von/src/dev/vale/von/VonPrinter.scala:86` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:96 — Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:96-102 | Frontend/TypingPass/src/dev/vale/typing/macros/citizen/StructDropMacro.scala:103-109 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:96` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (7 lines × 2) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingErrorHumanizer.scala:38 — Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingErrorHumanizer.scala:38-44 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingErrorHumanizer.scala:70-76 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingErrorHumanizer.scala:38` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) ValeRuster/src/main.rs:1615 — ValeRuster/src/main.rs:1615-1621 | ValeRuster/src/main.rs:1634-1640 — both copies are in the same file, so extract the block into 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) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:256 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:256-262 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:395-401 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:256` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:267 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:267-273 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:406-412 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:267` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:278 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:278-284 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:417-423 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:278` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:289 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:289-295 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:428-434 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:289` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:300 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:300-306 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:439-445 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:300` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1235 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1235-1241 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1246-1252 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1235` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×14
  • Duplicated block (6 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:765 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:765-770 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1462-1468 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:765` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:760 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:760-765 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1448-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. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:760` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1650 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1650-1655 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1669-1674 — both copies are in the same file, so extract the block into 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) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1893 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1893-1898 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1901-1906 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1893` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:912 — Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:912-917 | Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1153-1158 — both copies are in the same file, so extract the block into 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) Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1559 — Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1559-1564 | Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1566-1571 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1559` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala:42 — Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala:42-47 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala:58-63 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala:42` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:433 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:433-438 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:395-400 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:11 — Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:11-16 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:925-930 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (6 lines × 2) Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:44 — Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:44-49 | Frontend/TypingPass/src/dev/vale/typing/macros/citizen/StructDropMacro.scala:49-54 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) ValeRuster/src/main.rs:1478 — ValeRuster/src/main.rs:1478-1483 | ValeRuster/src/main.rs:1524-1529 — both copies are in the same file, so extract the block into 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) ValeRuster/src/main.rs:679 — ValeRuster/src/main.rs:679-684 | ValeRuster/src/main.rs:1254-1259 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/main.rs:679` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) ValeRuster/src/main.rs:735 — ValeRuster/src/main.rs:735-740 | ValeRuster/src/main.rs:751-756 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (6 lines × 2) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:228 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:228-233 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:367-372 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:228` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D1 · Cyclomatic Complexity · ValeRuster · ×13
  • ValeRuster::list_struct_and_methods (cyclomatic 63) ValeRuster/src/main.rs:1402 — ValeRuster::list_struct_and_methods has cyclomatic complexity 63 (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.
  • ValeRuster::main (cyclomatic 44) ValeRuster/src/main.rs:133 — ValeRuster::main 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.
  • ValeRuster::resolve::extend_and_resolve (cyclomatic 44) ValeRuster/src/resolve.rs:187 — ValeRuster::resolve::extend_and_resolve 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.
  • ValeRuster::indexer::genealogize (cyclomatic 36) ValeRuster/src/indexer.rs:16 — ValeRuster::indexer::genealogize has cyclomatic complexity 36 (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.
  • ValeRuster::list_generics (cyclomatic 25) ValeRuster/src/main.rs:1505 — ValeRuster::list_generics 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.
  • ValeRuster::simplify_type (cyclomatic 24) ValeRuster/src/main.rs:2169 — ValeRuster::simplify_type has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • ValeRuster::resolve::resolve (cyclomatic 24) ValeRuster/src/resolve.rs:11 — ValeRuster::resolve::resolve has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
  • ValeRuster::resolve_id::resolve_uid (cyclomatic 23) ValeRuster/src/resolve_id.rs:7 — ValeRuster::resolve_id::resolve_uid has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • ValeRuster::parse_type_path_step (cyclomatic 20) ValeRuster/src/main.rs:1744 — ValeRuster::parse_type_path_step 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.
  • ValeRuster::resolve_id::extend_and_resolve_uid (cyclomatic 18) ValeRuster/src/resolve_id.rs:143 — ValeRuster::resolve_id::extend_and_resolve_uid 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.
  • ValeRuster::rustify_simple_valtype (cyclomatic 17) ValeRuster/src/main.rs:1937 — ValeRuster::rustify_simple_valtype has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • ValeRuster::indexer::infer_missing_owners (cyclomatic 17) ValeRuster/src/indexer.rs:287 — ValeRuster::indexer::infer_missing_owners has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
  • ValeRuster::get_impl_children (cyclomatic 16) ValeRuster/src/main.rs:1143 — ValeRuster::get_impl_children 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.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×12
  • Duplicated block (8 lines × 2) Frontend/Builtins/src/dev/vale/Builtins.scala:79 — Frontend/Builtins/src/dev/vale/Builtins.scala:79-86 | Frontend/Builtins/src/dev/vale/Builtins.scala:97-104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/Builtins/src/dev/vale/Builtins.scala:79` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Frontend/Builtins/src/dev/vale/Builtins.scala:106` calls `put`, `intern`, `FileCoordinate` and `Frontend/Builtins/src/dev/vale/Builtins.scala:87` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1493 — Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1493-1500 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1518-1530 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1493` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:70 — Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:70-77 | Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:137-144 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:70` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:699 — Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:699-706 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:888-895 — both copies are in the same file, so extract the block into 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) Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:759 — Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:759-766 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:772-779 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:759` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:756` calls `VonMember`, `vonifyExpression`, `vonifyCoord` and `Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:771` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 2) Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:909 — Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:909-916 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:960-967 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:909` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1896 — Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1896-1903 | Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala:138-147 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1896` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (8 lines × 2) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerMiddleLayer.scala:124 — Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerMiddleLayer.scala:124-131 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerMiddleLayer.scala:343-350 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:98 — Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:98-105 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:725-732 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (8 lines × 2) ValeRuster/src/indexer.rs:196 — ValeRuster/src/indexer.rs:196-203 | ValeRuster/src/indexer.rs:210-217 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/indexer.rs:196` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:494 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:494-501 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:523-530 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:494` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:273 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:273-280 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:305-312 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:273` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D3 · God Classes · ClassTooLong · ×10
  • ClassTooLong: ExpressionCompiler Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:70 — ClassTooLong — 1421 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 1021 over it, 3.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: VonHammer Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:11 — ClassTooLong — 807 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 407 over it, 2.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ExpressionHammer Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:10 — ClassTooLong — 758 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 358 over it, 1.90× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ParsedLoader Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:9 — ClassTooLong — 636 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 400 significant lines; this is 236 over it, 1.59× 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: CompilerRuleSolver Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:347 — ClassTooLong — 505 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 105 over it, 1.26× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: FunctionScout Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala:38 — ClassTooLong — 496 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 96 over it, 1.24× 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: ArrayCompiler Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:28 — ClassTooLong — 465 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 65 over it, 1.16× 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: TemplexParser Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala:13 — ClassTooLong — 419 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 19 over it, 1.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: PatternCompiler Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala:31 — ClassTooLong — 416 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 16 over it, 1.04× 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: FunctionCompilerSolvingLayer Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:36 — ClassTooLong — 412 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 12 over it, 1.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.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×10
  • Duplicated block (9 lines × 2) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467 — Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467-475 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:579-590 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (9 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:261 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:261-269 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:294-302 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:261` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:202 — Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:202-210 | Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala:686-694 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:202` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:616 — Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:616-624 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:831-839 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:616` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:512 — Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:512-520 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:522-530 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:512` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:539 — Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:539-547 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:618-626 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:539` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:512 — Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:512-520 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:577-585 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) ValeRuster/src/main.rs:1961 — ValeRuster/src/main.rs:1961-1969 | ValeRuster/src/main.rs:2120-2128 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/main.rs:1961` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:198 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:198-206 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:216-224 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:198` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:314 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:314-322 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:328-336 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×8
  • Duplicated block (10 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:120 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:120-129 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:149-158 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:120` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:135 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:135-144 | Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:159-168 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:135` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:603 — Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:603-612 | Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:626-635 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:603` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:461 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:461-470 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:138-147 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (10 lines × 2) Frontend/TypingPass/src/dev/vale/typing/macros/RSALenMacro.scala:28 — Frontend/TypingPass/src/dev/vale/typing/macros/RSALenMacro.scala:28-37 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSALenMacro.scala:28-37 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (10 lines × 2) ValeRuster/src/indexer.rs:309 — ValeRuster/src/indexer.rs:309-319 | ValeRuster/src/indexer.rs:328-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 (10 lines × 2) ValeRuster/src/main.rs:369 — ValeRuster/src/main.rs:369-378 | ValeRuster/src/main.rs:387-396 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:516 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:516-525 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:753-762 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×8
  • Duplicated block (5 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1639 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1639-1643 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1644-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. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1639` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:137 — Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:137-141 | Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:143-147 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:137` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:478 — Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:478-486 | Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:868-872 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:478` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (5 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:23 — Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:23-27 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:82-86 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:23` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:87` calls `DefinitionCoordIsaSR`, `Vector`, `CallSiteCoordIsaSR` and `Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:28` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (5 lines × 2) Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:337 — Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:337-341 | Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:352-356 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:337` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Frontend/Utils/src/dev/vale/Utils.scala:242 — Frontend/Utils/src/dev/vale/Utils.scala:242-246 | Frontend/Utils/src/dev/vale/Utils.scala:254-258 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/Utils/src/dev/vale/Utils.scala:242` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) ValeRuster/src/indexer.rs:47 — ValeRuster/src/indexer.rs:47-51 | ValeRuster/src/indexer.rs:293-299 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/indexer.rs:47` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) ValeRuster/src/main.rs:663 — ValeRuster/src/main.rs:663-667 | ValeRuster/src/main.rs:1601-1605 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/main.rs:663` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D3 · God Classes · TooManyMethods · ×7
  • TooManyMethods: Instantiator Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:111 — 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: ParsedLoader Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:9 — TooManyMethods — 65 methods. The bar is 30 methods; this is 35 over it, 2.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.
  • TooManyMethods: ParserVonifier Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:9 — 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: ExpressionParser Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:239 — 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: RegionCounter Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCounter.scala:9 — TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: TemplataCompiler Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:66 — TooManyMethods — 35 methods. The bar is 30 methods; 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.
  • TooManyMethods: U Frontend/Utils/src/dev/vale/Utils.scala:6 — TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.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.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×6
  • Edited copy of a member (8 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:226 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:226-233 | Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala:417-424 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:235 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:235-242 | Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala:426-433 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:770 — Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:770-777 | Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:175-184 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala:504 — Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala:504-511 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:807-814 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala:22 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala:22-29 | Frontend/TypingPass/src/dev/vale/typing/names/names.scala:55-62 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:196 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:196-203 | Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala:387-394 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×6
  • Duplicated block (12 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:221 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:221-232 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:242-253 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:221` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:587 — Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:587-598 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:803-814 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:600` calls `flatMap` and `Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:816` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (12 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:119 — Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:119-130 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:183-194 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) Frontend/Von/src/dev/vale/von/VonPrinter.scala:226 — Frontend/Von/src/dev/vale/von/VonPrinter.scala:226-237 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:275-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. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/Von/src/dev/vale/von/VonPrinter.scala:226` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) Frontend/Von/src/dev/vale/von/VonPrinter.scala:240 — Frontend/Von/src/dev/vale/von/VonPrinter.scala:240-251 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:289-300 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/Von/src/dev/vale/von/VonPrinter.scala:240` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:734 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:734-745 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:765-776 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:734` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Edited copy of a member (17 corresponding lines) · ×5
  • Edited copy of a member (17 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:131 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:131-148 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:160-176 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:267 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:267-283 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:273-291 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSADropIntoMacro.scala:28 — Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSADropIntoMacro.scala:28-44 | Frontend/TypingPass/src/dev/vale/typing/macros/ssa/SSADropIntoMacro.scala:28-45 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:557 — Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:557-573 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:579-599 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1814 — Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1814-1830 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1839-1855 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×5
  • Edited copy of a member (11 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:148 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:148-158 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:173-183 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:168 — Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:168-179 | Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:195-205 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) Frontend/Utils/src/dev/vale/Utils.scala:241 — Frontend/Utils/src/dev/vale/Utils.scala:241-251 | Frontend/Utils/src/dev/vale/Utils.scala:253-266 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:81 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:81-91 | Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala:154-164 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) Frontend/TestVM/src/dev/vale/testvm/Heap.scala:355 — Frontend/TestVM/src/dev/vale/testvm/Heap.scala:355-365 | Frontend/TestVM/src/dev/vale/testvm/Heap.scala:371-385 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×4
  • Edited copy of a member (9 corresponding lines) Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:111 — Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:111-119 | Frontend/Solver/src/dev/vale/solver/SimpleSolverState.scala:175-183 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:204 — Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:204-213 | Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:223-231 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:321 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:321-330 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:337-345 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:335 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:335-344 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:350-358 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×4
  • Duplicated block (18 lines × 2) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:669 — Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:669-686 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:737-754 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:669` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (18 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:229 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:229-246 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:441-458 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:459` calls `vassert` and `Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:248` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (18 lines × 2) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:176 — Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:176-193 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:262-279 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:176` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (18 lines × 2) ValeRuster/src/resolve.rs:55 — ValeRuster/src/resolve.rs:55-72 | ValeRuster/src/resolve_id.rs:44-61 — before extracting anything, compare `ValeRuster/src/resolve.rs` and `ValeRuster/src/resolve_id.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/resolve.rs:55` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `ValeRuster/src/resolve.rs:53` calls `is_empty` and `ValeRuster/src/resolve_id.rs:43` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×4
  • Duplicated block (14 lines × 2) Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala:10 — Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala:10-23 | Frontend/CompileServer/src/dev/vale/compileserver/RunAction.scala:12-25 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (14 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:28 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:28-41 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:64-77 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:28` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 2) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:74 — Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:74-87 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:154-167 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:74` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 2) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:115 — Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:115-128 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:250-263 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:115` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (44 corresponding lines) · ×3
  • Edited copy of a member (44 corresponding lines) Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:57 — Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:57-100 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:116-183 — These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (44 corresponding lines) Frontend/Von/src/dev/vale/von/VonPrinter.scala:219 — Frontend/Von/src/dev/vale/von/VonPrinter.scala:219-264 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:270-313 — These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (44 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:52 — Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:52-107 | Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:117-160 — These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (33 corresponding lines) · ×3
  • Edited copy of a member (33 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:242 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:242-279 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:281-313 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (33 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:909 — Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:909-941 | Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:949-985 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (33 corresponding lines) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1042 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1042-1078 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1091-1123 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×3
  • Edited copy of a member (14 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:179 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:179-192 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:202-215 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (14 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:166 — Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:166-179 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:181-194 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (14 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:681 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:681-694 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:714-731 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×3
  • Edited copy of a member (13 corresponding lines) Frontend/LexingPass/src/dev/vale/lexing/LexingIterator.scala:94 — Frontend/LexingPass/src/dev/vale/lexing/LexingIterator.scala:94-108 | Frontend/LexingPass/src/dev/vale/lexing/LexingIterator.scala:110-122 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (13 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:3009 — Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:3009-3023 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:3032-3044 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (13 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:252 — Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:252-264 | Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:266-278 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×3
  • Edited copy of a member (7 corresponding lines) Frontend/HigherTypingPass/src/dev/vale/highertyping/ast.scala:35 — Frontend/HigherTypingPass/src/dev/vale/highertyping/ast.scala:35-41 | Frontend/HigherTypingPass/src/dev/vale/highertyping/ast.scala:42-48 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:21 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:21-27 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:22-28 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Frontend/Utils/src/dev/vale/CodeHierarchy.scala:14 — Frontend/Utils/src/dev/vale/CodeHierarchy.scala:14-20 | Frontend/Utils/src/dev/vale/Range.scala:8-17 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×3
  • Duplicated block (11 lines × 2) Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1154 — Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1154-1164 | Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1209-1219 — both copies are in the same file, so extract the block into 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) ValeRuster/src/main.rs:522 — ValeRuster/src/main.rs:522-533 | ValeRuster/src/main.rs:543-553 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/main.rs:522` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:104 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:104-114 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:578-588 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×3
  • Duplicated block (9 lines × 3) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:232 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:232-240 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:306-314 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:444-452 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:301` calls `val`, `translateCoord` and `Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:230` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (9 lines × 3) Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:706 — Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:706-714 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:724-732 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:781-789 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:706` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:734` calls `VonMember`, `vonifyKind`, `vonifyCoord` and `Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:791` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (9 lines × 3) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:632 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:632-640 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:659-667 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:680-688 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:632` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D6 · Cohesion (LCOM4) · Low cohesion · ×3
  • Low cohesion: ArrayCompiler (LCOM4 8) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:28 — ArrayCompiler's methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: StructCompilerGenericArgsLayer (LCOM4 5) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:23 — StructCompilerGenericArgsLayer's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: ExpressionCompiler (LCOM4 4) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:70 — ExpressionCompiler's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
D3 · God Classes · FunctionTooLong · ×2
  • FunctionTooLong: ValeRuster::resolve::extend_and_resolve ValeRuster/src/resolve.rs:187 — FunctionTooLong — ValeRuster::resolve::extend_and_resolve runs 165 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 65 over it, 1.65× 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: ValeRuster::indexer::genealogize ValeRuster/src/indexer.rs:16 — FunctionTooLong — ValeRuster::indexer::genealogize runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D35 · Change Coupling · Change coupling · ×2
  • Change coupling: ParsedLoader.scala ↔ ParserVonifier.scala Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:1 — `Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala` and `Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala` change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `bdae7907` Changed #!DeriveStructDrop to linear; `db076f71` Added parsing of isolates. Added a flag for controlling whether to us…; `70ea54dc` Upgrades for lexing and parsing pass to support regions — run `git show` on any of them.
  • Change coupling: ExpressionParser.scala ↔ ParserVonifier.scala Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1 — `Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala` and `Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala` change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `bdae7907` Changed #!DeriveStructDrop to linear; `70ea54dc` Upgrades for lexing and parsing pass to support regions; `240affeb` Fixing array bugs (at that commit the files were still `Valestrom/Parser/src/net/verdagon/vale/parser/ExpressionParser.scala` and `Valestrom/Parser/src/net/verdagon/vale/parser/ParserVonifier.scala`) — run `git show` on any of them.
D4 · Code Duplication · Edited copy of a member (77 corresponding lines) · ×2
  • Edited copy of a member (77 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:111 — Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:111-187 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:738-826 — These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (77 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:32 — Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:32-108 | Frontend/TypingPass/src/dev/vale/typing/macros/citizen/StructDropMacro.scala:38-114 — These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (26 corresponding lines) · ×2
  • Edited copy of a member (26 corresponding lines) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:934 — Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:934-959 | Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala:634-659 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (26 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:297 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:297-328 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:182-207 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (20 corresponding lines) · ×2
  • Edited copy of a member (20 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/TypeHammer.scala:93 — Frontend/SimplifyingPass/src/dev/vale/simplifying/TypeHammer.scala:93-113 | Frontend/SimplifyingPass/src/dev/vale/simplifying/TypeHammer.scala:115-134 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (20 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/BlockHammer.scala:59 — Frontend/SimplifyingPass/src/dev/vale/simplifying/BlockHammer.scala:59-78 | Frontend/SimplifyingPass/src/dev/vale/simplifying/BlockHammer.scala:86-105 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×2
  • Edited copy of a member (18 corresponding lines) Frontend/Von/src/dev/vale/von/VonPrinter.scala:47 — Frontend/Von/src/dev/vale/von/VonPrinter.scala:47-64 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:171-188 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (18 corresponding lines) Frontend/Von/src/dev/vale/von/VonPrinter.scala:74 — Frontend/Von/src/dev/vale/von/VonPrinter.scala:74-94 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:129-146 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×2
  • Edited copy of a member (12 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:733 — Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:733-745 | Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:755-766 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (12 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:170 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:170-181 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:199-210 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×2
  • Edited copy of a member (22 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ParseUtils.scala:46 — Frontend/ParsingPass/src/dev/vale/parsing/ParseUtils.scala:46-67 | Frontend/ParsingPass/src/dev/vale/parsing/ParseUtils.scala:81-102 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (22 corresponding lines) Frontend/TestVM/src/dev/vale/testvm/Heap.scala:425 — Frontend/TestVM/src/dev/vale/testvm/Heap.scala:425-446 | Frontend/TestVM/src/dev/vale/testvm/Heap.scala:453-475 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (16 corresponding lines) · ×2
  • Edited copy of a member (16 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:193 — Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:193-208 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:832-847 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:190 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:190-205 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:266-289 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 14+ corresponding lines) · ×2
  • Edited copies of one member (6 members, 14+ corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:116 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:116-129 | Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:131-144 | Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:155-168 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:145-158 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:160-173 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:184-197 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
  • Edited copies of one member (6 members, 14+ corresponding lines) Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:164 — Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:164-177 | Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:184-197 | Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:202-215 | Frontend/Solver/src/dev/vale/solver/SimpleSolverState.scala:201-214 | Frontend/Solver/src/dev/vale/solver/SimpleSolverState.scala:221-234 | Frontend/Solver/src/dev/vale/solver/SimpleSolverState.scala:239-252 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×2
  • Edited copy of a member (10 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/citizens.scala:48 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/citizens.scala:48-57 | Frontend/TypingPass/src/dev/vale/typing/ast/citizens.scala:55-64 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:108 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:108-118 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:348-357 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×2
  • Edited copy of a member (4 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala:173 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala:173-176 | Frontend/TypingPass/src/dev/vale/typing/types/types.scala:151-154 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala:192 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala:192-195 | Frontend/TypingPass/src/dev/vale/typing/types/types.scala:169-172 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×2
  • Edited copy of a member (6 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala:870 — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala:870-875 | Frontend/TypingPass/src/dev/vale/typing/ast/expressions.scala:907-912 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (6 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:361 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:361-367 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:362-367 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2
  • Duplicated block (16 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:239 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:239-254 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:129-144 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (16 lines × 2) ValeRuster/src/resolve.rs:36 — ValeRuster/src/resolve.rs:36-51 | ValeRuster/src/resolve_id.rs:28-43 — before extracting anything, compare `ValeRuster/src/resolve.rs` and `ValeRuster/src/resolve_id.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/resolve.rs:36` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `ValeRuster/src/resolve.rs:53` calls `is_empty` and `ValeRuster/src/resolve_id.rs:44` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×2
  • Duplicated block (13 lines × 2) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:321 — Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:321-333 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:434-446 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:321` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:43 — Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:43-55 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:102-114 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:43` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (12 lines × 3) · ×2
  • Duplicated block (12 lines × 3) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:102 — Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:102-113 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:172-183 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:245-256 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:102` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 3) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:78 — Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:78-89 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:158-169 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:351-362 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:78` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×2
  • Duplicated block (9–10 lines × 2) Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:203 — Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:203-212 | Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:237-245 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9–10 lines × 2) Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:354 — Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:354-362 | Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:369-378 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:354` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (8–9 lines × 2) · ×2
  • Duplicated block (8–9 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/LoopPostParser.scala:74 — Frontend/PostParsingPass/src/dev/vale/postparsing/LoopPostParser.scala:74-81 | Frontend/PostParsingPass/src/dev/vale/postparsing/LoopPostParser.scala:220-228 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/LoopPostParser.scala:74` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8–9 lines × 2) Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1464 — Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1464-1471 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerCore.scala:75-83 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1464` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×2
  • Duplicated block (5 lines × 3) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:222 — Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:222-226 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:228-232 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:234-238 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:222` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 3) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:123 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:123-127 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:134-138 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:145-149 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:123` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D1 · Cyclomatic Complexity · ExpressionCompiler.evaluate (cyclomatic 137) · ×1
  • ExpressionCompiler.evaluate (cyclomatic 137) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:457 — ExpressionCompiler.evaluate has cyclomatic complexity 137 (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.
D1 · Cyclomatic Complexity · FunctionScout.scoutFunction (cyclomatic 93) · ×1
  • FunctionScout.scoutFunction (cyclomatic 93) Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala:59 — FunctionScout.scoutFunction has cyclomatic complexity 93 (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.
D1 · Cyclomatic Complexity · ExpressionScout.scoutExpression (cyclomatic 79) · ×1
  • ExpressionScout.scoutExpression (cyclomatic 79) Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:235 — ExpressionScout.scoutExpression has cyclomatic complexity 79 (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.
D1 · Cyclomatic Complexity · CompilerRuleSolver.solveRule (cyclomatic 75) · ×1
  • CompilerRuleSolver.solveRule (cyclomatic 75) Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:557 — CompilerRuleSolver.solveRule 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.
D1 · Cyclomatic Complexity · Instantiator.translateRefExpr (cyclomatic 70) · ×1
  • Instantiator.translateRefExpr (cyclomatic 70) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:2006 — Instantiator.translateRefExpr 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.
D1 · Cyclomatic Complexity · ExpressionHammer.translate (cyclomatic 63) · ×1
  • ExpressionHammer.translate (cyclomatic 63) Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:27 — ExpressionHammer.translate has cyclomatic complexity 63 (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.
D1 · Cyclomatic Complexity · Compiler.evaluate (cyclomatic 49) · ×1
  • Compiler.evaluate (cyclomatic 49) Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:733 — Compiler.evaluate has cyclomatic complexity 49 (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.
D1 · Cyclomatic Complexity · TemplexParser.parseTemplexAtom (cyclomatic 47) · ×1
  • TemplexParser.parseTemplexAtom (cyclomatic 47) Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala:336 — TemplexParser.parseTemplexAtom has cyclomatic complexity 47 (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.
D1 · Cyclomatic Complexity · ExpressionParser.parseSpreeStep (cyclomatic 39) · ×1
  • ExpressionParser.parseSpreeStep (cyclomatic 39) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1093 — ExpressionParser.parseSpreeStep has cyclomatic complexity 39 (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.
D1 · Cyclomatic Complexity · RuneTypeSolver.solveRule (cyclomatic 38) · ×1
  • RuneTypeSolver.solveRule (cyclomatic 38) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:185 — RuneTypeSolver.solveRule 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.
D1 · Cyclomatic Complexity · ExpressionParser.parseStatement (cyclomatic 36) · ×1
  • ExpressionParser.parseStatement (cyclomatic 36) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:746 — ExpressionParser.parseStatement has cyclomatic complexity 36 (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.
D1 · Cyclomatic Complexity · PatternParser.parsePattern (cyclomatic 36) · ×1
  • PatternParser.parsePattern (cyclomatic 36) Frontend/ParsingPass/src/dev/vale/parsing/PatternParser.scala:74 — PatternParser.parsePattern has cyclomatic complexity 36 (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.
D1 · Cyclomatic Complexity · ExpressionParser.parseAtom (cyclomatic 32) · ×1
  • ExpressionParser.parseAtom (cyclomatic 32) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:955 — ExpressionParser.parseAtom 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.
D1 · Cyclomatic Complexity · ExpressionParser.parseExpressionDataElement (cyclomatic 32) · ×1
  • ExpressionParser.parseExpressionDataElement (cyclomatic 32) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1418 — ExpressionParser.parseExpressionDataElement 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.
D1 · Cyclomatic Complexity · Lexer.lexFunction (cyclomatic 30) · ×1
  • Lexer.lexFunction (cyclomatic 30) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:270 — Lexer.lexFunction 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.
D1 · Cyclomatic Complexity · RuneTypeSolver.solve (cyclomatic 29) · ×1
  • RuneTypeSolver.solve (cyclomatic 29) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:412 — RuneTypeSolver.solve 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.
D1 · Cyclomatic Complexity · OverloadResolver.attemptCandidateBanner (cyclomatic 28) · ×1
  • OverloadResolver.attemptCandidateBanner (cyclomatic 28) Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:229 — OverloadResolver.attemptCandidateBanner has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · AnonymousInterfaceMacro.mapRunes (cyclomatic 28) · ×1
  • AnonymousInterfaceMacro.mapRunes (cyclomatic 28) Frontend/TypingPass/src/dev/vale/typing/macros/AnonymousInterfaceMacro.scala:142 — AnonymousInterfaceMacro.mapRunes has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · LocalHelper.getBorrowOwnership (cyclomatic 27) · ×1
  • LocalHelper.getBorrowOwnership (cyclomatic 27) Frontend/TypingPass/src/dev/vale/typing/expression/LocalHelper.scala:213 — LocalHelper.getBorrowOwnership 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.
D1 · Cyclomatic Complexity · RuneTypeSolver.getPuzzles (cyclomatic 26) · ×1
  • RuneTypeSolver.getPuzzles (cyclomatic 26) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:116 — RuneTypeSolver.getPuzzles 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.
D1 · Cyclomatic Complexity · Parser.parseGenericParameter (cyclomatic 25) · ×1
  • Parser.parseGenericParameter (cyclomatic 25) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:23 — Parser.parseGenericParameter 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.
D1 · Cyclomatic Complexity · LocalHelper.softLoad (cyclomatic 25) · ×1
  • LocalHelper.softLoad (cyclomatic 25) Frontend/TypingPass/src/dev/vale/typing/expression/LocalHelper.scala:144 — LocalHelper.softLoad 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.
D1 · Cyclomatic Complexity · Lexer.lexInterface (cyclomatic 24) · ×1
  • Lexer.lexInterface (cyclomatic 24) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:486 — Lexer.lexInterface has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · PostParser.scoutGenericParameter (cyclomatic 24) · ×1
  • PostParser.scoutGenericParameter (cyclomatic 24) Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:245 — PostParser.scoutGenericParameter has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · RuleScout.translateRulex (cyclomatic 24) · ×1
  • RuleScout.translateRulex (cyclomatic 24) Frontend/PostParsingPass/src/dev/vale/postparsing/rules/RuleScout.scala:30 — RuleScout.translateRulex has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · TemplexScout.translateTemplex (cyclomatic 24) · ×1
  • TemplexScout.translateTemplex (cyclomatic 24) Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:65 — TemplexScout.translateTemplex has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CompilerErrorHumanizer.humanizeTemplata (cyclomatic 24) · ×1
  • CompilerErrorHumanizer.humanizeTemplata (cyclomatic 24) Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:613 — CompilerErrorHumanizer.humanizeTemplata has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: CompilerErrorHumanizer.humanize (cyclomatic 52) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · CompilerRuleSolver.solveCallRule (cyclomatic 24) · ×1
  • CompilerRuleSolver.solveCallRule (cyclomatic 24) Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:1005 — CompilerRuleSolver.solveCallRule 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.
D1 · Cyclomatic Complexity · ArrayCompiler.evaluateRuntimeSizedArrayFromCallable (cyclomatic 23) · ×1
  • ArrayCompiler.evaluateRuntimeSizedArrayFromCallable (cyclomatic 23) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:127 — ArrayCompiler.evaluateRuntimeSizedArrayFromCallable 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.
D1 · Cyclomatic Complexity · InferCompiler.checkResolvingConclusionsAndResolve (cyclomatic 23) · ×1
  • InferCompiler.checkResolvingConclusionsAndResolve (cyclomatic 23) Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:286 — InferCompiler.checkResolvingConclusionsAndResolve 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.
D1 · Cyclomatic Complexity · HigherTypingPass.explicifyLookups (cyclomatic 21) · ×1
  • HigherTypingPass.explicifyLookups (cyclomatic 21) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:47 — HigherTypingPass.explicifyLookups has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Lexer.lexImpl (cyclomatic 21) · ×1
  • Lexer.lexImpl (cyclomatic 21) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:164 — Lexer.lexImpl has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · PassManager.parseOpts (cyclomatic 21) · ×1
  • PassManager.parseOpts (cyclomatic 21) Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala:70 — PassManager.parseOpts 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.
D1 · Cyclomatic Complexity · Lexer.lexStruct (cyclomatic 20) · ×1
  • Lexer.lexStruct (cyclomatic 20) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:386 — Lexer.lexStruct 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. This is NOT this file's highest cyclomatic complexity: Lexer.lexDenizen (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Lexer.lexNumber (cyclomatic 20) · ×1
  • Lexer.lexNumber (cyclomatic 20) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:1215 — Lexer.lexNumber 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. This is NOT this file's highest cyclomatic complexity: Lexer.lexDenizen (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Compiler.ensureDeepExports (cyclomatic 20) · ×1
  • Compiler.ensureDeepExports (cyclomatic 20) Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1482 — Compiler.ensureDeepExports has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · Lexer.lexAttribute (cyclomatic 19) · ×1
  • Lexer.lexAttribute (cyclomatic 19) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:21 — Lexer.lexAttribute 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. This is NOT this file's highest cyclomatic complexity: Lexer.lexDenizen (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · ExpressionParser.parseArray (cyclomatic 19) · ×1
  • ExpressionParser.parseArray (cyclomatic 19) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1729 — ExpressionParser.parseArray 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.
D1 · Cyclomatic Complexity · ParseAndExplore.parseAndExplore (cyclomatic 19) · ×1
  • ParseAndExplore.parseAndExplore (cyclomatic 19) Frontend/ParsingPass/src/dev/vale/parsing/ParseAndExplore.scala:30 — ParseAndExplore.parseAndExplore 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.
D1 · Cyclomatic Complexity · PassManager.build (cyclomatic 19) · ×1
  • PassManager.build (cyclomatic 19) Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala:198 — PassManager.build 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.
D1 · Cyclomatic Complexity · FunctionCompilerCore.evaluateFunctionForHeader (cyclomatic 19) · ×1
  • FunctionCompilerCore.evaluateFunctionForHeader (cyclomatic 19) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerCore.scala:68 — FunctionCompilerCore.evaluateFunctionForHeader 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.
D1 · Cyclomatic Complexity · Lexer.lexStringPart (cyclomatic 18) · ×1
  • Lexer.lexStringPart (cyclomatic 18) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:1129 — Lexer.lexStringPart has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: Lexer.lexDenizen (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Solver.advance (cyclomatic 17) · ×1
  • Solver.advance (cyclomatic 17) Frontend/Solver/src/dev/vale/solver/Solver.scala:212 — Solver.advance has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · StructCompilerCore.compileStruct (cyclomatic 17) · ×1
  • StructCompilerCore.compileStruct (cyclomatic 17) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerCore.scala:35 — StructCompilerCore.compileStruct has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ExpressionParser.parseForeach (cyclomatic 16) · ×1
  • ExpressionParser.parseForeach (cyclomatic 16) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:315 — ExpressionParser.parseForeach 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.
D1 · Cyclomatic Complexity · Parser.parseFunction (cyclomatic 16) · ×1
  • Parser.parseFunction (cyclomatic 16) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:552 — Parser.parseFunction 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.
D1 · Cyclomatic Complexity · PatternParser.parseParameter (cyclomatic 16) · ×1
  • PatternParser.parseParameter (cyclomatic 16) Frontend/ParsingPass/src/dev/vale/parsing/PatternParser.scala:13 — PatternParser.parseParameter 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.
D1 · Cyclomatic Complexity · TemplexParser.parseArray (cyclomatic 16) · ×1
  • TemplexParser.parseArray (cyclomatic 16) Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala:14 — TemplexParser.parseArray 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.
D2 · Cognitive Complexity · ExpressionCompiler.evaluate (cognitive 149) · ×1
  • ExpressionCompiler.evaluate (cognitive 149) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:457 — ExpressionCompiler.evaluate has cognitive complexity 149 (threshold 15). Drivers by points: match/switch 33 (76 pts), if/else 40 (71 pts), boolean chains 2 (nesting depth added 74). 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.
D2 · Cognitive Complexity · CompilerRuleSolver.solveRule (cognitive 121) · ×1
  • CompilerRuleSolver.solveRule (cognitive 121) Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:557 — CompilerRuleSolver.solveRule has cognitive complexity 121 (threshold 15). Drivers by points: match/switch 28 (69 pts), if/else 29 (52 pts) (nesting depth added 64). 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.
D2 · Cognitive Complexity · FunctionScout.scoutFunction (cognitive 89) · ×1
  • FunctionScout.scoutFunction (cognitive 89) Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala:59 — FunctionScout.scoutFunction has cognitive complexity 89 (threshold 15). Drivers by points: match/switch 40 (57 pts), if/else 20 (31 pts), boolean chains 1 (nesting depth added 28). 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.
D2 · Cognitive Complexity · Compiler.evaluate (cognitive 85) · ×1
  • Compiler.evaluate (cognitive 85) Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:733 — Compiler.evaluate has cognitive complexity 85 (threshold 15). Drivers by points: match/switch 28 (67 pts), if/else 12 (13 pts), loops 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 41). 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.
D2 · Cognitive Complexity · ExpressionScout.scoutExpression (cognitive 69) · ×1
  • ExpressionScout.scoutExpression (cognitive 69) Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:235 — ExpressionScout.scoutExpression has cognitive complexity 69 (threshold 15). Drivers by points: match/switch 20 (43 pts), if/else 14 (24 pts), boolean chains 2 (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.
D2 · Cognitive Complexity · OverloadResolver.attemptCandidateBanner (cognitive 59) · ×1
  • OverloadResolver.attemptCandidateBanner (cognitive 59) Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:229 — OverloadResolver.attemptCandidateBanner has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 12 (49 pts), if/else 5 (10 pts) (nesting depth added 42). 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.
D2 · Cognitive Complexity · PatternParser.parsePattern (cognitive 49) · ×1
  • PatternParser.parsePattern (cognitive 49) Frontend/ParsingPass/src/dev/vale/parsing/PatternParser.scala:74 — PatternParser.parsePattern has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (32 pts), match/switch 10 (16 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Lexer.lexNumber (cognitive 46) · ×1
  • Lexer.lexNumber (cognitive 46) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:1215 — Lexer.lexNumber has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 3 (8 pts), boolean chains 5 (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.
D2 · Cognitive Complexity · CompilerRuleSolver.solveCallRule (cognitive 45) · ×1
  • CompilerRuleSolver.solveCallRule (cognitive 45) Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:1005 — CompilerRuleSolver.solveCallRule has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 7 (17 pts) (nesting depth added 26). 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.
D2 · Cognitive Complexity · Lexer.lexFunction (cognitive 38) · ×1
  • Lexer.lexFunction (cognitive 38) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:270 — Lexer.lexFunction has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 12 (28 pts), if/else 9, boolean chains 1 (nesting depth added 16). 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.
D2 · Cognitive Complexity · ExpressionHammer.translate (cognitive 35) · ×1
  • ExpressionHammer.translate (cognitive 35) Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:27 — ExpressionHammer.translate has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 11 (21 pts), if/else 11 (13 pts), boolean chains 1 (nesting depth added 12). 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.
D2 · Cognitive Complexity · ExpressionParser.parseSpreeStep (cognitive 30) · ×1
  • ExpressionParser.parseSpreeStep (cognitive 30) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1093 — ExpressionParser.parseSpreeStep has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 8 (14 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.
D2 · Cognitive Complexity · RuleScout.translateRulex (cognitive 30) · ×1
  • RuleScout.translateRulex (cognitive 30) Frontend/PostParsingPass/src/dev/vale/postparsing/rules/RuleScout.scala:30 — RuleScout.translateRulex has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 5 (11 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.
D2 · Cognitive Complexity · Parser.parseGenericParameter (cognitive 29) · ×1
  • Parser.parseGenericParameter (cognitive 29) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:23 — Parser.parseGenericParameter has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 11 (26 pts), if/else 3 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · StructCompilerCore.compileStruct (cognitive 27) · ×1
  • StructCompilerCore.compileStruct (cognitive 27) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerCore.scala:35 — StructCompilerCore.compileStruct has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 8 (13 pts) (nesting depth added 12). 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.
D2 · Cognitive Complexity · PassManager.build (cognitive 26) · ×1
  • PassManager.build (cognitive 26) Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala:198 — PassManager.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 5 (9 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.
D2 · Cognitive Complexity · RuneTypeSolver.solve (cognitive 26) · ×1
  • RuneTypeSolver.solve (cognitive 26) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:412 — RuneTypeSolver.solve has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 9, boolean chains 1, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TemplexScout.translateTemplex (cognitive 25) · ×1
  • TemplexScout.translateTemplex (cognitive 25) Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:65 — TemplexScout.translateTemplex has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (9 pts) (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · HigherTypingPass.explicifyLookups (cognitive 24) · ×1
  • HigherTypingPass.explicifyLookups (cognitive 24) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:47 — HigherTypingPass.explicifyLookups has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 6 (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.
D2 · Cognitive Complexity · LexAndExplore.lexAndExplore (cognitive 24) · ×1
  • LexAndExplore.lexAndExplore (cognitive 24) Frontend/LexingPass/src/dev/vale/lexing/LexAndExplore.scala:43 — LexAndExplore.lexAndExplore has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 2 (5 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ExpressionParser.parseStatement (cognitive 24) · ×1
  • ExpressionParser.parseStatement (cognitive 24) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:746 — ExpressionParser.parseStatement has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 12 (19 pts), if/else 5 (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.
D2 · Cognitive Complexity · TemplexParser.parseTemplexAtom (cognitive 24) · ×1
  • TemplexParser.parseTemplexAtom (cognitive 24) Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala:336 — TemplexParser.parseTemplexAtom has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 21 (22 pts), if/else 2 (nesting depth added 1). 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.
D2 · Cognitive Complexity · PassManager.parseOpts (cognitive 24) · ×1
  • PassManager.parseOpts (cognitive 24) Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala:70 — PassManager.parseOpts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 1, match/switch 1 (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.
D2 · Cognitive Complexity · Instantiator.translateRefExpr (cognitive 23) · ×1
  • Instantiator.translateRefExpr (cognitive 23) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:2006 — Instantiator.translateRefExpr has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 6 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Lexer.lexInterface (cognitive 23) · ×1
  • Lexer.lexInterface (cognitive 23) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:486 — Lexer.lexInterface has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 8, boolean chains 2, loops 1 (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.
D2 · Cognitive Complexity · ExpressionParser.parseExpressionDataElement (cognitive 23) · ×1
  • ExpressionParser.parseExpressionDataElement (cognitive 23) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1418 — ExpressionParser.parseExpressionDataElement has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 13 (17 pts), if/else 6 (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.
D2 · Cognitive Complexity · VonPrinter.printObjectSingleLine (cognitive 23) · ×1
  • VonPrinter.printObjectSingleLine (cognitive 23) Frontend/Von/src/dev/vale/von/VonPrinter.scala:215 — VonPrinter.printObjectSingleLine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VonPrinter.printArraySingleLine) 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.
D2 · Cognitive Complexity · VonPrinter.printArraySingleLine (cognitive 23) · ×1
  • VonPrinter.printArraySingleLine (cognitive 23) Frontend/Von/src/dev/vale/von/VonPrinter.scala:266 — VonPrinter.printArraySingleLine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VonPrinter.printObjectSingleLine) 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.
D2 · Cognitive Complexity · ExpressionParser.parseArray (cognitive 22) · ×1
  • ExpressionParser.parseArray (cognitive 22) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1729 — ExpressionParser.parseArray has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 7 (10 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Lexer.lexAttribute (cognitive 21) · ×1
  • Lexer.lexAttribute (cognitive 21) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:21 — Lexer.lexAttribute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (18 pts), match/switch 1 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Lexer.lexStringPart (cognitive 21) · ×1
  • Lexer.lexStringPart (cognitive 21) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:1129 — Lexer.lexStringPart has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · ExpressionParser.parseTupleOrSubExpression (cognitive 20) · ×1
  • ExpressionParser.parseTupleOrSubExpression (cognitive 20) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1372 — ExpressionParser.parseTupleOrSubExpression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 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.
D2 · Cognitive Complexity · PostParser.scoutGenericParameter (cognitive 20) · ×1
  • PostParser.scoutGenericParameter (cognitive 20) Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:245 — PostParser.scoutGenericParameter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 7 (10 pts) (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Solver.advance (cognitive 20) · ×1
  • Solver.advance (cognitive 20) Frontend/Solver/src/dev/vale/solver/Solver.scala:212 — Solver.advance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 5 (9 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.
D2 · Cognitive Complexity · ArrayCompiler.evaluateRuntimeSizedArrayFromCallable (cognitive 20) · ×1
  • ArrayCompiler.evaluateRuntimeSizedArrayFromCallable (cognitive 20) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:127 — ArrayCompiler.evaluateRuntimeSizedArrayFromCallable has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 5 (9 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.
D2 · Cognitive Complexity · TemplataCompiler.createPlaceholder (cognitive 20) · ×1
  • TemplataCompiler.createPlaceholder (cognitive 20) Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:1222 — TemplataCompiler.createPlaceholder has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 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.
D2 · Cognitive Complexity · FunctionCompilerCore.evaluateFunctionForHeader (cognitive 20) · ×1
  • FunctionCompilerCore.evaluateFunctionForHeader (cognitive 20) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerCore.scala:68 — FunctionCompilerCore.evaluateFunctionForHeader has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 9 (12 pts), if/else 6 (7 pts), boolean chains 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.
D2 · Cognitive Complexity · Lexer.lexStruct (cognitive 19) · ×1
  • Lexer.lexStruct (cognitive 19) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:386 — Lexer.lexStruct has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, match/switch 6 (9 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · ExpressionParser.parseAtom (cognitive 19) · ×1
  • ExpressionParser.parseAtom (cognitive 19) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:955 — ExpressionParser.parseAtom has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 11 (14 pts), if/else 5 (nesting depth added 3). 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.
D2 · Cognitive Complexity · Compiler.ensureDeepExports (cognitive 19) · ×1
  • Compiler.ensureDeepExports (cognitive 19) Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1482 — Compiler.ensureDeepExports has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Instantiator.translate (cognitive 18) · ×1
  • Instantiator.translate (cognitive 18) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:118 — Instantiator.translate has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 4, loops 1 (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.
D2 · Cognitive Complexity · RuneTypeSolver.solveRule (cognitive 18) · ×1
  • RuneTypeSolver.solveRule (cognitive 18) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:185 — RuneTypeSolver.solveRule has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 2 (3 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · BodyCompiler.evaluateFunctionBody (cognitive 18) · ×1
  • BodyCompiler.evaluateFunctionBody (cognitive 18) Frontend/TypingPass/src/dev/vale/typing/function/FunctionBodyCompiler.scala:165 — BodyCompiler.evaluateFunctionBody has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ExpressionParser.parseIfLadder (cognitive 17) · ×1
  • ExpressionParser.parseIfLadder (cognitive 17) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:388 — ExpressionParser.parseIfLadder has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 5, boolean chains 1, loops 1 (nesting depth added 3). 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.
D2 · Cognitive Complexity · ExpressionParser.parseBlockContents (cognitive 17) · ×1
  • ExpressionParser.parseBlockContents (cognitive 17) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:590 — ExpressionParser.parseBlockContents has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 6 (7 pts), loops 1 (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.
D2 · Cognitive Complexity · InferCompiler.checkResolvingConclusionsAndResolve (cognitive 17) · ×1
  • InferCompiler.checkResolvingConclusionsAndResolve (cognitive 17) Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:286 — InferCompiler.checkResolvingConclusionsAndResolve has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 11 (14 pts), if/else 3 (nesting depth added 3). 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.
D2 · Cognitive Complexity · BodyCompiler.declareAndEvaluateFunctionBody (cognitive 17) · ×1
  • BodyCompiler.declareAndEvaluateFunctionBody (cognitive 17) Frontend/TypingPass/src/dev/vale/typing/function/FunctionBodyCompiler.scala:61 — BodyCompiler.declareAndEvaluateFunctionBody has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 6). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CompilerRuleSolver.complexSolve (cognitive 17) · ×1
  • CompilerRuleSolver.complexSolve (cognitive 17) Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:358 — CompilerRuleSolver.complexSolve has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (12 pts), if/else 4 (5 pts) (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.
D2 · Cognitive Complexity · ExpressionParser.parseExpression (cognitive 16) · ×1
  • ExpressionParser.parseExpression (cognitive 16) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:845 — ExpressionParser.parseExpression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PassManager.main (cognitive 16) · ×1
  • PassManager.main (cognitive 16) Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala:365 — PassManager.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (7 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RuneTypeSolver.lookup (cognitive 16) · ×1
  • RuneTypeSolver.lookup (cognitive 16) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:360 — RuneTypeSolver.lookup has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 3 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D3 · God Classes · MethodTooLong · ×1
  • MethodTooLong: CompilerErrorHumanizer.humanize Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:26 — MethodTooLong — humanize runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D30 · Dependency Vulnerabilities · Medium advisory (unmaintained) · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Medium advisory (unsound) · ×1
  • REDACTED
D31 · IaC & Container Security · Medium IaC · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (62 shared lines) · ×1
  • Near-duplicate member pair (62 shared lines) ValeRuster/src/resolve.rs:20 — ValeRuster/src/resolve.rs:20-182 | ValeRuster/src/resolve_id.rs:11-137 — These two members are variants of one another: 62 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 · Near-duplicate member pair (24 shared lines) · ×1
  • Near-duplicate member pair (24 shared lines) Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:21 — Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:21-55 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:80-114 — These two members are variants of one another: 24 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (6 members, 50+ identical tokens) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:304 — Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:304-407 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:417-499 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:501-553 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:555-602 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:604-648 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:658-685 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:53 — Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:53-125 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:138-306 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:320-429 | Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala:125-189 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Edited copy of a member (83 corresponding lines) · ×1
  • Edited copy of a member (83 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:306 — Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:306-394 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:401-483 — These two members are one piece of code written twice and then edited apart: 83 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (75 corresponding lines) · ×1
  • Edited copy of a member (75 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:168 — Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:168-242 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:250-330 — These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (98 corresponding lines) · ×1
  • Edited copy of a member (98 corresponding lines) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:387 — Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:387-484 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:487-592 — These two members are one piece of code written twice and then edited apart: 98 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (60 corresponding lines) · ×1
  • Edited copy of a member (60 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1562 — Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1562-1621 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1631-1708 — These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (78 corresponding lines) · ×1
  • Edited copy of a member (78 corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:177 — Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:177-254 | Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:257-395 — These two members are one piece of code written twice and then edited apart: 78 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (61 corresponding lines) · ×1
  • Edited copy of a member (61 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:42 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:42-102 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:40-106 — These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 54+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 54+ corresponding lines) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:64 — Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:64-117 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:132-187 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:202-260 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (58 corresponding lines) · ×1
  • Edited copy of a member (58 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:114 — Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:114-171 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:181-240 — These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (40 corresponding lines) · ×1
  • Edited copy of a member (40 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:503 — Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:503-548 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:568-607 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 55+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 55+ corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:228 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:228-285 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:438-492 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:118-172 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 55 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (41 corresponding lines) · ×1
  • Edited copy of a member (41 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:126 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:126-167 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:177-217 — These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala:9 — Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala:9-35 | Frontend/CompileServer/src/dev/vale/compileserver/RunAction.scala:11-48 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (53 corresponding lines) · ×1
  • Edited copy of a member (53 corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:367 — Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:367-419 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:481-535 — These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (24 corresponding lines) · ×1
  • Edited copy of a member (24 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompiler.scala:191 — Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompiler.scala:191-220 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompiler.scala:231-254 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 23+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 23+ corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:25 — Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:25-53 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:61-89 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:97-119 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (30 corresponding lines) · ×1
  • Edited copy of a member (30 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:830 — Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:830-864 | Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:872-901 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 27+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 27+ corresponding lines) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:668 — Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:668-694 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:736-762 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:764-791 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 34+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 34+ corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala:265 — Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala:265-298 | Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala:300-333 | Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala:370-404 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 16+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 16+ corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:68 — Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:68-83 | Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:135-150 | Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:233-254 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 18+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 18+ corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1315 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1315-1332 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1334-1351 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1353-1370 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×1
  • Edited copy of a member (15 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerClosureOrLightLayer.scala:91 — Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerClosureOrLightLayer.scala:91-108 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerClosureOrLightLayer.scala:121-135 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×1
  • Edited copy of a member (19 corresponding lines) Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:62 — Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:62-80 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:90-108 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (31 corresponding lines) · ×1
  • Edited copy of a member (31 corresponding lines) Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:267 — Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:267-298 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:300-330 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 14+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 14+ corresponding lines) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:821 — Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:821-835 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:951-964 | Frontend/TypingPass/src/dev/vale/typing/Compilation.scala:60-77 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 15+ corresponding lines) Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:197 — Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:197-211 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:216-232 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:237-253 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 10+ corresponding lines) Frontend/TypingPass/src/dev/vale/typing/macros/SameInstanceMacro.scala:28 — Frontend/TypingPass/src/dev/vale/typing/macros/SameInstanceMacro.scala:28-37 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAMutableCapacityMacro.scala:32-48 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAMutablePopMacro.scala:31-42 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAMutablePushMacro.scala:32-44 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (54 lines × 2) · ×1
  • Duplicated block (54 lines × 2) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:398 — Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:398-451 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:498-551 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:398` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (5–45 lines × 4) · ×1
  • Duplicated block (5–45 lines × 4) Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:88 — Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:88-92 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:168-212 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:361-401 | Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala:148-152 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:88` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (38–39 lines × 2) · ×1
  • Duplicated block (38–39 lines × 2) Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:54 — Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:54-92 | Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:119-156 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:54` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (33 lines × 2) · ×1
  • Duplicated block (33 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:195 — Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:195-227 | Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:275-307 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:195` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (21–22 lines × 3) · ×1
  • Duplicated block (21–22 lines × 3) Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:181 — Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:181-202 | Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:261-282 | Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:402-422 — 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.
D4 · Code Duplication · Duplicated block (19–20 lines × 2) · ×1
  • Duplicated block (19–20 lines × 2) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:208 — Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:208-227 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:294-312 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:208` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:313` calls `lookupStruct`, `vassert`, `contains` and `Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:228` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (15–18 lines × 2) · ×1
  • Duplicated block (15–18 lines × 2) Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:137 — Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:137-154 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:209-223 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAImmutableNewMacro.scala:40 — Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAImmutableNewMacro.scala:40-56 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAMutableNewMacro.scala:39-55 — 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.
D4 · Code Duplication · Duplicated block (15–16 lines × 4) · ×1
  • Duplicated block (15–16 lines × 4) Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:177 — Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:177-192 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:211-226 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:263-278 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:297-311 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:194` calls `intern`, `ClosureParamNameT` and `Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:228` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (32 lines × 2) · ×1
  • Duplicated block (32 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:432 — Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:432-463 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:465-496 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:432` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • Duplicated block (15 lines × 3) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:676 — Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:676-690 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:744-758 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:773-787 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:771` calls `advance` and `Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:674` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (14–15 lines × 2) · ×1
  • Duplicated block (14–15 lines × 2) Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:139 — Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:139-153 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:168-181 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (14 lines × 3) · ×1
  • Duplicated block (14 lines × 3) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:236 — Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:236-249 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:421-434 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:521-534 — 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.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:672 — Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:672-684 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:704-716 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:740-752 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:700` calls `peek`, `Ok` and `Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:670` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (12 lines × 6) · ×1
  • Duplicated block (12 lines × 6) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:307 — Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:307-318 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:420-431 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:504-515 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:560-571 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:607-618 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:659-670 — 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.
D4 · Code Duplication · Duplicated block (18–19 lines × 2) · ×1
  • Duplicated block (18–19 lines × 2) Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:82 — Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:82-100 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:166-183 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:82` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (4–10 lines × 3) · ×1
  • Duplicated block (4–10 lines × 3) Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:193 — Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:193-202 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:440-443 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:573-582 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:193` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9 lines × 4) · ×1
  • Duplicated block (9 lines × 4) Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:105 — Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:105-113 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:207-215 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:302-310 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:469-477 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:105` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1
  • Duplicated block (8 lines × 4) Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467 — Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467-475 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:530-537 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:583-590 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:624-631 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:528` calls `put`, `Some` and `Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:581` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×1
  • Duplicated block (6–7 lines × 2) Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:899 — Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:899-905 | Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala:94-99 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:899` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (4–7 lines × 3) · ×1
  • Duplicated block (4–7 lines × 3) Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:233 — Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:233-239 | Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:254-260 | Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:273-276 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:233` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (151 lines × 2) · ×1
  • Duplicated block (151 lines × 2) Frontend/LexingPass/src/dev/vale/lexing/ast.scala:6 — Frontend/LexingPass/src/dev/vale/lexing/ast.scala:6-156 | Frontend/LexingPass/src/dev/vale/lexing/errors.scala:9-177 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/LexingPass/src/dev/vale/lexing/ast.scala:6` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (6 lines × 4) · ×1
  • Duplicated block (6 lines × 4) Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala:458 — Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala:458-463 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:34-39 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:96-101 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:552-557 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala:457` calls `_hashCode`, `hashCode` and `Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:550` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:36 — Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:36-41 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:95-100 | Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:199-204 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:36` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:34` calls `CallSiteCoordIsaSR`, `Vector`, `DefinitionCoordIsaSR` and `Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:94` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×1
  • Duplicated block (20 lines × 2) ValeRuster/src/resolve.rs:84 — ValeRuster/src/resolve.rs:84-103 | ValeRuster/src/resolve_id.rs:70-89 — before extracting anything, compare `ValeRuster/src/resolve.rs` and `ValeRuster/src/resolve_id.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/resolve.rs:84` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (13–17 lines × 3) · ×1
  • Duplicated block (13–17 lines × 3) ValeRuster/src/main.rs:1448 — ValeRuster/src/main.rs:1448-1461 | ValeRuster/src/main.rs:1487-1503 | ValeRuster/src/main.rs:1533-1545 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/main.rs:1448` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `ValeRuster/src/main.rs:1447` calls `Impl` and `ValeRuster/src/main.rs:1486` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8–10 lines × 2) · ×1
  • Duplicated block (8–10 lines × 2) ValeRuster/src/resolve.rs:22 — ValeRuster/src/resolve.rs:22-29 | ValeRuster/src/resolve_id.rs:13-22 — before extracting anything, compare `ValeRuster/src/resolve.rs` and `ValeRuster/src/resolve_id.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/resolve.rs:22` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) ValeRuster/src/main.rs:355 — ValeRuster/src/main.rs:355-362 | ValeRuster/src/main.rs:503-509 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `ValeRuster/src/main.rs:355` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Members sharing a duplicated core (20 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (20 members, 50+ identical tokens) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:194 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:194-203 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:205-214 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:216-225 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:227-240 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:242-251 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:253-262 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:264-273 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:275-284 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:286-295 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:297-306 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:326-335 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:337-346 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:348-357 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:366-379 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:381-390 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:392-401 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:403-412 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:414-423 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:425-434 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:436-445 — These 20 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 20 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 20 times.
D4 · Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (7 members, 50+ identical tokens) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:15 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:15-24 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:26-35 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:37-46 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:48-57 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:77-86 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:88-97 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:99-108 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
D4 · Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 11+ corresponding lines) Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:186 — Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:186-196 | Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:202-213 | Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:219-231 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 10+ corresponding lines) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:122 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:122-131 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:133-142 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:144-153 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (8–14 lines × 3) · ×1
  • Duplicated block (8–14 lines × 3) Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:444 — Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:444-457 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:459-472 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:473-480 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:444` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (5 lines × 20) · ×1
  • Duplicated block (5 lines × 20) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:195 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:195-199 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:206-210 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:217-221 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:228-232 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:243-247 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:254-258 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:265-269 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:276-280 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:287-291 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:298-302 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:327-331 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:338-342 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:349-353 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:367-371 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:382-386 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:393-397 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:404-408 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:415-419 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:426-430 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:437-441 — all 20 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:195` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (5 lines × 7) · ×1
  • Duplicated block (5 lines × 7) Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:16 — Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:16-20 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:27-31 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:38-42 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:49-53 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:78-82 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:89-93 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:100-104 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:16` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
Minor — 21 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×9
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCounter.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/templata.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/citizens.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
X10 · Duplicated predicate · Duplicated predicate · ×4
  • Duplicated predicate ValeRuster/src/resolve.rs:89 — `path.path[0] == "core" && path.path[1] == "macros"` appears character-identically in 2 files — ValeRuster/src/resolve.rs, ValeRuster/src/resolve_id.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 Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:136 — `name == that.name && virtuality == that.virtuality && tyype == that.tyype` appears character-identically in 2 files — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala, Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala. 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 Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala:25 — `packageCoord == thatPackageCoord && initSteps == thatInitSteps && localName == thatLast` appears character-identically in 2 files — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala, Frontend/TypingPass/src/dev/vale/typing/names/names.scala. 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 Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:84 — `subCitizen == thatStruct && superInterface == thatInterface` appears character-identically in 2 files — Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala, Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala. 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.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found ValeRuster/src/main.rs:1 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `ValeRuster/src/main.rs` makes this repository a deployable product (line 1).
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `Frontend` (58065 LoC, 1883 module-visible types across 35 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 9 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCounter.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/templata.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala (and 1 more) (11 orphaned 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 184 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • 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.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:6 — No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
X5 · Nullable reference types · Scala's null is not held to the type system everywhere · ×1
  • Scala's null is not held to the type system everywhere — No build over this repository's 169 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
Minor — 4 finding(s)
D12 · Dependency Hygiene · Outdated · ×4
  • Outdated: anyhow — `anyhow` is locked at 1.0.83 but 1.0.104 is the current stable release on crates.io, and it already satisfies the `"1.0.66"` requirement declared in ValeRuster/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p anyhow` and commit the updated REDACTED.
  • Outdated: clap — `clap` is locked at 4.5.4 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4.5.4"` requirement declared in ValeRuster/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
  • Outdated: regex — `regex` is locked at 1.10.4 but 1.13.1 is the current stable release on crates.io, and it already satisfies the `"1.10.4"` requirement declared in ValeRuster/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p regex` and commit the updated REDACTED.
  • Outdated: serde_json — `serde_json` is locked at 1.0.117 but 1.0.154 is the current stable release on crates.io, and it already satisfies the `"1.0.117"` requirement declared in ValeRuster/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde_json` 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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-b85d735c81064dc29c87224315bd263f/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-b85d735c81064dc29c87224315bd263f/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .25artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .2artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .6artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—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.0—
D37 · Vulnerability-disclosure Policydisclosure—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.0—
D40 · Network Egress Confinementruntime-hardening—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.0—
D41 · Kernel & Syscall Confinementruntime-hardening—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.0—
D42 · Runtime Threat Enforcementruntime-hardening—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.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1d8e6-e8ce-728c-bc92-4185fecaebd6 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

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.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md