Public report of com-lihaoyi/mill, 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 reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 14 November 2026, 07:11 UTC · Survey ID cd_b4343e35b09d43b395aeb877cb2ff9c6
com-lihaoyi/mill
Measured 14 November 2026, 07:10 UTC, at code version 9a3aabe
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
Up 1 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 96,507 lines of product code in 77 projects, tests not counted · Estimated rebuild effort: about 1.1 person-years · Weakest lens: Accessibility, 36
Findings by how serious they are
50 critical541 serious51 minor
15 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 07:10 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 ▸
60of 60 dimensions measured by tools.
630of 642 findings point to an exact file and line, so you can open each one in the code. The other 12 concern the repository as a whole, such as missing documentation.
60dimensions across 7 lenses, read from 96,507 lines of product code in 77 projects.
com-lihaoyi/mill falls short of our standard for production, held back most by its Accessibility lens, the interface's usability with a keyboard or assistive technology. It scores 49 out of 100 and is rated Weak, and 44 of its 50 critical findings are security problems in the build pipeline and in its automatic dependency updates.
Accessibility, at 36, is the weakest lens and counts most in the score. The best first step is adding text alternatives, worth about 10 points. Fixing focus, motion and contrast comes next, worth about 7 points. Raising Accessibility to 70 would lift the score to about 61.
Twenty-eight pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Ten pipeline steps put outside input straight into a shell command, so an attacker can run commands in the build pipeline. Pinning each tool to an exact version and passing outside input through environment variables would close both risks. Setting a waiting period for automatic updates would fix the four automatic dependency updates that take new releases at once, and the pipeline step that runs a download without checking it needs each download checked against a known checksum first. The two buttons or links with no name need a name, even when they only show an icon.
The product code is 96,507 lines, about €160,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Accessibility rose from 36 to 70, the lowest score rated Strong, the score would rise from 49 to about 61.
Code composition: what the lines of code are
Product code 65%Tests 35%
New since the last survey: 108 findings
These 108 critical or serious findings weren't in the previous survey, on 26 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Code Duplication · Edited copy of a member (26 corresponding lines) libs/javalib/src/mill/javalib/PublishModule.scala
Code Duplication · Edited copy of a member (53 corresponding lines) libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala
Code Duplication · Edited copy of a member (27 corresponding lines) libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala
Code Duplication · Edited copy of a member (25 corresponding lines) libs/javalib/src/mill/javalib/NativeImageModule.scala
Code Duplication · Edited copy of a member (33 corresponding lines) libs/groovylib/worker/src/mill/groovylib/worker/impl/GroovyWorkerImpl.scala
Code Duplication · Edited copy of a member (36 corresponding lines) testkit/src/mill/testkit/ExampleTester.scala
Code Duplication · Edited copy of a member (16 corresponding lines) core/internal/src/mill/internal/SpanningForest.scala
Code Duplication · Edited copy of a member (18 corresponding lines) libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala
Code Duplication · Edited copy of a member (24 corresponding lines) libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala
Code Duplication · Edited copy of a member (21 corresponding lines) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala
Code Duplication · Edited copy of a member (19 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidLibModule.scala
Code Duplication · Edited copy of a member (18 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidModule.scala
Code Duplication · Edited copy of a member (19 corresponding lines) libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JsCompileImpl.scala
Code Duplication · Edited copies of one member (3 members, 22+ corresponding lines) libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala
Code Duplication · Edited copy of a member (21 corresponding lines) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala
Code Duplication · Edited copy of a member (20 corresponding lines) libs/groovylib/src/mill/groovylib/GroovyWorkerManager.scala
Code Duplication · Edited copy of a member (23 corresponding lines) example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala
Code Duplication · Edited copy of a member (10 corresponding lines) contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala
Code Duplication · Edited copy of a member (13 corresponding lines) runner/bsp/worker/src/mill/bsp/worker/Endpoints.scala
Code Duplication · Edited copy of a member (14 corresponding lines) libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala
Code Duplication · Edited copy of a member (12 corresponding lines) libs/init/sbt/exportplugin/src/mill/main/sbt/ExportBuildPlugin.scala
Code Duplication · Edited copy of a member (20 corresponding lines) core/api/java11/src/mill/api/internal/Mirrors.scala
Code Duplication · Edited copy of a member (16 corresponding lines) libs/javalib/src/mill/javalib/Lib.scala
Code Duplication · Edited copy of a member (22 corresponding lines) libs/javalib/src/mill/javalib/PublishModule.scala
Code Duplication · Edited copy of a member (17 corresponding lines) libs/javalib/api/src/mill/javalib/api/internal/InternalJvmWorkerApi.scala
Code Duplication · Edited copy of a member (15 corresponding lines) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala
Code Duplication · Edited copy of a member (14 corresponding lines) libs/scalajslib/config/src/mill/scalajslib/config/worker/ScalaJSConfigWorker.scala
Code Duplication · Edited copy of a member (10 corresponding lines) libs/javalib/src/mill/javalib/dependency/versions/Version.scala
Code Duplication · Edited copy of a member (13 corresponding lines) libs/util/src/mill/util/MainModule.scala
Code Duplication · Edited copy of a member (15 corresponding lines) libs/javalib/src/mill/javalib/CoursierModule.scala
Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) libs/androidlib/src/mill/androidlib/AndroidAppModule.scala
Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala
Code Duplication · Edited copy of a member (23 corresponding lines) libs/util/java11/src/mill/util/Jvm.scala
Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala
Code Duplication · Edited copy of a member (19 corresponding lines) core/api/src/mill/api/Task.scala
Code Duplication · Edited copy of a member (13 corresponding lines) core/resolve/src/mill/resolve/ResolveNotFoundHandler.scala
Code Duplication · Edited copy of a member (17 corresponding lines) libs/scalajslib/worker/1/src/mill/scalajslib/worker/ScalaJSWorkerImpl.scala
Code Duplication · Edited copy of a member (13 corresponding lines) libs/javalib/src/mill/javalib/PublishModule.scala
Code Duplication · Edited copies of one member (3 members, 12+ corresponding lines) libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala
Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) libs/pythonlib/src/mill/pythonlib/RuffModule.scala
Code Duplication · Edited copy of a member (13 corresponding lines) libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala
Code Duplication · Edited copies of one member (3 members, 14+ corresponding lines) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala
Code Duplication · Edited copy of a member (8 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidAppModule.scala
Code Duplication · Edited copy of a member (9 corresponding lines) libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala
Code Duplication · Edited copy of a member (11 corresponding lines) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala
Code Duplication · Edited copy of a member (9 corresponding lines) contrib/codeartifact/src/mill/contrib/codeartifact/CodeArtifactPublisher.scala
Code Duplication · Edited copy of a member (4 corresponding lines) core/api/src/mill/api/internal/ExpandBraces.scala
Code Duplication · Edited copy of a member (5 corresponding lines) libs/javalib/src/mill/javalib/JavaModule.scala
Code Duplication · Edited copy of a member (6 corresponding lines) libs/javalib/src/mill/javalib/SemanticDbJavaModule.scala
Code Duplication · Edited copy of a member (6 corresponding lines) libs/scalajslib/worker/1/src/mill/scalajslib/worker/jsenv/ExoegoJsDomNodeJs.scala
Code Duplication · Edited copy of a member (11 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidAppModule.scala
Code Duplication · Edited copy of a member (7 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidAppModule.scala
Code Duplication · Edited copy of a member (6 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidLibModule.scala
Code Duplication · Edited copies of one member (3 members, 6+ corresponding lines) libs/javalib/src/mill/javalib/AssemblyModule.scala
Code Duplication · Edited copy of a member (4 corresponding lines) libs/javalib/src/mill/javalib/MavenWorkerSupport.scala
Code Duplication · Edited copy of a member (8 corresponding lines) libs/groovylib/src/mill/groovylib/GroovyModule.scala
Code Duplication · Edited copy of a member (4 corresponding lines) libs/javalib/src/mill/javalib/MavenWorkerSupport.scala
Code Duplication · Edited copy of a member (69 corresponding lines) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt
Code Duplication · Edited copy of a member (31 corresponding lines) example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt
Code Duplication · Edited copy of a member (16 corresponding lines) example/extending/jvmcode/4-module-classloader/bar/src/Bar.java
Code Duplication · Edited copy of a member (26 corresponding lines) libs/javascriptlib/src/mill/javascriptlib/TestModule.scala
Code Duplication · Edited copies of one member (4 members, 21+ corresponding lines) example/scalalib/web/2-todo-webapp/src/WebApp.scala
Code Duplication · Edited copy of a member (25 corresponding lines) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt
Code Duplication · Edited copy of a member (11 corresponding lines) example/scalalib/module/1-basic-config/custom-src/Foo2.scala
Code Duplication · Edited copy of a member (8 corresponding lines) example/javalib/basic/2-module-deps/foo/src/foo/Foo.java
Code Duplication · Edited copy of a member (17 corresponding lines) libs/javascriptlib/src/mill/javascriptlib/TestModule.scala
Code Duplication · Edited copy of a member (12 corresponding lines) example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala
Code Duplication · Edited copy of a member (15 corresponding lines) example/kotlinlib/module/4-programmable-config/custom-src/Foo2.kt
Code Duplication · Edited copy of a member (5 corresponding lines) example/javalib/basic/9-realistic/foo/src/foo/Foo.java
Code Duplication · Edited copy of a member (6 corresponding lines) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt
Code Duplication · Edited copy of a member (6 corresponding lines) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt
Code Duplication · Edited copy of a member (8 corresponding lines) example/javalib/basic/6-custom-build-logic/foo/src/foo/Foo.java
Code Duplication · Edited copy of a member (7 corresponding lines) example/javalib/springboot/3-todo-spring-boot/src/com/example/todoitem/web/TodoItemController.java
Code Duplication · Edited copy of a member (4 corresponding lines) example/fundamentals/modules/8-diy-java-modules/foo/src/Foo.java
Code Duplication · Edited copies of one member (3 members, 4+ corresponding lines) example/cli/builtins/1-builtin-commands/foo/src/foo/Foo.java
Code Duplication · Edited copy of a member (5 corresponding lines) example/kotlinlib/basic/9-realistic/foo/src/foo/Foo.kt
Code Duplication · Edited copy of a member (5 corresponding lines) example/scalalib/basic/9-realistic/foo/src/Foo.scala
Code Duplication · Edited copies of one member (4 members, 4+ corresponding lines) example/scalalib/web/2-todo-webapp/src/WebApp.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: 70 findings
These 70 critical or serious findings were in the previous survey, on 26 October 2026, and are gone from this one.
Exception handling · Swallowed exception (caught, then discarded) core/exec/src/mill/exec/TaskCacheEntry.scala
Exception handling · Swallowed exception (caught, then discarded) core/exec/src/mill/exec/TaskCacheEntry.scala
Exception handling · Swallowed exception (caught, then discarded) core/constants/src/mill/constants/InputPumper.java
Exception handling · Swallowed exception (caught, then discarded) core/api/src/mill/api/internal/Reflect.scala
Exception handling · Swallowed exception (caught, then discarded) core/api/src/mill/api/internal/WatchSig.scala
A11y enforcement · Accessibility enforcement below the top rung
Rebuild cost: about €160,000 · Estimate
Cost to rebuild
€55,000 to €280,000, for 913 to 2,896 hours of work, about 1.1 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 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.
Size
Medium: 96,507 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Raises the score by about 10 points · Medium effort · Text alternatives
2
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Raises the score by about 5 points · Medium effort · Forms & labels
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 €160,000 to build again, about 1.1 person-years of work. Its weakest lens is Accessibility, at 36 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video. Of all the actions in this report, it raises the score most for the work it takes: about 10 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.5 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 27,619 lines over the last 90 days, which is about 112,010 lines a year. At that pace, the extra work comes to an estimated 5.6 to 37.3 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
460 modules, with 611 dependencies between them. 6 loops run through 19 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 420 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.
api.daemon.internal.idea uses api.daemon, so a change to api.daemon can break api.daemon.internal.idea, while a change to api.daemon.internal.idea can't break api.daemon.
Position
Below the diagonal: api.daemon.internal.idea uses a module listed above it, which is the healthy direction.
9→10 api.daemon.internal.idea uses api.daemon.internalpart of a loop✕
Connections
3 pairs of types, where a type in api.daemon.internal.idea uses a type in api.daemon.internal.
api.daemon.internal.idea uses api.daemon.internal, so a change to api.daemon.internal can break api.daemon.internal.idea, while a change to api.daemon.internal.idea can't break api.daemon.internal.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
api.daemon.internal uses api.daemon, so a change to api.daemon can break api.daemon.internal, while a change to api.daemon.internal can't break api.daemon.
Position
Below the diagonal: api.daemon.internal uses a module listed above it, which is the healthy direction.
api.daemon.internal uses api.daemon.internal.idea, so a change to api.daemon.internal.idea can break api.daemon.internal, while a change to api.daemon.internal can't break api.daemon.internal.idea.
Position
Below the diagonal: api.daemon.internal uses a module listed above it, which is the healthy direction.
api.daemon.internal.bsp uses api.daemon.internal, so a change to api.daemon.internal can break api.daemon.internal.bsp, while a change to api.daemon.internal.bsp can't break api.daemon.internal.
Position
Below the diagonal: api.daemon.internal.bsp uses a module listed above it, which is the healthy direction.
api.internal uses api.daemon.internal, so a change to api.daemon.internal can break api.internal, while a change to api.internal can't break api.daemon.internal.
Position
Below the diagonal: api.internal uses a module listed above it, which is the healthy direction.
javalib.api.internal uses api.daemon, so a change to api.daemon can break javalib.api.internal, while a change to javalib.api.internal can't break api.daemon.
Position
Below the diagonal: javalib.api.internal uses a module listed above it, which is the healthy direction.
javalib.api.internal uses api.daemon.internal, so a change to api.daemon.internal can break javalib.api.internal, while a change to javalib.api.internal can't break api.daemon.internal.
Position
Below the diagonal: javalib.api.internal uses a module listed above it, which is the healthy direction.
javalib.api.internal uses javalib.api, so a change to javalib.api can break javalib.api.internal, while a change to javalib.api.internal can't break javalib.api.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
javalib.bsp uses api.daemon.internal, so a change to api.daemon.internal can break javalib.bsp, while a change to javalib.bsp can't break api.daemon.internal.
Position
Below the diagonal: javalib.bsp uses a module listed above it, which is the healthy direction.
javalib.bsp uses api.daemon.internal.bsp, so a change to api.daemon.internal.bsp can break javalib.bsp, while a change to javalib.bsp can't break api.daemon.internal.bsp.
Position
Below the diagonal: javalib.bsp uses a module listed above it, which is the healthy direction.
javalib.eclipse uses api.daemon.internal, so a change to api.daemon.internal can break javalib.eclipse, while a change to javalib.eclipse can't break api.daemon.internal.
Position
Below the diagonal: javalib.eclipse uses a module listed above it, which is the healthy direction.
kotlinlib.worker.api uses api.daemon, so a change to api.daemon can break kotlinlib.worker.api, while a change to kotlinlib.worker.api can't break api.daemon.
Position
Below the diagonal: kotlinlib.worker.api uses a module listed above it, which is the healthy direction.
scalajslib uses api.daemon.internal, so a change to api.daemon.internal can break scalajslib, while a change to scalajslib can't break api.daemon.internal.
Position
Below the diagonal: scalajslib uses a module listed above it, which is the healthy direction.
daemon uses api.daemon.internal.bsp, so a change to api.daemon.internal.bsp can break daemon, while a change to daemon can't break api.daemon.internal.bsp.
Position
Below the diagonal: daemon uses a module listed above it, which is the healthy direction.
javalib.api uses javalib.api.internal, so a change to javalib.api.internal can break javalib.api, while a change to javalib.api can't break javalib.api.internal.
Position
Below the diagonal: javalib.api uses a module listed above it, which is the healthy direction.
scalajslib.config uses scalajslib.worker.api, so a change to scalajslib.worker.api can break scalajslib.config, while a change to scalajslib.config can't break scalajslib.worker.api.
Position
Below the diagonal: scalajslib.config uses a module listed above it, which is the healthy direction.
javalib.zinc uses api.daemon.internal, so a change to api.daemon.internal can break javalib.zinc, while a change to javalib.zinc can't break api.daemon.internal.
Position
Below the diagonal: javalib.zinc uses a module listed above it, which is the healthy direction.
javalib.zinc uses javalib.api.internal, so a change to javalib.api.internal can break javalib.zinc, while a change to javalib.zinc can't break javalib.api.internal.
Position
Below the diagonal: javalib.zinc uses a module listed above it, which is the healthy direction.
javalib uses api.daemon.internal.idea, so a change to api.daemon.internal.idea can break javalib, while a change to javalib can't break api.daemon.internal.idea.
Position
Below the diagonal: javalib uses a module listed above it, which is the healthy direction.
javalib uses api.daemon.internal.bsp, so a change to api.daemon.internal.bsp can break javalib, while a change to javalib can't break api.daemon.internal.bsp.
Position
Below the diagonal: javalib uses a module listed above it, which is the healthy direction.
javalib.worker uses api.daemon.internal, so a change to api.daemon.internal can break javalib.worker, while a change to javalib.worker can't break api.daemon.internal.
Position
Below the diagonal: javalib.worker uses a module listed above it, which is the healthy direction.
javalib.worker uses javalib.api.internal, so a change to javalib.api.internal can break javalib.worker, while a change to javalib.worker can't break javalib.api.internal.
Position
Below the diagonal: javalib.worker uses a module listed above it, which is the healthy direction.
groovylib uses api.daemon.internal, so a change to api.daemon.internal can break groovylib, while a change to groovylib can't break api.daemon.internal.
Position
Below the diagonal: groovylib uses a module listed above it, which is the healthy direction.
groovylib uses api.daemon.internal.bsp, so a change to api.daemon.internal.bsp can break groovylib, while a change to groovylib can't break api.daemon.internal.bsp.
Position
Below the diagonal: groovylib uses a module listed above it, which is the healthy direction.
groovylib uses javalib.api.internal, so a change to javalib.api.internal can break groovylib, while a change to groovylib can't break javalib.api.internal.
Position
Below the diagonal: groovylib uses a module listed above it, which is the healthy direction.
kotlinlib uses api.daemon.internal.idea, so a change to api.daemon.internal.idea can break kotlinlib, while a change to kotlinlib can't break api.daemon.internal.idea.
Position
Below the diagonal: kotlinlib uses a module listed above it, which is the healthy direction.
kotlinlib uses api.daemon.internal, so a change to api.daemon.internal can break kotlinlib, while a change to kotlinlib can't break api.daemon.internal.
Position
Below the diagonal: kotlinlib uses a module listed above it, which is the healthy direction.
kotlinlib uses api.daemon.internal.bsp, so a change to api.daemon.internal.bsp can break kotlinlib, while a change to kotlinlib can't break api.daemon.internal.bsp.
Position
Below the diagonal: kotlinlib uses a module listed above it, which is the healthy direction.
kotlinlib uses javalib.api.internal, so a change to javalib.api.internal can break kotlinlib, while a change to kotlinlib can't break javalib.api.internal.
Position
Below the diagonal: kotlinlib uses a module listed above it, which is the healthy direction.
kotlinlib uses kotlinlib.worker.api, so a change to kotlinlib.worker.api can break kotlinlib, while a change to kotlinlib can't break kotlinlib.worker.api.
Position
Below the diagonal: kotlinlib uses a module listed above it, which is the healthy direction.
scalalib uses api.daemon.internal.bsp, so a change to api.daemon.internal.bsp can break scalalib, while a change to scalalib can't break api.daemon.internal.bsp.
Position
Below the diagonal: scalalib uses a module listed above it, which is the healthy direction.
androidlib uses api.daemon.internal.bsp, so a change to api.daemon.internal.bsp can break androidlib, while a change to androidlib can't break api.daemon.internal.bsp.
Position
Below the diagonal: androidlib uses a module listed above it, which is the healthy direction.
kotlinlib.js uses kotlinlib.worker.api, so a change to kotlinlib.worker.api can break kotlinlib.js, while a change to kotlinlib.js can't break kotlinlib.worker.api.
Position
Below the diagonal: kotlinlib.js uses a module listed above it, which is the healthy direction.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
55
High / Critical
A03:2025 — Software Supply Chain Failures
11
Medium
Roadmap
Top priorities: Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video; Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1; Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
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.
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.
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 — 50
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 — 541
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 — 51
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 15
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 60 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 60 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 630 of 642 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.scala, .java, .kt, .py, .ts, .tsx) 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.
D10 Test 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. The 63 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 1,053 test source file(s) (.scala, .java, .kt, .py) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — 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, .java, .kt, .py, .ts, .tsx) and this repository declares an sbt build (libs/init/sbt/test/resources/scala-seed-project, 6 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.
D12 Dependency Hygiene — 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. Not scored — a Gradle build resolved 173 artifact(s) across its subprojects (88 behind a shipped release, reported), but the currency signal was not established over the whole graph, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
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 (build.mill), 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. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D26 Project Cohesion — 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. Project size and spread are measured over build units (a .NET project, a Maven or Gradle module, an npm, Deno or JSR package, a Go module, a Cargo crate, a Python, Composer, Bundler, RubyGems, Mix, rebar3, sbt, SwiftPM or pub package, an OTP application, an Xcode project or XcodeGen spec, or a checkout that declares no build at all) whose source a code model reads. This repository's production source is in a language no model reads, or in units whose build tool D26 does not recognise. That is a gap in this analyzer's language reach — not a finding that the repository's projects are cohesive.
D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `contrib/docker/src/mill/contrib/docker/JibTypes.scala`, `contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckJavaModule.scala`, `contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckModule.scala`, `contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckWorker.scala`, `contrib/scalapblib/src/mill/contrib/scalapblib/Generator.scala`, … (+136 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
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 repository also uses Micronaut and Spring (Scala), whose singleton and shorter-lived bindings can capture one another the same way, but this check does not read them yet. That is a gap in this analyzer's language reach — not a finding that those bindings are free of it.
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'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.
AX2 Stateful singletons — 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. Those languages run requests on shared-memory threads, so a shared instance mutated without a lock is the same defect this card counts in C#, Java, Kotlin, Python, Go, Swift, Scala, Ruby and F#, but their singleton shapes are not read yet. That is a gap in this analyzer's language reach — not a finding that the code is free of it.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: a native UI project (libs/init/gradle/test/resources/android-hello-kotlin-gradle8/app/src/main/AndroidManifest.xml). The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
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.
C3 Audit Trail — 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. 'io.getquill' is imported (integration/feature/zinc-incremental-compilation/resources/app/src/main/scala/App.scala:3), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C4 Data Retention — 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. 'io.getquill' is imported (integration/feature/zinc-incremental-compilation/resources/app/src/main/scala/App.scala:3), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C5 Data-Subject Rights — 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. 'io.getquill' is imported (integration/feature/zinc-incremental-compilation/resources/app/src/main/scala/App.scala:3), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
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.
X3 Exception handling — 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. 34 further occurrence(s) are not listed individually; the score already reflects all 74.
Repo exclusion declarations: 8 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
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.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
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.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
35 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was ExportBuildPlugin.exportProject at 70. A further 2 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 VersionOrdering.compare at 21 — they are counted neither in the figure above nor in this dimension's score. 2 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: libs/javalib/src/mill/javalib/dependency/versions/Version.scala (VersionOrdering.compare at 21), runner/daemon/src/mill/daemon/VersionCheck.java (VersionCheck.check at 17). 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.
+ 30 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with ExportBuildPlugin.exportProject (cyclomatic 70). — Refactoring it lifts Cyclomatic Complexity from 6.4 to about 6.5/10.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 72 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 7 bodies over 60 down to 60 or less in Cognitive Complexity — start with ExportBuildPlugin.exportProject (cognitive 133), MillMain0.main0 (cognitive 107), ResolveCore.resolve (cognitive 83). — 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 7 together lifts Cognitive Complexity from 5.7 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.
Do you agree with this assessment?
D3 · God Classes8.9 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 15 FileTooLong finding(s) in God Classes — start with JavaModule.scala, Jvm.scala, MillBuildBootstrap.scala. — One of this dimension's main actionable groups (15 warning-level).
Resolve the 13 TooManyMethods finding(s) in God Classes — start with JavaModule.scala, AndroidModule.scala, TypeScriptModule.scala. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 2 MethodTooLong finding(s) in God Classes — start with MillMain0.scala, Execution.scala. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
97 duplicated block group(s) detected. 4.7 % of the production lines (4,498 of 96,507) are in a reported copy. A further 87 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 78 of the 184 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.
+ 88 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 10 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with WebApp.scala (2), BuildGenScala.scala, TypeScriptModule.scala. — One of this dimension's main actionable groups (10 warning-level).
Resolve the 8 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with ScalaJSConfigModule.scala (2), FlywayModule.scala, Util.scala. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 5 Edited copy of a member (13 corresponding lines) finding(s) in Code Duplication — start with Endpoints.scala, MainModule.scala, ResolveNotFoundHandler.scala. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling9.8 / 10Stronggated by 2 serious findings✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
77 production modules (Gradle+Maven+sbt+Mill), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; edges a convention plugin adds from buildSrc or build-logic are not visible there; a dependsOn spread (deps: _*) and a project whose directory a helper computes are not visible there; a Mill module a helper method defines, a moduleDeps a function computes, and a module directory computed other than as a path over super.moduleDir are not visible there; 2 module(s) off the main sequence, with abstractness counted on 36 of the 77 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: integration/feature/gen-eclipse/resources/mixed-java-scala-project/runner.launcher · ×2
What to do
Resolve the 2 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 3 Low cohesion finding(s) in Cohesion (LCOM4) — start with BuildModelBuilder.scala, MillRpcWireTransport.scala, MillDaemonServer.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.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 63 tests. Measured on the JavaScript/TypeScript suite only — at least 1,053 test source file(s) (.scala, .java, .kt, .py) went unread, so its test quality is unmeasured and is not in these counts.
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.
Secret scan ran and found no leaked secrets. 1 detection(s) were excluded as holding no minted credential in material that runs: a name, reference or comparison rather than a value, a readable phrase or pattern, a value that declares itself fake, or development, test, example, mock or demo material.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 17 declared JVM dependency artifact(s) use a banned license. Licences were resolved from the POMs Maven Central publishes, over the coordinates this repository's 37 Maven/Gradle manifest(s) declare with a version resolvable from the manifest itself — the same declaration-site closure this analysis reads for dependency currency. The JVM has no lockfile a checkout is guaranteed to carry, so this is deliberately NOT the transitive closure. 20 further coordinate(s) are declared with no version at the declaration site — inherited from a parent POM, a BOM or an unresolved Gradle version reference — and are NOT graded: this verdict covers what the checkout pins, not the full transitive graph. 1 of them resolve to no licence at all on Central, even through their parent POMs; that is missing data, not a violation, and none of them is charged. A further 4 coordinate(s) are not published to Maven Central — another repository (Google's Maven hosts androidx), a SNAPSHOT, or a private artifact — so their licences are not readable from here and they are outside this verdict.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 12 Hotspot finding(s) in Churn × Complexity Hotspots — start with GroupExecution.scala, Execution.scala, MillMavenBuildGenMain.scala. — One of this dimension's main actionable groups (12 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.5 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
52 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is core/resolve/src/mill/resolve/ResolveCore.scala. Counted over 333 of the 905 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1 · ×2
Further sole-owners (lower concentration)
What to do
Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
104 deducted task-comment markers across 96507 LoC (0.1/KLoC) → score 9.8. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 81 TodoComment finding(s) in Explicit Debt — start with AndroidAppModule.scala (7), AndroidModule.scala (6), KotlinJsModule.scala (5). — One of this dimension's main actionable groups (81 warning-level).
Resolve the 12 FixmeComment finding(s) in Explicit Debt — start with Task.scala (3), BuildInfoTests.scala (2), CoursierClient.scala. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 11 HackComment finding(s) in Explicit Debt — start with LocalSummary.scala, BspMainModule.scala, ScalaNativeModule.scala. — One of this dimension's main actionable groups (11 warning-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
55 finding(s): 0 critical, 44 high, 6 medium, 5 low. 19 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 99 file(s) — `contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckModule.scala`, `contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckWorker.scala`, `core/api/java11/src/mill/api/JsonFormatters.scala`, `core/api/java11/src/mill/api/MappedRoots.scala`, `core/api/java11/src/mill/api/PathRef.scala`, … (+94 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 3 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 5 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 10 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (6), REDACTED, REDACTED. — One of this dimension's main actionable groups (10 issue-level).
Resolve the 9 REDACTED finding(s) charged to Static Analysis (SAST) — the other 19 are reported here at file:line but scored by D36 (supply-chain provenance), which charges them once. — One of this dimension's main actionable groups (28 issue-level, 9 of them charged here).
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. 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.
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.
27 of 333 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is libs/javascriptlib/src/mill/javascriptlib/TestModule.scala. Counted over 333 of the 905 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 2 Orphaned knowledge finding(s) in Knowledge Freshness — start with TestModule.scala, GenEclipseImpl.scala. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 25 Orphaned file finding(s) in Knowledge Freshness — start with PublishModule.scala (2), CrossMacros.scala, DockerModule.scala. — One of this dimension's main actionable groups (25 recommendation-level).
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.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 8 Change coupling finding(s) in Change Coupling — start with EndpointsJava.scala (2), BspWorkerImpl.scala, SelectiveExecutionImpl.scala. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with EvaluatorProxy.scala. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 3 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. 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.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
1 end-of-life runtime(s) and 0 end-of-life framework(s), read from 12 platform declaration(s) and 35 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with build.gradle.kts. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d44_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives1.0 / 10Critical✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative. — website/docs/supplemental-ui/partials/header-content.hbs:71
What to do
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Do you agree with this assessment?
AC2 · Forms & labels4.5 / 10Weak✓ Tool-verified
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. — website/docs/supplemental-ui/partials/header-content.hbs:74
A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). (×2) — website/docs/supplemental-ui/partials/header-content.hbs:77, website/docs/supplemental-ui/partials/nav-tree.hbs:18
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
`button` sets color: #fff on background-color: #007bff — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — example/large/multilang/14-multi-language/client/src/App.css:52
`button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. (×5) — example/scalalib/web/7-webapp-scalajs-shared/resources/webapp/index.css:40, example/scalalib/web/6-webapp-scalajs/resources/webapp/index.css:40, example/scalalib/web/4-todo-http4s/resources/webapp/index.css:40, …
`.new-todo` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. (×5) — example/scalalib/web/7-webapp-scalajs-shared/resources/webapp/index.css:96, example/scalalib/web/6-webapp-scalajs/resources/webapp/index.css:96, example/scalalib/web/4-todo-http4s/resources/webapp/index.css:96, …
`:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — example/javascriptlib/basic/6-client-server-realistic/client/src/index.css:37
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.
Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.
`app` serves requests (Flask routes run on a server thread per request, and every thread shares the one module object) but updates module state with a read-modify-write outside any lock (todos; e.g. `todos` in `clear_completed` at line 81). Two requests that interleave between the read and the write lose one update. — REDACTED:81
`WebApp` is one shared instance (Cask routes object: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (todos; e.g. `todos` in `add` at line 24). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt. (×2) — example/scalalib/web/2-todo-webapp/src/WebApp.scala:5, example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:5
`WebApp` is one shared instance (Cask routes object: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (todos; e.g. `todos` in `add` at line 33). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt. — example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:5
`WebApp` is one shared instance (Cask routes object: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (todos; e.g. `todos` in `add` at line 19). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt. — example/scalalib/web/7-webapp-scalajs-shared/src/WebApp.scala:6
What to do
Python: keep request handlers free of module-level counters and accumulators — move the state into a store built for concurrent access (the database, a cache, an atomic counter such as itertools.count) or guard each read-modify-write with a module-level threading.Lock (`with _lock:`).
Scala: keep controllers and singletons stateless — per-request data in locals, shared data in a store — or hold the state in a thread-safe type (TrieMap, AtomicInteger/AtomicReference, a cats-effect Ref) or update it under `synchronized { }`; a flag that is only ever overwritten can be a `@volatile var`.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
`GroupExecution` declares 19 abstract members: `workspace`, `outPath`, `externalOutPath`, `rootModule`, `classLoaderSigHash`, `classLoaderIdentityHash`, `workerCache`, `env`, `failFast`, `ec`, `codeSignatures`, `systemExit`, `exclusiveSystemStreams`, `getEvaluator`, `staticBuildOverrideFiles`, `replayLogs`, `offline`, `useFileLocks`, `workspaceLocking`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — core/exec/src/mill/exec/GroupExecution.scala:30
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Code Health — Unreviewed-generation residue in this repository's Scala: methods whose whole body is still `???` or a "not implemented" throw where nothing overrides them, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
`systemExit` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — libs/javalib/worker/src/mill/javalib/worker/MillJvmWorkerMain.scala:107
What to do
Finish or delete the members whose body is still `???` or a "not implemented" throw where nothing overrides them, and replace placeholder text before shipping.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Scala: methods whose body is `???` or only throws a "not implemented" error, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`systemExit` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — libs/javalib/worker/src/mill/javalib/worker/MillJvmWorkerMain.scala:107
What to do
Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the 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.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability5.5 / 10Adequate✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 1/2 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `website/blog/modules/ROOT/attachments/fast-assembly`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
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 12 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:3
`REDACTED` schedules updates, but no `package-ecosystem` entry covers `pip`, `maven`, `gradle`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the `updates:` list. — REDACTED:5
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.
Dependabot is configured but does not watch `pip`, `maven`, `gradle` — add those `package-ecosystem` entries to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured. — contrib/jmh/test/resources/jmh/src/Bench1.scala
What to do
Run JMH with the GC profiler (`-prof gc`, or addProfiler(GCProfiler.class)) so allocation rate regressions are visible, not just time.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`testTask` is async and calls Thread.sleep — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs. (×2) — libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:456, libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:493
What to do
Scala: compose the Future or effect (map/flatMap, a for-comprehension) instead of Await.result or unsafeRunSync, and wrap unavoidable blocking calls in blocking { } (Future), IO.blocking or ZIO.attemptBlocking.
Other · Security — Read from this repository's Scala source and the Java beside it: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. This repository serves no HTTP of its own — no HTTP-server artifact (akka-http, pekko-http, http4s, Play, Finagle, zio-http, cask, Scalatra, a tapir server, Jetty, Undertow, …) outside test scope in its build, and no server package imported or server bound in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. (×8) — core/api/java11/src/mill/api/PathRef.scala:186, core/api/java11/src/mill/api/PathRef.scala:188, REDACTED:35, …
What to do
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 8 sites, not one: `core/api/java11/src/mill/api/PathRef.scala:186` (MessageDigest.getInstance("MD5")), `core/api/java11/src/mill/api/PathRef.scala:188` (MessageDigest.getInstance("MD5")), `REDACTED:35` (MessageDigest.getInstance("md5")), `libs/androidlib/src/mill/androidlib/AndroidSdkManagerModule.scala:97` (MessageDigest.getInstance("sha1")), `libs/javalib/scalameta-worker/src/SemanticdbProcessor.scala:121` (MessageDigest.getInstance("MD5")), `libs/javalib/src/mill/javalib/publish/SonatypeHelpers.scala:251` (MessageDigest.getInstance("md5")), `libs/javalib/src/mill/javalib/publish/SonatypeHelpers.scala:253` (MessageDigest.getInstance("sha1")), `libs/pythonlib/src/mill/pythonlib/UvModule.scala:260` (MessageDigest.getInstance("MD5")). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether an enhanced `for` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is iterating invalidates the fail-fast iterator it is holding, so the next `next()` throws `ConcurrentModificationException` and the remaining elements 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. Whether a `for (x in c)` or `c.forEach { … }` leaves the collection it is walking alone — a `mutableListOf`/`ArrayList`, `mutableMapOf`/`HashMap` or `mutableSetOf`/`HashSet` is a `java.util` collection on the JVM and is walked by its own fail-fast iterator, so a body that adds to or removes from the very collection the loop is walking makes the next step throw `ConcurrentModificationException` 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.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×25) — runner/server/src/mill/server/MillDaemonServer.scala:218, runner/launcher/src/mill/launcher/JLineNativeLoader.scala:86, runner/launcher/src/mill/launcher/MillServerLauncher.scala:60, …
`case _: Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×7) — runner/launcher/src/mill/launcher/CoursierClient.scala:40, runner/launcher/src/mill/launcher/MillProcessLauncher.scala:325, runner/launcher/src/mill/launcher/MillProcessLauncher.scala:328, …
`case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — runner/launcher/src/mill/launcher/MillProcessLauncher.scala:310, libs/util/java11/src/mill/util/Jvm.scala:268
`case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×6) — runner/bsp/worker/src/mill/bsp/worker/MillBuildServer.scala:156, runner/bsp/worker/src/mill/bsp/worker/MillBuildServer.scala:179, libs/util/src/mill/util/VcsVersion.scala:161, …
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
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 795 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.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 8 of 55 WCAG 2.2 Level A/AA success criteria (15%; ≈16% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 47 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 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.
X10 Duplicated predicate — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 3 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 4 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.
C3 Audit Trail — Not assessed: this repository stores data through 'io.getquill' (integration/feature/zinc-incremental-compilation/resources/app/src/main/scala/App.scala:3) but declares no persisted model this check reads (Slick table columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL migrations). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
C4 Data Retention — Not assessed: this repository stores data through 'io.getquill' (integration/feature/zinc-incremental-compilation/resources/app/src/main/scala/App.scala:3) but declares no persisted model this check reads (Slick table columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL migrations). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
C5 Data-Subject Rights — Not assessed: this repository stores data through 'io.getquill' (integration/feature/zinc-incremental-compilation/resources/app/src/main/scala/App.scala:3) but declares no persisted model this check reads (Slick table columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL migrations). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 51 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.
AC3 Page structure — No structural check found in the parsed markup — AC3 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AX1 Captive dependencies — AX1 reached only 8% of this repository's production lines — scala (87,169 lines), typescript (1,022 lines), python (904 lines), javascript (686 lines), groovy (167 lines), c (64 lines), cpp (13 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
AX4 Dependency direction — not applicable to a CQRS architecture (the inward-dependency rule is for layered/clean styles)
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
D11 Test Reliability — Test reliability not included — the .scala suite was found but not re-run
D12 Dependency Hygiene — Not scored — a Gradle build resolved 173 artifact(s) across its subprojects (88 behind a shipped release, reported), but the currency signal was not established over the whole graph, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
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.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D21 Naming Consistency — Naming consistency does not read html, sc yet; not measured.
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; comments in this repository's .java, .kt, .py, .scala source were not judged.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — D26 measured no build unit over this repository's .c, .cpp, .groovy, .java, .kt, .scala, .ts, .tsx source. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.scala), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 141 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
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 (4 signals for this style, 2 needed — the count is met but a required primary signal is absent): 1 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit); 268 value object(s); 10 domain event(s); its 1 aggregate(s) are ORM models only — persistence, not behaviour: a CRUD model, measured, not claimed as DDD; its domain events are published by services or handlers — no domain entity raises one; 4 repository port(s) loading or saving an aggregate/entity; a domain structure with no aggregate, domain event or strongly-typed id in it: a CRUD / clean-architecture model, measured but not claimed as DDD; a top-level example/ tree: a library or framework whose examples are its consumers — these types are building blocks, not a domain
ED1 Event-Driven — not scored — this repository shows only 1 of the 3 signals this lens looks for (1 CQRS handler(s))
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
M4 Documentation accuracy — Not applicable: the 135 current-state document(s) make no claim of a kind M4 checks. 65 claim(s) of kinds M4 does not check were not checked (path 48, command argument 3, environment variable 14); M4 checks only links and versions and artefact counts.
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, JavaScript/TypeScript 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
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X17 Uncapped recursion over a caller-supplied document — 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, Java and Kotlin were read, and no request in it can be cancelled by a caller (Ktor, OkHttp's newCall or a URL stream, from a suspend function) — 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 Java request off Android takes no token: it is cancelled through the handle it returns (Future.cancel, Call.cancel, a Disposable), ambiently (io.grpc.Context) or by interrupting its thread, not through a parameter; a Kotlin request outside a suspend function has no caller's cancellation to honour
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
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
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
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.
X6 Hand-rolled structured-format parsing — 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.
AC2 · Forms & labels· <button> with no accessible text · ×2
<button> with no accessible text website/docs/supplemental-ui/partials/header-content.hbs:77— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text website/docs/supplemental-ui/partials/nav-tree.hbs:18— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
Orphaned knowledge libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Orphaned knowledge runner/eclipse/src/mill/eclipse/GenEclipseImpl.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.
AC1 · Text alternatives· <img> without a text alternative · ×1
<img> without a text alternative website/docs/supplemental-ui/partials/header-content.hbs:71— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
AC2 · Forms & labels· <input> without a programmatic label · ×1
<input> without a programmatic label website/docs/supplemental-ui/partials/header-content.hbs:74— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
TodoComment runner/idea/src/mill/idea/GenIdeaImpl.scala:288— // TODO: check if this still holds, since we have replaced import $ivy support. — 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 runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:849— // TODO: Check if named tuples could make this call more typesafe — 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 runner/daemon/src/mill/daemon/MillScalaParserImpl.scala:371— // TODO: let's check if this actually happens, if so, perhaps we should just ignore it — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment runner/bsp/worker/src/mill/bsp/worker/BspCompileProblemReporter.scala:86— // TODO: document that if the problem is a general information without a text document — 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 runner/bsp/worker/src/mill/bsp/worker/BspCompileProblemReporter.scala:135— // TODO: review whether this is a proper source or if it should 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 runner/bsp/worker/src/mill/bsp/worker/BspTestReporter.scala:105— // TODO: what to do 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 runner/bsp/worker/src/mill/bsp/worker/Endpoints.scala:363— // TODO: See in what form IntelliJ expects data about products of compilation in order to set data field — 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 runner/bsp/worker/src/mill/bsp/worker/Utils.scala:38— // module's hash code TODO: find something more reliable than the hash code — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mill-build/src/millbuild/Deps.scala:392— // TODO: uiTooling is needed for screenshot tests — 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 mill-build/src/millbuild/MillJavaModule.scala:99— // TODO: a bunch of code needs reviewing with this lint) — 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 libs/util/src/mill/util/VisualizeModule.scala:221— // TODO: Remove bin-compat shim in Mill 2.x — 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 libs/scalalib/test/src/mill/scalalib/Scala38NightlyTests.scala:8— // TODO: Once Scala 3.8.2 is out, we can change this test to use 3.8.2 and remove the extra repo — 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 libs/scalalib/src/mill/scalalib/ScalaModule.scala:126— // TODO: do we need to handle compiler plugins? — 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 libs/scalalib/src/mill/scalalib/scalafmt/ScalafmtModule.scala:40— // TODO: Do we want provide some defaults or write a default file? — 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 libs/pythonlib/src/mill/pythonlib/PythonModule.scala:172— // TODO: right now, any task that calls this helper will have its own python — 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 libs/pythonlib/src/mill/pythonlib/TestModule.scala:66— // TODO: this is a dummy for now, however we should look into re-using — 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 libs/kotlinlib/src/mill/kotlinlib/KotlinModule.scala:219— // TODO need to provide a dedicated source set for common sources in case of Multiplatform — 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 libs/kotlinlib/src/mill/kotlinlib/KotlinModule.scala:359— // TODO if there is penalty for activating it in the compiler, put it behind configuration flag — 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 libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:364— // TODO if there is penalty for activating it in the compiler, put it behind configuration flag — 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 libs/kotlinlib/src/mill/kotlinlib/kapt/KaptModule.scala:119— // TODO: move compiler options to a dedicated function (or task) called from allKotlincOptions — 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 libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:455— // TODO cache these lookups. May be a big performance penalty. — 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 libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:498— // TODO may be optimized if there is a single folder for all modules — 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 libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:561— // TODO add runner to be able to use test selector — 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 libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:563— // TODO this is valid only for the NodeJS target. Once browser support is — 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 libs/kotlinlib/src/mill/kotlinlib/js/RunTarget.scala:6— // TODO rely on the node version installed in the env or fetch a specific one? — 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.
Swallowed exception (empty catch) runner/server/src/mill/server/MillDaemonServer.scala:218— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/launcher/src/mill/launcher/JLineNativeLoader.scala:86— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/launcher/src/mill/launcher/MillServerLauncher.scala:60— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/launcher/src/mill/launcher/MillServerLauncher.scala:62— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/launcher/src/mill/launcher/MillServerLauncher.scala:119— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:109— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:204— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:206— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:438— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:768— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:770— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillDaemonMain0.scala:106— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillDaemonMain0.scala:108— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillMain0.scala:330— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillMain0.scala:424— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillMain0.scala:426— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillMain0.scala:428— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/MillNoDaemonMain0.scala:79— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/RunnerSharedState.scala:103— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/RunnerSharedState.scala:105— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/RunnerSharedState.scala:107— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/SharedOutLockManager.scala:98— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/SharedOutLockManager.scala:118— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/daemon/src/mill/daemon/SharedOutLockManager.scala:128— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) runner/bsp/worker/src/mill/bsp/worker/BspLogger.scala:37— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
FileTooLong: javalib/JavaModule.scala libs/javalib/src/mill/javalib/JavaModule.scala— FileTooLong — 947 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 447 over it, 1.89× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: util/Jvm.scala libs/util/java11/src/mill/util/Jvm.scala— FileTooLong — 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 over it, 1.42× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: daemon/MillBuildBootstrap.scala runner/daemon/src/mill/daemon/MillBuildBootstrap.scala— FileTooLong — 709 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: MillBuildBootstrap (48-796). The bar is 500 significant lines; this is 209 over it, 1.42× 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: exec/GroupExecution.scala core/exec/src/mill/exec/GroupExecution.scala— FileTooLong — 700 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 200 over it, 1.40× 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: androidlib/AndroidAppModule.scala libs/androidlib/src/mill/androidlib/AndroidAppModule.scala— FileTooLong — 671 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 171 over it, 1.34× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: idea/GenIdeaImpl.scala runner/idea/src/mill/idea/GenIdeaImpl.scala— FileTooLong — 651 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 151 over it, 1.30× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: daemon/MillMain0.scala runner/daemon/src/mill/daemon/MillMain0.scala— FileTooLong — 644 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 144 over it, 1.29× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: gradle/BuildModelBuilder.scala libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala— FileTooLong — 635 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: BuildModelBuilder (27-864). The bar is 500 significant lines; this is 135 over it, 1.27× 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: zinc/IncrementalAnnotationProcessing.scala libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala— FileTooLong — 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: javascriptlib/TypeScriptModule.scala libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala— FileTooLong — 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22× 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: publish/Licence.scala libs/javalib/src/mill/javalib/publish/Licence.scala— FileTooLong — 564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 64 over it, 1.13× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: exec/Execution.scala core/exec/src/mill/exec/Execution.scala— FileTooLong — 563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 63 over it, 1.13× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: zinc/ZincWorker.scala libs/javalib/worker/src/mill/javalib/zinc/ZincWorker.scala— FileTooLong — 555 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ZincWorker (34-691). The bar is 500 significant lines; this is 55 over it, 1.11× 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: androidlib/AndroidModule.scala libs/androidlib/src/mill/androidlib/AndroidModule.scala— FileTooLong — 546 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 46 over it, 1.09× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: resolve/Resolve.scala core/resolve/src/mill/resolve/Resolve.scala— FileTooLong — 506 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6 over it, 1.01× 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.
Swallowed exception (caught, then discarded) runner/launcher/src/mill/launcher/CoursierClient.scala:40— `case _: Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) runner/launcher/src/mill/launcher/MillProcessLauncher.scala:310— `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) runner/launcher/src/mill/launcher/MillProcessLauncher.scala:325— `case _: Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) runner/launcher/src/mill/launcher/MillProcessLauncher.scala:328— `case _: Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) runner/launcher/src/mill/launcher/MillProcessLauncher.scala:343— `case _: Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) runner/daemon/src/mill/daemon/MillMain0.scala:735— `case _: Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) runner/bsp/worker/src/mill/bsp/worker/MillBuildServer.scala:156— `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) runner/bsp/worker/src/mill/bsp/worker/MillBuildServer.scala:179— `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) libs/util/src/mill/util/VcsVersion.scala:161— `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) libs/util/src/mill/util/VcsVersion.scala:175— `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) libs/util/java11/src/mill/util/Jvm.scala:268— `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) libs/util/java11/src/mill/util/Jvm.scala:335— `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) libs/util/java11/src/mill/util/Jvm.scala:357— `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) libs/util/java11/src/mill/util/Jvm.scala:383— `case _: Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) libs/javalib/worker/src/mill/javalib/zinc/HighlightJava.scala:174— `case _: Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
TooManyMethods: JavaModule libs/javalib/src/mill/javalib/JavaModule.scala:52— TooManyMethods — 109 methods. The bar is 30 methods; this is 79 over it, 3.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: AndroidModule libs/androidlib/src/mill/androidlib/AndroidModule.scala:19— TooManyMethods — 60 methods. The bar is 30 methods; this is 30 over it, 2.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: TypeScriptModule libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:10— TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AndroidAppModule libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:66— TooManyMethods — 50 methods. The bar is 30 methods; this is 20 over it, 1.67× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: QuarkusModule libs/javalib/src/mill/javalib/quarkus/QuarkusModule.scala:25— TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ScalaNativeModule libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:27— TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AndroidSdkModule libs/androidlib/src/mill/androidlib/AndroidSdkModule.scala:25— 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: IncrementalAnnotationProcessing libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:21— 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: Jvm libs/util/java11/src/mill/util/Jvm.scala:40— 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: FlywayModule contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:26— TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× 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: PublishModule libs/javalib/src/mill/javalib/PublishModule.scala:15— 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: BuildModelBuilder libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala:27— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BuildGenYaml libs/init/buildgen/src/mill/main/buildgen/BuildGenYaml.scala:14— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 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.
Hotspot: core/exec/src/mill/exec/GroupExecution.scala core/exec/src/mill/exec/GroupExecution.scala:237— core/exec/src/mill/exec/GroupExecution.scala changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in GroupExecution.executeGroupCached at line 237. 1 of those changes was a fix/bug commit, and the other 9 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- core/exec/src/mill/exec/GroupExecution.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: core/exec/src/mill/exec/Execution.scala core/exec/src/mill/exec/Execution.scala:167— core/exec/src/mill/exec/Execution.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Execution.execute0Once at line 167. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- core/exec/src/mill/exec/Execution.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala:13— libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MillMavenBuildGenMain.init at line 13. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: runner/idea/src/mill/idea/GenIdeaImpl.scala runner/idea/src/mill/idea/GenIdeaImpl.scala:112— runner/idea/src/mill/idea/GenIdeaImpl.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in GenIdeaImpl.xmlFileLayout at line 112. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- runner/idea/src/mill/idea/GenIdeaImpl.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala:315— libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in BuildModelBuilder.configureJvmModule at line 315. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/javalib/worker/src/mill/javalib/zinc/ZincWorker.scala libs/javalib/worker/src/mill/javalib/zinc/ZincWorker.scala:332— libs/javalib/worker/src/mill/javalib/zinc/ZincWorker.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ZincWorker.compileInternal at line 332. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- libs/javalib/worker/src/mill/javalib/zinc/ZincWorker.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:272— libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in KotlinJsModule.kotlinJsCompile at line 272. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: runner/meta/src/mill/meta/CodeGen.scala runner/meta/src/mill/meta/CodeGen.scala:73— runner/meta/src/mill/meta/CodeGen.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CodeGen.generateWrappedAndSupportSources at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- runner/meta/src/mill/meta/CodeGen.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfig.scala libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfig.scala:45— libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfig.scala changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ScalaJSConfig.config at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfig.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: core/internal/src/mill/internal/PromptLogger.scala core/internal/src/mill/internal/PromptLogger.scala:168— core/internal/src/mill/internal/PromptLogger.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in prompt.logPrefixedLine at line 168. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- core/internal/src/mill/internal/PromptLogger.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/util/src/mill/util/Inspect.scala libs/util/src/mill/util/Inspect.scala:83— libs/util/src/mill/util/Inspect.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Inspect.inspect at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- libs/util/src/mill/util/Inspect.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: core/api/src/mill/api/Discover.scala core/api/src/mill/api/Discover.scala:75— core/api/src/mill/api/Discover.scala changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Router.applyImpl at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:06:18 +01:00' --until='2026-11-14 00:06:18 +01:00' --full-history --no-merges -- core/api/src/mill/api/Discover.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
FixmeComment runner/launcher/src/mill/launcher/CoursierClient.scala:54— // FIXME All the messing with COURSIER_REPOSITORIES assumes user override repos only via this env var, — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment runner/idea/src/mill/idea/GenIdeaImpl.scala:574— // FIXME: fill in these fields — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment libs/util/src/mill/util/Inspect.scala:86— // FIXME: Review this, looks obsolete since os-lib 0.11.9/10 — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:456— // FIXME: This should be `super.coursierProject()`, but that's not possible due to bin-compat — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment libs/kotlinlib/src/mill/kotlinlib/KotlinWorkerManager.scala:51— // FIXME: this prevents reuse over JVM restarts but is safe with different snapshotting algorithms in different — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment libs/javalib/src/mill/javalib/internal/ModuleUtils.scala:20— // FIXME: Remove or consolidate with copy in JvmWorkerImpl — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment core/api/src/mill/api/Task.scala:496— // FIXME: deprecated return type: Change to Option (bin-compat) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment core/api/src/mill/api/Task.scala:567— // FIXME: deprecated return type: Change to Option — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment core/api/src/mill/api/Task.scala:590— // FIXME: deprecated return type: Change to Option — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment core/api/java11/src/mill/api/PathRef.scala:137— // FIXME: consider removing the sys-err-out in non-snapshot release — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment contrib/buildinfo/test/src/mill/contrib/buildinfo/BuildInfoTests.scala:112— // FIXME: the mainClass should be found automatically — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment contrib/buildinfo/test/src/mill/contrib/buildinfo/BuildInfoTests.scala:124— // FIXME: the mainClass should be found automatically — 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.
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×11
Focus outline removed in CSS without a :focus replacement example/scalalib/web/7-webapp-scalajs-shared/resources/webapp/index.css:40— `button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/7-webapp-scalajs-shared/resources/webapp/index.css:96— `.new-todo` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/6-webapp-scalajs/resources/webapp/index.css:40— `button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/6-webapp-scalajs/resources/webapp/index.css:96— `.new-todo` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/4-todo-http4s/resources/webapp/index.css:40— `button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/4-todo-http4s/resources/webapp/index.css:96— `.new-todo` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/3-webapp-cache-busting/resources/webapp/index.css:40— `button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/3-webapp-cache-busting/resources/webapp/index.css:96— `.new-todo` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/2-todo-webapp/resources/webapp/index.css:40— `button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/scalalib/web/2-todo-webapp/resources/webapp/index.css:96— `.new-todo` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement example/javascriptlib/basic/6-client-server-realistic/client/src/index.css:37— `:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
HackComment runner/codesig/src/mill/codesig/LocalSummary.scala:540— // HACK: we skip any constants that get passed to `sourcecode.Line()`, — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment libs/util/src/mill/util/bsp/BspMainModule.scala:16— // Hack-ish way to have some BSP state in the module context — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:515— // Hack to try and let the Scala Native subprocess finish streaming its stdout — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:473— // Hack to try and let the Node.js subprocess finish streaming its stdout — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment libs/pythonlib/src/mill/pythonlib/PythonModule.scala:273— // Hack to forward the background subprocess output to the Mill server process — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment libs/javalib/src/mill/javalib/NativeImageModule.scala:87— // Hack to forward the background subprocess output to the Mill server process — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment libs/javalib/src/mill/javalib/RunModule.scala:392— // Hack to forward the background subprocess output to the Mill server process — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment libs/javalib/src/mill/javalib/JavaModule.scala:643— // hack, so that depending on `coursierDependencyTask.withConfiguration(Configuration.provided)` — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment libs/javalib/spotless-worker/src/mill/javalib/spotless/GitRatchet.scala:23— // HACK: — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment core/internal/cli/src/mill/internal/MillCliConfig.scala:236— // Hack to work around `a.copy` not propagating the name mapping correctly, so we have — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment core/eval/src/mill/eval/ScriptModuleInit.scala:149— // Hack to try and pick up classes nested within package objects — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
Duplicated block (9 lines × 2) libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:440— libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:440-448 | libs/init/buildgen/src/mill/main/buildgen/BuildGenYaml.scala:182-190 — 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 `libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:440` 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) libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:454— libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:454-462 | libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:777-785 — both copies are in the same file, so extract the 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 `libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:454` 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) libs/scalajslib/config/src/mill/scalajslib/config/worker/ScalaJSConfigWorker.scala:23— libs/scalajslib/config/src/mill/scalajslib/config/worker/ScalaJSConfigWorker.scala:23-31 | libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:20-28 — 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 (9 lines × 2) libs/util/src/mill/util/MainModule.scala:158— libs/util/src/mill/util/MainModule.scala:158-166 | libs/util/src/mill/util/SelectiveExecutionModule.scala:81-89 — 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 `libs/util/src/mill/util/MainModule.scala:158` 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) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:127— libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:127-135 | libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:181-189 — 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 (9 lines × 2) example/scalalib/web/2-todo-webapp/src/WebApp.scala:120— example/scalalib/web/2-todo-webapp/src/WebApp.scala:120-128 | example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:129-137 — before extracting anything, compare `example/scalalib/web/2-todo-webapp/src/WebApp.scala` and `example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/web/2-todo-webapp/src/WebApp.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 (9 lines × 2) example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:111— example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:111-119 | example/scalalib/web/7-webapp-scalajs-shared/src/WebApp.scala:50-58 — 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 `example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:111` 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) example/extending/plugins/1-writing-mill-plugins/myplugin/src/LineCountJavaModule.scala:14— example/extending/plugins/1-writing-mill-plugins/myplugin/src/LineCountJavaModule.scala:14-22 | example/extending/plugins/2-plugin-integration-tests/myplugin/src/LineCountJavaModule.scala:14-22 — before extracting anything, compare `example/extending/plugins/1-writing-mill-plugins/myplugin/src/LineCountJavaModule.scala` and `example/extending/plugins/2-plugin-integration-tests/myplugin/src/LineCountJavaModule.scala` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:20— example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:20-28 | example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala:24-32 — before extracting anything, compare `example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala` and `example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) example/fundamentals/tasks/1-task-graph/src/Foo.java:9— example/fundamentals/tasks/1-task-graph/src/Foo.java:9-17 | example/fundamentals/tasks/2-primary-tasks/src/foo/Foo.java:9-17 — before extracting anything, compare `example/fundamentals/tasks/1-task-graph/src/Foo.java` and `example/fundamentals/tasks/2-primary-tasks/src/foo/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Change coupling: BspWorkerImpl.scala ↔ MillMain0.scala runner/bsp/worker/src/mill/bsp/worker/BspWorkerImpl.scala:1— `runner/bsp/worker/src/mill/bsp/worker/BspWorkerImpl.scala` and `runner/daemon/src/mill/daemon/MillMain0.scala` change together 75% of the time (12 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `1d8a71bf` Run at most one BSP server per build client (#6905); `be1b21cb` Highlight prompt header command cyan, fix `tail -F` message (#6662); `70b3c90c` Automatically reload BSP server upon meta-build change (#5305) — run `git show` on any of them.
Change coupling: SelectiveExecutionImpl.scala ↔ SelectiveExecutionModule.scala core/eval/src/mill/eval/SelectiveExecutionImpl.scala:1— `core/eval/src/mill/eval/SelectiveExecutionImpl.scala` and `libs/util/src/mill/util/SelectiveExecutionModule.scala` change together 75% of the time (12 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `fd960c76` Manual Selective execution configuration (#6732); `bb040465` Make `Task[V]` invariant (#6700); `2e15c748` Make selective execution work via `Task`s rather than `String`s (#6291) — run `git show` on any of them.
Change coupling: EndpointsJava.scala ↔ EndpointsScala.scala runner/bsp/worker/src/mill/bsp/worker/EndpointsJava.scala:1— `runner/bsp/worker/src/mill/bsp/worker/EndpointsJava.scala` and `runner/bsp/worker/src/mill/bsp/worker/EndpointsScala.scala` change together 70% of the time (7 of the 10 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 7 shared commits counted here, the most recent 3 are `be921215` Remove the dependency on `BspClientType` in BSP functions (#5217) (at that commit the files were still `runner/bsp/worker/src/mill/bsp/worker/MillJavaBuildServer.scala` and `runner/bsp/worker/src/mill/bsp/worker/MillScalaBuildServer.scala`); `4216a395` Fix: tests loading resources don't work in Intellij triggered tests w… (at that commit the files were still `runner/bsp/worker/src/mill/bsp/worker/MillJavaBuildServer.scala` and `runner/bsp/worker/src/mill/bsp/worker/MillScalaBuildServer.scala`); `324750b9` [WIP] avoid usage of `Task.Anon` in Mill BSP server (#4877) (at that commit the files were still `bsp/worker/src/mill/bsp/worker/MillJavaBuildServer.scala` and `bsp/worker/src/mill/bsp/worker/MillScalaBuildServer.scala`) — run `git show` on any of them.
Change coupling: EndpointsJava.scala ↔ MillBuildServer.scala runner/bsp/worker/src/mill/bsp/worker/EndpointsJava.scala:1— `runner/bsp/worker/src/mill/bsp/worker/EndpointsJava.scala` and `runner/bsp/worker/src/mill/bsp/worker/MillBuildServer.scala` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — 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 6 shared commits counted here, the most recent 3 are `be921215` Remove the dependency on `BspClientType` in BSP functions (#5217) (at that commit the file was still `runner/bsp/worker/src/mill/bsp/worker/MillJavaBuildServer.scala`); `4216a395` Fix: tests loading resources don't work in Intellij triggered tests w… (at that commit the file was still `runner/bsp/worker/src/mill/bsp/worker/MillJavaBuildServer.scala`); `324750b9` [WIP] avoid usage of `Task.Anon` in Mill BSP server (#4877) (at that commit the files were still `bsp/worker/src/mill/bsp/worker/MillJavaBuildServer.scala` and `bsp/worker/src/mill/bsp/worker/MillBuildServer.scala`) — run `git show` on any of them.
Change coupling: MillGradleBuildGenMain.scala ↔ MillMavenBuildGenMain.scala libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala:1— `libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala` and `libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `40b71c76` `mill init`: Detect Quarkus + fixes (backport #7117); `d2af1a50` Fixed mappings for ErrorProneModule in auto-migration (#7133); `e4193ae7` Prefix all main classes with `Mill` to make it easier to spot them in… — run `git show` on any of them.
Change coupling: EndpointsJvm.scala ↔ MillBuildServer.scala runner/bsp/worker/src/mill/bsp/worker/EndpointsJvm.scala:1— `runner/bsp/worker/src/mill/bsp/worker/EndpointsJvm.scala` and `runner/bsp/worker/src/mill/bsp/worker/MillBuildServer.scala` change together 53% of the time (8 of the 15 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 `8d204315` BSP fixes (#5698) (at that commit the file was still `runner/bsp/worker/src/mill/bsp/worker/MillJvmBuildServer.scala`); `09dbec2f` Cleanup compiler warnings in bsp worker module (#5551) (at that commit the file was still `runner/bsp/worker/src/mill/bsp/worker/MillJvmBuildServer.scala`); `8938add9` Factor `BspRunModuleApi` out of `RunModuleApi` (#5261) (at that commit the file was still `runner/bsp/worker/src/mill/bsp/worker/MillJvmBuildServer.scala`) — run `git show` on any of them.
Change coupling: ScalaPBModule.scala ↔ ScalaPBWorker.scala contrib/scalapblib/src/mill/contrib/scalapblib/ScalaPBModule.scala:1— `contrib/scalapblib/src/mill/contrib/scalapblib/ScalaPBModule.scala` and `contrib/scalapblib/src/mill/contrib/scalapblib/ScalaPBWorker.scala` change together 50% of the time (7 of the 14 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 7 shared commits counted here, the most recent 3 are `69daaece` Support Java generation in ScalaPBModule (#5996); `ba4486f8` Use PathRef hashCode for workers caches (#2189) (at that commit the files were still `contrib/scalapblib/src/ScalaPBModule.scala` and `contrib/scalapblib/src/ScalaPBWorker.scala`); `721fe576` ScalaPB: various fix and improves (#1027) (at that commit the files were still `contrib/scalapblib/src/ScalaPBModule.scala` and `contrib/scalapblib/src/ScalaPBWorker.scala`) — run `git show` on any of them.
Change coupling: MillMain0.scala ↔ MillDaemonServer.scala runner/daemon/src/mill/daemon/MillMain0.scala:1— `runner/daemon/src/mill/daemon/MillMain0.scala` and `runner/server/src/mill/server/MillDaemonServer.scala` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `8d4071fa` Migrate enter-to-rerun, terminfo interactions to RPC infra (#6679); `be1b21cb` Highlight prompt header command cyan, fix `tail -F` message (#6662); `e30b3d83` Improve `console.log` handling (#6661) — run `git show` on any of them.
Duplicated block (6 lines × 2) contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:456— contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:456-461 | contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:481-486 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:456` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) core/internal/src/mill/internal/Util.scala:231— core/internal/src/mill/internal/Util.scala:231-236 | core/internal/src/mill/internal/Util.scala:256-261 — both copies are in the same file, so extract the block into 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) libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala:141— libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala:141-146 | libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala:441-446 — 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 `libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala:141` 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 before the matched lines, `libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala:438` calls `recMvnDeps`, `flatMap`, `moduleLookup` and `libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala:140` 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 (6 lines × 2) contrib/docker/src/mill/contrib/docker/JibBuild.scala:27— contrib/docker/src/mill/contrib/docker/JibBuild.scala:27-32 | contrib/docker/src/mill/contrib/docker/JibBuild.scala:113-118 — both copies are in the same file, so extract the 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 `contrib/docker/src/mill/contrib/docker/JibBuild.scala:27` 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, `contrib/docker/src/mill/contrib/docker/JibBuild.scala:111` calls `DockerDaemonImage`, `to`, `named` and `contrib/docker/src/mill/contrib/docker/JibBuild.scala:26` 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 (6 lines × 2) libs/javalib/src/mill/javalib/eclipse/GenEclipseModule.scala:18— libs/javalib/src/mill/javalib/eclipse/GenEclipseModule.scala:18-23 | libs/javalib/src/mill/javalib/idea/GenIdeaModule.scala:19-24 — 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) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:93— libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:93-98 | libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:45-50 — 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) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:120— libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:120-125 | libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:72-77 — 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) example/scalalib/module/1-basic-config/custom-src/Foo2.scala:10— example/scalalib/module/1-basic-config/custom-src/Foo2.scala:10-15 | example/scalalib/module/4-programmable-config/custom-src/Foo2.scala:14-19 — before extracting anything, compare `example/scalalib/module/1-basic-config/custom-src/Foo2.scala` and `example/scalalib/module/4-programmable-config/custom-src/Foo2.scala` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/module/1-basic-config/custom-src/Foo2.scala:10` 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.
Weak hash algorithm core/api/java11/src/mill/api/PathRef.scala:186— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm core/api/java11/src/mill/api/PathRef.scala:188— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm REDACTED:35— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm libs/androidlib/src/mill/androidlib/AndroidSdkManagerModule.scala:97— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm libs/javalib/scalameta-worker/src/SemanticdbProcessor.scala:121— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm libs/javalib/src/mill/javalib/publish/SonatypeHelpers.scala:251— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm libs/javalib/src/mill/javalib/publish/SonatypeHelpers.scala:253— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm libs/pythonlib/src/mill/pythonlib/UvModule.scala:260— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×5
Edited copy of a member (13 corresponding lines) runner/bsp/worker/src/mill/bsp/worker/Endpoints.scala:257— runner/bsp/worker/src/mill/bsp/worker/Endpoints.scala:257-269 | runner/bsp/worker/src/mill/bsp/worker/Endpoints.scala:294-306 — 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) libs/util/src/mill/util/MainModule.scala:158— libs/util/src/mill/util/MainModule.scala:158-170 | libs/util/src/mill/util/SelectiveExecutionModule.scala:81-93 — 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) core/resolve/src/mill/resolve/ResolveNotFoundHandler.scala:85— core/resolve/src/mill/resolve/ResolveNotFoundHandler.scala:85-97 | core/resolve/src/mill/resolve/ResolveNotFoundHandler.scala:105-119 — 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) libs/javalib/src/mill/javalib/PublishModule.scala:407— libs/javalib/src/mill/javalib/PublishModule.scala:407-419 | mill-build/src/millbuild/MillPublishJavaModule.scala:60-72 — 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) libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:167— libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:167-179 | libs/scalajslib/worker/1/src/mill/scalajslib/worker/ScalaJSWorkerImpl.scala:253-266 — 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 (6 corresponding lines) · ×5
Edited copy of a member (6 corresponding lines) libs/javalib/src/mill/javalib/SemanticDbJavaModule.scala:109— libs/javalib/src/mill/javalib/SemanticDbJavaModule.scala:109-114 | libs/scalalib/src/mill/scalalib/ScalaModule.scala:193-199 — 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) libs/scalajslib/worker/1/src/mill/scalajslib/worker/jsenv/ExoegoJsDomNodeJs.scala:7— libs/scalajslib/worker/1/src/mill/scalajslib/worker/jsenv/ExoegoJsDomNodeJs.scala:7-12 | libs/scalajslib/worker/1/src/mill/scalajslib/worker/jsenv/JsDom.scala:7-12 — 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) libs/androidlib/src/mill/androidlib/AndroidLibModule.scala:75— libs/androidlib/src/mill/androidlib/AndroidLibModule.scala:75-80 | libs/javalib/src/mill/javalib/PublishModule.scala:313-318 — 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) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:247— example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:247-252 | example/kotlinlib/web/6-webapp-kotlinjs-shared/src/WebApp.kt:142-150 — 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) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:88— example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:88-94 | example/kotlinlib/web/6-webapp-kotlinjs-shared/src/WebApp.kt:67-72 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (17 lines × 2) libs/javalib/src/mill/javalib/SemanticDbJavaModule.scala:155— libs/javalib/src/mill/javalib/SemanticDbJavaModule.scala:155-171 | libs/scalalib/src/mill/scalalib/ScalaModule.scala:727-743 — 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 `libs/javalib/src/mill/javalib/SemanticDbJavaModule.scala:155` 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 (17 lines × 2) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:463— libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:463-479 | libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:505-521 — 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 `libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:463` 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 (17 lines × 2) example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:54— example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:54-70 | example/scalalib/web/7-webapp-scalajs-shared/shared/src/Shared.scala:13-29 — before extracting anything, compare `example/scalalib/web/6-webapp-scalajs/src/WebApp.scala` and `example/scalalib/web/7-webapp-scalajs-shared/shared/src/Shared.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/web/6-webapp-scalajs/src/WebApp.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.
Duplicated block (17 lines × 2) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:154— example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:154-170 | example/kotlinlib/web/6-webapp-kotlinjs-shared/shared/src/Shared.kt:82-98 — 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 `example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:154` 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 (17 lines × 2) example/extending/plugins/2-plugin-integration-tests/myplugin/integration/resources/example-test-project/src/foo/Foo.java:1— example/extending/plugins/2-plugin-integration-tests/myplugin/integration/resources/example-test-project/src/foo/Foo.java:1-17 | example/extending/plugins/2-plugin-integration-tests/myplugin/integration/resources/integration-test-project/src/foo/Foo.java:1-17 — before extracting anything, compare `example/extending/plugins/2-plugin-integration-tests/myplugin/integration/resources/example-test-project/src/foo/Foo.java` and `example/extending/plugins/2-plugin-integration-tests/myplugin/integration/resources/integration-test-project/src/foo/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/extending/plugins/2-plugin-integration-tests/myplugin/integration/resources/example-test-project/src/foo/Foo.java:1` 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) libs/groovylib/src/mill/groovylib/GroovyMavenModule.scala:12— libs/groovylib/src/mill/groovylib/GroovyMavenModule.scala:12-19 | libs/kotlinlib/src/mill/kotlinlib/KotlinMavenModule.scala:11-18 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `libs/groovylib/src/mill/groovylib/GroovyMavenModule.scala:12` 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) example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala:10— example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala:10-17 | website/blog/modules/ROOT/attachments/fast-assembly/src/main/scala/foo/Foo.scala:10-17 — before extracting anything, compare `example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala` and `website/blog/modules/ROOT/attachments/fast-assembly/src/main/scala/foo/Foo.scala` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:30— example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:30-37 | example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala:34-41 — before extracting anything, compare `example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala` and `example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) example/kotlinlib/module/1-basic-config/custom-src/Foo2.kt:27— example/kotlinlib/module/1-basic-config/custom-src/Foo2.kt:27-34 | example/kotlinlib/module/4-programmable-config/custom-src/Foo2.kt:31-38 — before extracting anything, compare `example/kotlinlib/module/1-basic-config/custom-src/Foo2.kt` and `example/kotlinlib/module/4-programmable-config/custom-src/Foo2.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:47— example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:47-54 | example/kotlinlib/web/6-webapp-kotlinjs-shared/client/src/ClientApp.kt:55-62 — before extracting anything, compare `example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt` and `example/kotlinlib/web/6-webapp-kotlinjs-shared/client/src/ClientApp.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:47` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) runner/daemon/src/mill/daemon/MillBspMain.java:1— runner/daemon/src/mill/daemon/MillBspMain.java:1-15 | runner/daemon/src/mill/daemon/MillNoDaemonMain.java:1-15 — 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 `runner/daemon/src/mill/daemon/MillBspMain.java:1` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:102— example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:102-118 | example/kotlinlib/web/6-webapp-kotlinjs-shared/shared/src/Shared.kt:36-50 — 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 `example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:102` 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 (15 lines × 2) example/kotlinlib/linting/5-kover/bar/src/BarKotlin.kt:3— example/kotlinlib/linting/5-kover/bar/src/BarKotlin.kt:3-17 | example/kotlinlib/linting/5-kover/src/foo/FooKotlin.kt:3-17 — before extracting anything, compare `example/kotlinlib/linting/5-kover/bar/src/BarKotlin.kt` and `example/kotlinlib/linting/5-kover/src/foo/FooKotlin.kt` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) example/cli/builtins/1-builtin-commands/bar/src/bar/Bar.java:1— example/cli/builtins/1-builtin-commands/bar/src/bar/Bar.java:1-15 | example/javalib/basic/7-multi-module/bar/src/bar/Bar.java:1-15 — before extracting anything, compare `example/cli/builtins/1-builtin-commands/bar/src/bar/Bar.java` and `example/javalib/basic/7-multi-module/bar/src/bar/Bar.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/cli/builtins/1-builtin-commands/bar/src/bar/Bar.java:1` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) example/javalib/module/1-basic-config/src/foo/Foo.java:1— example/javalib/module/1-basic-config/src/foo/Foo.java:1-15 | example/javalib/module/4-programmable-config/src/foo/Foo.java:1-15 — before extracting anything, compare `example/javalib/module/1-basic-config/src/foo/Foo.java` and `example/javalib/module/4-programmable-config/src/foo/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/javalib/module/1-basic-config/src/foo/Foo.java:1` 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.
Stateful singleton: WebApp example/scalalib/web/2-todo-webapp/src/WebApp.scala:5— `WebApp` is one shared instance (Cask routes object: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (todos; e.g. `todos` in `add` at line 24). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt.
Stateful singleton: WebApp example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:5— `WebApp` is one shared instance (Cask routes object: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (todos; e.g. `todos` in `add` at line 33). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt.
Stateful singleton: WebApp example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:5— `WebApp` is one shared instance (Cask routes object: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (todos; e.g. `todos` in `add` at line 24). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt.
Stateful singleton: WebApp example/scalalib/web/7-webapp-scalajs-shared/src/WebApp.scala:6— `WebApp` is one shared instance (Cask routes object: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (todos; e.g. `todos` in `add` at line 19). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×4
Edited copy of a member (8 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:1221— libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:1221-1228 | libs/androidlib/src/mill/androidlib/AndroidModule.scala:911-918 — 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) libs/groovylib/src/mill/groovylib/GroovyModule.scala:280— libs/groovylib/src/mill/groovylib/GroovyModule.scala:280-287 | libs/scalalib/src/mill/scalalib/ScalaModule.scala:649-656 — 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) example/javalib/basic/2-module-deps/foo/src/foo/Foo.java:8— example/javalib/basic/2-module-deps/foo/src/foo/Foo.java:8-15 | example/javalib/module/18-programmable-module-deps/foo/src/foo/Foo.java:8-15 — 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) example/javalib/basic/6-custom-build-logic/foo/src/foo/Foo.java:4— example/javalib/basic/6-custom-build-logic/foo/src/foo/Foo.java:4-11 | example/javalib/module/17-custom-trait/src/qux/Qux.java:4-11 — 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· Edited copy of a member (4 corresponding lines) · ×4
Edited copy of a member (4 corresponding lines) core/api/src/mill/api/internal/ExpandBraces.scala:33— core/api/src/mill/api/internal/ExpandBraces.scala:33-39 | core/api/src/mill/api/internal/ParseArgs.scala:127-130 — 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) libs/javalib/src/mill/javalib/MavenWorkerSupport.scala:21— libs/javalib/src/mill/javalib/MavenWorkerSupport.scala:21-24 | libs/javalib/src/mill/javalib/PgpWorkerSupport.scala:15-18 — 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) libs/javalib/src/mill/javalib/MavenWorkerSupport.scala:28— libs/javalib/src/mill/javalib/MavenWorkerSupport.scala:28-31 | libs/javalib/src/mill/javalib/PgpWorkerSupport.scala:22-25 — 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) example/fundamentals/modules/8-diy-java-modules/foo/src/Foo.java:6— example/fundamentals/modules/8-diy-java-modules/foo/src/Foo.java:6-9 | example/fundamentals/modules/8-diy-java-modules/qux/src/Qux.java:6-10 — 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 (5 corresponding lines) · ×4
Edited copy of a member (5 corresponding lines) libs/javalib/src/mill/javalib/JavaModule.scala:1360— libs/javalib/src/mill/javalib/JavaModule.scala:1360-1364 | mill-build/src/millbuild/MillPublishJavaModule.scala:42-46 — These two members are one piece of code written twice and then edited apart: 5 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 (5 corresponding lines) example/javalib/basic/9-realistic/foo/src/foo/Foo.java:6— example/javalib/basic/9-realistic/foo/src/foo/Foo.java:6-11 | example/javalib/packaging/4-repackage-config/foo/src/foo/Foo.java:6-10 — These two members are one piece of code written twice and then edited apart: 5 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 (5 corresponding lines) example/kotlinlib/basic/9-realistic/foo/src/foo/Foo.kt:7— example/kotlinlib/basic/9-realistic/foo/src/foo/Foo.kt:7-12 | example/kotlinlib/packaging/4-repackage-config/foo/src/foo/Foo.kt:8-12 — These two members are one piece of code written twice and then edited apart: 5 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 (5 corresponding lines) example/scalalib/basic/9-realistic/foo/src/Foo.scala:5— example/scalalib/basic/9-realistic/foo/src/Foo.scala:5-10 | example/scalalib/packaging/4-repackage-config/foo/src/foo/Foo.scala:6-10 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (7 lines × 2) libs/androidlib/src/mill/androidlib/AndroidLibModule.scala:61— libs/androidlib/src/mill/androidlib/AndroidLibModule.scala:61-67 | libs/javalib/src/mill/javalib/PublishModule.scala:546-552 — 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 `libs/androidlib/src/mill/androidlib/AndroidLibModule.scala:61` 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) libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:553— libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:553-559 | libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:575-581 — both copies are in the same file, so extract the 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 `libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:553` 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) libs/javalib/src/mill/javalib/JavaModule.scala:1011— libs/javalib/src/mill/javalib/JavaModule.scala:1011-1017 | libs/scalalib/src/mill/scalalib/ScalaModule.scala:64-72 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) example/javalib/basic/2-module-deps/foo/src/foo/Foo.java:9— example/javalib/basic/2-module-deps/foo/src/foo/Foo.java:9-15 | example/javalib/module/18-programmable-module-deps/foo/src/foo/Foo.java:9-15 — before extracting anything, compare `example/javalib/basic/2-module-deps/foo/src/foo/Foo.java` and `example/javalib/module/18-programmable-module-deps/foo/src/foo/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (11 lines × 2) contrib/artifactory/src/mill/contrib/artifactory/ArtifactoryHttpApi.scala:24— contrib/artifactory/src/mill/contrib/artifactory/ArtifactoryHttpApi.scala:24-34 | libs/javalib/src/mill/javalib/publish/SonatypeHttpApi.scala:141-151 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:32— example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:32-42 | example/kotlinlib/web/6-webapp-kotlinjs-shared/client/src/ClientApp.kt:40-50 — before extracting anything, compare `example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt` and `example/kotlinlib/web/6-webapp-kotlinjs-shared/client/src/ClientApp.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:32` 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) example/cli/builtins/1-builtin-commands/foo/src/foo/Foo.java:17— example/cli/builtins/1-builtin-commands/foo/src/foo/Foo.java:17-27 | example/javalib/basic/7-multi-module/foo/src/foo/Foo.java:17-27 — before extracting anything, compare `example/cli/builtins/1-builtin-commands/foo/src/foo/Foo.java` and `example/javalib/basic/7-multi-module/foo/src/foo/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (11 lines × 2) example/pythonlib/web/3-hello-django/foo/src/manage.py:8— example/pythonlib/web/3-hello-django/foo/src/manage.py:8-18 | example/pythonlib/web/4-todo-django/todo/src/manage.py:8-18 — before extracting anything, compare `example/pythonlib/web/3-hello-django/foo/src/manage.py` and `example/pythonlib/web/4-todo-django/todo/src/manage.py` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×3
Edited copy of a member (25 corresponding lines) libs/javalib/src/mill/javalib/NativeImageModule.scala:72— libs/javalib/src/mill/javalib/NativeImageModule.scala:72-96 | libs/pythonlib/src/mill/pythonlib/PythonModule.scala:257-282 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:39— example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:39-69 | example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala:43-77 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:172— example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:172-196 | example/kotlinlib/web/6-webapp-kotlinjs-shared/src/WebApp.kt:74-98 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×3
Edited copy of a member (16 corresponding lines) core/internal/src/mill/internal/SpanningForest.scala:100— core/internal/src/mill/internal/SpanningForest.scala:100-115 | core/internal/src/mill/internal/SpanningForest.scala:119-135 — 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) libs/javalib/src/mill/javalib/Lib.scala:45— libs/javalib/src/mill/javalib/Lib.scala:45-60 | libs/javalib/src/mill/javalib/Lib.scala:84-103 — 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) example/extending/jvmcode/4-module-classloader/bar/src/Bar.java:10— example/extending/jvmcode/4-module-classloader/bar/src/Bar.java:10-25 | example/extending/jvmcode/6-module-cached-classloader/bar/src/Bar.java:15-31 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×3
Edited copy of a member (19 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidLibModule.scala:55— libs/androidlib/src/mill/androidlib/AndroidLibModule.scala:55-73 | libs/javalib/src/mill/javalib/PublishModule.scala:532-554 — 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.
Edited copy of a member (19 corresponding lines) libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JsCompileImpl.scala:18— libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JsCompileImpl.scala:18-36 | libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JvmCompileImpl.scala:18-36 — 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.
Edited copy of a member (19 corresponding lines) core/api/src/mill/api/Task.scala:668— core/api/src/mill/api/Task.scala:668-687 | core/api/src/mill/api/Task.scala:785-803 — 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 (17 corresponding lines) · ×3
Edited copy of a member (17 corresponding lines) libs/javalib/api/src/mill/javalib/api/internal/InternalJvmWorkerApi.scala:34— libs/javalib/api/src/mill/javalib/api/internal/InternalJvmWorkerApi.scala:34-50 | libs/javalib/api/src/mill/javalib/api/internal/InternalJvmWorkerApi.scala:70-93 — 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) libs/scalajslib/worker/1/src/mill/scalajslib/worker/ScalaJSWorkerImpl.scala:206— libs/scalajslib/worker/1/src/mill/scalajslib/worker/ScalaJSWorkerImpl.scala:206-227 | libs/scalanativelib/worker/0.5/src/mill/scalanativelib/worker/ScalaNativeWorkerImpl.scala:140-156 — 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) libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:407— libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:407-423 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:463-480 — 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 (15 corresponding lines) · ×3
Edited copy of a member (15 corresponding lines) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:229— libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:229-243 | libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:171-186 — 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.
Edited copy of a member (15 corresponding lines) libs/javalib/src/mill/javalib/CoursierModule.scala:312— libs/javalib/src/mill/javalib/CoursierModule.scala:312-326 | libs/javalib/src/mill/javalib/CoursierModule.scala:345-360 — 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.
Edited copy of a member (15 corresponding lines) example/kotlinlib/module/4-programmable-config/custom-src/Foo2.kt:7— example/kotlinlib/module/4-programmable-config/custom-src/Foo2.kt:7-25 | example/kotlinlib/module/1-basic-config/custom-src/Foo2.kt:7-21 — 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 copies of one member (3 members, 15+ corresponding lines) · ×3
Edited copies of one member (3 members, 15+ corresponding lines) libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:310— libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:310-328 | libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:1128-1144 | libs/androidlib/src/mill/androidlib/AndroidModule.scala:547-561 — 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.
Edited copies of one member (3 members, 15+ corresponding lines) contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:117— contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:117-131 | contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:133-147 | contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:149-163 — 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.
Edited copies of one member (3 members, 15+ corresponding lines) libs/pythonlib/src/mill/pythonlib/RuffModule.scala:62— libs/pythonlib/src/mill/pythonlib/RuffModule.scala:62-77 | libs/pythonlib/src/mill/pythonlib/RuffModule.scala:88-102 | libs/pythonlib/src/mill/pythonlib/RuffModule.scala:107-122 — 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 copy of a member (11 corresponding lines) · ×3
Edited copy of a member (11 corresponding lines) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:359— libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:359-369 | libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:469-482 — 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) libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:948— libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:948-958 | libs/androidlib/src/mill/androidlib/AndroidR8AppModule.scala:24-34 — 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) example/scalalib/module/1-basic-config/custom-src/Foo2.scala:5— example/scalalib/module/1-basic-config/custom-src/Foo2.scala:5-15 | example/scalalib/module/4-programmable-config/custom-src/Foo2.scala:5-19 — 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.
Duplicated block (12 lines × 2) libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala:149— libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala:149-160 | libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala:449-460 — 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 `libs/init/gradle/src/mill/main/gradle/MillGradleBuildGenMain.scala:149` 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) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:155— libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:155-166 | libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:426-437 — both copies are in the same file, so extract the 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 `libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:155` 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) libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:625— libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:625-636 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:686-697 — both copies are in the same file, so extract the 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 `libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:625` 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, `libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:638` calls `mkConfig`, `npmInstall` and `libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:699` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:202— libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:202-211 | libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:232-241 — both copies are in the same file, so extract the block into 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) example/scalalib/web/2-todo-webapp/src/WebApp.scala:112— example/scalalib/web/2-todo-webapp/src/WebApp.scala:112-121 | example/scalalib/web/4-todo-http4s/src/WebApp.scala:125-134 — before extracting anything, compare `example/scalalib/web/2-todo-webapp/src/WebApp.scala` and `example/scalalib/web/4-todo-http4s/src/WebApp.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/web/2-todo-webapp/src/WebApp.scala:112` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) example/kotlinlib/script/3-web-server/WebServer.kt:10— example/kotlinlib/script/3-web-server/WebServer.kt:10-19 | example/kotlinlib/web/1-web-example/src/WebServer.kt:10-19 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (5 members, 50+ identical tokens) example/scalalib/web/2-todo-webapp/src/WebApp.scala:53— example/scalalib/web/2-todo-webapp/src/WebApp.scala:53-108 | example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:62-117 | example/scalalib/web/4-todo-http4s/src/WebApp.scala:31-151 | example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:53-107 | example/scalalib/web/7-webapp-scalajs-shared/shared/src/Shared.scala:12-67 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:45— libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:45-68 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:137-174 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:206-249 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:373-396 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:430-461 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) example/fundamentals/modules/7-root-module/src/foo/Foo.java:16— example/fundamentals/modules/7-root-module/src/foo/Foo.java:16-33 | example/javalib/basic/1-simple/src/foo/Foo.java:16-33 | example/javalib/basic/5-programmable/foo/src/foo/Foo.java:16-33 | example/javalib/packaging/2-native-image-libs/foo/src/foo/Foo.java:16-33 | integration/dedicated/full-run-logs/resources/src/foo/Foo.java:16-34 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Low cohesion: BuildModelBuilder (LCOM4 5) libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala:27— BuildModelBuilder'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: MillRpcWireTransport (LCOM4 4) libs/rpc/src/mill/rpc/MillRpcWireTransport.scala:9— MillRpcWireTransport's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: MillDaemonServer (LCOM4 4) runner/server/src/mill/server/MillDaemonServer.scala:17— MillDaemonServer'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.
MethodTooLong: MillMain0.main0 runner/daemon/src/mill/daemon/MillMain0.scala:98— MethodTooLong — main0 runs 410 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 310 over it, 4.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Execution.execute0Once core/exec/src/mill/exec/Execution.scala:167— MethodTooLong — execute0Once runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (4 members, 50+ identical tokens) libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:67— libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:67-111 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:113-144 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:147-187 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:189-219 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) example/javalib/dependencies/1-dependencies/src/foo/Foo.java:9— example/javalib/dependencies/1-dependencies/src/foo/Foo.java:9-16 | example/javalib/dependencies/3-unmanaged-jars/src/foo/Foo.java:9-16 | example/kotlinlib/dependencies/1-dependencies/src/foo/Foo.java:9-16 | example/scalalib/dependencies/1-dependencies/src/foo/Foo.java:9-16 — 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 (26 corresponding lines) · ×2
Edited copy of a member (26 corresponding lines) libs/javalib/src/mill/javalib/PublishModule.scala:129— libs/javalib/src/mill/javalib/PublishModule.scala:129-158 | mill-build/src/millbuild/MillPublishJavaModule.scala:79-104 — 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) libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:625— libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:625-651 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:686-711 — 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 (18 corresponding lines) · ×2
Edited copy of a member (18 corresponding lines) libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:445— libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:445-462 | libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:765-785 — 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) libs/androidlib/src/mill/androidlib/AndroidModule.scala:618— libs/androidlib/src/mill/androidlib/AndroidModule.scala:618-635 | libs/androidlib/src/mill/androidlib/AndroidModule.scala:881-908 — 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 (21 corresponding lines) · ×2
Edited copy of a member (21 corresponding lines) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:459— libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:459-479 | libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:496-521 — These two members are one piece of code written twice and then edited apart: 21 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 (21 corresponding lines) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:146— libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:146-166 | libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:417-437 — These two members are one piece of code written twice and then edited apart: 21 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) libs/groovylib/src/mill/groovylib/GroovyWorkerManager.scala:21— libs/groovylib/src/mill/groovylib/GroovyWorkerManager.scala:21-40 | libs/javalib/src/mill/javalib/spring/boot/SpringBootToolsModule.scala:42-65 — 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) core/api/java11/src/mill/api/internal/Mirrors.scala:336— core/api/java11/src/mill/api/internal/Mirrors.scala:336-357 | core/api/java11/src/mill/api/internal/Mirrors.scala:359-378 — 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 (23 corresponding lines) · ×2
Edited copy of a member (23 corresponding lines) example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala:19— example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala:19-46 | website/blog/modules/ROOT/attachments/fast-assembly/src/main/scala/foo/Foo.scala:19-41 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) libs/util/java11/src/mill/util/Jvm.scala:89— libs/util/java11/src/mill/util/Jvm.scala:89-117 | libs/util/java11/src/mill/util/Jvm.scala:162-184 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×2
Edited copy of a member (10 corresponding lines) contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:456— contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:456-465 | contrib/flyway/src/mill/contrib/flyway/FlywayModule.scala:467-479 — 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) libs/javalib/src/mill/javalib/dependency/versions/Version.scala:168— libs/javalib/src/mill/javalib/dependency/versions/Version.scala:168-177 | libs/javalib/src/mill/javalib/dependency/versions/Version.scala:180-189 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×2
Edited copy of a member (14 corresponding lines) libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:552— libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:552-568 | libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:574-587 — 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) libs/scalajslib/config/src/mill/scalajslib/config/worker/ScalaJSConfigWorker.scala:22— libs/scalajslib/config/src/mill/scalajslib/config/worker/ScalaJSConfigWorker.scala:22-35 | libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:19-32 — 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 (12 corresponding lines) · ×2
Edited copy of a member (12 corresponding lines) libs/init/sbt/exportplugin/src/mill/main/sbt/ExportBuildPlugin.scala:83— libs/init/sbt/exportplugin/src/mill/main/sbt/ExportBuildPlugin.scala:83-94 | libs/init/sbt/exportplugin/src/mill/main/sbt/ExportBuildPlugin.scala:96-107 — 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) example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala:8— example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala:8-22 | example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:7-18 — 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 (9 corresponding lines) · ×2
Edited copy of a member (9 corresponding lines) libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:144— libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:144-152 | libs/init/buildgen/src/mill/main/buildgen/BuildGenYaml.scala:67-75 — 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) contrib/codeartifact/src/mill/contrib/codeartifact/CodeArtifactPublisher.scala:90— contrib/codeartifact/src/mill/contrib/codeartifact/CodeArtifactPublisher.scala:90-98 | libs/javalib/src/mill/javalib/publish/SonatypePublisher.scala:108-118 — 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· Edited copy of a member (7 corresponding lines) · ×2
Edited copy of a member (7 corresponding lines) libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:1066— libs/androidlib/src/mill/androidlib/AndroidAppModule.scala:1066-1072 | libs/androidlib/src/mill/androidlib/AndroidModule.scala:204-210 — 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) example/javalib/springboot/3-todo-spring-boot/src/com/example/todoitem/web/TodoItemController.java:85— example/javalib/springboot/3-todo-spring-boot/src/com/example/todoitem/web/TodoItemController.java:85-91 | example/javalib/web/4-todo-micronaut/src/main/java/example/micronaut/TodoItemController.java:118-124 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (14 lines × 2) libs/javascriptlib/src/mill/javascriptlib/PublishModule.scala:129— libs/javascriptlib/src/mill/javascriptlib/PublishModule.scala:129-143 | libs/javascriptlib/src/mill/javascriptlib/TypeScriptModule.scala:641-654 — 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 `libs/javascriptlib/src/mill/javascriptlib/PublishModule.scala:129` 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) libs/scalalib/src/mill/scalalib/ScalaModule.scala:357— libs/scalalib/src/mill/scalalib/ScalaModule.scala:357-370 | runner/meta/src/mill/meta/MillBuildRootModule.scala:314-327 — 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 `libs/scalalib/src/mill/scalalib/ScalaModule.scala:357` 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–13 lines × 2) libs/javalib/src/mill/javalib/NativeImageModule.scala:84— libs/javalib/src/mill/javalib/NativeImageModule.scala:84-96 | libs/pythonlib/src/mill/pythonlib/PythonModule.scala:271-282 — 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 `libs/javalib/src/mill/javalib/NativeImageModule.scala:84` 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–13 lines × 2) libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:67— libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:67-78 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:113-125 — both copies are in the same file, so extract the 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 `libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:67` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 3) libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:103— libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:103-111 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:136-144 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:211-219 — 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 `libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:103` 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 × 3) example/javalib/dependencies/1-dependencies/src/bar/Bar.java:24— example/javalib/dependencies/1-dependencies/src/bar/Bar.java:24-32 | example/kotlinlib/dependencies/1-dependencies/src/bar/Bar.java:24-32 | example/scalalib/dependencies/1-dependencies/src/bar/Bar.java:24-32 — before extracting anything, compare `example/javalib/dependencies/1-dependencies/src/bar/Bar.java` and `example/kotlinlib/dependencies/1-dependencies/src/bar/Bar.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (5 lines × 4) libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:102— libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:102-106 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:135-139 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:177-181 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:210-214 — 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 `libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:102` 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 × 4) example/kotlinlib/basic/2-module-deps/bar/src/bar/Bar.kt:6— example/kotlinlib/basic/2-module-deps/bar/src/bar/Bar.kt:6-10 | example/kotlinlib/basic/7-multi-module/bar/src/bar/Bar.kt:6-10 | example/kotlinlib/module/18-programmable-module-deps/bar/src/bar/Bar.kt:6-10 | example/kotlinlib/script/9-programmable-module-deps/bar/src/bar/Bar.kt:6-10 — before extracting anything, compare `example/kotlinlib/basic/2-module-deps/bar/src/bar/Bar.kt` and `example/kotlinlib/basic/7-multi-module/bar/src/bar/Bar.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (26 lines × 2) example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:72— example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:72-97 | example/scalalib/web/7-webapp-scalajs-shared/shared/src/Shared.scala:31-56 — before extracting anything, compare `example/scalalib/web/6-webapp-scalajs/src/WebApp.scala` and `example/scalalib/web/7-webapp-scalajs-shared/shared/src/Shared.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:72` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (26 lines × 2) example/androidlib/kotlin/1-hello-kotlin-declarative/app/src/main/java/com/helloworld/app/MainActivity.kt:12— example/androidlib/kotlin/1-hello-kotlin-declarative/app/src/main/java/com/helloworld/app/MainActivity.kt:12-37 | example/androidlib/kotlin/1-hello-kotlin/app/src/main/java/com/helloworld/app/MainActivity.kt:12-37 — before extracting anything, compare `example/androidlib/kotlin/1-hello-kotlin-declarative/app/src/main/java/com/helloworld/app/MainActivity.kt` and `example/androidlib/kotlin/1-hello-kotlin/app/src/main/java/com/helloworld/app/MainActivity.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (5 lines × 2) libs/javalib/testrunner/src/mill/javalib/testrunner/TestRunnerUtils.scala:219— libs/javalib/testrunner/src/mill/javalib/testrunner/TestRunnerUtils.scala:219-223 | runner/bsp/worker/src/mill/bsp/worker/BspTestReporter.scala:65-69 — 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 `libs/javalib/testrunner/src/mill/javalib/testrunner/TestRunnerUtils.scala:219` 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) example/scalalib/web/8-cross-version-platform-publishing/foo/qux/src/Qux.scala:4— example/scalalib/web/8-cross-version-platform-publishing/foo/qux/src/Qux.scala:4-8 | example/scalalib/web/9-cross-platform-version-publishing/qux/src/Qux.scala:4-8 — before extracting anything, compare `example/scalalib/web/8-cross-version-platform-publishing/foo/qux/src/Qux.scala` and `example/scalalib/web/9-cross-platform-version-publishing/qux/src/Qux.scala` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) example/kotlinlib/basic/6-custom-build-logic/foo/src/foo/Foo.kt:5— example/kotlinlib/basic/6-custom-build-logic/foo/src/foo/Foo.kt:5-17 | example/kotlinlib/module/17-custom-trait/src/qux/Qux.kt:5-17 — before extracting anything, compare `example/kotlinlib/basic/6-custom-build-logic/foo/src/foo/Foo.kt` and `example/kotlinlib/module/17-custom-trait/src/qux/Qux.kt` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) example/kotlinlib/linting/1-linting/src/foo/Foo.kt:3— example/kotlinlib/linting/1-linting/src/foo/Foo.kt:3-15 | example/kotlinlib/linting/2-detekt/src/example/Foo.kt:5-17 — before extracting anything, compare `example/kotlinlib/linting/1-linting/src/foo/Foo.kt` and `example/kotlinlib/linting/2-detekt/src/example/Foo.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Off the main sequence: integration/feature/gen-eclipse/resources/mixed-java-scala-project/runner.launcher — integration/feature/gen-eclipse/resources/mixed-java-scala-project/runner.launcher: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: integration/feature/gen-idea/resources/hello-kotlin-idea/HelloKotlin — integration/feature/gen-idea/resources/hello-kotlin-idea/HelloKotlin: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Sync-over-async blocking libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:456— `testTask` is async and calls Thread.sleep — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs.
Sync-over-async blocking libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:493— `testTask` is async and calls Thread.sleep — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs.
Low contrast colour pair in CSS (4.0:1) example/large/multilang/14-multi-language/client/src/App.css:52— `button` sets color: #fff on background-color: #007bff — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
Stateful module: app REDACTED:81— `app` serves requests (Flask routes run on a server thread per request, and every thread shares the one module object) but updates module state with a read-modify-write outside any lock (todos; e.g. `todos` in `clear_completed` at line 81). Two requests that interleave between the read and the write lose one update.
ExportBuildPlugin.exportProject (cyclomatic 70) libs/init/sbt/exportplugin/src/mill/main/sbt/ExportBuildPlugin.scala:121— ExportBuildPlugin.exportProject has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MillMain0.main0 (cyclomatic 54) runner/daemon/src/mill/daemon/MillMain0.scala:98— MillMain0.main0 has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GenIdeaImpl.xmlFileLayout (cyclomatic 44) runner/idea/src/mill/idea/GenIdeaImpl.scala:112— GenIdeaImpl.xmlFileLayout has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ResolveCore.resolve (cyclomatic 37) core/resolve/src/mill/resolve/ResolveCore.scala:98— ResolveCore.resolve has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
CrossMacros.makeImpl (cyclomatic 36) core/api/src/mill/api/internal/CrossMacros.scala:8— CrossMacros.makeImpl 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.
Execution.execute0Once (cyclomatic 34) core/exec/src/mill/exec/Execution.scala:167— Execution.execute0Once has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GroupExecution.executeGroupCached (cyclomatic 34) core/exec/src/mill/exec/GroupExecution.scala:237— GroupExecution.executeGroupCached has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ScalaJSConfig.config (cyclomatic 34) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfig.scala:45— ScalaJSConfig.config has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
KotlinJsModule.kotlinJsCompile (cyclomatic 32) libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:272— KotlinJsModule.kotlinJsCompile 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.
MillBuildBootstrap.processRunClasspath (cyclomatic 32) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:329— MillBuildBootstrap.processRunClasspath 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.
CodeGen.generateWrappedAndSupportSources (cyclomatic 29) runner/meta/src/mill/meta/CodeGen.scala:73— CodeGen.generateWrappedAndSupportSources has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ExampleParser.apply (cyclomatic 28) mill-build/src-testkit/mill/testkit/ExampleParser.scala:12— ExampleParser.apply 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.
SemanticdbProcessor.postProcess (cyclomatic 27) libs/javalib/scalameta-worker/src/SemanticdbProcessor.scala:15— SemanticdbProcessor.postProcess has cyclomatic complexity 27 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
ToFormatterStep.apply (cyclomatic 25) libs/javalib/spotless-worker/src/mill/javalib/spotless/converters.scala:34— ToFormatterStep.apply 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.
ZincWorker.compileInternal (cyclomatic 24) libs/javalib/worker/src/mill/javalib/zinc/ZincWorker.scala:332— ZincWorker.compileInternal 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.
MillMavenBuildGenMain.init (cyclomatic 23) libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala:13— MillMavenBuildGenMain.init 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.
TransformingReporter.dottyStyleMessage (cyclomatic 23) libs/javalib/worker/src/mill/javalib/zinc/TransformingReporter.scala:46— TransformingReporter.dottyStyleMessage 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.
prompt.logPrefixedLine (cyclomatic 22) core/internal/src/mill/internal/PromptLogger.scala:168— prompt.logPrefixedLine has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BuildModelBuilder.configureJvmModule (cyclomatic 20) libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala:315— BuildModelBuilder.configureJvmModule 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.
MillBuildBootstrap.evaluateRec (cyclomatic 20) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:114— MillBuildBootstrap.evaluateRec 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.
UvModule.distribution (cyclomatic 19) libs/pythonlib/src/mill/pythonlib/UvModule.scala:172— UvModule.distribution 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.
MillRpcClient.create (cyclomatic 19) libs/rpc/src/mill/rpc/MillRpcClient.scala:20— MillRpcClient.create 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.
ExampleRenderer.render (cyclomatic 19) mill-build/src-testkit/mill/testkit/ExampleRenderer.scala:19— ExampleRenderer.render 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.
LocalSummary.analyzeMethodArgTypes (cyclomatic 19) runner/codesig/src/mill/codesig/LocalSummary.scala:163— LocalSummary.analyzeMethodArgTypes 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.
SharedOutLockManager.lease (cyclomatic 19) runner/daemon/src/mill/daemon/SharedOutLockManager.scala:21— SharedOutLockManager.lease 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.
Router.applyImpl (cyclomatic 18) core/api/src/mill/api/Discover.scala:75— Router.applyImpl has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
Resolve.resolve (cyclomatic 18) core/resolve/src/mill/resolve/Resolve.scala:422— Resolve.resolve 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.
MillSbtBuildGenMain.init (cyclomatic 18) libs/init/sbt/src/mill/main/sbt/MillSbtBuildGenMain.scala:15— MillSbtBuildGenMain.init 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.
ScriptModuleInit.moduleFor (cyclomatic 17) core/eval/src/mill/eval/ScriptModuleInit.scala:29— ScriptModuleInit.moduleFor 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.
Util.parseYaml0 (cyclomatic 17) core/internal/src/mill/internal/Util.scala:177— Util.parseYaml0 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
OsDetector.normalizeOsName (cyclomatic 17) libs/javalib/src/mill/javalib/OsDetector.scala:21— OsDetector.normalizeOsName 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.
BashTokenizer.tokenize (cyclomatic 17) testkit/src/mill/testkit/BashTokenizer.scala:7— BashTokenizer.tokenize has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Inspect.inspect (cyclomatic 16) libs/util/src/mill/util/Inspect.scala:83— Inspect.inspect has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MyMethodVisitor.visitInvokeDynamicInsn (cyclomatic 16) runner/codesig/src/mill/codesig/LocalSummary.scala:407— MyMethodVisitor.visitInvokeDynamicInsn 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.
ResolvedCalls.apply (cyclomatic 16) runner/codesig/src/mill/codesig/ResolvedCalls.scala:28— ResolvedCalls.apply 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.
ExportBuildPlugin.exportProject (cognitive 133) libs/init/sbt/exportplugin/src/mill/main/sbt/ExportBuildPlugin.scala:121— ExportBuildPlugin.exportProject has cognitive complexity 133 (threshold 15). Drivers by points: if/else 44 (82 pts), match/switch 16 (41 pts), boolean chains 10 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MillMain0.main0 (cognitive 107) runner/daemon/src/mill/daemon/MillMain0.scala:98— MillMain0.main0 has cognitive complexity 107 (threshold 15). Drivers by points: if/else 27 (52 pts), error handling 7 (26 pts), match/switch 6 (18 pts), boolean chains 11 (nesting depth added 56). 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.
ResolveCore.resolve (cognitive 83) core/resolve/src/mill/resolve/ResolveCore.scala:98— ResolveCore.resolve has cognitive complexity 83 (threshold 15). Drivers by points: match/switch 13 (37 pts), if/else 18 (33 pts), loops 2 (12 pts), boolean chains 1 (nesting depth added 49). 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.
LocalSummary.analyzeMethodArgTypes (cognitive 74) runner/codesig/src/mill/codesig/LocalSummary.scala:163— LocalSummary.analyzeMethodArgTypes has cognitive complexity 74 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 5 (20 pts), match/switch 3 (16 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GroupExecution.executeGroupCached (cognitive 66) core/exec/src/mill/exec/GroupExecution.scala:237— GroupExecution.executeGroupCached has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (35 pts), match/switch 11 (27 pts), boolean chains 4 (nesting depth added 30). 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.
CodeGen.generateWrappedAndSupportSources (cognitive 66) runner/meta/src/mill/meta/CodeGen.scala:73— CodeGen.generateWrappedAndSupportSources has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (40 pts), match/switch 6 (14 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Execution.execute0Once (cognitive 65) core/exec/src/mill/exec/Execution.scala:167— Execution.execute0Once has cognitive complexity 65 (threshold 15). Drivers by points: if/else 26 (44 pts), match/switch 5 (8 pts), boolean chains 6, error handling 2 (6 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt.logPrefixedLine (cognitive 56) core/internal/src/mill/internal/PromptLogger.scala:168— prompt.logPrefixedLine has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 3 (7 pts), match/switch 2 (7 pts), boolean chains 5, error handling 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MillMavenBuildGenMain.init (cognitive 53) libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.scala:13— MillMavenBuildGenMain.init has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (38 pts), match/switch 7 (14 pts), boolean chains 1 (nesting depth added 27). 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.
Tarjans.apply (cognitive 52) core/internal/src/mill/internal/Tarjans.scala:8— Tarjans.apply has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (42 pts), loops 3 (10 pts) (nesting depth added 39). 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.
GenIdeaImpl.xmlFileLayout (cognitive 46) runner/idea/src/mill/idea/GenIdeaImpl.scala:112— GenIdeaImpl.xmlFileLayout has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (23 pts), match/switch 14, boolean chains 8, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
BuildModelBuilder.configureJvmModule (cognitive 44) libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala:315— BuildModelBuilder.configureJvmModule has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CrossMacros.makeImpl (cognitive 42) core/api/src/mill/api/internal/CrossMacros.scala:8— CrossMacros.makeImpl has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 19 (21 pts), if/else 17 (20 pts), boolean chains 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.
MillBuildBootstrap.evaluateRec (cognitive 41) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:114— MillBuildBootstrap.evaluateRec has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (21 pts), error handling 3 (11 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TransformingReporter.dottyStyleMessage (cognitive 40) libs/javalib/worker/src/mill/javalib/zinc/TransformingReporter.scala:46— TransformingReporter.dottyStyleMessage has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 6, match/switch 3 (6 pts), error handling 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Router.applyImpl (cognitive 36) core/api/src/mill/api/Discover.scala:75— Router.applyImpl has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 6 (8 pts), loops 5 (8 pts), error handling 1 (4 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Resolve.resolve (cognitive 34) core/resolve/src/mill/resolve/Resolve.scala:422— Resolve.resolve has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 9 (15 pts), 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.
ZincWorker.compileInternal (cognitive 34) libs/javalib/worker/src/mill/javalib/zinc/ZincWorker.scala:332— ZincWorker.compileInternal has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17, match/switch 10 (12 pts), loops 2 (3 pts), boolean chains 1, error handling 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.
ScalaJSWorkerImpl.rawLink (cognitive 34) libs/scalajslib/worker/1/src/mill/scalajslib/worker/ScalaJSWorkerImpl.scala:79— ScalaJSWorkerImpl.rawLink has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (13 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SemanticdbProcessor.postProcess (cognitive 33) libs/javalib/scalameta-worker/src/SemanticdbProcessor.scala:15— SemanticdbProcessor.postProcess has cognitive complexity 33 (threshold 15). Drivers by points: loops 14 (29 pts), if/else 2 (3 pts), match/switch 1 (nesting depth added 16). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
InvalidationForest.buildInvalidationTree (cognitive 32) core/internal/src/mill/internal/InvalidationForest.scala:18— InvalidationForest.buildInvalidationTree has cognitive complexity 32 (threshold 15). Drivers by points: loops 7 (19 pts), match/switch 4 (7 pts), if/else 4 (6 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Util.parseYaml0 (cognitive 32) core/internal/src/mill/internal/Util.scala:177— Util.parseYaml0 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 5 (10 pts), loops 2 (4 pts), error handling 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ScalaJSConfig.config (cognitive 31) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfig.scala:45— ScalaJSConfig.config has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 6 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SharedOutLockManager.lease (cognitive 31) runner/daemon/src/mill/daemon/SharedOutLockManager.scala:21— SharedOutLockManager.lease has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (19 pts), error handling 4 (9 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PathRef.calc (cognitive 27) core/api/java11/src/mill/api/PathRef.scala:167— PathRef.calc has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 2 (9 pts), loops 1 (2 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.
Pumper.run (cognitive 27) core/constants/src/mill/constants/ProxyStream.java:151— Pumper.run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), match/switch 1 (4 pts), error handling 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ResolveCore.tryResolveLabelAsCross (cognitive 26) core/resolve/src/mill/resolve/ResolveCore.scala:579— ResolveCore.tryResolveLabelAsCross has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (13 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TabCompleteModule.complete (cognitive 26) libs/tabcomplete/src/mill/tabcomplete/TabCompleteModule.scala:20— TabCompleteModule.complete has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 4 (8 pts), loops 1 (2 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.
Inspect.inspect (cognitive 26) libs/util/src/mill/util/Inspect.scala:83— Inspect.inspect has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, match/switch 4 (7 pts), boolean chains 3, loops 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.
MillBuildBootstrap.processRunClasspath (cognitive 26) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:329— MillBuildBootstrap.processRunClasspath has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 11 (17 pts), if/else 6, boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ExpandBraces.expandRec (cognitive 25) core/api/src/mill/api/internal/ExpandBraces.scala:14— ExpandBraces.expandRec has cognitive complexity 25 (threshold 15). Drivers by points: loops 4 (18 pts), if/else 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 17). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
MillBuildServer.startWatcherThread (cognitive 25) runner/bsp/worker/src/mill/bsp/worker/MillBuildServer.scala:135— MillBuildServer.startWatcherThread has cognitive complexity 25 (threshold 15). Drivers by points: error handling 7 (15 pts), if/else 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GroupExecution.executeGroup (cognitive 23) core/exec/src/mill/exec/GroupExecution.scala:653— GroupExecution.executeGroup has cognitive complexity 23 (threshold 15). Drivers by points: error handling 3 (9 pts), if/else 4 (6 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BuildGenYaml.renderYamlPomSettings (cognitive 23) libs/init/buildgen/src/mill/main/buildgen/BuildGenYaml.scala:493— BuildGenYaml.renderYamlPomSettings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ResolvedCalls.apply (cognitive 23) runner/codesig/src/mill/codesig/ResolvedCalls.scala:28— ResolvedCalls.apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 7 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DiscoveredBuildFiles.parseBuildFiles (cognitive 23) runner/meta/src/mill/meta/DiscoveredBuildFiles.scala:38— DiscoveredBuildFiles.parseBuildFiles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, error handling 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Applicative.impl (cognitive 22) core/api/src/mill/api/internal/Applicative.scala:32— Applicative.impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MainModule.show0 (cognitive 22) libs/util/src/mill/util/MainModule.scala:483— MainModule.show0 has cognitive complexity 22 (threshold 15). Drivers by points: loops 3 (11 pts), match/switch 3 (10 pts), if/else 1 (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.
ExampleParser.apply (cognitive 22) mill-build/src-testkit/mill/testkit/ExampleParser.scala:12— ExampleParser.apply has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 6 (9 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
LockUpgrade.readThenWrite (cognitive 21) core/internal/src/mill/internal/LockUpgrade.scala:64— LockUpgrade.readThenWrite has cognitive complexity 21 (threshold 15). Drivers by points: error handling 4 (9 pts), if/else 4 (8 pts), match/switch 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BuildGenScala.renderDefValues (cognitive 21) libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:326— BuildGenScala.renderDefValues has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MillSbtBuildGenMain.init (cognitive 21) libs/init/sbt/src/mill/main/sbt/MillSbtBuildGenMain.scala:15— MillSbtBuildGenMain.init has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 4 (6 pts), boolean chains 1, error handling 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.
IncrementalAnnotationProcessing.detect (cognitive 21) libs/javalib/worker/src/mill/javalib/zinc/IncrementalAnnotationProcessing.scala:123— IncrementalAnnotationProcessing.detect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
KotlinJsModule.kotlinJsCompile (cognitive 21) libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:272— KotlinJsModule.kotlinJsCompile has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 10 (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.
MillScalaParserImpl.objectDatas (cognitive 21) runner/daemon/src/mill/daemon/MillScalaParserImpl.scala:216— MillScalaParserImpl.objectDatas has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 3 (5 pts), match/switch 3, 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.
EvaluatorImpl.execute (cognitive 20) core/eval/src/mill/eval/EvaluatorImpl.scala:319— EvaluatorImpl.execute has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (8 pts), loops 3 (6 pts), if/else 4, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaskCacheEntry.read (cognitive 20) core/exec/src/mill/exec/TaskCacheEntry.scala:32— TaskCacheEntry.read has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), error handling 3 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CrossThreadRwLock.acquire (cognitive 20) core/internal/src/mill/internal/CrossThreadRwLock.scala:43— CrossThreadRwLock.acquire has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), error handling 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
BuildGenScala.renderDefSources (cognitive 20) libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:358— BuildGenScala.renderDefSources has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BashTokenizer.tokenize (cognitive 20) testkit/src/mill/testkit/BashTokenizer.scala:7— BashTokenizer.tokenize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PathRefFormat.parse (cognitive 19) core/api/java11/src/mill/api/PathRef.scala:373— PathRefFormat.parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EvaluatorImpl.validateModuleOverrides (cognitive 19) core/eval/src/mill/eval/EvaluatorImpl.scala:206— EvaluatorImpl.validateModuleOverrides has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 4, boolean chains 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.
MillInitGpgKeysMain.main (cognitive 19) libs/javalib/pgp-worker/src/mill/javalib/pgp/worker/MillInitGpgKeysMain.scala:9— MillInitGpgKeysMain.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, error handling 2 (3 pts), loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
DepsTreeRenderer.render (cognitive 19) libs/javalib/src/mill/javalib/internal/DepsTreeRenderer.scala:95— DepsTreeRenderer.render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MillScalaParserImpl.splitTrees (cognitive 19) runner/daemon/src/mill/daemon/MillScalaParserImpl.scala:329— MillScalaParserImpl.splitTrees has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 6 (8 pts), boolean chains 1 (nesting depth added 4). 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.
LauncherOutFilesRecordStore.readActiveRecord (cognitive 18) core/internal/src/mill/internal/LauncherOutFilesRecordStore.scala:70— LauncherOutFilesRecordStore.readActiveRecord has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), error handling 3 (5 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MillBuildBootstrap.classpath (cognitive 18) runner/daemon/src/mill/daemon/MillBuildBootstrap.scala:882— MillBuildBootstrap.classpath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GenEclipseImpl.getEclipseProjects (cognitive 18) runner/eclipse/src/mill/eclipse/GenEclipseImpl.scala:156— GenEclipseImpl.getEclipseProjects has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (8 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.
GenIdeaImpl.moduleXmlTemplate (cognitive 18) runner/idea/src/mill/idea/GenIdeaImpl.scala:772— GenIdeaImpl.moduleXmlTemplate has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (8 pts), if/else 6, match/switch 2 (4 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InputPumper.run (cognitive 18) core/constants/src/mill/constants/InputPumper.java:30— InputPumper.run has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (8 pts), if/else 5 (8 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Internal.symKindSym (cognitive 17) core/api/java11/src/mill/api/internal/Mirrors.scala:151— Internal.symKindSym has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Util.splitPreserveEOL (cognitive 17) core/internal/src/mill/internal/Util.scala:382— Util.splitPreserveEOL has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BuildGen.withBaseModule (cognitive 17) libs/init/buildgen/src/mill/main/buildgen/BuildGen.scala:23— BuildGen.withBaseModule has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 4, match/switch 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.
OsDetector.normalizeOsName (cognitive 17) libs/javalib/src/mill/javalib/OsDetector.scala:21— OsDetector.normalizeOsName has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ConciseLevelConsoleAppender.appendLog (cognitive 17) libs/javalib/worker/src/sbt/mill/SbtLoggerUtils.scala:30— ConciseLevelConsoleAppender.appendLog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
VcsVersion.calcVcsState (cognitive 17) libs/util/src/mill/util/VcsVersion.scala:126— VcsVersion.calcVcsState has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), error handling 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IntegrationTesterBase.initWorkspace (cognitive 17) testkit/src/mill/testkit/IntegrationTesterBase.scala:54— IntegrationTesterBase.initWorkspace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), boolean chains 2, match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Input.read (cognitive 16) core/internal/src/mill/internal/PipeStreams.scala:110— Input.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Resolve.resolveRootModule (cognitive 16) core/resolve/src/mill/resolve/Resolve.scala:629— Resolve.resolveRootModule has cognitive complexity 16 (threshold 15). Drivers by points: error handling 2 (5 pts), loops 2 (5 pts), if/else 3, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BuildGenYaml.renderYamlModuleBody (cognitive 16) libs/init/buildgen/src/mill/main/buildgen/BuildGenYaml.scala:231— BuildGenYaml.renderYamlModuleBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (5 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.
InitModule.init (cognitive 16) libs/init/src/mill/init/InitModule.scala:30— InitModule.init has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), match/switch 2, 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.
ZincCompilerBridgeProvider.compile (cognitive 16) libs/javalib/api/src/mill/javalib/api/internal/ZincCompilerBridgeProvider.scala:66— ZincCompilerBridgeProvider.compile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
RunnerImpl.run (cognitive 16) libs/javalib/src/mill/javalib/RunModule.scala:358— RunnerImpl.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DepsTreeRenderer.forward (cognitive 16) libs/javalib/src/mill/javalib/internal/DepsTreeRenderer.scala:41— DepsTreeRenderer.forward has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UvModule.distribution (cognitive 16) libs/pythonlib/src/mill/pythonlib/UvModule.scala:172— UvModule.distribution has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, match/switch 3 (6 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.
Jvm.createJar (cognitive 16) libs/util/java11/src/mill/util/Jvm.scala:483— Jvm.createJar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Watching.watchAndWait (cognitive 16) runner/daemon/src/mill/daemon/Watching.scala:113— Watching.watchAndWait has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, error handling 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ClassTooLong: BuildModelBuilder libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala:27— ClassTooLong — 612 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 212 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Change-coupling hub: EvaluatorProxy.scala → EvaluatorImpl.scala, SelectiveExecutionImpl.scala, MillBuildBootstrap.scala core/api/src/mill/api/EvaluatorProxy.scala— `core/api/src/mill/api/EvaluatorProxy.scala` changes together with 3 other files — `core/eval/src/mill/eval/EvaluatorImpl.scala`, `core/eval/src/mill/eval/SelectiveExecutionImpl.scala`, `runner/daemon/src/mill/daemon/MillBuildBootstrap.scala` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
D4 · Code Duplication· Edited copy of a member (53 corresponding lines) · ×1
Edited copy of a member (53 corresponding lines) libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala:349— libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala:349-412 | libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala:459-511 — 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 (27 corresponding lines) · ×1
Edited copy of a member (27 corresponding lines) libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:439— libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:439-465 | libs/init/buildgen/src/mill/main/buildgen/BuildGenYaml.scala:181-209 — 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 (33 corresponding lines) · ×1
Edited copy of a member (33 corresponding lines) libs/groovylib/worker/src/mill/groovylib/worker/impl/GroovyWorkerImpl.scala:22— libs/groovylib/worker/src/mill/groovylib/worker/impl/GroovyWorkerImpl.scala:22-54 | libs/groovylib/worker/src/mill/groovylib/worker/impl/GroovyWorkerImpl.scala:63-95 — 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 (36 corresponding lines) · ×1
Edited copy of a member (36 corresponding lines) testkit/src/mill/testkit/ExampleTester.scala:213— testkit/src/mill/testkit/ExampleTester.scala:213-248 | testkit/src/mill/testkit/IntegrationTester.scala:481-517 — These two members are one piece of code written twice and then edited apart: 36 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) libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:194— libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:194-217 | libs/kotlinlib/src/mill/kotlinlib/js/KotlinJsModule.scala:222-248 — 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, 22+ corresponding lines) · ×1
Edited copies of one member (3 members, 22+ corresponding lines) libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala:179— libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala:179-201 | libs/androidlib/src/mill/androidlib/AndroidModule.scala:741-762 | libs/androidlib/src/mill/androidlib/AndroidModule.scala:770-793 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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 (22 corresponding lines) · ×1
Edited copy of a member (22 corresponding lines) libs/javalib/src/mill/javalib/PublishModule.scala:579— libs/javalib/src/mill/javalib/PublishModule.scala:579-600 | libs/javalib/src/mill/javalib/PublishModule.scala:755-782 — 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 copies of one member (3 members, 13+ corresponding lines) · ×1
Edited copies of one member (3 members, 13+ corresponding lines) libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:372— libs/scalajslib/src/mill/scalajslib/ScalaJSModule.scala:372-384 | libs/scalalib/src/mill/scalalib/ScalaModule.scala:659-671 | libs/scalanativelib/src/mill/scalanativelib/ScalaNativeModule.scala:414-426 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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, 12+ corresponding lines) · ×1
Edited copies of one member (3 members, 12+ corresponding lines) libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala:247— libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala:247-258 | libs/javalib/src/mill/javalib/CoursierModule.scala:47-59 | libs/javalib/src/mill/javalib/CoursierModule.scala:69-81 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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, 14+ corresponding lines) · ×1
Edited copies of one member (3 members, 14+ corresponding lines) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:207— libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:207-220 | libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:152-165 | libs/scalajslib/worker/1/src/mill/scalajslib/worker/ScalaJSWorkerImpl.scala:318-331 — 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, 6+ corresponding lines) · ×1
Edited copies of one member (3 members, 6+ corresponding lines) libs/javalib/src/mill/javalib/AssemblyModule.scala:179— libs/javalib/src/mill/javalib/AssemblyModule.scala:179-184 | libs/javalib/src/mill/javalib/classgraph/ClassgraphWorkerModule.scala:26-31 | libs/scalalib/src/mill/scalalib/scalafmt/ScalafmtWorkerModule.scala:32-37 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (64 lines × 2) libs/scalajslib/config/src/mill/scalajslib/config/worker/ScalaJSConfigWorker.scala:49— libs/scalajslib/config/src/mill/scalajslib/config/worker/ScalaJSConfigWorker.scala:49-112 | libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:80-143 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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 (34–35 lines × 2) libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala:354— libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala:354-387 | libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala:461-495 — both copies are in the same file, so extract the 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 `libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala:354` 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 (21 lines × 2) libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:147— libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:147-167 | libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:189-209 — both copies are in the same file, so extract the 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 `libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala:147` 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 (20–21 lines × 2) libs/kotlinlib/src/mill/kotlinlib/kapt/KaptModule.scala:132— libs/kotlinlib/src/mill/kotlinlib/kapt/KaptModule.scala:132-152 | libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.scala:260-279 — 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 `libs/kotlinlib/src/mill/kotlinlib/kapt/KaptModule.scala:132` 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 (20 lines × 2) runner/daemon/src/mill/daemon/MillMain0.scala:537— runner/daemon/src/mill/daemon/MillMain0.scala:537-556 | runner/daemon/src/mill/daemon/MillMain0.scala:563-582 — both copies are in the same file, so extract the 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 `runner/daemon/src/mill/daemon/MillMain0.scala:537` 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 (15–16 lines × 2) libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:89— libs/init/buildgen/src/mill/main/buildgen/BuildGenScala.scala:89-103 | libs/init/buildgen/src/mill/main/buildgen/BuildGenYaml.scala:33-48 — 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 (4–16 lines × 3) libs/javalib/src/mill/javalib/PublishModule.scala:109— libs/javalib/src/mill/javalib/PublishModule.scala:109-124 | libs/javalib/src/mill/javalib/PublishModule.scala:140-155 | mill-build/src/millbuild/MillPublishJavaModule.scala:98-101 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `libs/javalib/src/mill/javalib/PublishModule.scala:109` 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–15 lines × 2) example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala:33— example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala:33-46 | website/blog/modules/ROOT/attachments/fast-assembly/src/main/scala/foo/Foo.scala:27-41 — before extracting anything, compare `example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala` and `website/blog/modules/ROOT/attachments/fast-assembly/src/main/scala/foo/Foo.scala` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/spark/3-semi-realistic/src/foo/Foo.scala:33` 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–14 lines × 2) libs/androidlib/src/mill/androidlib/AndroidR8AppModule.scala:453— libs/androidlib/src/mill/androidlib/AndroidR8AppModule.scala:453-464 | libs/javalib/src/mill/javalib/JavaModule.scala:1324-1337 — 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 `libs/androidlib/src/mill/androidlib/AndroidR8AppModule.scala:453` 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 (13–14 lines × 2) libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JsCompileImpl.scala:23— libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JsCompileImpl.scala:23-36 | libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JvmCompileImpl.scala:24-36 — before extracting anything, compare `libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JsCompileImpl.scala` and `libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JvmCompileImpl.scala` as WHOLE FILES: 82% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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 `libs/kotlinlib/worker/src/mill/kotlinlib/worker/impl/JsCompileImpl.scala:23` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 3) libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala:186— libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala:186-198 | libs/androidlib/src/mill/androidlib/AndroidModule.scala:747-759 | libs/androidlib/src/mill/androidlib/AndroidModule.scala:778-790 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `libs/androidlib/src/mill/androidlib/AndroidKotlinModule.scala:186` 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–11 lines × 2) libs/javalib/src/mill/javalib/PublishModule.scala:130— libs/javalib/src/mill/javalib/PublishModule.scala:130-140 | mill-build/src/millbuild/MillPublishJavaModule.scala:83-89 — 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–11 lines × 2) libs/pythonlib/src/mill/pythonlib/UvModule.scala:184— libs/pythonlib/src/mill/pythonlib/UvModule.scala:184-194 | libs/pythonlib/src/mill/pythonlib/UvModule.scala:203-212 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `libs/pythonlib/src/mill/pythonlib/UvModule.scala:184` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `libs/pythonlib/src/mill/pythonlib/UvModule.scala:201` calls `Right` and `libs/pythonlib/src/mill/pythonlib/UvModule.scala:183` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 3) libs/scalalib/src/mill/scalalib/ScalaModule.scala:360— libs/scalalib/src/mill/scalalib/ScalaModule.scala:360-369 | libs/scalalib/src/mill/scalalib/ScalaModule.scala:720-729 | runner/meta/src/mill/meta/MillBuildRootModule.scala:317-326 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `libs/scalalib/src/mill/scalalib/ScalaModule.scala:360` 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 (18 lines × 2) libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:100— libs/scalajslib/config/src/mill/scalajslib/config/ScalaJSConfigModule.scala:100-117 | libs/scalajslib/src/mill/scalajslib/worker/ScalaJSWorker.scala:52-69 — 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 × 3) libs/androidlib/src/mill/androidlib/InstrumentationOutput.scala:70— libs/androidlib/src/mill/androidlib/InstrumentationOutput.scala:70-75 | libs/androidlib/src/mill/androidlib/InstrumentationOutput.scala:77-82 | libs/androidlib/src/mill/androidlib/InstrumentationOutput.scala:84-89 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 4) contrib/artifactory/src/mill/contrib/artifactory/ArtifactoryPublisher.scala:83— contrib/artifactory/src/mill/contrib/artifactory/ArtifactoryPublisher.scala:83-94 | contrib/codeartifact/src/mill/contrib/codeartifact/CodeArtifactPublisher.scala:103-117 | contrib/gitlab/src/mill/contrib/gitlab/GitlabPublisher.scala:50-62 | libs/javalib/src/mill/javalib/publish/SonatypePublisher.scala:163-174 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `contrib/artifactory/src/mill/contrib/artifactory/ArtifactoryPublisher.scala:83` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java:11— example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java:11-38 | example/androidlib/java/2-app-bundle/bundle/src/main/java/com/helloworld/app/MainActivity.java:11-38 | example/androidlib/java/3-linting/app/src/main/java/com/helloworld/app/MainActivity.java:11-38 | example/androidlib/java/4-sum-lib-java/app/src/main/java/com/example/app/Calculator.java:17-44 | example/androidlib/java/5-R8/app/src/main/java/com/helloworld/app/MainActivity.java:11-38 | example/androidlib/java/6-native-libs/app/src/main/java/com/helloworld/app/MainActivity.java:18-45 — 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· Edited copy of a member (69 corresponding lines) · ×1
Edited copy of a member (69 corresponding lines) example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:96— example/kotlinlib/web/5-webapp-kotlinjs/src/WebApp.kt:96-170 | example/kotlinlib/web/6-webapp-kotlinjs-shared/shared/src/Shared.kt:30-98 — These two members are one piece of code written twice and then edited apart: 69 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) example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:56— example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:56-86 | example/kotlinlib/web/6-webapp-kotlinjs-shared/client/src/ClientApp.kt:64-97 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 21+ corresponding lines) · ×1
Edited copies of one member (4 members, 21+ corresponding lines) example/scalalib/web/2-todo-webapp/src/WebApp.scala:111— example/scalalib/web/2-todo-webapp/src/WebApp.scala:111-133 | example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:120-142 | example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:110-130 | example/scalalib/web/7-webapp-scalajs-shared/src/WebApp.scala:49-73 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 4+ corresponding lines) · ×1
Edited copies of one member (3 members, 4+ corresponding lines) example/cli/builtins/1-builtin-commands/foo/src/foo/Foo.java:11— example/cli/builtins/1-builtin-commands/foo/src/foo/Foo.java:11-14 | example/javalib/basic/7-multi-module/foo/src/foo/Foo.java:11-14 | example/large/selective/9-selective-execution/foo/src/foo/Foo.java:7-10 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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, 4+ corresponding lines) · ×1
Edited copies of one member (4 members, 4+ corresponding lines) example/scalalib/web/2-todo-webapp/src/WebApp.scala:35— example/scalalib/web/2-todo-webapp/src/WebApp.scala:35-38 | example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:44-47 | example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:35-38 | example/scalalib/web/7-webapp-scalajs-shared/src/WebApp.scala:30-33 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 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.
Duplicated block (23–43 lines × 4) libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:138— libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:138-174 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:207-249 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:374-396 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:431-461 — 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 `libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:374` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 (19–41 lines × 5) libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:45— libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:45-63 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:137-171 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:206-246 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:373-393 | libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:430-458 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:137` 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 after the matched lines, `libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:65` calls `over` and `libs/javascriptlib/src/mill/javascriptlib/TestModule.scala:173` 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 (55–58 lines × 3) example/scalalib/web/2-todo-webapp/src/WebApp.scala:54— example/scalalib/web/2-todo-webapp/src/WebApp.scala:54-108 | example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:63-117 | example/scalalib/web/4-todo-http4s/src/WebApp.scala:65-122 — before extracting anything, compare `example/scalalib/web/2-todo-webapp/src/WebApp.scala` and `example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/web/4-todo-http4s/src/WebApp.scala:65` 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 (23 lines × 2) example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:40— example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:40-62 | example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala:44-66 — before extracting anything, compare `example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala` and `example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:40` 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, `example/scalalib/web/7-webapp-scalajs-shared/client/src/ClientApp.scala:69` calls `renderBody` and `example/scalalib/web/6-webapp-scalajs/client/src/ClientApp.scala:64` 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 (13 lines × 5) example/scalalib/web/2-todo-webapp/src/WebApp.scala:80— example/scalalib/web/2-todo-webapp/src/WebApp.scala:80-92 | example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:89-101 | example/scalalib/web/4-todo-http4s/src/WebApp.scala:91-103 | example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:76-88 | example/scalalib/web/7-webapp-scalajs-shared/shared/src/Shared.scala:35-47 — before extracting anything, compare `example/scalalib/web/2-todo-webapp/src/WebApp.scala` and `example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/scalalib/web/2-todo-webapp/src/WebApp.scala:80` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8–9 lines × 2) example/scalalib/web/2-todo-webapp/src/WebApp.scala:115— example/scalalib/web/2-todo-webapp/src/WebApp.scala:115-123 | example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:113-120 — 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 `example/scalalib/web/2-todo-webapp/src/WebApp.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. 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 × 7) example/javalib/module/17-custom-trait/mill-build/src/LineCountJavaModule.scala:7— example/javalib/module/17-custom-trait/mill-build/src/LineCountJavaModule.scala:7-15 | example/javalib/script/10-custom-class/mill-build/src/LineCountJavaModule.scala:8-16 | example/kotlinlib/module/17-custom-trait/mill-build/src/LineCountKotlinModule.scala:7-15 | example/kotlinlib/script/10-custom-class/mill-build/src/LineCountKotlinModule.scala:8-16 | example/large/precompiled/10-precompiled-modules/mill-build/src/LineCountJavaModule.scala:12-20 | example/scalalib/module/17-custom-trait/mill-build/src/LineCountScalaModule.scala:7-15 | example/scalalib/script/10-custom-class/mill-build/src/LineCountScalaModule.scala:8-16 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times.
Duplicated block (5 lines × 3) example/scalalib/web/2-todo-webapp/src/WebApp.scala:47— example/scalalib/web/2-todo-webapp/src/WebApp.scala:47-51 | example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala:56-60 | example/scalalib/web/6-webapp-scalajs/src/WebApp.scala:47-51 — before extracting anything, compare `example/scalalib/web/2-todo-webapp/src/WebApp.scala` and `example/scalalib/web/3-webapp-cache-busting/src/WebApp.scala` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (23–24 lines × 2) example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:57— example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:57-79 | example/kotlinlib/web/6-webapp-kotlinjs-shared/client/src/ClientApp.kt:65-88 — before extracting anything, compare `example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt` and `example/kotlinlib/web/6-webapp-kotlinjs-shared/client/src/ClientApp.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/kotlinlib/web/5-webapp-kotlinjs/client/src/ClientApp.kt:57` 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 (16 lines × 2) example/androidlib/kotlin/2-compose/app/src/main/kotlin/com/example/composetest/ui/theme/Theme.kt:42— example/androidlib/kotlin/2-compose/app/src/main/kotlin/com/example/composetest/ui/theme/Theme.kt:42-57 | example/androidlib/kotlin/3-compose-screenshot-tests/app/src/main/java/com/example/screenshottest/theme/Theme.kt:48-63 — before extracting anything, compare `example/androidlib/kotlin/2-compose/app/src/main/kotlin/com/example/composetest/ui/theme/Theme.kt` and `example/androidlib/kotlin/3-compose-screenshot-tests/app/src/main/java/com/example/screenshottest/theme/Theme.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (8 lines × 3) example/kotlinlib/basic/1-simple/src/foo/Foo.kt:12— example/kotlinlib/basic/1-simple/src/foo/Foo.kt:12-19 | example/kotlinlib/basic/5-programmable/foo/src/foo/Foo.kt:12-19 | example/kotlinlib/packaging/2-native-image-libs/foo/src/foo/Foo.kt:12-19 — before extracting anything, compare `example/kotlinlib/basic/1-simple/src/foo/Foo.kt` and `example/kotlinlib/basic/5-programmable/foo/src/foo/Foo.kt` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/kotlinlib/basic/1-simple/src/foo/Foo.kt:12` 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 (20 lines × 4) example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java:12— example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java:12-31 | example/androidlib/java/2-app-bundle/bundle/src/main/java/com/helloworld/app/MainActivity.java:12-31 | example/androidlib/java/3-linting/app/src/main/java/com/helloworld/app/MainActivity.java:12-31 | example/androidlib/java/5-R8/app/src/main/java/com/helloworld/app/MainActivity.java:12-31 — before extracting anything, compare `example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java` and `example/androidlib/java/2-app-bundle/bundle/src/main/java/com/helloworld/app/MainActivity.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (17–18 lines × 5) example/fundamentals/modules/7-root-module/src/foo/Foo.java:17— example/fundamentals/modules/7-root-module/src/foo/Foo.java:17-33 | example/javalib/basic/1-simple/src/foo/Foo.java:17-33 | example/javalib/basic/5-programmable/foo/src/foo/Foo.java:17-33 | example/javalib/packaging/2-native-image-libs/foo/src/foo/Foo.java:17-33 | integration/dedicated/full-run-logs/resources/src/foo/Foo.java:17-34 — before extracting anything, compare `example/fundamentals/modules/7-root-module/src/foo/Foo.java` and `example/javalib/basic/1-simple/src/foo/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (15 lines × 6) example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java:24— example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java:24-38 | example/androidlib/java/2-app-bundle/bundle/src/main/java/com/helloworld/app/MainActivity.java:24-38 | example/androidlib/java/3-linting/app/src/main/java/com/helloworld/app/MainActivity.java:24-38 | example/androidlib/java/4-sum-lib-java/app/src/main/java/com/example/app/Calculator.java:30-44 | example/androidlib/java/5-R8/app/src/main/java/com/helloworld/app/MainActivity.java:24-38 | example/androidlib/java/6-native-libs/app/src/main/java/com/helloworld/app/MainActivity.java:31-45 — before extracting anything, compare `example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java` and `example/androidlib/java/2-app-bundle/bundle/src/main/java/com/helloworld/app/MainActivity.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/androidlib/java/1-hello-world/app/src/main/java/com/helloworld/app/MainActivity.java:24` 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 × 4) example/javalib/dependencies/1-dependencies/src/foo/Foo.java:10— example/javalib/dependencies/1-dependencies/src/foo/Foo.java:10-16 | example/javalib/dependencies/3-unmanaged-jars/src/foo/Foo.java:10-16 | example/kotlinlib/dependencies/1-dependencies/src/foo/Foo.java:10-16 | example/scalalib/dependencies/1-dependencies/src/foo/Foo.java:10-16 — before extracting anything, compare `example/javalib/dependencies/1-dependencies/src/foo/Foo.java` and `example/javalib/dependencies/3-unmanaged-jars/src/foo/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (20 lines × 3) example/extending/jvmcode/1-subprocess/foo/src/Foo.java:1— example/extending/jvmcode/1-subprocess/foo/src/Foo.java:1-20 | example/extending/jvmcode/2-classloader/foo/src/Foo.java:1-20 | example/extending/jvmcode/3-worker/foo/src/Foo.java:1-20 — before extracting anything, compare `example/extending/jvmcode/1-subprocess/foo/src/Foo.java` and `example/extending/jvmcode/2-classloader/foo/src/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/extending/jvmcode/1-subprocess/foo/src/Foo.java:1` 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 (11 lines × 5) example/cli/builtins/1-builtin-commands/bar/src/bar/Bar.java:1— example/cli/builtins/1-builtin-commands/bar/src/bar/Bar.java:1-15 | example/javalib/basic/2-module-deps/bar/src/bar/Bar.java:1-11 | example/javalib/basic/7-multi-module/bar/src/bar/Bar.java:1-15 | example/javalib/module/18-programmable-module-deps/bar/src/bar/Bar.java:1-11 | example/javalib/script/9-programmable-module-deps/bar/src/bar/Bar.java:1-11 — before extracting anything, compare `example/cli/builtins/1-builtin-commands/bar/src/bar/Bar.java` and `example/javalib/basic/2-module-deps/bar/src/bar/Bar.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/cli/builtins/1-builtin-commands/bar/src/bar/Bar.java:1` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 4) example/javalib/basic/9-realistic/bar/src/bar/Bar.java:1— example/javalib/basic/9-realistic/bar/src/bar/Bar.java:1-11 | example/javalib/module/1-basic-config/src/foo/Foo.java:1-15 | example/javalib/module/4-programmable-config/src/foo/Foo.java:1-15 | example/javalib/packaging/4-repackage-config/bar/src/bar/Bar.java:1-11 — before extracting anything, compare `example/javalib/basic/9-realistic/bar/src/bar/Bar.java` and `example/javalib/packaging/4-repackage-config/bar/src/bar/Bar.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/javalib/basic/9-realistic/bar/src/bar/Bar.java:1` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 4) example/extending/jvmcode/1-subprocess/foo/src/Foo.java:1— example/extending/jvmcode/1-subprocess/foo/src/Foo.java:1-20 | example/extending/jvmcode/2-classloader/foo/src/Foo.java:1-20 | example/extending/jvmcode/3-worker/foo/src/Foo.java:1-20 | example/javalib/module/7-resources/foo/src/Foo.java:1-14 — before extracting anything, compare `example/extending/jvmcode/1-subprocess/foo/src/Foo.java` and `example/extending/jvmcode/2-classloader/foo/src/Foo.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `example/extending/jvmcode/1-subprocess/foo/src/Foo.java:1` 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.
End-of-life runtime: Java 24 libs/init/gradle/test/resources/kotlin-multimodule/buildSrc/build.gradle.kts:1— libs/init/gradle/test/resources/kotlin-multimodule/buildSrc/build.gradle.kts declares Java 24 as this project's Gradle toolchain, and Java 24, a non-LTS release, superseded by Java 25 on 2025-09-16. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-09-16 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
Unfinished stub — body is `???` libs/javalib/worker/src/mill/javalib/worker/MillJvmWorkerMain.scala:107— `systemExit` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — body is ??? / NotImplementedError libs/javalib/worker/src/mill/javalib/worker/MillJvmWorkerMain.scala:107— `systemExit` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
Orphaned file core/api/src/mill/api/internal/CrossMacros.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 contrib/docker/src/mill/contrib/docker/DockerModule.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 runner/eclipse/src/mill/eclipse/EclipseJdtUtils.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 libs/javalib/src/mill/javalib/internal/PublishModule.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 libs/javalib/backgroundwrapper/src/mill/javalib/backgroundwrapper/MillBackgroundWrapper.java: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 libs/javascriptlib/src/mill/javascriptlib/TsLintModule.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 contrib/docker/src/mill/contrib/docker/JibBuild.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 integration/feature/gen-eclipse/src/GenEclipseUtils.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 contrib/scoverage/worker2/src/mill/contrib/scoverage/worker/ScoverageReportWorkerImpl.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 libs/javascriptlib/src/mill/javascriptlib/PublishModule.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 libs/scalanativelib/worker/0.5/src/mill/scalanativelib/worker/ScalaNativeWorkerImpl.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 libs/androidlib/src/mill/androidlib/InstrumentationOutput.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 libs/javascriptlib/src/mill/javascriptlib/ReactScriptsModule.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 libs/androidlib/src/mill/androidlib/AndroidNativeAppModule.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 core/api/src/mill/api/internal/Shims.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 libs/scalanativelib/src/mill/scalanativelib/api/ScalaNativeApi.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 libs/pythonlib/src/mill/pythonlib/CoverageModule.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 libs/javalib/src/mill/javalib/publish/Ivy.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 libs/pythonlib/src/mill/pythonlib/RuffModule.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 libs/javalib/maven-worker/src/mill/javalib/maven/worker/impl/WorkerRemoteM2Publisher.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 contrib/docker/src/mill/contrib/docker/JibTypes.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 libs/javalib/src/mill/javalib/JlinkModule.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 contrib/versionfile/src/mill/contrib/versionfile/VersionFileModule.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 libs/javalib/src/mill/javalib/JpackageModule.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 runner/eclipse/src/mill/eclipse/EclipseJdtProject.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.
Duplicated predicate testkit/src/mill/testkit/ExampleTester.scala:328— `System.getenv("CI") != null && os.exists(workspaceSourcePath / "ignoreErrorsOnCI")` appears character-identically in 2 files — testkit/src/mill/testkit/ExampleTester.scala, testkit/src/mill/testkit/UtestExampleTestSuite.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 testkit/src/mill/testkit/IntegrationTestSuite.scala:61— `allowSharedOutputDir && sys.env.contains("MILL_TEST_SHARED_OUTPUT_DIR")` appears character-identically in 2 files — testkit/src/mill/testkit/IntegrationTestSuite.scala, testkit/src/mill/testkit/IntegrationTesterBase.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 libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala:431— `dep.organization == "org.junit.jupiter" && dep.version.nonEmpty` appears character-identically in 2 files — libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala, libs/init/maven/src/mill/main/maven/MillMavenBuildGenMain.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 libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala:797— `isManagedJavacOption(arg) || isErrorProneOption(arg)` appears character-identically in 2 files — libs/init/gradle/exportplugin/src/mill/main/gradle/BuildModelBuilder.scala, libs/init/maven/src/mill/main/maven/Plugins.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 libs/kotlinlib/src/mill/kotlinlib/kapt/KaptModule.scala:137— `kotlincUseBtApi() && !kotlinUseEmbeddableCompiler()` appears character-identically in 2 files — libs/kotlinlib/src/mill/kotlinlib/kapt/KaptModule.scala, libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.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 libs/kotlinlib/src/mill/kotlinlib/kapt/KaptModule.scala:136— `kotlincUseBtApi() && kotlinUseEmbeddableCompiler()` appears character-identically in 2 files — libs/kotlinlib/src/mill/kotlinlib/kapt/KaptModule.scala, libs/kotlinlib/src/mill/kotlinlib/ksp/KspModule.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.
Silent fallback default in catch core/api/src/mill/api/internal/WatchSig.scala:15— `poll` swallows every exception into `0` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing.
Silent fallback default in catch core/internal/src/mill/internal/LauncherOutFilesImpl.scala:113— `lastModifiedMillis` swallows every exception into `0L` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing.
Silent fallback default in catch core/internal/src/mill/internal/LauncherOutFilesRecordStore.scala:68— `lastModifiedMillis` swallows every exception into `0L` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 46 significant file(s) lose their only recent owner: core/resolve/src/mill/resolve/ResolveCore.scala, libs/javalib/worker/src/mill/javalib/zinc/IncrementalTrackingJavaCompiler.scala, runner/server/src/mill/server/MillDaemonServer.scala, core/eval/src/mill/eval/SelectiveExecutionImpl.scala, libs/daemon/client/src/mill/client/ServerLauncher.scala, core/internal/src/mill/internal/PromptLoggerUtil.scala, core/internal/src/mill/internal/LauncherLockingImpl.scala, core/api/daemon/src/mill/api/daemon/Logger.scala (+38 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 3 significant file(s) lose their only recent owner: libs/javalib/src/mill/javalib/repackage/RepackageModule.scala, libs/javalib/src/mill/javalib/internal/DepsTreeRenderer.scala, contrib/sbom/src/mill/contrib/sbom/CycloneDXJavaModule.scala. Pair on, review, or document these before any departure.
Fat interface: GroupExecution (19 abstract members) core/exec/src/mill/exec/GroupExecution.scala:30— `GroupExecution` declares 19 abstract members: `workspace`, `outPath`, `externalOutPath`, `rootModule`, `classLoaderSigHash`, `classLoaderIdentityHash`, `workerCache`, `env`, `failFast`, `ec`, `codeSignatures`, `systemExit`, `exclusiveSystemStreams`, `getEvaluator`, `staticBuildOverrideFiles`, `replayLogs`, `offline`, `useFileLocks`, `workspaceLocking`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (52 single-owned of 333 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; 333 of the 905 production source files in this repository met that bar). They are anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: contrib/codeartifact/src/mill/contrib/codeartifact/CodeArtifactPublisher.scala, contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckModule.scala, libs/javalib/src/mill/javalib/OsDetectorModule.scala.
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 25 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: contrib/docker/src/mill/contrib/docker/DockerModule.scala, runner/eclipse/src/mill/eclipse/EclipseJdtUtils.scala, libs/javalib/src/mill/javalib/internal/PublishModule.scala, libs/javalib/backgroundwrapper/src/mill/javalib/backgroundwrapper/MillBackgroundWrapper.java, libs/javascriptlib/src/mill/javascriptlib/TsLintModule.scala, core/api/src/mill/api/internal/CrossMacros.scala, contrib/docker/src/mill/contrib/docker/JibBuild.scala, integration/feature/gen-eclipse/src/GenEclipseUtils.scala (and 17 more) (27 orphaned of 333 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; 333 of the 905 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.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
Logging is not universal — Only 1/2 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `website/blog/modules/ROOT/attachments/fast-assembly`.
No SAST REDACTED:3— 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 12 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.
P3 · Security & performance tooling· Dependabot does not watch pip/maven/gradle · ×1
Dependabot does not watch pip/maven/gradle REDACTED:5— `REDACTED` schedules updates, but no `package-ecosystem` entry covers `pip`, `maven`, `gradle`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the `updates:` list.
Benchmarks don't track allocations contrib/jmh/test/resources/jmh/src/Bench1.scala— A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured.
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 795 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.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 141 file(s) — `contrib/docker/src/mill/contrib/docker/JibTypes.scala`, `contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckJavaModule.scala`, `contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckModule.scala`, `contrib/owaspdependencycheck/src/mill/contrib/owaspdependencycheck/OwaspDependencyCheckWorker.scala`, `contrib/scalapblib/src/mill/contrib/scalapblib/Generator.scala`, … (+136 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a1d8e4-c45f-734f-9d60-ff91bc88825c · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 50 · Warnings: 541 · Recommendations: 51 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 14-11-2026 @ 07:10 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.