Public report of marko-js/marko, published 29 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). 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, 29 October 2026, 23:22 UTC · Survey ID cd_1b0f1299c14b403dbe6d08312f653ccc
marko-js/marko
Measured 29 October 2026, 23:17 UTC, at code version 9095470
No regression since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAt riskDown 2 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: 58,076 lines of product code in 9 projects, tests not counted · Estimated rebuild effort: about 1.4 person-years · Weakest lens: Production Readiness, 42
Findings by how serious they are
40 critical1113 serious107 minor
12 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
29 October 2026, 23:17 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
71of 71 dimensions measured by tools.
1235of 1260 findings point to an exact file and line, so you can open each one in the code. The other 25 concern the repository as a whole, such as missing documentation.
71dimensions across 6 lenses, read from 58,076 lines of product code in 9 projects.
marko-js/marko is rated At risk because critical security findings are open. Its score is held back because we found no logging, tracing or health checks in the code and no automated security scanning of the code, its secrets or its dependencies. It scores 48 out of 100, which the At risk rating leaves unchanged.
Production Readiness, at 42, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 4 points. Adding a diagnostic log would lift Production Readiness itself, also worth about 4. Raising Production Readiness to 70 would lift the score to about 53.
Thirteen known security holes in the packages the code depends on can be used by attackers. Eleven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with, and two secrets can leak from the build pipeline. Updating the vulnerable packages, pinning each tool to an exact version and limiting each secret to its own step would close these risks. Fixing the weaknesses the scanner points to would fix the two security weaknesses in the code, and setting a waiting period for automatic updates would deal with the automatic dependency update that takes a new release at once. The eight loops of files that import each other need breaking.
The product code is 58,076 lines, about €200,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 Production Readiness rose from 42 to 70, the lowest score rated Strong, the score would rise from 48 to about 53.
Code composition: what the lines of code are
Product code 27%Tests 73%
New since the last survey: 105 findings
These 105 critical or serious findings weren't in the previous survey, on 15 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Large Files · packages/runtime-tags/src/translator/visitors/tag/native-tag.ts: 2065 lines of code packages/runtime-tags/src/translator/visitors/tag/native-tag.ts
Large Files · packages/runtime-tags/src/translator/util/signals.ts: 1674 lines of code packages/runtime-tags/src/translator/util/signals.ts
Large Files · REDACTED: 1609 lines of code REDACTED
Large Files · packages/runtime-tags/src/translator/util/known-tag.ts: 1393 lines of code packages/runtime-tags/src/translator/util/known-tag.ts
Large Files · packages/runtime-tags/src/translator/util/references.ts: 1299 lines of code packages/runtime-tags/src/translator/util/references.ts
Large Files · REDACTED: 1078 lines of code REDACTED
Large Files · packages/runtime-tags/src/translator/util/finalize-references.ts: 896 lines of code packages/runtime-tags/src/translator/util/finalize-references.ts
Large Files · packages/runtime-tags/src/translator/util/optional.ts: 733 lines of code packages/runtime-tags/src/translator/util/optional.ts
Large Files · packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts: 647 lines of code packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts
Large Files · packages/runtime-tags/src/dom/resume.ts: 560 lines of code packages/runtime-tags/src/dom/resume.ts
Large Files · packages/runtime-tags/src/translator/util/sections.ts: 560 lines of code packages/runtime-tags/src/translator/util/sections.ts
Large Files · packages/compiler/src/babel-plugin/index.js: 511 lines of code packages/compiler/src/babel-plugin/index.js
Large Files · packages/runtime-tags/src/translator/util/bindings.ts: 490 lines of code packages/runtime-tags/src/translator/util/bindings.ts
Large Files · packages/runtime-tags/src/translator/util/solve-reasons.ts: 490 lines of code packages/runtime-tags/src/translator/util/solve-reasons.ts
Large Files · packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts: 486 lines of code packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts
Large Files · packages/runtime-tags/src/dom/signals.ts: 451 lines of code packages/runtime-tags/src/dom/signals.ts
Large Files · packages/runtime-tags/src/translator/util/structure.ts: 447 lines of code packages/runtime-tags/src/translator/util/structure.ts
Large Files · packages/runtime-tags/src/translator/core/for.ts: 406 lines of code packages/runtime-tags/src/translator/core/for.ts
Large Files · packages/runtime-tags/src/html/template.ts: 401 lines of code packages/runtime-tags/src/html/template.ts
Dead Code · Dead file (~79 LoC) scripts/test-parallel-worker.cjs
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 121 findings
These 121 critical or serious findings were in the previous survey, on 15 October 2026, and are gone from this one. The first 100 are listed here.
Large Files · packages/runtime-tags/src/translator/visitors/tag/native-tag.ts: 2075 lines of code packages/runtime-tags/src/translator/visitors/tag/native-tag.ts
Large Files · packages/runtime-tags/src/translator/util/signals.ts: 1683 lines of code packages/runtime-tags/src/translator/util/signals.ts
Large Files · REDACTED: 1607 lines of code REDACTED
Large Files · packages/runtime-tags/src/translator/util/known-tag.ts: 1375 lines of code packages/runtime-tags/src/translator/util/known-tag.ts
Rebuild cost: about €200,000 · Estimate
Cost to rebuild
€66,000 to €330,000, for 1,106 to 3,508 hours of work, about 1.4 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 48. 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: 58,076 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 4 points · Low effort · ADR Quality
2
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.
Raises the score by about 2 points · Low effort · Bus Factor
3
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 4 points · Medium effort · Observability
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €200,000 to build again, about 1.4 person-years of work. Its weakest lens is Production Readiness, at 42 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 4 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.0 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 8% to 17% on every change. The history of the code shows how much it changes: about 337,778 lines over the last 90 days, which is about 1,369,877 lines a year. At that pace, the extra work comes to an estimated 258 to 1548 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · 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.
124 modules, with 89 dependencies between them. 2 loops run through 7 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 84 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.
translator.interop uses translator.visitors.program.pre-analyze, so a change to translator.visitors.program.pre-analyze can break translator.interop, while a change to translator.interop can't break translator.visitors.program.pre-analyze.
Position
Below the diagonal: translator.interop uses a module listed above it, which is the healthy direction.
21→28 translator.util.reasons uses translator.util.referencespart of a loop✕
Connections
1 pair of types, where a type in translator.util.reasons uses a type in translator.util.references.
translator.util.reasons uses translator.util.references, so a change to translator.util.references can break translator.util.reasons, while a change to translator.util.reasons can't break translator.util.references.
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.
translator.util.slots uses common.opt, so a change to common.opt can break translator.util.slots, while a change to translator.util.slots can't break common.opt.
Position
Below the diagonal: translator.util.slots uses a module listed above it, which is the healthy direction.
22→26 translator.util.slots uses translator.util.sectionspart of a loop✕
Connections
2 pairs of types, where a type in translator.util.slots uses a type in translator.util.sections.
translator.util.slots uses translator.util.sections, so a change to translator.util.sections can break translator.util.slots, while a change to translator.util.slots can't break translator.util.sections.
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.
22→28 translator.util.slots uses translator.util.referencespart of a loop✕
Connections
1 pair of types, where a type in translator.util.slots uses a type in translator.util.references.
translator.util.slots uses translator.util.references, so a change to translator.util.references can break translator.util.slots, while a change to translator.util.slots can't break translator.util.references.
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.
22→30 translator.util.slots uses translator.util.bindingspart of a loop✕
Connections
1 pair of types, where a type in translator.util.slots uses a type in translator.util.bindings.
translator.util.slots uses translator.util.bindings, so a change to translator.util.bindings can break translator.util.slots, while a change to translator.util.slots can't break translator.util.bindings.
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.
translator.util.tag-name-type uses translator.util.tag-import, so a change to translator.util.tag-import can break translator.util.tag-name-type, while a change to translator.util.tag-name-type can't break translator.util.tag-import.
Position
Below the diagonal: translator.util.tag-name-type uses a module listed above it, which is the healthy direction.
translator.util.sections uses translator.util.optional, so a change to translator.util.optional can break translator.util.sections, while a change to translator.util.sections can't break translator.util.optional.
Position
Below the diagonal: translator.util.sections uses a module listed above it, which is the healthy direction.
translator.util.sections uses translator.util.slots, so a change to translator.util.slots can break translator.util.sections, while a change to translator.util.sections can't break translator.util.slots.
Position
Below the diagonal: translator.util.sections uses a module listed above it, which is the healthy direction.
26→28 translator.util.sections uses translator.util.referencespart of a loop✕
Connections
1 pair of types, where a type in translator.util.sections uses a type in translator.util.references.
translator.util.sections uses translator.util.references, so a change to translator.util.references can break translator.util.sections, while a change to translator.util.sections can't break translator.util.references.
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.
26→30 translator.util.sections uses translator.util.bindingspart of a loop✕
Connections
2 pairs of types, where a type in translator.util.sections uses a type in translator.util.bindings.
translator.util.sections uses translator.util.bindings, so a change to translator.util.bindings can break translator.util.sections, while a change to translator.util.sections can't break translator.util.bindings.
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.
translator.util.references uses common.opt, so a change to common.opt can break translator.util.references, while a change to translator.util.references can't break common.opt.
Position
Below the diagonal: translator.util.references uses a module listed above it, which is the healthy direction.
translator.util.references uses translator.util.optional, so a change to translator.util.optional can break translator.util.references, while a change to translator.util.references can't break translator.util.optional.
Position
Below the diagonal: translator.util.references uses a module listed above it, which is the healthy direction.
translator.util.references uses translator.util.reasons, so a change to translator.util.reasons can break translator.util.references, while a change to translator.util.references can't break translator.util.reasons.
Position
Below the diagonal: translator.util.references uses a module listed above it, which is the healthy direction.
translator.util.references uses translator.util.sections, so a change to translator.util.sections can break translator.util.references, while a change to translator.util.references can't break translator.util.sections.
Position
Below the diagonal: translator.util.references uses a module listed above it, which is the healthy direction.
28→30 translator.util.references uses translator.util.bindingspart of a loop✕
Connections
10 pairs of types, where a type in translator.util.references uses a type in translator.util.bindings.
translator.util.references uses translator.util.bindings, so a change to translator.util.bindings can break translator.util.references, while a change to translator.util.references can't break translator.util.bindings.
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.
translator.visitors.tag.native-tag uses translator.util.sections, so a change to translator.util.sections can break translator.visitors.tag.native-tag, while a change to translator.visitors.tag.native-tag can't break translator.util.sections.
Position
Below the diagonal: translator.visitors.tag.native-tag uses a module listed above it, which is the healthy direction.
translator.util.bindings uses common.opt, so a change to common.opt can break translator.util.bindings, while a change to translator.util.bindings can't break common.opt.
Position
Below the diagonal: translator.util.bindings uses a module listed above it, which is the healthy direction.
translator.util.bindings uses translator.util.optional, so a change to translator.util.optional can break translator.util.bindings, while a change to translator.util.bindings can't break translator.util.optional.
Position
Below the diagonal: translator.util.bindings uses a module listed above it, which is the healthy direction.
translator.util.bindings uses translator.util.sections, so a change to translator.util.sections can break translator.util.bindings, while a change to translator.util.bindings can't break translator.util.sections.
Position
Below the diagonal: translator.util.bindings uses a module listed above it, which is the healthy direction.
translator.util.bindings uses translator.util.references, so a change to translator.util.references can break translator.util.bindings, while a change to translator.util.bindings can't break translator.util.references.
Position
Below the diagonal: translator.util.bindings uses a module listed above it, which is the healthy direction.
translator.core uses translator.util.branch-tag, so a change to translator.util.branch-tag can break translator.core, while a change to translator.core can't break translator.util.branch-tag.
Position
Below the diagonal: translator.core uses a module listed above it, which is the healthy direction.
translator.core uses translator.visitors.program.pre-analyze, so a change to translator.visitors.program.pre-analyze can break translator.core, while a change to translator.core can't break translator.visitors.program.pre-analyze.
Position
Below the diagonal: translator.core uses a module listed above it, which is the healthy direction.
translator.core uses translator.util.bindings, so a change to translator.util.bindings can break translator.core, while a change to translator.core can't break translator.util.bindings.
Position
Below the diagonal: translator.core uses a module listed above it, which is the healthy direction.
translator.core.show uses translator.util.bindings, so a change to translator.util.bindings can break translator.core.show, while a change to translator.core.show can't break translator.util.bindings.
Position
Below the diagonal: translator.core.show uses a module listed above it, which is the healthy direction.
translator.util.known-tag uses translator.util.reasons, so a change to translator.util.reasons can break translator.util.known-tag, while a change to translator.util.known-tag can't break translator.util.reasons.
Position
Below the diagonal: translator.util.known-tag uses a module listed above it, which is the healthy direction.
translator.util.known-tag uses translator.util.sections, so a change to translator.util.sections can break translator.util.known-tag, while a change to translator.util.known-tag can't break translator.util.sections.
Position
Below the diagonal: translator.util.known-tag uses a module listed above it, which is the healthy direction.
translator.util.known-tag uses translator.util.bindings, so a change to translator.util.bindings can break translator.util.known-tag, while a change to translator.util.known-tag can't break translator.util.bindings.
Position
Below the diagonal: translator.util.known-tag uses a module listed above it, which is the healthy direction.
translator.util.signals uses common.opt, so a change to common.opt can break translator.util.signals, while a change to translator.util.signals can't break common.opt.
Position
Below the diagonal: translator.util.signals uses a module listed above it, which is the healthy direction.
translator.util.signals uses translator.util.sections, so a change to translator.util.sections can break translator.util.signals, while a change to translator.util.signals can't break translator.util.sections.
Position
Below the diagonal: translator.util.signals uses a module listed above it, which is the healthy direction.
translator.util.signals uses translator.util.bindings, so a change to translator.util.bindings can break translator.util.signals, while a change to translator.util.signals can't break translator.util.bindings.
Position
Below the diagonal: translator.util.signals uses a module listed above it, which is the healthy direction.
translator.util.sources uses translator.util.optional, so a change to translator.util.optional can break translator.util.sources, while a change to translator.util.sources can't break translator.util.optional.
Position
Below the diagonal: translator.util.sources uses a module listed above it, which is the healthy direction.
translator.util.sources uses translator.util.bindings, so a change to translator.util.bindings can break translator.util.sources, while a change to translator.util.sources can't break translator.util.bindings.
Position
Below the diagonal: translator.util.sources uses a module listed above it, which is the healthy direction.
dom.load uses translator.util.signals, so a change to translator.util.signals can break dom.load, while a change to dom.load can't break translator.util.signals.
Position
Below the diagonal: dom.load uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.branch-tag, so a change to translator.util.branch-tag can break translator.util, while a change to translator.util can't break translator.util.branch-tag.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.cyclic-memo, so a change to translator.util.cyclic-memo can break translator.util, while a change to translator.util can't break translator.util.cyclic-memo.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.entry-builder, so a change to translator.util.entry-builder can break translator.util, while a change to translator.util can't break translator.util.entry-builder.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.evaluate, so a change to translator.util.evaluate can break translator.util, while a change to translator.util can't break translator.util.evaluate.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.module-registrations, so a change to translator.util.module-registrations can break translator.util, while a change to translator.util can't break translator.util.module-registrations.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.nested-attribute-tags, so a change to translator.util.nested-attribute-tags can break translator.util, while a change to translator.util can't break translator.util.nested-attribute-tags.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.optional, so a change to translator.util.optional can break translator.util, while a change to translator.util can't break translator.util.optional.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.solve-reasons, so a change to translator.util.solve-reasons can break translator.util, while a change to translator.util can't break translator.util.solve-reasons.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.structure, so a change to translator.util.structure can break translator.util, while a change to translator.util can't break translator.util.structure.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.tag-facts, so a change to translator.util.tag-facts can break translator.util, while a change to translator.util can't break translator.util.tag-facts.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.tag-import, so a change to translator.util.tag-import can break translator.util, while a change to translator.util can't break translator.util.tag-import.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.visitors.program.pre-analyze, so a change to translator.visitors.program.pre-analyze can break translator.util, while a change to translator.util can't break translator.visitors.program.pre-analyze.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.reasons, so a change to translator.util.reasons can break translator.util, while a change to translator.util can't break translator.util.reasons.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.slots, so a change to translator.util.slots can break translator.util, while a change to translator.util can't break translator.util.slots.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.sections, so a change to translator.util.sections can break translator.util, while a change to translator.util can't break translator.util.sections.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.references, so a change to translator.util.references can break translator.util, while a change to translator.util can't break translator.util.references.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
35 pairs of types, where a type in translator.util uses a type in translator.util.bindings. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
translator.util uses translator.util.bindings, so a change to translator.util.bindings can break translator.util, while a change to translator.util can't break translator.util.bindings.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.signals, so a change to translator.util.signals can break translator.util, while a change to translator.util can't break translator.util.signals.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.util uses translator.util.sources, so a change to translator.util.sources can break translator.util, while a change to translator.util can't break translator.util.sources.
Position
Below the diagonal: translator.util uses a module listed above it, which is the healthy direction.
translator.visitors.program uses translator, so a change to translator can break translator.visitors.program, while a change to translator.visitors.program can't break translator.
Position
Below the diagonal: translator.visitors.program uses a module listed above it, which is the healthy direction.
translator.visitors.program uses translator.visitors.program.pre-analyze, so a change to translator.visitors.program.pre-analyze can break translator.visitors.program, while a change to translator.visitors.program can't break translator.visitors.program.pre-analyze.
Position
Below the diagonal: translator.visitors.program uses a module listed above it, which is the healthy direction.
translator.visitors.program uses translator.util.sections, so a change to translator.util.sections can break translator.visitors.program, while a change to translator.visitors.program can't break translator.util.sections.
Position
Below the diagonal: translator.visitors.program uses a module listed above it, which is the healthy direction.
translator.visitors.program uses translator.util.signals, so a change to translator.util.signals can break translator.visitors.program, while a change to translator.visitors.program can't break translator.util.signals.
Position
Below the diagonal: translator.visitors.program uses a module listed above it, which is the healthy direction.
translator.visitors.tag uses common.opt, so a change to common.opt can break translator.visitors.tag, while a change to translator.visitors.tag can't break common.opt.
Position
Below the diagonal: translator.visitors.tag uses a module listed above it, which is the healthy direction.
translator.visitors.tag uses translator, so a change to translator can break translator.visitors.tag, while a change to translator.visitors.tag can't break translator.
Position
Below the diagonal: translator.visitors.tag uses a module listed above it, which is the healthy direction.
translator.visitors.tag uses translator.visitors.program.pre-analyze, so a change to translator.visitors.program.pre-analyze can break translator.visitors.tag, while a change to translator.visitors.tag can't break translator.visitors.program.pre-analyze.
Position
Below the diagonal: translator.visitors.tag uses a module listed above it, which is the healthy direction.
translator.visitors.tag uses translator.util.references, so a change to translator.util.references can break translator.visitors.tag, while a change to translator.visitors.tag can't break translator.util.references.
Position
Below the diagonal: translator.visitors.tag uses a module listed above it, which is the healthy direction.
translator.visitors.tag uses translator.visitors.tag.native-tag, so a change to translator.visitors.tag.native-tag can break translator.visitors.tag, while a change to translator.visitors.tag can't break translator.visitors.tag.native-tag.
Position
Below the diagonal: translator.visitors.tag uses a module listed above it, which is the healthy direction.
translator.visitors.tag uses translator.util.bindings, so a change to translator.util.bindings can break translator.visitors.tag, while a change to translator.visitors.tag can't break translator.util.bindings.
Position
Below the diagonal: translator.visitors.tag uses a module listed above it, which is the healthy direction.
translator.visitors.tag uses dom.load, so a change to dom.load can break translator.visitors.tag, while a change to translator.visitors.tag can't break dom.load.
Position
Below the diagonal: translator.visitors.tag uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 55% · Adequate · gated by D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
41
High / Critical
A03:2025 — Software Supply Chain Failures
22
High / Critical
A07:2025 — Authentication Failures
2
High / Critical
Roadmap
First, implement user-facing diagnostic logging to capture error details for reproducible bug reports. Second, integrate static security analysis into the CI pipeline to prevent security regressions from merging. Third, publish the missing architecture decision record to document key design choices. Fourth, configure the release process to use draft releases or manual gates, allowing teams to halt deployments before they reach users. Finally, address the off-boarding risk to ensure knowledge is not siloed with a single individual.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security — so a security regression fails the build instead of landing.
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 40
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 — 1113
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 — 107
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 12
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 71 of 71 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 71 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, 1235 of 1260 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.ts, .js, .mjs, .cjs) and the coverage collector does support this ecosystem — it drives jest, vitest and mocha — but the only runner it declares is `mocha`, which the collector drives through `npm test` under a coverage provider — and that cannot reach a test script which delegates to a shell script or a build tool. Read from the manifests: the root package has a `scripts.test` of `node scripts/test-parallel.js` and declares `mocha`, which that command never names. This repository does measure coverage — a coverage step in CI (`codecov/codecov-action`) — so the number exists; it is our reading of it that is missing. Not scored — this is a gap in the analyzer's runner coverage, not a missing .ts/.js/.mjs/.cjs runner and not a defect in this repository. To have real coverage read, produce a coverage report in a standard format (lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — a committed report is read whatever runner produced it.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.ts, .js, .mjs, .cjs) and the reliability runner does support this ecosystem — it drives jest, vitest, mocha and egg-bin — but the only runner it declares is `mocha`, which the re-runner drives as `npm test -- --reporter json` — and that command cannot reach a test script which delegates to a shell script or a build tool. Read from the manifests: the root package has a `scripts.test` of `node scripts/test-parallel.js` and declares `mocha`, which that command never names. So flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's runner coverage, not a missing .ts/.js/.mjs/.cjs runner and not a finding about this repository.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `packages/compiler/src/index.js`, `packages/compiler/src/taglib/index.js`, `packages/runtime-class/index.d.ts`, `packages/runtime-class/src/translator/index.js`, `packages/runtime-tags/index.d.ts`, … (+28 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: a web-server dependency ('express') — a service to boot even with no user interface. 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. Watchdog then boots it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
R10 Code Duplication — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 45 further occurrence(s) are not listed individually; the score already reflects all 85.
R4 Test Coverage — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 6 further occurrence(s) are not listed individually; the score already reflects all 46.
R7 Dead Code — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 166 further occurrence(s) are not listed individually; the score already reflects all 206.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 475 JavaScript/TypeScript file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled certificate validation and obsolete TLS versions, and none was found. The server controls this dimension also scores were not assessed, so no score is given.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python and Rust source only, and no C# was loaded, and no named async function in this repository's JavaScript/TypeScript, nor any Go, PHP or Dart function or Kotlin suspend function, makes a request that can be cancelled (fetch, axios, ky, ofetch; net/http, net.Dial; amphp; Dio; Ktor, OkHttp), so there is nothing to judge, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala and Rust source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP make no call through a named logger, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations: 1 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D23 Boundary Type-Coupling: Boundary leakage is detected from type references across detected contexts — leaks that flow through primitives, serialization or shared infrastructure may not surface as a typed reference.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
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.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
131 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was parser.parseMarko at 98. A further 6 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 serializer.writeUnknownObject at 62 — they are counted neither in the figure above nor in this dimension's score. 4 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: packages/runtime-tags/src/translator/interop/feature-detection.ts (feature-detection.getFeatureTypeFromCoreTagName at 21), packages/runtime-class/src/translator/util/optimize-vdom-create.js (exit at 16), packages/runtime-class/src/runtime/components/legacy/jquery.js (jquery.patchComponent at 16), packages/runtime-tags/src/html/template.ts (ServerRendered.#read at 16). 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.
+ 102 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 5 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with parser.parseMarko (cyclomatic 98), index.morphdom::morphChildren (cyclomatic 88), morphdom::morphChildren (cyclomatic 88). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 5 together lifts Cyclomatic Complexity from 4.6 to about 5.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 185 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 23 bodies over 60 down to 60 or less in Cognitive Complexity — start with index.morphdom::morphChildren (cognitive 303), morphdom::morphChildren (cognitive 303), parser.parseMarko (cognitive 136). — 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 23 together lifts Cognitive Complexity from 2.0 to about 3.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.8 / 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 19 FunctionTooLong finding(s) in God Classes — start with index.js (2), known-tag.ts (2), signals.ts (2). — One of this dimension's main actionable groups (19 warning-level).
Resolve the 14 FileTooLong finding(s) in God Classes — start with REDACTED (2), REDACTED, serializer.ts. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 1 MethodTooLong finding(s) in God Classes — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.0 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
4 production modules (npm), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 1 module(s) off the main sequence, with abstractness counted on 2 of the 4 (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: @marko/compiler
What to do
Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with REDACTED, optional.ts. — One of this dimension's main actionable groups (2 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
898 test methods: 898 unit, 0 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 898 `it`/`test` case(s) across 112 test file(s) declaring at least one; its tier split is read from package names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality9.7 / 10Stronggated by 17 serious findings✓ 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.
16 skipped (16 with a documented reason), 17 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 898 tests.
No assertions: should initialize components correctly across async boundaries · ×17packages/runtime-class/test/components-pages/fixtures/server-render-function-references/tests.js:1
Resolve the 17 No assertions finding(s) in Test Quality — start with tests.js (14), index.test.js (3). — One of this dimension's main actionable groups (17 warning-level).
Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
4 outdated direct production npm dependency(ies) of 22 graded, 0 pinning defect(s), across 17 package.json (4 of them the product) and 1 committed lockfile(s). Development dependencies are deliberately not graded for currency: that grade is about what SHIPS. 0 direct dependency(ies) — production, development or optional — are marked DEPRECATED by their publisher (the registry's per-version mark, or the lockfile's copy of it when the registry could not be asked); deprecated transitive packages are listed but not charged. Whether any is UNMAINTAINED is not graded — the registry publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, and the frontend dependency lens (R8) answers it in this same run. Known CVEs in this dependency graph are D30's question, read from the manifest there.
Deprecated: glob · ×3REDACTED:2106
Outdated (npm): @luxass/strip-json-comments · ×4
✓ On the Gold path — maintain.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 22 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 22 production dependency(ies) this repository's committed lockfile resolves, across 4 product package.json manifest(s). Its 58 `devDependencies` declaration(s) are excluded: a consumer installs none of them. ★ DEPTH: this is the DIRECT production set the lockfile resolves, NOT the transitive closure — only one of the four lock dialects this pass reads states a full graph, so a banned licence pulled in only by a dependency's OWN dependencies is outside this verdict, exactly as the JVM arm's declaration-site verdict is. ★ Each licence is the one the registry publishes for the package's CURRENT release rather than for the pinned version, which is the same caveat the Hex and RubyGems arms carry. This repository publishes itself under MIT, which is its own choice and is not judged here.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: packages/runtime-tags/src/translator/util/signals.ts (60×51=3060); packages/runtime-tags/src/translator/util/known-tag.ts (50×56=2800); REDACTED (67×34=2278) Repeated repair below the complexity floor: packages/runtime-tags/src/translator/visitors/import-declaration.ts (13 of 23 changes were fixes); packages/runtime-tags/src/html/compat.ts (11 of 19 changes were fixes); packages/runtime-tags/src/dom/dom.ts (10 of 15 changes were fixes)
Resolve the 468 Repeated repair finding(s) in Churn × Complexity Hotspots — start with REDACTED (288), dom.bundle.debug.js (161), compat.ts (2). — One of this dimension's main actionable groups (468 warning-level).
Resolve the 38 Hotspot finding(s) in Churn × Complexity Hotspots — start with index.js (2), runtime.js (2), REDACTED (2). — One of this dimension's main actionable groups (38 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor3.6 / 10Weak✓ 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.
106 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is packages/runtime-tags/src/html/serializer.ts. Counted over 166 of the 471 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
What to do
Resolve the 1 Off-boarding risk 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.
23 deducted task-comment markers across 38109 LoC (0.1/KLoC) → score 9.9. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 23 TodoComment finding(s) in Explicit Debt — start with known-tag.ts (5), dom.ts (3), bindings.ts (2). — One of this dimension's main actionable groups (23 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 39 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether domain types (IDs, enums, value objects) leak across bounded-context boundaries.
Method: Cross-context domain-type leakage via Roslyn structural classification (strongly-typed IDs / value objects) over every public surface. Exhaustive, deterministic, type-level aggregate-boundary check.
Coverage: Bounded contexts derived from NAMESPACE prefix (or graph-inferred where available); cross-boundary domain-type leakage then checked exhaustively over every public member of every type.
2 of 9 build units (npm) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 1 High secret finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
48 finding(s): 0 critical, 16 high, 14 medium, 18 low. 11 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 36 file(s) — `packages/compiler/src/index.js` (line 14), `packages/compiler/src/taglib/index.js` (line 14, line 15, line 16), `packages/runtime-class/index.d.ts` (line 107, line 108, line 295), `packages/runtime-class/src/translator/index.js` (line 20), `packages/runtime-tags/index.d.ts` (line 73, line 74), … (+31 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.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 6 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
No action in Static Analysis (SAST) — all 11 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (11 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 10 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (10). — One of this dimension's main actionable groups (10 issue-level).
Resolve the 2 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
17 of 166 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is packages/runtime-class/src/runtime/vdom/morphdom/index.js. Counted over 166 of the 471 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with index.js. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 16 Orphaned file finding(s) in Knowledge Freshness — start with index.js (2), AsyncVDOMBuilder.js, renderer.js. — One of this dimension's main actionable groups (16 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 4 Change coupling finding(s) in Change Coupling — start with entry.js, for.ts, compat.ts. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
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.
Other · Code Health — Unreviewed-generation residue in this repository's JavaScript/TypeScript: functions whose whole body still throws a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings and JSX of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's JavaScript/TypeScript: functions that only throw a "not implemented" error, functions that take inputs and return a constant or do nothing, async functions that never await, 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.
`onCreate` has an empty body — confirm it's an intentional no-op and not an unfinished method. — packages/runtime-class/src/runtime/components/ServerComponent.js:78
`onInput` has an empty body — confirm it's an intentional no-op and not an unfinished method. — packages/runtime-class/src/runtime/components/ServerComponent.js:79
`onRender` has an empty body — confirm it's an intentional no-op and not an unfinished method. — packages/runtime-class/src/runtime/components/ServerComponent.js:80
What to do
Clear the softer debt: re-enable or delete skipped tests, decide whether each empty function is a deliberate no-op (and say so in a comment), and replace blanket `eslint-disable` / `@ts-nocheck` with targeted, justified suppressions.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
333 code files changed in the last 6 months but the README was not touched — it may no longer reflect the system.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 6 of 9 project(s) that lack one — worth up to 1.3 pts.
Review the README against recent changes; refresh the parts that drifted.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
packages/runtime-class/README.md links to `.github/CONTRIBUTING.md`, but `packages/runtime-class/.github/CONTRIBUTING.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — packages/runtime-class/README.md:160
packages/runtime-tags/README.md links to `.github/CONTRIBUTING.md`, but `packages/runtime-tags/.github/CONTRIBUTING.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — packages/runtime-tags/README.md:71
packages/runtime-class/docs/webpack.md names Marko 4, but the manifest declares `marko` ^5.39.47. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — packages/runtime-class/docs/webpack.md:6
What to do
Reconcile the README with reality: packages/runtime-class/README.md links to `.github/CONTRIBUTING.md`, but `packages/runtime-class/.github/CONTRIBUTING.md` does not exist; packages/runtime-tags/README.md links to `.github/CONTRIBUTING.md`, but `packages/runtime-tags/.github/CONTRIBUTING.md` does not exist; packages/runtime-class/docs/webpack.md names Marko 4, but the manifest declares `marko` ^5.39.47.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
What to do
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 3268 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:6
`package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — package.json:27
What to do
Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security — so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
What to do
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
R1 · Type Safety5.0 / 10Adequate✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
340 typed · 339 plain JS — the untyped files are packages/compiler/babel-utils.js, packages/compiler/config.js, packages/compiler/modules.js, packages/compiler/register.js, packages/compiler/scripts/types.js, packages/compiler/scripts/types/babel-traverse.js (+333 more).
What to do
Migrate the remaining .js/.jsx files to TypeScript.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
9 duplicated blocks under packages/ have copies in at least two of the sibling directories compiler, runtime-class, runtime-tags — 8 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — packages/runtime-class/src/translator/util/load-import.js:166
5 of the duplicated blocks reported below have copies in at least two of the sibling directories native-tag[html], native-tag[vdom] under packages/runtime-class/src/translator/tag/. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:13
5 duplicated blocks under packages/runtime-tags/src/translator/ have copies in at least two of the sibling directories core, interop, util, visitors — 3 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — packages/runtime-tags/src/translator/core/define.ts:106
packages/runtime-class/src/translator/util/load-import.js:166 · packages/runtime-tags/src/translator/util/tag-import.ts:91 — the two spans are one implementation copied and then locally edited — 339 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-class/src/translator/util/load-import.js:166
packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:13 · packages/runtime-class/src/translator/tag/native-tag[vdom]/attributes.js:8 — the two spans are one implementation copied and then locally edited — 375 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:13
packages/compiler/src/babel-utils/imports.js:56 · packages/compiler/src/babel-utils/imports.js: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. — packages/compiler/src/babel-utils/imports.js:56
packages/runtime-class/src/translator/tag/native-tag[html]/index.js:24 · packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:109 — the two spans are one implementation copied and then locally edited — 195 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-class/src/translator/tag/native-tag[html]/index.js:24
packages/compiler/src/babel-plugin/plugins/migrate.js:30 · packages/compiler/src/babel-plugin/plugins/transform.js:32 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/compiler/src/babel-plugin/plugins/migrate.js:30
packages/runtime-class/src/translator/tag/native-tag[html]/index.js:156 · packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:29 — the two spans are one implementation copied and then locally edited — 145 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-class/src/translator/tag/native-tag[html]/index.js:156
packages/runtime-class/src/translator/tag/attribute/directives/class.js:12 · packages/runtime-class/src/translator/tag/attribute/directives/style.js:12 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/runtime-class/src/translator/tag/attribute/directives/class.js:12
packages/runtime-tags/src/html/control-flow.ts:162 · packages/runtime-tags/src/html/control-flow.ts:208 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/runtime-tags/src/html/control-flow.ts:162
packages/runtime-tags/src/html/control-flow.ts:81 · packages/runtime-tags/src/html/control-flow.ts:121 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/runtime-tags/src/html/control-flow.ts:81
packages/runtime-class/src/runtime/html/AsyncStream.js:779 · packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:424 — the two spans are one implementation copied and then locally edited — 142 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-class/src/runtime/html/AsyncStream.js:779
packages/runtime-tags/src/translator/core/let.ts:49 · packages/runtime-tags/src/translator/core/return.ts:44 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/runtime-tags/src/translator/core/let.ts:49
packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:72 · packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:156 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:72
packages/runtime-class/src/translator/tag/dynamic-tag.js:17 · packages/runtime-class/src/translator/tag/native-tag[html]/index.js:75 · packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:132 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/runtime-class/src/translator/tag/dynamic-tag.js:17
packages/runtime-tags/src/dom/template.ts:59 · packages/runtime-tags/src/html/template.ts:65 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/runtime-tags/src/dom/template.ts:59
packages/runtime-tags/src/html/attrs.ts:130 · packages/runtime-tags/src/html/attrs.ts:176 · packages/runtime-tags/src/html/attrs.ts:196 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/runtime-tags/src/html/attrs.ts:130
packages/runtime-class/src/runtime/components/ComponentDef.js:52 · packages/runtime-class/src/runtime/components/ServerComponent.js:54 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/runtime-class/src/runtime/components/ComponentDef.js:52
packages/runtime-class/src/translator/util/get-component-files.js:70 · packages/runtime-tags/src/translator/util/get-style-file.ts:38 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — packages/runtime-class/src/translator/util/get-component-files.js:70
packages/runtime-tags/src/translator/visitors/tag/attribute-tag.ts:41 · packages/runtime-tags/src/translator/visitors/tag/custom-tag.ts:125 — the two spans are one implementation copied and then locally edited — 66 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-tags/src/translator/visitors/tag/attribute-tag.ts:41
packages/runtime-class/src/runtime/helpers/load-tag-event-trigger.js:3 · packages/runtime-class/src/runtime/helpers/load-tag-visible-trigger.js:3 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/runtime-class/src/runtime/helpers/load-tag-event-trigger.js:3
packages/runtime-tags/src/common/for.ts:30 · packages/runtime-tags/src/common/for.ts:48 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — packages/runtime-tags/src/common/for.ts:30
packages/compiler/src/babel-plugin/parser.js:226 · packages/compiler/src/babel-plugin/parser.js:252 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/compiler/src/babel-plugin/parser.js:226
packages/compiler/src/taglib/loader/loadTagFromProps.js:55 · packages/compiler/src/taglib/loader/loadTaglibFromProps.js:19 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/compiler/src/taglib/loader/loadTagFromProps.js:55
packages/runtime-class/src/translator/taglib/core/parse-client.js:4 · packages/runtime-class/src/translator/taglib/core/parse-server.js:4 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/runtime-class/src/translator/taglib/core/parse-client.js:4
packages/runtime-tags/src/html/serializer.ts:1238 · packages/runtime-tags/src/html/serializer.ts:1285 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/runtime-tags/src/html/serializer.ts:1238
packages/runtime-tags/src/html/serializer.ts:1837 · packages/runtime-tags/src/html/serializer.ts:1963 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — packages/runtime-tags/src/html/serializer.ts:1837
packages/runtime-tags/src/translator/visitors/tag/index.ts:96 · packages/runtime-tags/src/translator/visitors/tag/index.ts:120 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/runtime-tags/src/translator/visitors/tag/index.ts:96
packages/runtime-class/src/runtime/html/AsyncStream.js:591 · packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:351 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — packages/runtime-class/src/runtime/html/AsyncStream.js:591
packages/runtime-tags/src/html/serializer.ts:1683 · packages/runtime-tags/src/html/serializer.ts:1756 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — packages/runtime-tags/src/html/serializer.ts:1683
packages/runtime-tags/src/translator/visitors/tag/custom-tag.ts:117 · packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts:231 — the two spans are one implementation copied and then locally edited — 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-tags/src/translator/visitors/tag/custom-tag.ts:117
packages/compiler/src/babel-plugin/index.js:275 · packages/compiler/src/babel-plugin/parser.js:181 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — packages/compiler/src/babel-plugin/index.js:275
packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:88 · packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:169 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:88
packages/runtime-class/src/translator/index.js:306 · packages/runtime-tags/src/translator/visitors/program/index.ts:245 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — packages/runtime-class/src/translator/index.js:306
packages/runtime-tags/src/common/errors.ts:33 · packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:2026 — the two spans are one implementation copied and then locally edited — 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-tags/src/common/errors.ts:33
packages/runtime-tags/src/translator/core/define.ts:106 · packages/runtime-tags/src/translator/visitors/tag/attribute-tag.ts:44 — the two spans are one implementation copied and then locally edited — 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-tags/src/translator/core/define.ts:106
packages/runtime-tags/src/translator/core/for.ts:170 · packages/runtime-tags/src/translator/core/for.ts:233 — the two spans are one implementation copied and then locally edited — 95 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-tags/src/translator/core/for.ts:170
packages/runtime-tags/src/translator/util/known-tag.ts:1159 · packages/runtime-tags/src/translator/util/translate-attrs.ts:51 — the two spans are one implementation copied and then locally edited — 98 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-tags/src/translator/util/known-tag.ts:1159
packages/runtime-tags/src/translator/util/references.ts:363 · packages/runtime-tags/src/translator/util/references.ts:381 — the two spans are one implementation copied and then locally edited — 67 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/runtime-tags/src/translator/util/references.ts:363
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).
Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.
packages/compiler/scripts/types.js:10 imports @babel/types/lib/index.d.ts, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — packages/compiler/scripts/types.js:10
packages/runtime-class/test/__util__/create-marko-jsdom-module.js:4 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/__util__/create-marko-jsdom-module.js:4
packages/runtime-class/test/__util__/test-init.js:1 reaches past another workspace package's public entry into its internals with a relative path (../../node-require) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/__util__/test-init.js:1
packages/runtime-class/test/api-compiler/index.test.js:8 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/api-compiler/index.test.js:8
packages/runtime-class/test/api-compiler/index.test.js:11 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/api-compiler/index.test.js:11
packages/runtime-class/test/api/fixtures/require-hook-compiler-options/test.js:2 reaches past another workspace package's public entry into its internals with a relative path (../../../../node-require) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/api/fixtures/require-hook-compiler-options/test.js:2
packages/runtime-class/test/api/index.test.js:9 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/api/index.test.js:9
packages/runtime-class/test/api/index.test.js:12 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/api/index.test.js:12
packages/runtime-class/test/components-browser/fixtures/component-preserve-all-state-when-rendered-in-loop/test.js:2 reaches past another workspace package's public entry into its internals with a relative path (../../../../src/runtime/components/dom-data) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/components-browser/fixtures/component-preserve-all-state-when-rendered-in-loop/test.js:2
packages/runtime-class/test/node-require/index.test.js:10 reaches past another workspace package's public entry into its internals with a relative path (../../node-require) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/node-require/index.test.js:10
packages/runtime-class/test/taglib-loader/index.test.js:9 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/taglib-loader/index.test.js:9
packages/runtime-class/test/taglib-loader/index.test.js:11 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/taglib-loader/index.test.js:11
packages/runtime-class/test/taglib-lookup/index.test.js:10 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/taglib-lookup/index.test.js:10
packages/runtime-class/test/vdom-create/fixtures/isSameNode-createElement/index.js:2 reaches past another workspace package's public entry into its internals with a relative path (../../../../src/runtime/components/dom-data) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/runtime-class/test/vdom-create/fixtures/isSameNode-createElement/index.js:2
scripts/test-parallel.js:26 imports mocha/lib/cli/run-option-metadata, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — scripts/test-parallel.js:26
What to do
Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
enter has cyclomatic complexity 91 and cognitive complexity 172; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:155
morphChildren has cyclomatic complexity 88 and cognitive complexity 303; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-class/src/runtime/vdom/morphdom/index.js:149
computeNode has cyclomatic complexity 82 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:4
enter has cyclomatic complexity 57 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:548
exit has cyclomatic complexity 56 and cognitive complexity 107; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts:261
writeAttrsToSignals has cyclomatic complexity 53 and cognitive complexity 118; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/util/known-tag.ts:1101
analyzeAttrs has cyclomatic complexity 51 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/util/known-tag.ts:614
MarkoTag has cyclomatic complexity 45 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-class/src/translator/index.js:100
(anonymous) has cyclomatic complexity 43 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-class/src/translator/tag/native-tag[html]/index.js:22
enter has cyclomatic complexity 40 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:914
analyzeExpressionTagName has cyclomatic complexity 39 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/util/tag-name-type.ts:134
checkStyleInterpolations has cyclomatic complexity 38 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/util/style-interpolation.ts:6
flush has cyclomatic complexity 34 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:1326
dynamicTag has cyclomatic complexity 33 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-class/src/runtime/helpers/dynamic-tag.js:24
getMarkoFile has cyclomatic complexity 32 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/compiler/src/babel-plugin/index.js:169
writeHTMLResumeStatements has cyclomatic complexity 32 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-tags/src/translator/util/signals.ts:1238
findDynamicTagTypes has cyclomatic complexity 31 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/runtime-class/src/translator/tag/index.js:161
* has cyclomatic complexity 31 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/compiler/src/taglib/loader/loadTagFromProps.js:110
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files7.2 / 10Strong✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
packages/runtime-tags/src/html/serializer.ts has 2317 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/html/serializer.ts:1
packages/runtime-tags/src/translator/visitors/tag/native-tag.ts has 2065 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:1
packages/runtime-tags/src/translator/util/signals.ts has 1674 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/signals.ts:1
REDACTED has 1609 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
packages/runtime-tags/src/translator/util/known-tag.ts has 1393 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/known-tag.ts:1
packages/runtime-tags/src/translator/util/references.ts has 1299 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/references.ts:1
REDACTED has 1078 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
packages/runtime-tags/src/translator/util/finalize-references.ts has 896 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/finalize-references.ts:1
packages/compiler/src/babel-plugin/parser.js has 758 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/compiler/src/babel-plugin/parser.js:1
packages/runtime-tags/src/translator/util/optional.ts has 733 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/optional.ts:1
packages/runtime-class/src/translator/index.js has 732 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-class/src/translator/index.js:1
packages/runtime-tags/src/html/control-flow.ts has 713 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/html/control-flow.ts:1
packages/runtime-class/src/runtime/html/AsyncStream.js has 693 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-class/src/runtime/html/AsyncStream.js:1
packages/runtime-tags/src/dom/controllable.ts has 660 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/dom/controllable.ts:1
packages/runtime-class/src/runtime/vdom/morphdom/index.js has 650 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-class/src/runtime/vdom/morphdom/index.js:1
packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts has 647 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts:1
packages/runtime-class/src/runtime/components/Component.js has 570 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-class/src/runtime/components/Component.js:1
packages/runtime-tags/src/dom/resume.ts has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/dom/resume.ts:1
packages/runtime-tags/src/translator/util/sections.ts has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/sections.ts:1
packages/runtime-tags/src/html/attrs.ts has 547 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/html/attrs.ts:1
packages/compiler/src/babel-plugin/index.js has 511 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/compiler/src/babel-plugin/index.js:1
packages/runtime-tags/src/translator/util/module-registrations.ts has 500 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/module-registrations.ts:1
packages/runtime-tags/src/translator/util/bindings.ts has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/bindings.ts:1
packages/runtime-tags/src/translator/util/solve-reasons.ts has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/solve-reasons.ts:1
packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts has 486 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts:1
packages/compiler/src/taglib/loader/loadTagFromProps.js has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/compiler/src/taglib/loader/loadTagFromProps.js:1
packages/runtime-tags/src/translator/util/translate-attrs.ts has 468 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/translate-attrs.ts:1
packages/runtime-tags/src/dom/dom.ts has 459 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/dom/dom.ts:1
packages/runtime-tags/src/dom/signals.ts has 451 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/dom/signals.ts:1
packages/runtime-tags/src/translator/util/structure.ts has 447 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/util/structure.ts:1
packages/runtime-tags/src/translator/core/for.ts has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/translator/core/for.ts:1
packages/runtime-tags/src/html/template.ts has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/runtime-tags/src/html/template.ts:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage9.0 / 10Strong✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×40) — scripts/sizes.mts:1, packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js:1, packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code7.9 / 10Strong✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
26 file(s) (~2445 LoC) were excluded from dead-code analysis. This package's entry point(s) resolved, but the walk stopped one hop in: packages/compiler/babel-types.d.ts imports './dist/traverse', which is not in the scanned tree. That is usually a generated or build-output module, so reachability cannot see past it and no dead-code claim is made about this package. Nothing is necessarily wrong here. — packages/compiler
Unreachable from the 1892 application, 17 tooling and 6100 test entry point(s) detected in this repo. Gate removals on `pnpm run build` — an undetected custom entry would make these reachable.
no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 4 in-repo import(s) from 4 other file(s) do name it (packages/runtime-class/src/runtime/helpers/tags-compat/html-debug.js, packages/runtime-class/src/runtime/helpers/tags-compat/html-debug.mjs, packages/runtime-class/src/runtime/helpers/tags-compat/html.js and 1 more) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js
no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 4 in-repo import(s) from 4 other file(s) do name it (packages/runtime-class/src/runtime/helpers/tags-compat/dom-debug.js, packages/runtime-class/src/runtime/helpers/tags-compat/dom-debug.mjs, packages/runtime-class/src/runtime/helpers/tags-compat/dom.js and 1 more) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js
no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×20) — packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js, packages/runtime-class/src/runtime/vdom/hot-reload.js, scripts/test-parallel-worker.cjs, …
no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (packages/runtime-class/src/runtime/components/legacy/dependencies/html.js, packages/runtime-class/src/runtime/components/legacy/dependencies/vdom.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/runtime-class/src/runtime/components/legacy/dependencies/index.js
no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/runtime-class/src/runtime/components/legacy/defineComponent-legacy.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it (×2) — packages/runtime-class/src/runtime/components/legacy/defineRenderer-legacy.js, packages/runtime-class/src/runtime/components/legacy/defineWidget-legacy.js
no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/runtime-class/helpers/empty.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/runtime-class/helpers/notEmpty.js
no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/runtime-class/legacy-components.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/runtime-class/src/runtime/components/legacy/index.js
This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. (×11) — packages/runtime-class/src/translator/tag/attribute-tag.js:16, packages/runtime-class/src/translator/tag/util.js:228, packages/runtime-class/test/translator/fixtures/declared-class-member/snapshots/cjs-expected.js:11, …
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Imported but not declared in any reachable package.json — installs work only by hoisting accident. — scripts/ts-hooks/index.js:5
Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2)
Declared in packages/compiler/package.json but never imported anywhere in that package or its workspace members — while scripts/ts-hooks/index.js DOES import it and no package.json above that file declares it, so the import resolves through the copy this declaration installs. The declaration is misplaced rather than dead: removing it breaks that import. Move it to the package.json that owns the importing file (or, if the two packages are meant to share it, hoist it to the workspace root) rather than deleting it.
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
packages/compiler/src/babel-plugin/index.js → packages/compiler/src/babel-plugin/parser.js → packages/compiler/src/babel-utils/index.js → packages/compiler/src/babel-utils/imports.js → packages/compiler/src/index.js → packages/compiler/src/babel-plugin/index.js (one verified cycle inside a mutually-dependent group of 10 files) — packages/compiler/src/babel-plugin/index.js:21
packages/compiler/src/taglib/loader/Taglib.js → packages/compiler/src/taglib/loader/loaders.js → packages/compiler/src/taglib/loader/loadAttributeFromProps.js → packages/compiler/src/taglib/loader/types.js → packages/compiler/src/taglib/loader/Taglib.js (one verified cycle inside a mutually-dependent group of 10 files) — packages/compiler/src/taglib/loader/Taglib.js:4
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document3.5 / 10Weak✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`toDelimitedString` is exported and takes `val: unknown` from its caller, and it calls itself at line 129 (`toDelimitedString`) with a piece of `val` — and nowhere in `toDelimitedString` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `toDelimitedString` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/runtime-tags/src/common/helpers.ts:129
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped4.5 / 10Weak✓ Tool-verified
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
`html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. (×3) — packages/runtime-class/src/runtime/vdom/parse-html.js:5, packages/runtime-class/src/runtime/vdom/parse-html.js:9, packages/runtime-tags/src/dom/parse-html.ts:6
What to do
Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×8) — scripts/sizes.mts:17, packages/runtime-tags/src/html/serializer.ts:2204, packages/runtime-class/src/translator/util/add-dependencies.js:316, …
`catch` 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. (×3) — packages/runtime-tags/src/translator/util/get-style-file.ts:16, REDACTED:81, REDACTED:105
`catch (_)` 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. — packages/compiler/src/taglib/loader/scanTagsDir.js:88
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 strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
~11.5 `!` null assertions per 1k TypeScript source lines — 482 assertion(s) across the 41806 source line(s) of the 212 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/runtime-tags/src/translator/util/known-tag.ts (37), REDACTED (35), packages/runtime-tags/src/translator/util/signals.ts (21). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
What to do
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 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.
P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 57 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — Not applicable: TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
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.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no data at rest for these controls to protect. If it does persist personal data (through a hosted backend configured outside this repository, for instance), the controls belong to wherever that data is stored.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository stands up no server (no Express, Fastify, Koa, Hono, NestJS or similar app, no Next.js/SvelteKit/Nuxt server route, no edge function), creates no Supabase tables and talks to no hosted backend. Access control is therefore N/A here — a browser application or library is authorized by the server it calls, not by itself; a client-side route guard hides a page and authorizes nothing. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a hosted backend configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound. If it does (through a hosted backend configured outside this repository, for instance), the limit belongs wherever that data is stored.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over. If it does (through a hosted backend configured outside this repository, for instance), the rights are served wherever that data is stored.
D11 Test Reliability — Test reliability not included — the mocha suite is behind a delegating test script
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, TypeScript not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed JavaScript, TypeScript surface was not measured.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .mts, .ts, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 reads resolved call sites in the languages it reads only — this repository's production source is .mts, .ts, which was left unread. 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) — 33 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D4 Code Duplication — This repository's production source (.mts, .ts) is not read by D4's token comparison, which compares .NET source: duplication in it is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream. Not scored here — read the R10 card for this repository's duplication.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not measured — the mocha suite is behind a delegating test script
DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
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
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the 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 — no coverage report found on disk — produce a coverage report in a standard format (lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for tinybench, mitata, benchmark.js, benny or vitest `bench(...)` calls in files that import them (or `*.bench.*` files), or one of those in a package.json, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: TypeScript/JavaScript runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
R5 Dependency Freshness — uses a pnpm lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
S1 Web-Security Posture — Not assessed: 475 JavaScript/TypeScript file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. That half of the dimension is clean, but it is not scored on its own: a C# repository with the same clean reading is scored on its server controls as well, or is N/A for having no web surface, and neither can be decided here. The server controls — HTTPS enforcement, HSTS, cookie flags, input validation — are NOT assessed for JavaScript/TypeScript: each is scored as an absence, an absence is only reportable over the production HTTP server, and in this ecosystem the file that opens the port is build output or a framework launcher rather than a file in the source tree. Their absence here is not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X26 Unsynchronised callback handoff — Not applicable: this check looks for a collection written by a callback on one thread while the body waiting on it touches it on another, and in this repository's languages no collection is reachable from two threads at once. TypeScript/JavaScript runs every callback on the one thread that owns its objects: a callback runs only when the body waiting on it has yielded, never alongside it, and a worker thread receives a COPY of what it is sent. A SharedArrayBuffer carries raw bytes, never an Array, Map or Set, so no collection is reachable from two threads at once. Not a gap in the analyzer and not a finding about your code.
X27 Collection changed while being enumerated — Not applicable: this check looks for a loop whose body adds to or removes from the very collection the loop is walking, invalidating the enumerator it holds, and in this repository's languages that cannot happen. JavaScript and TypeScript have no iterator that a change can invalidate: an `Array` is walked by index against its live length, and a `Map` or `Set` by the ECMAScript specification's live entry list, so a body that adds to, removes from or empties what it walks raises nothing — every loop form (`for…of`, `for…in`, `forEach`, `map`, `filter`, `reduce`, `entries()`) on every built-in collection (`Array`, `Map`, `Set`, plain objects, `URLSearchParams`, `Headers`, `FormData`) runs to completion. Such a loop can still skip an element or never end, which is a different defect and not the one this check asks about. Not a gap in the analyzer and not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, 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.
Orphaned knowledge packages/runtime-class/src/runtime/vdom/morphdom/index.js: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.
Unlisted import 'complain' scripts/ts-hooks/index.js:5— Imported but not declared in any reachable package.json — installs work only by hoisting accident.
Repeated repair: packages/runtime-tags/src/translator/visitors/import-declaration.ts packages/runtime-tags/src/translator/visitors/import-declaration.ts:245— packages/runtime-tags/src/translator/visitors/import-declaration.ts changed 23 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is import-declaration.trackRegisteredImports at line 245), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix(runtime-tags): render a template a `<const>` names without reading the `<const>`”; “fix(runtime-tags): resume a lazily imported template the server writes”; “fix(runtime-tags): keep a template the server writes in the client bundle”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/visitors/import-declaration.ts`: 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.
Repeated repair: packages/runtime-tags/src/html/compat.ts packages/runtime-tags/src/html/compat.ts:308— packages/runtime-tags/src/html/compat.ts changed 19 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is compat.drainClassFunctions at line 308), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: write Class lazy assets within Tags content through the Tags writer”; “fix(runtime-tags): cut Class interop content with the Tags <try> around it”; “fix(runtime-tags): hold effects per boundary so a @catch drops only its body's”; “fix(runtime-tags): let tags record facts and keep reasons on slots”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/html/compat.ts`: 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.
Repeated repair: packages/runtime-tags/src/dom/dom.ts packages/runtime-tags/src/dom/dom.ts:268— packages/runtime-tags/src/dom/dom.ts changed 15 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is dom.attrsInternal at line 268), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): run a new branch's setup as it is created”; “fix(runtime-tags): keep a client-rendered dynamic style's first declaration”; “fix(runtime-tags): give a lone `$!{}` row a parent and keep equal markup”; “fix(runtime-tags): settle an await through the count it took and release it on destroy”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/dom/dom.ts`: 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.
Repeated repair: packages/runtime-tags/src/translator/visitors/function.ts packages/runtime-tags/src/translator/visitors/function.ts:73— packages/runtime-tags/src/translator/visitors/function.ts changed 15 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is function.isMarkoAttribute at line 73), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): keep a template the server writes in the client bundle”; “fix(runtime-tags): reject module level references to render-scoped names”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): settle serialize reasons that follow other serialize reasons”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/visitors/function.ts`: 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.
Repeated repair: packages/runtime-tags/src/html/assets.ts packages/runtime-tags/src/html/assets.ts:172— packages/runtime-tags/src/html/assets.ts changed 14 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is assets.writeAsset at line 172), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix(runtime-tags): escape html-script text so JSON script types stay valid”; “fix(runtime-tags): resume a lazily imported template the server writes”; “fix(runtime-tags): disallow a tag variable on a lazily loaded tag”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/html/assets.ts`: 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.
Repeated repair: packages/runtime-tags/src/dom/load.ts packages/runtime-tags/src/dom/load.ts:102— packages/runtime-tags/src/dom/load.ts changed 16 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is load.insertLoaded at line 102), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): run a new branch's setup as it is created”; “fix(runtime-tags): disallow a tag variable on a lazily loaded tag”; “fix(runtime-tags): require a `<return>` for a tag variable”; “fix(runtime-tags): run a lazy tag's cloned renders before its variable's readers”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/dom/load.ts`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/dynamic-tag-content-instance-switch/__snapshots__/dom.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/dynamic-tag-content-instance-switch/__snapshots__/dom.bundle.debug.js:25— packages/runtime-tags/src/__tests__/fixtures/dynamic-tag-content-instance-switch/__snapshots__/dom.bundle.debug.js changed 9 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 25), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): run a new branch's setup as it is created”; “fix(runtime-tags): require a `<return>` for a tag variable”; “fix(runtime-tags): run a dynamic tag's branch renders before its variable's readers”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/dynamic-tag-content-instance-switch/__snapshots__/dom.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/lazy-tag-dynamic-unmount-before-load/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/lazy-tag-dynamic-unmount-before-load/__snapshots__/html.bundle.debug.js:2— packages/runtime-tags/src/__tests__/fixtures/lazy-tag-dynamic-unmount-before-load/__snapshots__/html.bundle.debug.js changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 2), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix: pass the asset runtime to each lazy tag instead of the page entry”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/lazy-tag-dynamic-unmount-before-load/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/lazy-tag-placeholder/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/lazy-tag-placeholder/__snapshots__/html.bundle.debug.js:2— packages/runtime-tags/src/__tests__/fixtures/lazy-tag-placeholder/__snapshots__/html.bundle.debug.js changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 2), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix: pass the asset runtime to each lazy tag instead of the page entry”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/lazy-tag-placeholder/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/cross-tag-closure/__snapshots__/dom.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/cross-tag-closure/__snapshots__/dom.bundle.debug.js:4— packages/runtime-tags/src/__tests__/fixtures/cross-tag-closure/__snapshots__/dom.bundle.debug.js changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 1 (its worst body is (anonymous) at line 4), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): run a new branch's setup as it is created”; “fix(runtime-tags): require a `<return>` for a tag variable”; “fix(runtime-tags): key resume register ids by a closure's owner section”; “fix(runtime-tags): key closure signal indexes uniquely per subscriber scope”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/cross-tag-closure/__snapshots__/dom.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/return-tag-bind-type-casting/__snapshots__/dom.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/return-tag-bind-type-casting/__snapshots__/dom.bundle.debug.js:4— packages/runtime-tags/src/__tests__/fixtures/return-tag-bind-type-casting/__snapshots__/dom.bundle.debug.js changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 1 (its worst body is (anonymous) at line 4), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): run a new branch's setup as it is created”; “fix(runtime-tags): require a `<return>` for a tag variable”; “fix(runtime-tags): key resume register ids by a closure's owner section”; “fix(runtime-tags): key closure signal indexes uniquely per subscriber scope”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/return-tag-bind-type-casting/__snapshots__/dom.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/known-tag-args-spread/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/known-tag-args-spread/__snapshots__/html.bundle.debug.js:8— packages/runtime-tags/src/__tests__/fixtures/known-tag-args-spread/__snapshots__/html.bundle.debug.js changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is (anonymous) at line 8), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”; “fix(runtime-tags): key closure signal indexes uniquely per subscriber scope”; “fix(runtime-tags): serialize a spread value a client render reads”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/known-tag-args-spread/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/lazy-tag-dynamic-placeholder/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/lazy-tag-dynamic-placeholder/__snapshots__/html.bundle.debug.js:2— packages/runtime-tags/src/__tests__/fixtures/lazy-tag-dynamic-placeholder/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 2), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix: pass the asset runtime to each lazy tag instead of the page entry”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/lazy-tag-dynamic-placeholder/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/lazy-tag-input-chunk-load-error/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/lazy-tag-input-chunk-load-error/__snapshots__/html.bundle.debug.js:2— packages/runtime-tags/src/__tests__/fixtures/lazy-tag-input-chunk-load-error/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 2), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix: pass the asset runtime to each lazy tag instead of the page entry”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/lazy-tag-input-chunk-load-error/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-error/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-error/__snapshots__/html.bundle.debug.js:2— packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-error/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 2), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix: pass the asset runtime to each lazy tag instead of the page entry”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-error/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/input-missing-property/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/input-missing-property/__snapshots__/html.bundle.debug.js:11— packages/runtime-tags/src/__tests__/fixtures/input-missing-property/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 11), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): link a branch's owner by its marker only when the branch's runtime is bundled”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”; “fix(runtime-tags): key closure signal indexes uniquely per subscriber scope”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/input-missing-property/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/at-tags-for-loop-param-intersection-closure/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/at-tags-for-loop-param-intersection-closure/__snapshots__/html.bundle.debug.js:2— packages/runtime-tags/src/__tests__/fixtures/at-tags-for-loop-param-intersection-closure/__snapshots__/html.bundle.debug.js changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 2), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): link a branch's owner by its marker only when the branch's runtime is bundled”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”; “fix(runtime-tags): key closure signal indexes uniquely per subscriber scope”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/at-tags-for-loop-param-intersection-closure/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/basic-nested-params/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/basic-nested-params/__snapshots__/html.bundle.debug.js:34— packages/runtime-tags/src/__tests__/fixtures/basic-nested-params/__snapshots__/html.bundle.debug.js changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is (anonymous) at line 34), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”; “fix(runtime-tags): key closure signal indexes uniquely per subscriber scope”; “fix(runtime-tags): serialize a spread value a client render reads”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/basic-nested-params/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/bind-to-input/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/bind-to-input/__snapshots__/html.bundle.debug.js:2— packages/runtime-tags/src/__tests__/fixtures/bind-to-input/__snapshots__/html.bundle.debug.js changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is (anonymous) at line 2), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”; “fix(runtime-tags): key closure signal indexes uniquely per subscriber scope”; “fix(runtime-tags): serialize a spread value a client render reads”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/bind-to-input/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/lazy-tag-nested-async/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/lazy-tag-nested-async/__snapshots__/html.bundle.debug.js:40— packages/runtime-tags/src/__tests__/fixtures/lazy-tag-nested-async/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 40), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix: pass the asset runtime to each lazy tag instead of the page entry”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/lazy-tag-nested-async/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-entry-error/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-entry-error/__snapshots__/html.bundle.debug.js:21— packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-entry-error/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is (anonymous) at line 21), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix: pass the asset runtime to each lazy tag instead of the page entry”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-entry-error/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-script-error/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-script-error/__snapshots__/html.bundle.debug.js:21— packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-script-error/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is (anonymous) at line 21), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): a lazily imported template renders in an import cycle”; “fix: pass the asset runtime to each lazy tag instead of the page entry”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/lazy-tag-load-script-error/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/at-tags-for-loop-param-event-handler/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/at-tags-for-loop-param-event-handler/__snapshots__/html.bundle.debug.js:2— packages/runtime-tags/src/__tests__/fixtures/at-tags-for-loop-param-event-handler/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 2), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): resume attribute tag loop content a call site swaps”; “fix(runtime-tags): link a branch's owner by its marker only when the branch's runtime is bundled”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): keep an attribute tag loop param for sections nested in its content”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/at-tags-for-loop-param-event-handler/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/native-tag-local-closures/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/native-tag-local-closures/__snapshots__/html.bundle.debug.js:6— packages/runtime-tags/src/__tests__/fixtures/native-tag-local-closures/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 6), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): resume attribute tag loop content a call site swaps”; “fix(runtime-tags): link a branch's owner by its marker only when the branch's runtime is bundled”; “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): stop a native tag spread registering content it only renders”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/native-tag-local-closures/__snapshots__/html.bundle.debug.js`: 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.
Repeated repair: packages/runtime-tags/src/__tests__/fixtures/input-property-alias-closure/__snapshots__/html.bundle.debug.js packages/runtime-tags/src/__tests__/fixtures/input-property-alias-closure/__snapshots__/html.bundle.debug.js:17— packages/runtime-tags/src/__tests__/fixtures/input-property-alias-closure/__snapshots__/html.bundle.debug.js changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is (anonymous) at line 17), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(runtime-tags): let tags record facts and keep reasons on slots”; “fix(runtime-tags): key resume register ids by a closure's owner section”; “fix(runtime-tags): key closure signal indexes uniquely per subscriber scope”; “fix(runtime-tags): serialize a spread value a client render reads”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/__tests__/fixtures/input-property-alias-closure/__snapshots__/html.bundle.debug.js`: 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.
+ 443 more in this group — see findings.md.
R4 · Test Coverage· No test reaches this file · ×40
No test reaches this file scripts/sizes.mts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/helpers/load-tag.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/components/legacy/dependencies/index.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/components/legacy/defineRenderer-legacy.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/components/legacy/ready.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/vdom/hot-reload.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-tags/scripts/bundle.mts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/test-parallel-worker.cjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/inspect-compiled-output.mts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-tags/scripts/build-plugins/decl-hoist.mts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/components/attach-detach.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/helpers/load-tag-browser.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/core-tags/core/await/client-reorder-runtime.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/core-tags/core/__flush_here_and_after__.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/pkg-override.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/publish-alias.mts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/helpers/load-tag-visible-trigger.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/components/legacy/defineComponent-legacy.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/helpers/load-tag-event-trigger.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/vdom/helpers/const-element.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/helpers/load-tag-race-trigger.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file packages/runtime-class/src/runtime/helpers/load-tag-media-trigger.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
Hotspot: packages/runtime-tags/src/translator/util/signals.ts packages/runtime-tags/src/translator/util/signals.ts:1238— packages/runtime-tags/src/translator/util/signals.ts changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in signals.writeHTMLResumeStatements at line 1238. 24 of those changes were fix/bug commits, and the other 36 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/signals.ts`: 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: packages/runtime-tags/src/translator/util/known-tag.ts packages/runtime-tags/src/translator/util/known-tag.ts:1101— packages/runtime-tags/src/translator/util/known-tag.ts changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in known-tag.writeAttrsToSignals at line 1101. 21 of those changes were fix/bug commits, and the other 29 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/known-tag.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:1326— REDACTED changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Chunk.flush at line 1326. 34 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-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: packages/runtime-tags/src/dom/resume.ts packages/runtime-tags/src/dom/resume.ts:126— packages/runtime-tags/src/dom/resume.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in resume.init at line 126. 10 of those changes were fix/bug commits, and the other 13 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/dom/resume.ts`: 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: packages/runtime-tags/src/html/serializer.ts packages/runtime-tags/src/html/serializer.ts:1003— packages/runtime-tags/src/html/serializer.ts changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in serializer.writeUnknownObject at line 1003. 12 of those changes were fix/bug commits, and the other 22 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/html/serializer.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:938— REDACTED changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in (anonymous) at line 938. 49 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-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: packages/runtime-tags/src/translator/util/references.ts packages/runtime-tags/src/translator/util/references.ts:402— packages/runtime-tags/src/translator/util/references.ts changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in references.trackReferencesForBinding at line 402. 44 of those changes were fix/bug commits, and the other 44 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/references.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:612— REDACTED changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in control-flow._dynamic_tag at line 612. 17 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-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: packages/compiler/src/babel-plugin/parser.js packages/compiler/src/babel-plugin/parser.js:48— packages/compiler/src/babel-plugin/parser.js changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in parser.parseMarko at line 48. 7 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-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/compiler/src/babel-plugin/parser.js`: 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: packages/runtime-tags/src/html/dynamic-tag.ts packages/runtime-tags/src/html/dynamic-tag.ts:44— packages/runtime-tags/src/html/dynamic-tag.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in dynamic-tag._dynamic_tag at line 44. 14 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-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/html/dynamic-tag.ts`: 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: packages/runtime-tags/src/translator/visitors/tag/native-tag.ts packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:1211— packages/runtime-tags/src/translator/visitors/tag/native-tag.ts changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in native-tag.getRelatedControllable at line 1211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/visitors/tag/native-tag.ts`: 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: packages/runtime-tags/src/translator/util/tag-name-type.ts packages/runtime-tags/src/translator/util/tag-name-type.ts:134— packages/runtime-tags/src/translator/util/tag-name-type.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in tag-name-type.analyzeExpressionTagName at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/tag-name-type.ts`: 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: packages/runtime-tags/src/translator/util/finalize-references.ts packages/runtime-tags/src/translator/util/finalize-references.ts:349— packages/runtime-tags/src/translator/util/finalize-references.ts changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in finalize-references.allocateIds at line 349. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/finalize-references.ts`: 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: packages/runtime-tags/src/translator/core/style.ts packages/runtime-tags/src/translator/core/style.ts:324— packages/runtime-tags/src/translator/core/style.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in style.createStyleDependency at line 324. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/core/style.ts`: 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: packages/runtime-tags/src/translator/visitors/placeholder.ts packages/runtime-tags/src/translator/visitors/placeholder.ts:107— packages/runtime-tags/src/translator/visitors/placeholder.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in placeholder.translateExit at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/visitors/placeholder.ts`: 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: packages/runtime-tags/src/html/attrs.ts packages/runtime-tags/src/html/attrs.ts:305— packages/runtime-tags/src/html/attrs.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in attrs._attrs at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/html/attrs.ts`: 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: packages/runtime-tags/src/translator/core/if.ts packages/runtime-tags/src/translator/core/if.ts:278— packages/runtime-tags/src/translator/core/if.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in if.flattenTextOnlyConditional at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/core/if.ts`: 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: packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js:18— packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in runtime-html.p at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js`: 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: packages/compiler/src/babel-plugin/index.js packages/compiler/src/babel-plugin/index.js:169— packages/compiler/src/babel-plugin/index.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in index.getMarkoFile at line 169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/compiler/src/babel-plugin/index.js`: 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: packages/runtime-tags/src/translator/util/translate-attrs.ts packages/runtime-tags/src/translator/util/translate-attrs.ts:40— packages/runtime-tags/src/translator/util/translate-attrs.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in translate-attrs.translateAttrs at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/translate-attrs.ts`: 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: packages/runtime-tags/src/translator/util/structure.ts packages/runtime-tags/src/translator/util/structure.ts:175— packages/runtime-tags/src/translator/util/structure.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in structure.resolveStructure at line 175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/structure.ts`: 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: .sizes/comments.csr/runtime.js .sizes/comments.csr/runtime.js:105— .sizes/comments.csr/runtime.js changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in (anonymous) at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- .sizes/comments.csr/runtime.js`: 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: packages/runtime-tags/src/translator/util/solve-reasons.ts packages/runtime-tags/src/translator/util/solve-reasons.ts:423— packages/runtime-tags/src/translator/util/solve-reasons.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in solve-reasons.computeBindingReaders at line 423. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/solve-reasons.ts`: 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: packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts:213— packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in pre-analyze.buildChangeHandlerAttr at line 213. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts`: 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: packages/runtime-tags/src/translator/util/optional.ts packages/runtime-tags/src/translator/util/optional.ts:177— packages/runtime-tags/src/translator/util/optional.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Sorted.intersects at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-31 11:54:45 -07:00' --until='2026-10-29 11:54:45 -07:00' --full-history --no-merges -- packages/runtime-tags/src/translator/util/optional.ts`: 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.
TodoComment packages/runtime-tags/src/translator/visitors/program/index.ts:95— // TODO: make any exports undefined if they are noops/empty — 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 packages/runtime-tags/src/translator/util/bindings.ts:185— // TODO: should prefer declared properties as alias roots. — 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 packages/runtime-tags/src/translator/util/bindings.ts:192— // TODO: check if default is used, if so an intermediate binding is needed — 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 packages/runtime-tags/src/translator/util/known-tag.ts:797— // TODO: update when supporting default params — 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 packages/runtime-tags/src/translator/util/known-tag.ts:801— // TODO: update when supporting default params — 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 packages/runtime-tags/src/translator/util/known-tag.ts:1045— // TODO: pretty sure content needs to have the reference group of it's param defaults. — 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 packages/runtime-tags/src/translator/util/known-tag.ts:1299— // TODO: pretty sure content needs to have the reference group of it's param defaults. — 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 packages/runtime-tags/src/translator/util/known-tag.ts:1350— // TODO: use spreadBinding property alias after we optimize `in` — 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 packages/runtime-tags/src/translator/util/params-tree.ts:9— // TODO: change to "known" — 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 packages/runtime-tags/src/translator/util/scope-read.ts:32— // TODO: handle hoisted references — 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 packages/runtime-tags/src/translator/core/define.ts:69— // TODO: support destructure — 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 packages/runtime-tags/src/translator/core/if.ts:80— // TODO: remove all branches if none have body content. — 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 packages/runtime-tags/src/translator/core/return.ts:98— // TODO: this should be based on the parent actually mutating the tag variable. — 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 REDACTED:428— // TODO: if the return value is already registered, use that. — 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 REDACTED:1117— // TODO: eventually this should be allowed. — 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 packages/runtime-tags/src/dom/dom.ts:60— // TODO: benchmark if it is actually faster to check first — 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 packages/runtime-tags/src/dom/dom.ts:166— // TODO: benchmark if it is actually faster to check data first — 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 packages/runtime-tags/src/dom/dom.ts:174— // TODO: benchmark if it is actually faster to check data first — 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 packages/runtime-tags/src/dom/scope.ts:81— // TODO: turn into normal function declaration when resolved: https://github.com/oxc-project/oxc/issues/17364?issue=rolldown%7Crolldown%7C7666
TodoComment packages/runtime-tags/src/dom/walker.ts:22— // TODO: turn into normal function declaration when resolved: https://github.com/oxc-project/oxc/issues/17364?issue=rolldown%7Crolldown%7C7666
TodoComment packages/runtime-tags/src/common/helpers.ts:115— // TODO: turn into normal function declaration when resolved: https://github.com/oxc-project/oxc/issues/17364?issue=rolldown%7Crolldown%7C7666
TodoComment packages/runtime-tags/src/__tests__/utils/track-mutations.ts:28— // TODO: throw — 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 packages/runtime-tags/src/__tests__/fixtures-interop/custom-tag-parameters-from-args/test.ts:8— // TODO: it is broken. — 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.
FunctionTooLong: parser.parseMarko packages/compiler/src/babel-plugin/parser.js:48— FunctionTooLong — parseMarko runs 490 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 390 over it, 4.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: index.morphdom packages/runtime-class/src/runtime/vdom/morphdom/index.js:59— FunctionTooLong — morphdom runs 422 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 322 over it, 4.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: resume.init packages/runtime-tags/src/dom/resume.ts:126— FunctionTooLong — init runs 284 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 184 over it, 2.84× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: known-tag.writeAttrsToSignals packages/runtime-tags/src/translator/util/known-tag.ts:1101— FunctionTooLong — writeAttrsToSignals runs 240 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 140 over it, 2.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: known-tag.analyzeAttrs packages/runtime-tags/src/translator/util/known-tag.ts:614— FunctionTooLong — analyzeAttrs runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: compute.computeNode REDACTED:4— FunctionTooLong — computeNode runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: signals.writeHTMLResumeStatements packages/runtime-tags/src/translator/util/signals.ts:1238— FunctionTooLong — writeHTMLResumeStatements runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: renderer-legacy.createRendererFunc packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:14— FunctionTooLong — createRendererFunc runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dynamic-tag._dynamic_tag packages/runtime-tags/src/html/dynamic-tag.ts:44— FunctionTooLong — _dynamic_tag runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: index.getMarkoFile packages/compiler/src/babel-plugin/index.js:169— FunctionTooLong — getMarkoFile runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: references.createBindingsAndTrackReferences packages/runtime-tags/src/translator/util/references.ts:606— FunctionTooLong — createBindingsAndTrackReferences runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: index.createInteropTranslator packages/runtime-tags/src/translator/interop/index.ts:34— FunctionTooLong — createInteropTranslator runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: pre-analyze.buildChangeHandlerAttr packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts:213— FunctionTooLong — buildChangeHandlerAttr runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: control-flow._await_promise REDACTED:55— FunctionTooLong — _await_promise runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: renderer.createRendererFunc packages/runtime-class/src/runtime/components/renderer.js:58— FunctionTooLong — createRendererFunc runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: serializer.writeUnknownObject packages/runtime-tags/src/html/serializer.ts:1003— FunctionTooLong — writeUnknownObject runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: custom-tag.translateDOM packages/runtime-tags/src/translator/visitors/tag/custom-tag.ts:176— FunctionTooLong — translateDOM runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: signals.getSignal packages/runtime-tags/src/translator/util/signals.ts:296— FunctionTooLong — getSignal runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: tag-name-type.analyzeExpressionTagName packages/runtime-tags/src/translator/util/tag-name-type.ts:134— FunctionTooLong — analyzeExpressionTagName runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× 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.
No assertions: should initialize components correctly across async boundaries packages/runtime-class/test/components-pages/fixtures/server-render-function-references/tests.js:1— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should initialize components correctly across async boundaries packages/runtime-class/test/components-pages/fixtures/server-render-dom-event-handlers/tests.js:1— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should invoke lifecycle events correctly when a UI component is rendered on the server packages/runtime-class/test/components-pages/fixtures/lifecycle-events/tests.js:1— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should invoke lifecycle events correctly when a UI component is rendered on the server - component exports class packages/runtime-class/test/components-pages/fixtures/lifecycle-events/tests.js:6— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should invoke lifecycle events correctly when a UI component is rendered on the server - component exports class ctor packages/runtime-class/test/components-pages/fixtures/lifecycle-events/tests.js:11— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should invoke lifecycle events correctly when a UI component is rendered on the server - component exports object packages/runtime-class/test/components-pages/fixtures/lifecycle-events/tests.js:16— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: preserve content included on the server packages/runtime-class/test/components-pages/fixtures/include-preserve/tests.js:1— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should allow diffing html packages/runtime-class/test/components-pages/fixtures/empty-component/tests.js:1— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should allow no args packages/runtime-class/test/components-pages/fixtures/dom-events-bubbling/tests.js:32— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should allow one arg packages/runtime-class/test/components-pages/fixtures/dom-events-bubbling/tests.js:36— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should allow one arg as array packages/runtime-class/test/components-pages/fixtures/dom-events-bubbling/tests.js:40— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should allow two args packages/runtime-class/test/components-pages/fixtures/dom-events-bubbling/tests.js:44— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should serialize component config down to the browser packages/runtime-class/test/components-pages/fixtures/component-state/tests.js:7— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should initialize components correctly across async boundaries packages/runtime-class/test/components-pages/fixtures/async-boundaries/tests.js:1— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should not crash the program if the underlying stream has an error listener packages/runtime-class/test/async-stream/index.test.js:487— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should crash the program if the underlying stream does *not* have an error listener packages/runtime-class/test/async-stream/index.test.js:501— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: should track finished correctly packages/runtime-class/test/async-stream/index.test.js:705— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
Boundary violation [package:third-party-deep-import] packages/compiler/scripts/types.js:10— packages/compiler/scripts/types.js:10 imports @babel/types/lib/index.d.ts, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/__util__/create-marko-jsdom-module.js:4— packages/runtime-class/test/__util__/create-marko-jsdom-module.js:4 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/__util__/test-init.js:1— packages/runtime-class/test/__util__/test-init.js:1 reaches past another workspace package's public entry into its internals with a relative path (../../node-require) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/api-compiler/index.test.js:8— packages/runtime-class/test/api-compiler/index.test.js:8 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/api-compiler/index.test.js:11— packages/runtime-class/test/api-compiler/index.test.js:11 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/api/fixtures/require-hook-compiler-options/test.js:2— packages/runtime-class/test/api/fixtures/require-hook-compiler-options/test.js:2 reaches past another workspace package's public entry into its internals with a relative path (../../../../node-require) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/api/index.test.js:9— packages/runtime-class/test/api/index.test.js:9 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/api/index.test.js:12— packages/runtime-class/test/api/index.test.js:12 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/components-browser/fixtures/component-preserve-all-state-when-rendered-in-loop/test.js:2— packages/runtime-class/test/components-browser/fixtures/component-preserve-all-state-when-rendered-in-loop/test.js:2 reaches past another workspace package's public entry into its internals with a relative path (../../../../src/runtime/components/dom-data) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/node-require/index.test.js:10— packages/runtime-class/test/node-require/index.test.js:10 reaches past another workspace package's public entry into its internals with a relative path (../../node-require) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/taglib-loader/index.test.js:9— packages/runtime-class/test/taglib-loader/index.test.js:9 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/taglib-loader/index.test.js:11— packages/runtime-class/test/taglib-loader/index.test.js:11 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/taglib-lookup/index.test.js:10— packages/runtime-class/test/taglib-lookup/index.test.js:10 reaches past another workspace package's public entry into its internals with a relative path (../../compiler) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:test-cross-package-internals] packages/runtime-class/test/vdom-create/fixtures/isSameNode-createElement/index.js:2— packages/runtime-class/test/vdom-create/fixtures/isSameNode-createElement/index.js:2 reaches past another workspace package's public entry into its internals with a relative path (../../../../src/runtime/components/dom-data) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
Boundary violation [package:third-party-deep-import] scripts/test-parallel.js:26— scripts/test-parallel.js:26 imports mocha/lib/cli/run-option-metadata, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
FileTooLong: REDACTED REDACTED— FileTooLong — 1893 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1393 over it, 3.79× 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: html/serializer.ts packages/runtime-tags/src/html/serializer.ts— FileTooLong — 1795 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1295 over it, 3.59× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: tag/native-tag.ts packages/runtime-tags/src/translator/visitors/tag/native-tag.ts— FileTooLong — 1544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1044 over it, 3.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: util/signals.ts packages/runtime-tags/src/translator/util/signals.ts— FileTooLong — 1239 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 739 over it, 2.48× 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: REDACTED REDACTED— FileTooLong — 1160 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 660 over it, 2.32× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: util/known-tag.ts packages/runtime-tags/src/translator/util/known-tag.ts— FileTooLong — 1045 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 545 over it, 2.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: util/references.ts packages/runtime-tags/src/translator/util/references.ts— FileTooLong — 942 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 442 over it, 1.88× 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: REDACTED REDACTED— FileTooLong — 800 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 300 over it, 1.60× 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/finalize-references.ts packages/runtime-tags/src/translator/util/finalize-references.ts— FileTooLong — 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: babel-plugin/parser.js packages/compiler/src/babel-plugin/parser.js— FileTooLong — 567 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 86% of them inside a single declaration: parseMarko (48-768). The bar is 500 significant lines; this is 67 over it, 1.13× 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: util/optional.ts packages/runtime-tags/src/translator/util/optional.ts— 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: html/control-flow.ts packages/runtime-tags/src/html/control-flow.ts— FileTooLong — 559 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 59 over it, 1.12× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: translator/index.js packages/runtime-class/src/translator/index.js— FileTooLong — 537 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 37 over it, 1.07× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: html/AsyncStream.js packages/runtime-class/src/runtime/html/AsyncStream.js— FileTooLong — 505 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 80% of them inside a single declaration: proto (125-807). The bar is 500 significant lines; this is 5 over it, 1.01× 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.
Swallowed exception (empty catch) scripts/sizes.mts:17— 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) packages/runtime-tags/src/html/serializer.ts:2204— 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) packages/runtime-class/src/translator/util/add-dependencies.js:316— 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) packages/runtime-class/src/runtime/components/legacy/ready.js: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) packages/runtime-class/src/runtime/components/legacy/dependencies/index.js:78— 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) packages/compiler/modules.js:23— 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) packages/compiler/src/taglib/loader/scanTagsDir.js:182— 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) packages/compiler/src/babel-plugin/index.js:405— 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.
Duplicated block (16 lines × 2 locations) packages/compiler/src/babel-plugin/parser.js:226— packages/compiler/src/babel-plugin/parser.js:226 · packages/compiler/src/babel-plugin/parser.js:252 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (16 lines × 2 locations) packages/compiler/src/taglib/loader/loadTagFromProps.js:55— packages/compiler/src/taglib/loader/loadTagFromProps.js:55 · packages/compiler/src/taglib/loader/loadTaglibFromProps.js:19 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (16 lines × 2 locations) packages/runtime-class/src/translator/taglib/core/parse-client.js:4— packages/runtime-class/src/translator/taglib/core/parse-client.js:4 · packages/runtime-class/src/translator/taglib/core/parse-server.js:4 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (16 lines × 2 locations) packages/runtime-tags/src/html/serializer.ts:1238— packages/runtime-tags/src/html/serializer.ts:1238 · packages/runtime-tags/src/html/serializer.ts:1285 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (16 lines × 2 locations) packages/runtime-tags/src/html/serializer.ts:1837— packages/runtime-tags/src/html/serializer.ts:1837 · packages/runtime-tags/src/html/serializer.ts:1963 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2 locations) packages/runtime-tags/src/translator/visitors/tag/index.ts:96— packages/runtime-tags/src/translator/visitors/tag/index.ts:96 · packages/runtime-tags/src/translator/visitors/tag/index.ts:120 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Dead file (~5 LoC) packages/runtime-class/browser-refresh.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~5 LoC) packages/runtime-class/src/compiler/modules.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~5 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/dom-debug.mjs— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~5 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/dom.mjs— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~5 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/html-debug.mjs— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~5 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/html.mjs— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~3 LoC) packages/runtime-class/src/runtime/components/legacy/dependencies/html.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~3 LoC) packages/runtime-class/src/runtime/components/legacy/dependencies/vdom.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~3 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/dom-debug.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~3 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/dom.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~3 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/html-debug.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~3 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/html.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R10 · Code Duplication· Duplicated block with local edits (14 matched lines × 2 locations) · ×5
Duplicated block with local edits (14 matched lines × 2 locations) packages/runtime-tags/src/common/errors.ts:33— packages/runtime-tags/src/common/errors.ts:33 · packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:2026 — the two spans are one implementation copied and then locally edited — 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (14 matched lines × 2 locations) packages/runtime-tags/src/translator/core/define.ts:106— packages/runtime-tags/src/translator/core/define.ts:106 · packages/runtime-tags/src/translator/visitors/tag/attribute-tag.ts:44 — the two spans are one implementation copied and then locally edited — 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (14 matched lines × 2 locations) packages/runtime-tags/src/translator/core/for.ts:170— packages/runtime-tags/src/translator/core/for.ts:170 · packages/runtime-tags/src/translator/core/for.ts:233 — the two spans are one implementation copied and then locally edited — 95 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (14 matched lines × 2 locations) packages/runtime-tags/src/translator/util/known-tag.ts:1159— packages/runtime-tags/src/translator/util/known-tag.ts:1159 · packages/runtime-tags/src/translator/util/translate-attrs.ts:51 — the two spans are one implementation copied and then locally edited — 98 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (14 matched lines × 2 locations) packages/runtime-tags/src/translator/util/references.ts:363— packages/runtime-tags/src/translator/util/references.ts:363 · packages/runtime-tags/src/translator/util/references.ts:381 — the two spans are one implementation copied and then locally edited — 67 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Change coupling: entry.js ↔ REDACTED .sizes/comments.ssr/entry.js:1— `.sizes/comments.ssr/entry.js` and `REDACTED` change together 91% of the time (10 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — 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 10 shared commits counted here, the most recent 3 are `f79163dc` perf: optimize resume visit runtime for bundle size; `4aa8120f` fix: avoid storing client scope id counter on; `0807d31b` fix: let tags updating incorrectly on resume — run `git show` on any of them.
Change coupling: for.ts ↔ if.ts packages/runtime-tags/src/translator/core/for.ts:1— `packages/runtime-tags/src/translator/core/for.ts` and `packages/runtime-tags/src/translator/core/if.ts` change together 63% of the time (17 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are `23cb7c99` refactor(runtime-tags): describe a branch's closure hop as data; `1c2a58cd` refactor(runtime-tags): name write reason lookups; `2ac0b163` refactor(runtime-tags): record which tag renders a branch section in … — run `git show` on any of them.
Change coupling: compat.ts ↔ template.ts packages/runtime-tags/src/dom/compat.ts:1— `packages/runtime-tags/src/dom/compat.ts` and `packages/runtime-tags/src/dom/template.ts` change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `0be6dad0` refactor: use enum replacement instead of mangled properties for prop…; `4aa8120f` fix: avoid storing client scope id counter on; `89e310e9` refactor: avoid getters for renderer args — run `git show` on any of them.
Change coupling: references.ts ↔ translate-var.ts packages/runtime-tags/src/translator/util/references.ts:1— `packages/runtime-tags/src/translator/util/references.ts` and `packages/runtime-tags/src/translator/util/translate-var.ts` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `9411bbed` fix(runtime-tags): assign a renamed destructure through its change ha…; `f9d44124` fix(runtime-tags): build a new array for a whole-array rest; `66cfef18` refactor(runtime-tags): name the value graph for what derives from what — run `git show` on any of them.
Swallowed exception (caught, then discarded) packages/runtime-tags/src/translator/util/get-style-file.ts:16— `catch` 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) packages/compiler/src/taglib/loader/scanTagsDir.js:88— `catch (_)` 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) REDACTED:81— `catch` 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) REDACTED:105— `catch` 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.
walkInternal (cyclomatic 20) REDACTED:61— walkInternal has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
walkInternal (cyclomatic 20) .sizes/comments.csr/runtime.js:37— walkInternal has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
walkInternal (cyclomatic 20) .sizes/counter.csr/runtime.js:36— walkInternal has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
createRendererFunc::renderer (cognitive 53) packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:20— createRendererFunc::renderer has cognitive complexity 53 (threshold 15). Drivers by points: if/else 25 (43 pts), boolean chains 9, ternaries 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.
createRendererFunc::renderer (cognitive 50) packages/runtime-class/src/runtime/components/renderer.js:81— createRendererFunc::renderer has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (37 pts), ternaries 2 (10 pts), boolean chains 3 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
createRendererFunc::renderer::t (cognitive 17) packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:150— createRendererFunc::renderer::t has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2 (nesting depth added 8). 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.
parseMarko::onOpenTagEnd (cognitive 46) packages/compiler/src/babel-plugin/parser.js:551— parseMarko::onOpenTagEnd has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 5 (19 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 26). 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.
parseMarko::onCloseTagEnd (cognitive 38) packages/compiler/src/babel-plugin/parser.js:653— parseMarko::onCloseTagEnd has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 5, loops 1 (3 pts), ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseMarko::onOpenTagName (cognitive 19) packages/compiler/src/babel-plugin/parser.js:359— parseMarko::onOpenTagName has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
walkInternal (cognitive 28) REDACTED:61— walkInternal has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
walkInternal (cognitive 28) .sizes/comments.csr/runtime.js:37— walkInternal has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
walkInternal (cognitive 28) .sizes/counter.csr/runtime.js:36— walkInternal has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Duplicated block (14 lines × 2 locations) packages/compiler/src/babel-plugin/index.js:275— packages/compiler/src/babel-plugin/index.js:275 · packages/compiler/src/babel-plugin/parser.js:181 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (14 lines × 2 locations) packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:88— packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:88 · packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:169 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (14 lines × 2 locations) packages/runtime-class/src/translator/index.js:306— packages/runtime-class/src/translator/index.js:306 · packages/runtime-tags/src/translator/visitors/program/index.ts:245 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
X24 · Document value interpolated into markup unescaped· Untrusted text written into markup unescaped · ×3
Untrusted text written into markup unescaped packages/runtime-class/src/runtime/vdom/parse-html.js:5— `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped packages/runtime-class/src/runtime/vdom/parse-html.js:9— `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped packages/runtime-tags/src/dom/parse-html.ts:6— `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
createRendererFunc::renderer (cyclomatic 30) packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:20— createRendererFunc::renderer has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
createRendererFunc::renderer (cyclomatic 19) packages/runtime-class/src/runtime/components/renderer.js:81— createRendererFunc::renderer 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.
(anonymous) (cyclomatic 29) REDACTED:289— (anonymous) has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 294, 307, 314, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
(anonymous) (cyclomatic 29) .sizes/comments.csr/runtime.js:100— (anonymous) has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 105, 118, 125, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
parseMarko::onCloseTagEnd (cyclomatic 22) packages/compiler/src/babel-plugin/parser.js:653— parseMarko::onCloseTagEnd 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.
parseMarko::onOpenTagEnd (cyclomatic 21) packages/compiler/src/babel-plugin/parser.js:551— parseMarko::onOpenTagEnd has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
init (cyclomatic 22) .sizes/comments.ssr/runtime.js:130— init has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 12 function items inside it that branch (initRuntime::curRenders::processResumes, initRuntime::curRenders::applyScopes, initRuntime::curRenders::m, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
init (cyclomatic 22) .sizes/counter.ssr/runtime.js:127— init has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 12 function items inside it that branch (initRuntime::curRenders::processResumes, initRuntime::curRenders::applyScopes, initRuntime::curRenders::m, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
(anonymous) (cognitive 33) REDACTED:289— (anonymous) has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 12, ternaries 6 (8 pts), loops 4 (7 pts), if/else 4, other 2 (nesting depth added 5). None of this is in the body itself: all 33 points belong to 4 function literals inside it that branch (lines 294, 307, 314, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
(anonymous) (cognitive 33) .sizes/comments.csr/runtime.js:100— (anonymous) has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 12, ternaries 6 (8 pts), loops 4 (7 pts), if/else 4, other 2 (nesting depth added 5). None of this is in the body itself: all 33 points belong to 4 function literals inside it that branch (lines 105, 118, 125, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
init (cognitive 31) .sizes/comments.ssr/runtime.js:130— init has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 7 (8 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 8). Most of this is not in the body itself: 5 of the 31 points are its own statements and the rest belongs to 12 function items inside it that branch (initRuntime::curRenders::processResumes, initRuntime::curRenders::applyScopes, initRuntime::curRenders::m, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
init (cognitive 31) .sizes/counter.ssr/runtime.js:127— init has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 7 (8 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 8). Most of this is not in the body itself: 5 of the 31 points are its own statements and the rest belongs to 12 function items inside it that branch (initRuntime::curRenders::processResumes, initRuntime::curRenders::applyScopes, initRuntime::curRenders::m, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
init::initRuntime::curRenders::m (cognitive 24) REDACTED:1051— init::initRuntime::curRenders::m has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (8 pts), loops 3 (6 pts), if/else 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
init::initRuntime::curRenders::processResumes (cognitive 17) REDACTED:1013— init::initRuntime::curRenders::processResumes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 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.
(anonymous) (cognitive 16) REDACTED:110— (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), loops 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
(anonymous) (cognitive 16) packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:17— (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3, boolean chains 1, 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.
Low cohesion: State (LCOM4 6) REDACTED:671— State's methods fall into 6 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 6 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: Sorted (LCOM4 5) packages/runtime-tags/src/translator/util/optional.ts:13— Sorted'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.
Duplicated block (19 lines × 2 locations) packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:72— packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:72 · packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:156 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (19 lines × 2 locations) packages/runtime-tags/src/dom/template.ts:59— packages/runtime-tags/src/dom/template.ts:59 · packages/runtime-tags/src/html/template.ts:65 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (19 lines × 3 locations) packages/runtime-class/src/translator/tag/dynamic-tag.js:17— packages/runtime-class/src/translator/tag/dynamic-tag.js:17 · packages/runtime-class/src/translator/tag/native-tag[html]/index.js:75 · packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:132 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (19 lines × 3 locations) packages/runtime-tags/src/html/attrs.ts:130— packages/runtime-tags/src/html/attrs.ts:130 · packages/runtime-tags/src/html/attrs.ts:176 · packages/runtime-tags/src/html/attrs.ts:196 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (18 lines × 2 locations) packages/runtime-class/src/runtime/components/ComponentDef.js:52— packages/runtime-class/src/runtime/components/ComponentDef.js:52 · packages/runtime-class/src/runtime/components/ServerComponent.js:54 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (18 lines × 2 locations) packages/runtime-class/src/translator/util/get-component-files.js:70— packages/runtime-class/src/translator/util/get-component-files.js:70 · packages/runtime-tags/src/translator/util/get-style-file.ts:38 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (17 lines × 2 locations) packages/runtime-class/src/runtime/helpers/load-tag-event-trigger.js:3— packages/runtime-class/src/runtime/helpers/load-tag-event-trigger.js:3 · packages/runtime-class/src/runtime/helpers/load-tag-visible-trigger.js:3 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (17 lines × 2 locations) packages/runtime-tags/src/common/for.ts:30— packages/runtime-tags/src/common/for.ts:30 · packages/runtime-tags/src/common/for.ts:48 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2 locations) packages/runtime-class/src/runtime/html/AsyncStream.js:591— packages/runtime-class/src/runtime/html/AsyncStream.js:591 · packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:351 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (15 lines × 2 locations) packages/runtime-tags/src/html/serializer.ts:1683— packages/runtime-tags/src/html/serializer.ts:1683 · packages/runtime-tags/src/html/serializer.ts:1756 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Dead file (~1 LoC) packages/runtime-class/src/runtime/components/legacy/defineWidget-legacy.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/runtime-class/src/runtime/components/legacy/defineComponent-legacy.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~1 LoC) packages/runtime-class/src/runtime/components/legacy/index.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/runtime-class/legacy-components.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
parser.parseMarko (cyclomatic 98) packages/compiler/src/babel-plugin/parser.js:48— parser.parseMarko has cyclomatic complexity 98 (threshold 15). Of this number, 75 points are the body's own statements and 23 belong to 6 function items inside it that branch. 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.
index.morphdom::morphChildren (cyclomatic 88) packages/runtime-class/src/runtime/vdom/morphdom/index.js:149— index.morphdom::morphChildren has cyclomatic complexity 88 (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.
computeNode (cyclomatic 82) REDACTED:4— computeNode has cyclomatic complexity 82 (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.
runtime-html.p (cyclomatic 56) packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js:18— runtime-html.p has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 5 of the 56 points are its own statements and the rest belongs to 12 function items inside it that branch (flushScripts, a function literal at line 187, a function literal at line 202, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
known-tag.writeAttrsToSignals (cyclomatic 56) packages/runtime-tags/src/translator/util/known-tag.ts:1101— known-tag.writeAttrsToSignals has cyclomatic complexity 56 (threshold 15). Of this number, 53 points are the body's own statements and 3 belong to 2 function items inside it that branch. 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.
known-tag.analyzeAttrs (cyclomatic 53) packages/runtime-tags/src/translator/util/known-tag.ts:614— known-tag.analyzeAttrs has cyclomatic complexity 53 (threshold 15). Of this number, 51 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
signals.writeHTMLResumeStatements (cyclomatic 51) packages/runtime-tags/src/translator/util/signals.ts:1238— signals.writeHTMLResumeStatements has cyclomatic complexity 51 (threshold 15). Of this number, 32 points are the body's own statements and 19 belong to 6 function items inside it that branch. 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.
MarkoTag (cyclomatic 51) packages/runtime-class/src/translator/index.js:100— MarkoTag has cyclomatic complexity 51 (threshold 15). Of this number, 45 points are the body's own statements and 6 belong to 2 function items inside it that branch. 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.
index.default (cyclomatic 45) packages/runtime-class/src/translator/tag/native-tag[html]/index.js:22— index.default has cyclomatic complexity 45 (threshold 15). Of this number, 43 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
(anonymous) (cyclomatic 45) packages/runtime-class/src/translator/tag/native-tag[html]/index.js:22— (anonymous) has cyclomatic complexity 45 (threshold 15). Of this number, 43 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
style-interpolation.checkStyleInterpolations (cyclomatic 43) packages/runtime-tags/src/translator/util/style-interpolation.ts:6— style-interpolation.checkStyleInterpolations has cyclomatic complexity 43 (threshold 15). Of this number, 38 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
control-flow._dynamic_tag (cyclomatic 40) REDACTED:612— control-flow._dynamic_tag has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 4 of the 40 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 694, createTagBranch). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
renderer-legacy.createRendererFunc (cyclomatic 38) packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:14— renderer-legacy.createRendererFunc has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 20, 150). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
tag-name-type.analyzeExpressionTagName (cyclomatic 38) packages/runtime-tags/src/translator/util/tag-name-type.ts:134— tag-name-type.analyzeExpressionTagName has cyclomatic complexity 38 (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.
signals.getSignal (cyclomatic 37) packages/runtime-tags/src/translator/util/signals.ts:296— signals.getSignal has cyclomatic complexity 37 (threshold 15). Of this number, 29 points are the body's own statements and 8 belong to 2 function literals inside it that branch. 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.
index.getMarkoFile (cyclomatic 36) packages/compiler/src/babel-plugin/index.js:169— index.getMarkoFile has cyclomatic complexity 36 (threshold 15). Of this number, 32 points are the body's own statements and 4 belong to 2 function literals inside it that branch. 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.
runtime-dom.p (cyclomatic 36) packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js:37— runtime-dom.p has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 5 of the 36 points are its own statements and the rest belongs to 10 function items inside it that branch (create5to6Renderer, renderAndMorph, a function literal at line 66, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
defineRenderer-legacy.defineRenderer (cyclomatic 35) packages/runtime-class/src/runtime/components/legacy/defineRenderer-legacy.js:11— defineRenderer-legacy.defineRenderer has cyclomatic complexity 35 (threshold 15). Of this number, 21 points are the body's own statements and 14 belong to one function literal inside it that branches. 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.
Chunk.flush (cyclomatic 34) REDACTED:1326— Chunk.flush 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.
dynamic-tag.dynamicTag (cyclomatic 33) packages/runtime-class/src/runtime/helpers/dynamic-tag.js:24— dynamic-tag.dynamicTag has cyclomatic complexity 33 (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.
(anonymous) (cyclomatic 33) REDACTED:191— (anonymous) has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 2 of the 33 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 224, createTagBranch, createTagBranch::T). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
signals.replaceAssignedNode (cyclomatic 32) packages/runtime-tags/src/translator/util/signals.ts:1556— signals.replaceAssignedNode has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TagLoader."*" (cyclomatic 31) packages/compiler/src/taglib/loader/loadTagFromProps.js:110— TagLoader."*" has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
index.findDynamicTagTypes (cyclomatic 31) packages/runtime-class/src/translator/tag/index.js:161— index.findDynamicTagTypes has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
signals.buildSignalFn (cyclomatic 31) packages/runtime-tags/src/translator/util/signals.ts:581— signals.buildSignalFn has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
* (cyclomatic 31) packages/compiler/src/taglib/loader/loadTagFromProps.js:110— * has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
util.getAttrs (cyclomatic 30) packages/runtime-class/src/translator/tag/util.js:12— util.getAttrs has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
control-flow.loop (cyclomatic 30) REDACTED:889— control-flow.loop has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 904, 925, 893, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
attrs._attrs (cyclomatic 30) packages/runtime-tags/src/html/attrs.ts:305— attrs._attrs has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
exit (cyclomatic 30) packages/runtime-class/src/translator/index.js:381— exit has cyclomatic complexity 30 (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.
walker.walkInternal (cyclomatic 28) packages/runtime-tags/src/dom/walker.ts:23— walker.walkInternal has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
resume.init::initRuntime (cyclomatic 28) packages/runtime-tags/src/dom/resume.ts:142— resume.init::initRuntime has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
dynamic-tag._dynamic_tag::renderNative (cyclomatic 28) packages/runtime-tags/src/html/dynamic-tag.ts:73— dynamic-tag._dynamic_tag::renderNative has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pre-analyze.buildChangeHandlerAttr (cyclomatic 28) packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts:213— pre-analyze.buildChangeHandlerAttr has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_await_promise (cyclomatic 28) REDACTED:1764— _await_promise has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 10 function items inside it that branch (awaitPromise, a function literal at line 1850, a function literal at line 1814, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
VElement.VElement.___morphAttrs (cyclomatic 27) REDACTED:264— VElement.VElement.___morphAttrs has cyclomatic complexity 27 (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.
serializer.toObjectKey (cyclomatic 27) packages/runtime-tags/src/html/serializer.ts:2263— serializer.toObjectKey has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: serializer.writeUnknownObject (cyclomatic 62) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
evaluate.isImpure (cyclomatic 27) packages/runtime-tags/src/translator/util/evaluate.ts:46— evaluate.isImpure has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: evaluate.isNullableExpr (cyclomatic 44) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
defineRenderer::renderer (cyclomatic 27) packages/runtime-class/src/runtime/components/legacy/defineRenderer-legacy.js:46— defineRenderer::renderer has cyclomatic complexity 27 (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.
control-flow.tryBoundary (cyclomatic 26) packages/runtime-tags/src/html/control-flow.ts:630— control-flow.tryBoundary has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 678). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
serializer.writeMap (cyclomatic 25) packages/runtime-tags/src/html/serializer.ts:1225— serializer.writeMap has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: serializer.writeUnknownObject (cyclomatic 62) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
signals.writeSignals::writeSignal (cyclomatic 25) packages/runtime-tags/src/translator/util/signals.ts:972— signals.writeSignals::writeSignal has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
structure.resolveStructure (cyclomatic 25) packages/runtime-tags/src/translator/util/structure.ts:175— structure.resolveStructure has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
renderable.default (cyclomatic 24) packages/runtime-class/src/runtime/renderable.js:38— renderable.default has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 155, 47, 72, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ComponentDef.ComponentDef.___deserialize (cyclomatic 24) packages/runtime-class/src/runtime/components/ComponentDef.js:94— ComponentDef.ComponentDef.___deserialize has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
renderer.createRendererFunc (cyclomatic 24) packages/runtime-class/src/runtime/components/renderer.js:58— renderer.createRendererFunc has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 81). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
tag-name-type.analyzeTagNameType (cyclomatic 24) packages/runtime-tags/src/translator/util/tag-name-type.ts:59— tag-name-type.analyzeTagNameType has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
init::initRuntime::curRenders::m (cyclomatic 24) REDACTED:1051— init::initRuntime::curRenders::m has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
visit (cyclomatic 24) packages/runtime-class/src/translator/util/add-dependencies.js:101— visit has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
exports (cyclomatic 24) packages/runtime-class/src/runtime/renderable.js:38— exports has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to 8 function items inside it that branch (render, renderToString, renderSync, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
index.findWithMeta (cyclomatic 23) packages/compiler/src/taglib/finder/index.js:59— index.findWithMeta has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 2 function items inside it that branch. 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.
custom-tag.default (cyclomatic 22) packages/runtime-class/src/translator/tag/custom-tag.js:19— custom-tag.default 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.
serializer.writeDeferred (cyclomatic 22) packages/runtime-tags/src/html/serializer.ts:596— serializer.writeDeferred 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. This is NOT this file's highest cyclomatic complexity: serializer.writeUnknownObject (cyclomatic 62) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
references.trackReferencesForBinding (cyclomatic 22) packages/runtime-tags/src/translator/util/references.ts:402— references.trackReferencesForBinding 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.
references.createBindingsAndTrackReferences (cyclomatic 22) packages/runtime-tags/src/translator/util/references.ts:606— references.createBindingsAndTrackReferences 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.
translate-attrs.translateAttrs (cyclomatic 22) packages/runtime-tags/src/translator/util/translate-attrs.ts:40— translate-attrs.translateAttrs 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.
placeholder.translateExit (cyclomatic 22) packages/runtime-tags/src/translator/visitors/placeholder.ts:107— placeholder.translateExit 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.
(anonymous) (cyclomatic 22) packages/runtime-class/src/translator/tag/custom-tag.js:19— (anonymous) has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
reorderer-renderer.default (cyclomatic 21) packages/runtime-class/src/core-tags/core/await/reorderer-renderer.js:5— reorderer-renderer.default has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 84, 61, 36, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
finalize-references.allocateIds (cyclomatic 21) packages/runtime-tags/src/translator/util/finalize-references.ts:349— finalize-references.allocateIds has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 353, 415, 381, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
pre-analyze.normalizeTag (cyclomatic 21) packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts:115— pre-analyze.normalizeTag has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
exports (cyclomatic 21) packages/runtime-class/src/core-tags/core/await/reorderer-renderer.js:5— exports has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch ((anonymous)::handleAwait::writeResult, a function literal at line 61, a function literal at line 36, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
load-import.getLoadImportConfig (cyclomatic 20) packages/runtime-class/src/translator/util/load-import.js:161— load-import.getLoadImportConfig 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.
tag-import.getLoadImportConfig (cyclomatic 20) packages/runtime-tags/src/translator/util/tag-import.ts:84— tag-import.getLoadImportConfig 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.
style.createStyleDependency (cyclomatic 20) packages/runtime-tags/src/translator/core/style.ts:324— style.createStyleDependency 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.
TaglibLookup.getAttribute (cyclomatic 19) packages/compiler/src/taglib/lookup/index.js:207— TaglibLookup.getAttribute has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (findAttributeForTag, tryAttribute). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
attributes.default (cyclomatic 19) packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:11— attributes.default 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.
add-dependencies.tryGetTemplateImports (cyclomatic 19) packages/runtime-class/src/translator/util/add-dependencies.js:280— add-dependencies.tryGetTemplateImports has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 299, addTemplateImport). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
renderer.awaitTag (cyclomatic 19) packages/runtime-class/src/core-tags/core/await/renderer.js:84— renderer.awaitTag has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body's own statements and 5 belong to 2 function items inside it that branch. 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.
index.attachDepsAndComponentsToTemplate (cyclomatic 19) packages/runtime-class/src/runtime/components/legacy/dependencies/index.js:31— index.attachDepsAndComponentsToTemplate has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body's own statements and 6 belong to 2 function literals inside it that branch. 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.
control-flow._show (cyclomatic 19) REDACTED:509— control-flow._show has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 524). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
finalize-references.resolveReferencedBindings (cyclomatic 19) packages/runtime-tags/src/translator/util/finalize-references.ts:824— finalize-references.resolveReferencedBindings has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 838). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
nested-attribute-tags.analyzeAttributeTags (cyclomatic 19) packages/runtime-tags/src/translator/util/nested-attribute-tags.ts:53— nested-attribute-tags.analyzeAttributeTags 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.
(anonymous) (cyclomatic 19) packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:11— (anonymous) 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.
serializer.writeRequest (cyclomatic 18) packages/runtime-tags/src/html/serializer.ts:1660— serializer.writeRequest has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: serializer.writeUnknownObject (cyclomatic 62) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
optional.differenceSorted (cyclomatic 18) packages/runtime-tags/src/translator/util/optional.ts:668— optional.differenceSorted has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
module-registrations.resolveRegisteredExport (cyclomatic 18) packages/runtime-tags/src/translator/util/module-registrations.ts:197— module-registrations.resolveRegisteredExport has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
solve-reasons.computeBindingReaders (cyclomatic 18) packages/runtime-tags/src/translator/util/solve-reasons.ts:423— solve-reasons.computeBindingReaders has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
translate-var.translateVar (cyclomatic 18) packages/runtime-tags/src/translator/util/translate-var.ts:22— translate-var.translateVar has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 63, 42). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
finalize-references.resolveReads (cyclomatic 18) packages/runtime-tags/src/translator/util/finalize-references.ts:162— finalize-references.resolveReads has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
finalize-references.pruneBinding (cyclomatic 18) packages/runtime-tags/src/translator/util/finalize-references.ts:671— finalize-references.pruneBinding has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
native-tag.getRelatedControllable (cyclomatic 18) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:1211— native-tag.getRelatedControllable has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
native-tag.addDelimitedAttrItem (cyclomatic 18) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:2109— native-tag.addDelimitedAttrItem has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
(anonymous) (cyclomatic 18) REDACTED:155— (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 160). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
scanTagsDir.scanTagsDir (cyclomatic 17) packages/compiler/src/taglib/loader/scanTagsDir.js:129— scanTagsDir.scanTagsDir 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.
attributes.default (cyclomatic 17) packages/runtime-class/src/translator/tag/native-tag[vdom]/attributes.js:6— attributes.default 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.
serializer.throwUnserializable (cyclomatic 17) packages/runtime-tags/src/html/serializer.ts:2088— serializer.throwUnserializable has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: serializer.writeUnknownObject (cyclomatic 62) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
serializer.quote (cyclomatic 17) packages/runtime-tags/src/html/serializer.ts:2334— serializer.quote has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: serializer.writeUnknownObject (cyclomatic 62) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
write-guard.buildGroupMask (cyclomatic 17) packages/runtime-tags/src/translator/util/write-guard.ts:73— write-guard.buildGroupMask 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.
signals.signalHasWork (cyclomatic 17) packages/runtime-tags/src/translator/util/signals.ts:481— signals.signalHasWork has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
if.flattenTextOnlyConditional (cyclomatic 17) packages/runtime-tags/src/translator/core/if.ts:278— if.flattenTextOnlyConditional 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.
D1 · Cyclomatic Complexity· enter (cyclomatic 17) · ×1
enter (cyclomatic 17) packages/runtime-class/src/translator/tag/index.js:27— enter 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.
index.tagArguments (cyclomatic 16) packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:107— index.tagArguments has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
control-flow._await_promise::awaitPromise (cyclomatic 16) REDACTED:85— control-flow._await_promise::awaitPromise has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
serializer.writeGenerator (cyclomatic 16) packages/runtime-tags/src/html/serializer.ts:1865— serializer.writeGenerator has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: serializer.writeUnknownObject (cyclomatic 62) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
writer.flushSerializer (cyclomatic 16) REDACTED:1621— writer.flushSerializer has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
references.addReadToExpression (cyclomatic 16) packages/runtime-tags/src/translator/util/references.ts:1182— references.addReadToExpression has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
read-replacement.getDOMReadBase (cyclomatic 16) packages/runtime-tags/src/translator/util/read-replacement.ts:69— read-replacement.getDOMReadBase has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
finalize-references.resolveIntersectionSource (cyclomatic 16) packages/runtime-tags/src/translator/util/finalize-references.ts:505— finalize-references.resolveIntersectionSource has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
native-tag.assertOptionInSelectWithValue (cyclomatic 16) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:1594— native-tag.assertOptionInSelectWithValue has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
reorderKeyed (cyclomatic 16) REDACTED:2019— reorderKeyed has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
exit (cyclomatic 16) packages/runtime-class/src/translator/tag/index.js:92— exit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
index.morphdom::morphChildren (cognitive 303) packages/runtime-class/src/runtime/vdom/morphdom/index.js:149— index.morphdom::morphChildren has cognitive complexity 303 (threshold 15). Drivers by points: if/else 71 (265 pts), boolean chains 23, loops 4 (13 pts), ternaries 1 (2 pts) (nesting depth added 204). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
parser.parseMarko (cognitive 136) packages/compiler/src/babel-plugin/parser.js:48— parser.parseMarko has cognitive complexity 136 (threshold 15). Drivers by points: if/else 60 (99 pts), boolean chains 17, loops 6 (11 pts), ternaries 4 (7 pts), match/switch 2 (nesting depth added 47). Of this number, 112 points are the body's own statements and 24 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
known-tag.analyzeAttrs (cognitive 130) packages/runtime-tags/src/translator/util/known-tag.ts:614— known-tag.analyzeAttrs has cognitive complexity 130 (threshold 15). Drivers by points: if/else 45 (91 pts), loops 10 (27 pts), boolean chains 9, ternaries 1 (3 pts) (nesting depth added 65). Of this number, 124 points are the body's own statements and 6 belong to one function item inside it that branches. 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.
known-tag.writeAttrsToSignals (cognitive 124) packages/runtime-tags/src/translator/util/known-tag.ts:1101— known-tag.writeAttrsToSignals has cognitive complexity 124 (threshold 15). Drivers by points: if/else 33 (70 pts), loops 10 (23 pts), boolean chains 13, ternaries 3 (11 pts), match/switch 1 (7 pts) (nesting depth added 64). Of this number, 118 points are the body's own statements and 6 belong to 2 function items inside it that branch. 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.
computeNode (cognitive 102) REDACTED:4— computeNode has cognitive complexity 102 (threshold 15). Drivers by points: if/else 23 (64 pts), match/switch 7 (17 pts), loops 4 (11 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (2 pts), other 1 (nesting depth added 61). 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.
dynamicTag (cognitive 86) packages/runtime-class/src/runtime/helpers/dynamic-tag.js:24— dynamicTag has cognitive complexity 86 (threshold 15). Drivers by points: if/else 22 (59 pts), ternaries 4 (17 pts), boolean chains 10 (nesting depth added 50). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
style-interpolation.checkStyleInterpolations (cognitive 80) packages/runtime-tags/src/translator/util/style-interpolation.ts:6— style-interpolation.checkStyleInterpolations has cognitive complexity 80 (threshold 15). Drivers by points: if/else 23 (60 pts), boolean chains 11, match/switch 1 (4 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 42). Of this number, 74 points are the body's own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
signals.writeHTMLResumeStatements (cognitive 78) packages/runtime-tags/src/translator/util/signals.ts:1238— signals.writeHTMLResumeStatements has cognitive complexity 78 (threshold 15). Drivers by points: if/else 23 (39 pts), ternaries 7 (18 pts), boolean chains 14, loops 4 (7 pts) (nesting depth added 30). Of this number, 48 points are the body's own statements and 30 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tag-name-type.analyzeExpressionTagName (cognitive 74) packages/runtime-tags/src/translator/util/tag-name-type.ts:134— tag-name-type.analyzeExpressionTagName has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (65 pts), boolean chains 8, loops 1 (nesting depth added 37). 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.
index.findDynamicTagTypes (cognitive 72) packages/runtime-class/src/translator/tag/index.js:161— index.findDynamicTagTypes has cognitive complexity 72 (threshold 15). Drivers by points: if/else 20 (57 pts), loops 2 (7 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 43). 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.
p (cognitive 70) packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js:18— p has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 20, ternaries 7 (14 pts), loops 1 (2 pts) (nesting depth added 17). Most of this is not in the body itself: 1 of the 70 points is its own statement and the rest belongs to 17 function items inside it that branch (a function literal at line 202, flushScripts, getRenderer, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
MarkoTag (cognitive 69) packages/runtime-class/src/translator/index.js:100— MarkoTag has cognitive complexity 69 (threshold 15). Drivers by points: if/else 24 (47 pts), boolean chains 19, loops 2 (3 pts) (nesting depth added 24). Of this number, 59 points are the body's own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
control-flow._dynamic_tag (cognitive 65) REDACTED:612— control-flow._dynamic_tag has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (32 pts), ternaries 6 (23 pts), boolean chains 10 (nesting depth added 30). Most of this is not in the body itself: 2 of the 65 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 694, createTagBranch). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
index.default (cognitive 63) packages/runtime-class/src/translator/tag/native-tag[html]/index.js:22— index.default has cognitive complexity 63 (threshold 15). Drivers by points: if/else 26 (45 pts), boolean chains 13, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 21). Of this number, 59 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pre-analyze.buildChangeHandlerAttr (cognitive 63) packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts:213— pre-analyze.buildChangeHandlerAttr has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 8 (29 pts), boolean chains 5 (nesting depth added 35). 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.
(anonymous) (cognitive 63) packages/runtime-class/src/translator/tag/native-tag[html]/index.js:22— (anonymous) has cognitive complexity 63 (threshold 15). Drivers by points: if/else 26 (45 pts), boolean chains 12, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 21). Of this number, 59 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
index.getMarkoFile (cognitive 62) packages/compiler/src/babel-plugin/index.js:169— index.getMarkoFile has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (39 pts), loops 6 (10 pts), boolean chains 7, ternaries 1 (4 pts), error handling 1 (2 pts) (nesting depth added 26). Of this number, 54 points are the body's own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
signals.replaceAssignedNode (cognitive 61) packages/runtime-tags/src/translator/util/signals.ts:1556— signals.replaceAssignedNode has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (38 pts), ternaries 3 (12 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 36). Of this number, 46 points are the body's own statements and 15 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
structure.resolveStructure (cognitive 59) packages/runtime-tags/src/translator/util/structure.ts:175— structure.resolveStructure has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (35 pts), ternaries 4 (17 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
finalize-references.resolveReads (cognitive 59) packages/runtime-tags/src/translator/util/finalize-references.ts:162— finalize-references.resolveReads has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (40 pts), ternaries 2 (12 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 41). Of this number, 54 points are the body's own statements and 5 belong to one function literal inside it that branches. 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.
VElement.VElement.___morphAttrs (cognitive 57) REDACTED:264— VElement.VElement.___morphAttrs has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (49 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderer-legacy.createRendererFunc (cognitive 54) packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js:14— renderer-legacy.createRendererFunc has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (43 pts), boolean chains 11 (nesting depth added 18). None of this is in the body itself: all 54 points belong to 2 function literals inside it that branch (lines 20, 150). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Chunk.flush (cognitive 54) REDACTED:1326— Chunk.flush has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 4 (9 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
nested-attribute-tags.analyzeAttributeTags (cognitive 54) packages/runtime-tags/src/translator/util/nested-attribute-tags.ts:53— nested-attribute-tags.analyzeAttributeTags has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 5 (14 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 35). 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.
TagLoader."*" (cognitive 53) packages/compiler/src/taglib/loader/loadTagFromProps.js:110— TagLoader."*" has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
(anonymous) (cognitive 53) REDACTED:191— (anonymous) has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 10 (28 pts), boolean chains 14, if/else 8 (11 pts) (nesting depth added 21). Most of this is not in the body itself: 1 of the 53 points is its own statement and the rest belongs to 3 function items inside it that branch (a function literal at line 224, createTagBranch, createTagBranch::T). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
* (cognitive 53) packages/compiler/src/taglib/loader/loadTagFromProps.js:110— * has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderer.createRendererFunc (cognitive 51) packages/runtime-class/src/runtime/components/renderer.js:58— renderer.createRendererFunc has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 5, ternaries 1 (5 pts) (nesting depth added 25). Most of this is not in the body itself: 6 of the 51 points are its own statements and the rest belongs to one function literal inside it that branches (line 81). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
index.findWithMeta (cognitive 50) packages/compiler/src/taglib/finder/index.js:59— index.findWithMeta has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 28). Of this number, 44 points are the body's own statements and 6 belong to 2 function items inside it that branch. 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.
load-import.getLoadImportConfig (cognitive 49) packages/runtime-class/src/translator/util/load-import.js:161— load-import.getLoadImportConfig has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 3 (9 pts), ternaries 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tag-import.getLoadImportConfig (cognitive 49) packages/runtime-tags/src/translator/util/tag-import.ts:84— tag-import.getLoadImportConfig has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 3 (9 pts), ternaries 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
translate-attrs.translateAttrs (cognitive 49) packages/runtime-tags/src/translator/util/translate-attrs.ts:40— translate-attrs.translateAttrs has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (40 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 26). 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.
visit (cognitive 48) packages/runtime-class/src/translator/util/add-dependencies.js:101— visit has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 5 (12 pts), boolean chains 3 (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.
placeholder.translateExit (cognitive 47) packages/runtime-tags/src/translator/visitors/placeholder.ts:107— placeholder.translateExit has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 9 (28 pts), if/else 10 (14 pts), boolean chains 5 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
getAttrs (cognitive 47) packages/runtime-class/src/translator/tag/util.js:12— getAttrs has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 8, ternaries 4 (5 pts), loops 1 (nesting depth added 19). Of this number, 43 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
serializer.throwUnserializable (cognitive 46) packages/runtime-tags/src/html/serializer.ts:2088— serializer.throwUnserializable has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (38 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
references.createBindingsAndTrackReferences (cognitive 46) packages/runtime-tags/src/translator/util/references.ts:606— references.createBindingsAndTrackReferences has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (37 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 27). 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.
signals.buildSignalFn (cognitive 46) packages/runtime-tags/src/translator/util/signals.ts:581— signals.buildSignalFn has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 7, loops 3 (5 pts), ternaries 2 (5 pts) (nesting depth added 19). Of this number, 40 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
walker.walkInternal (cognitive 44) packages/runtime-tags/src/dom/walker.ts:23— walker.walkInternal has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (15 pts), boolean chains 6 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dynamic-tag._dynamic_tag::renderNative (cognitive 44) packages/runtime-tags/src/html/dynamic-tag.ts:73— dynamic-tag._dynamic_tag::renderNative has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 5 (16 pts), boolean chains 9 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (dynamic-tag._dynamic_tag) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
native-tag.assertOptionInSelectWithValue (cognitive 44) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:1594— native-tag.assertOptionInSelectWithValue has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
serializer.writeMap (cognitive 43) packages/runtime-tags/src/html/serializer.ts:1225— serializer.writeMap has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 10, loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
attrs._attrs (cognitive 42) packages/runtime-tags/src/html/attrs.ts:305— attrs._attrs has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 7, match/switch 2 (3 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runtime-dom.p (cognitive 41) packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js:37— runtime-dom.p has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 11, loops 3 (5 pts), ternaries 4 (5 pts) (nesting depth added 10). Most of this is not in the body itself: 4 of the 41 points are its own statements and the rest belongs to 10 function items inside it that branch (renderAndMorph, create5to6Renderer, a function literal at line 66, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
serializer.writeDeferred (cognitive 40) packages/runtime-tags/src/html/serializer.ts:596— serializer.writeDeferred has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (8 pts), ternaries 3 (6 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.
control-flow.loop (cognitive 39) REDACTED:889— control-flow.loop has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 4 (7 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 11). None of this is in the body itself: all 39 points belong to 4 function literals inside it that branch (lines 904, 925, 893, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
optional.differenceSorted (cognitive 39) packages/runtime-tags/src/translator/util/optional.ts:668— optional.differenceSorted has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 6 (16 pts), boolean chains 2, ternaries 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scanTagsDir.scanTagsDir (cognitive 38) packages/compiler/src/taglib/loader/scanTagsDir.js:129— scanTagsDir.scanTagsDir has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
attributes.default (cognitive 38) packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:11— attributes.default has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 4 (7 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
control-flow.reorderKeyed (cognitive 38) REDACTED:1085— control-flow.reorderKeyed has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Chunk.renderPlaceholders (cognitive 38) REDACTED:1052— Chunk.renderPlaceholders has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
optional.filter (cognitive 38) packages/runtime-tags/src/translator/util/optional.ts:301— optional.filter has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 3 (15 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
references.trackReferencesForBinding (cognitive 38) packages/runtime-tags/src/translator/util/references.ts:402— references.trackReferencesForBinding has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 5, ternaries 1 (3 pts), loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
(anonymous) (cognitive 38) packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:11— (anonymous) has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 4 (7 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
finalize-references.resolveReferencedBindings (cognitive 37) packages/runtime-tags/src/translator/util/finalize-references.ts:824— finalize-references.resolveReferencedBindings has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 3 (nesting depth added 17). Most of this is not in the body itself: 3 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 838). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
TaglibLoader.taglibImports (cognitive 36) packages/compiler/src/taglib/loader/loadTaglibFromProps.js:241— TaglibLoader.taglibImports has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
serializer.toObjectKey (cognitive 36) packages/runtime-tags/src/html/serializer.ts:2263— serializer.toObjectKey has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 10, loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
style.createStyleDependency (cognitive 35) packages/runtime-tags/src/translator/core/style.ts:324— style.createStyleDependency has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, ternaries 3 (4 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pre-analyze.normalizeTag (cognitive 34) packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts:115— pre-analyze.normalizeTag has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
(anonymous) (cognitive 34) packages/runtime-class/src/translator/tag/custom-tag.js:19— (anonymous) has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (21 pts), ternaries 3 (7 pts), boolean chains 6 (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.
defineRenderer::renderer (cognitive 34) packages/runtime-class/src/runtime/components/legacy/defineRenderer-legacy.js:46— defineRenderer::renderer has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 12, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
attributes.default (cognitive 33) packages/runtime-class/src/translator/tag/native-tag[vdom]/attributes.js:6— attributes.default has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 2 (6 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
signals.getSignal (cognitive 33) packages/runtime-tags/src/translator/util/signals.ts:296— signals.getSignal has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 9, ternaries 1 (2 pts) (nesting depth added 11). Of this number, 27 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_await_promise (cognitive 33) REDACTED:1764— _await_promise has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (10 pts), ternaries 6 (9 pts) (nesting depth added 6). None of this is in the body itself: all 33 points belong to 10 function items inside it that branch (awaitPromise, a function literal at line 1814, a function literal at line 1850, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
___deserialize (cognitive 33) packages/runtime-class/src/runtime/components/ComponentDef.js:94— ___deserialize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 9, ternaries 3 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
attribute-tag.analyzeAttributeTags (cognitive 32) packages/runtime-class/src/translator/tag/attribute-tag.js:22— attribute-tag.analyzeAttributeTags has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
custom-tag.default (cognitive 32) packages/runtime-class/src/translator/tag/custom-tag.js:19— custom-tag.default has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 7, ternaries 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.
property-handlers.invokeHandlers (cognitive 31) packages/compiler/src/taglib/loader/property-handlers.js:11— property-handlers.invokeHandlers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (26 pts), error handling 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 16). Of this number, 26 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
writer.flushSerializer (cognitive 31) REDACTED:1621— writer.flushSerializer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (5 pts), boolean chains 4 (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.
add-dependencies.tryGetTemplateImports (cognitive 30) packages/runtime-class/src/translator/util/add-dependencies.js:280— add-dependencies.tryGetTemplateImports has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (3 pts) (nesting depth added 15). Of this number, 15 points are the body's own statements and 15 belong to 2 function items inside it that branch. 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.
finalize-references.allocateIds (cognitive 30) packages/runtime-tags/src/translator/util/finalize-references.ts:349— finalize-references.allocateIds has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (9 pts), loops 5 (7 pts), boolean chains 4 (nesting depth added 10). None of this is in the body itself: all 30 points belong to 5 function literals inside it that branch (lines 353, 415, 381, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
exit (cognitive 30) packages/runtime-class/src/translator/index.js:381— exit has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, ternaries 8 (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.
addBrowserImports (cognitive 30) packages/runtime-class/src/translator/util/add-dependencies.js:211— addBrowserImports has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), ternaries 1 (5 pts), boolean chains 3, loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
writer.getFilteredGlobals (cognitive 29) REDACTED:1704— writer.getFilteredGlobals has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
tag-name-type.analyzeTagNameType (cognitive 29) packages/runtime-tags/src/translator/util/tag-name-type.ts:59— tag-name-type.analyzeTagNameType has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 9, ternaries 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.
getTemplateId (cognitive 29) packages/compiler/src/babel-utils/tags.js:312— getTemplateId has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 1 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
exports (cognitive 29) packages/runtime-class/src/core-tags/core/await/reorderer-renderer.js:5— exports has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 5 (11 pts), boolean chains 3 (nesting depth added 8). Most of this is not in the body itself: 4 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch ((anonymous)::handleAwait::writeResult, a function literal at line 61, (anonymous)::handleAwait, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
controllable._attr_input_checkedValue_script (cognitive 28) packages/runtime-tags/src/dom/controllable.ts:148— controllable._attr_input_checkedValue_script has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 14). Most of this is not in the body itself: 5 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 164). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
params-tree.exposeParamsTree (cognitive 28) packages/runtime-tags/src/translator/util/params-tree.ts:23— params-tree.exposeParamsTree has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 14). Of this number, 24 points are the body's own statements and 4 belong to one function literal inside it that branches. 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.
style-value.styleHelper (cognitive 27) packages/runtime-class/src/runtime/helpers/style-value.js:8— style-value.styleHelper has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
resume.init::initRuntime (cognitive 27) packages/runtime-tags/src/dom/resume.ts:142— resume.init::initRuntime has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 27. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Chunk.flushReadyScripts (cognitive 27) REDACTED:1261— Chunk.flushReadyScripts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
translate-var.translateVar (cognitive 27) packages/runtime-tags/src/translator/util/translate-var.ts:22— translate-var.translateVar has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 3 (nesting depth added 8). Most of this is not in the body itself: 7 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 63, 42). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
addDelegatedEventHandlerToHost (cognitive 27) packages/runtime-class/src/runtime/components/event-delegation.js:75— addDelegatedEventHandlerToHost has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (6 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 81, (anonymous)::stopPropagation). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity· enter (cognitive 27) · ×1
enter (cognitive 27) packages/runtime-class/src/translator/tag/attribute/index.js:15— enter has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
TaglibLookup.getAttribute::findAttributeForTag (cognitive 26) packages/compiler/src/taglib/lookup/index.js:230— TaglibLookup.getAttribute::findAttributeForTag has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
signals.traverse (cognitive 26) packages/runtime-tags/src/dom/signals.ts:434— signals.traverse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (7 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
references.trackReference (cognitive 26) packages/runtime-tags/src/translator/util/references.ts:822— references.trackReference has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
finalize-references.resolveBindings (cognitive 26) packages/runtime-tags/src/translator/util/finalize-references.ts:249— finalize-references.resolveBindings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native-tag.addDelimitedAttrItem (cognitive 26) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:2109— native-tag.addDelimitedAttrItem has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reorderKeyed (cognitive 26) REDACTED:2019— reorderKeyed has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (8 pts), ternaries 2 (7 pts), if/else 3 (6 pts), boolean chains 4, other 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
translate-html-comment.enter (cognitive 25) packages/runtime-class/src/translator/taglib/core/translate-html-comment.js:13— translate-html-comment.enter has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (8 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
for-each-identifier.forEachIdentifierPath (cognitive 25) packages/runtime-tags/src/translator/util/for-each-identifier.ts:46— for-each-identifier.forEachIdentifierPath has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
module-registrations.resolveRegisteredExport (cognitive 25) packages/runtime-tags/src/translator/util/module-registrations.ts:197— module-registrations.resolveRegisteredExport has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
awaitTag (cognitive 25) packages/runtime-class/src/core-tags/core/await/renderer.js:84— awaitTag has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 4). Of this number, 17 points are the body's own statements and 8 belong to 3 function items inside it that branch. 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.
renderContents (cognitive 25) packages/runtime-class/src/core-tags/core/await/renderer.js:228— renderContents has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 4 (10 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Sorted.intersects (cognitive 24) packages/runtime-tags/src/translator/util/optional.ts:177— Sorted.intersects has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), boolean chains 3, ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_attr_input_checkedValue_script (cognitive 24) REDACTED:1489— _attr_input_checkedValue_script has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (13 pts), boolean chains 4, if/else 3 (4 pts), loops 1 (3 pts) (nesting depth added 11). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 1496). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
markoc.walk (cognitive 23) packages/runtime-class/bin/markoc.js:209— markoc.walk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 2, loops 1 (nesting depth added 6). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 255, 226, 245). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
renderable.default (cognitive 23) packages/runtime-class/src/runtime/renderable.js:38— renderable.default has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 10, match/switch 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 155, 47, 72, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
serializer.writeGenerator (cognitive 23) packages/runtime-tags/src/html/serializer.ts:1865— serializer.writeGenerator has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Chunk.consume (cognitive 23) REDACTED:1183— Chunk.consume has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
signals.writeSignals::writeSignal (cognitive 23) packages/runtime-tags/src/translator/util/signals.ts:972— signals.writeSignals::writeSignal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, 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.
bindings.compareReferences (cognitive 23) packages/runtime-tags/src/translator/util/bindings.ts:287— bindings.compareReferences has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 7 (23 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
feature-detection.scanTag (cognitive 23) packages/runtime-tags/src/translator/interop/feature-detection.ts:117— feature-detection.scanTag has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· enter (cognitive 23) · ×1
enter (cognitive 23) packages/runtime-class/src/translator/tag/index.js:27— enter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, 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.
exit (cognitive 23) packages/runtime-class/src/translator/tag/index.js:92— exit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
exports (cognitive 23) packages/runtime-class/src/runtime/renderable.js:38— exports has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 10, match/switch 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 8 function items inside it that branch (render, renderToString, renderSync, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
load-import.translateLoadTag (cognitive 22) packages/runtime-class/src/translator/util/load-import.js:78— load-import.translateLoadTag has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
index.attachDepsAndComponentsToTemplate (cognitive 22) packages/runtime-class/src/runtime/components/legacy/dependencies/index.js:31— index.attachDepsAndComponentsToTemplate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 3). Of this number, 13 points are the body's own statements and 9 belong to 2 function literals inside it that branch. 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.
helpers.normalizeDynamicRenderer (cognitive 22) packages/runtime-tags/src/common/helpers.ts:176— helpers.normalizeDynamicRenderer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4 (nesting depth added 11). 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.
references.mergeInto (cognitive 22) packages/runtime-tags/src/translator/util/references.ts:934— references.mergeInto has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
module-registrations.writeModuleRegistrations (cognitive 22) packages/runtime-tags/src/translator/util/module-registrations.ts:254— module-registrations.writeModuleRegistrations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
for-selector.onlyComparesKey (cognitive 22) packages/runtime-tags/src/translator/util/for-selector.ts:51— for-selector.onlyComparesKey has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 62). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
if.flattenTextOnlyConditional (cognitive 22) packages/runtime-tags/src/translator/core/if.ts:278— if.flattenTextOnlyConditional has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (6 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.
finalize-references.pruneBinding (cognitive 22) packages/runtime-tags/src/translator/util/finalize-references.ts:671— finalize-references.pruneBinding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 4, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
(computed) (cognitive 22) packages/runtime-class/src/runtime/html/AsyncStream.js:129— (computed) has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 1 (3 pts) (nesting depth added 9). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 8 function items inside it that branch (iteratorNextFn, end, write, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
index.execModifiersAndDirectives (cognitive 21) packages/runtime-class/src/translator/tag/attribute/index.js:120— index.execModifiersAndDirectives has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3 (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.
errors.assertExclusiveAttrs (cognitive 21) packages/runtime-tags/src/common/errors.ts:190— errors.assertExclusiveAttrs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
controllable._attr_select_value_script (cognitive 21) packages/runtime-tags/src/dom/controllable.ts:373— controllable._attr_select_value_script has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 11). Of this number, 18 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
control-flow._await_promise::awaitPromise (cognitive 21) REDACTED:85— control-flow._await_promise::awaitPromise has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, ternaries 1 (2 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.
control-flow._show (cognitive 21) REDACTED:509— control-flow._show has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 524). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
serializer.writeRequest (cognitive 21) packages/runtime-tags/src/html/serializer.ts:1660— serializer.writeRequest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), ternaries 2 (3 pts), 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.
control-flow._await (cognitive 21) packages/runtime-tags/src/html/control-flow.ts:449— control-flow._await has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3 (nesting depth added 9). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 487, 493). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Sorted.union (cognitive 21) packages/runtime-tags/src/translator/util/optional.ts:26— Sorted.union has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 1 (5 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
traverse.traverseFind (cognitive 21) packages/runtime-tags/src/translator/util/traverse.ts:45— traverse.traverseFind has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
custom-tag.translateDOM (cognitive 21) packages/runtime-tags/src/translator/visitors/tag/custom-tag.ts:176— custom-tag.translateDOM has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (8 pts), boolean chains 3 (nesting depth added 8). Of this number, 12 points are the body's own statements and 9 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
index.mergeObjects (cognitive 21) packages/runtime-tags/src/translator/interop/index.ts:299— index.mergeObjects has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 6 (10 pts) (nesting depth added 11). Of this number, 20 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
translate-for.exit (cognitive 20) packages/runtime-class/src/translator/taglib/core/translate-for.js:7— translate-for.exit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, ternaries 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.
class-value.classHelper (cognitive 20) packages/runtime-class/src/runtime/helpers/class-value.js:3— class-value.classHelper has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 11). 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.
defineRenderer-legacy.defineRenderer (cognitive 20) packages/runtime-class/src/runtime/components/legacy/defineRenderer-legacy.js:11— defineRenderer-legacy.defineRenderer has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 14, if/else 5 (6 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
merge-attrs.mergeAttrs (cognitive 20) packages/runtime-class/src/runtime/html/helpers/merge-attrs.js:10— merge-attrs.mergeAttrs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 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.
Sorted.filter (cognitive 20) packages/runtime-tags/src/translator/util/optional.ts:61— Sorted.filter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (7 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
for-each-identifier.forEachIdentifier (cognitive 20) packages/runtime-tags/src/translator/util/for-each-identifier.ts:2— for-each-identifier.forEachIdentifier has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
write-guard.buildGroupMask (cognitive 20) packages/runtime-tags/src/translator/util/write-guard.ts:73— write-guard.buildGroupMask has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
signals.trimEmptyArgs (cognitive 20) packages/runtime-tags/src/translator/util/signals.ts:819— signals.trimEmptyArgs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, 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.
native-tag.getRelatedControllable (cognitive 20) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:1211— native-tag.getRelatedControllable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
index.buildLookup (cognitive 19) packages/compiler/src/taglib/index.js:26— index.buildLookup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reorderer-renderer.default (cognitive 19) packages/runtime-class/src/core-tags/core/await/reorderer-renderer.js:5— reorderer-renderer.default has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 84, 51, 36, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
helpers.toDelimitedString (cognitive 19) packages/runtime-tags/src/common/helpers.ts:116— helpers.toDelimitedString has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (6 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.
dynamic-tag._dynamic_tag (cognitive 19) packages/runtime-tags/src/html/dynamic-tag.ts:44— dynamic-tag._dynamic_tag has cognitive complexity 19 (threshold 15). Drivers by points: if/else 22 (45 pts), ternaries 10 (39 pts), boolean chains 11 (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (dynamic-tag._dynamic_tag::renderNative) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
references.trackParamsReferences (cognitive 19) packages/runtime-tags/src/translator/util/references.ts:285— references.trackParamsReferences has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 1 (4 pts), boolean chains 2, loops 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.
solve-reasons.computeBindingReaders (cognitive 19) packages/runtime-tags/src/translator/util/solve-reasons.ts:423— solve-reasons.computeBindingReaders has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (5 pts), boolean chains 3, ternaries 2 (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.
traverse (cognitive 19) REDACTED:826— traverse has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (4 pts), boolean chains 3, loops 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.
_attr_select_value_script (cognitive 19) REDACTED:1605— _attr_select_value_script has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (6 pts), boolean chains 3, ternaries 1 (nesting depth added 8). Of this number, 15 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
p::renderAndMorph (cognitive 19) packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js:179— p::renderAndMorph has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 1 (4 pts), boolean chains 3, 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.
custom-tag.hoistToFactory (cognitive 18) packages/runtime-class/src/translator/tag/custom-tag.js:165— custom-tag.hoistToFactory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 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.
markoc.isIgnored (cognitive 18) packages/runtime-class/bin/markoc.js:171— markoc.isIgnored has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderer.requestData (cognitive 18) packages/runtime-class/src/core-tags/core/await/renderer.js:15— renderer.requestData has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 1 (2 pts) (nesting depth added 6). Of this number, 11 points are the body's own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
decl-hoist.moduleScopeVarHoistPlugin.renderChunk (cognitive 18) packages/runtime-tags/scripts/build-plugins/decl-hoist.mts:11— decl-hoist.moduleScopeVarHoistPlugin.renderChunk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 2, ternaries 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.
dom._html (cognitive 18) packages/runtime-tags/src/dom/dom.ts:365— dom._html has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (3 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.
queue.runRenders (cognitive 18) packages/runtime-tags/src/dom/queue.ts:214— queue.runRenders has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
optional.findIndexSortedFrom (cognitive 18) packages/runtime-tags/src/translator/util/optional.ts:616— optional.findIndexSortedFrom has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (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.
optional.unionSorted (cognitive 18) packages/runtime-tags/src/translator/util/optional.ts:709— optional.unionSorted has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 3 (4 pts), loops 3 (4 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.
sources.compareSources (cognitive 18) packages/runtime-tags/src/translator/util/sources.ts:76— sources.compareSources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
read-replacement.getDOMReadBase (cognitive 18) packages/runtime-tags/src/translator/util/read-replacement.ts:69— read-replacement.getDOMReadBase has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (6 pts), boolean chains 4 (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.
signals.writeRegisteredFns (cognitive 18) packages/runtime-tags/src/translator/util/signals.ts:1140— signals.writeRegisteredFns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
beginAsync (cognitive 18) packages/runtime-class/src/runtime/html/AsyncStream.js:329— beginAsync has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (3 pts) (nesting depth added 7). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
merge (cognitive 18) packages/compiler/src/taglib/lookup/index.js:13— merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tagArguments (cognitive 18) packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:107— tagArguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 3). Of this number, 13 points are the body's own statements and 5 belong to 3 function literals inside it that branch. 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.
bindReady (cognitive 18) packages/runtime-class/src/runtime/components/legacy/ready.js:38— bindReady has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 4). Of this number, 11 points are the body's own statements and 7 belong to 3 function items inside it that branch. 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.
t (cognitive 18) packages/runtime-class/src/runtime/vdom/hot-reload.js:15— t has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 9). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 6 function items inside it that branch (set::(anonymous)::(anonymous)::___renderer, set, a function literal at line 38, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
dynamic-tag.default (cognitive 17) packages/runtime-class/src/translator/tag/dynamic-tag.js:7— dynamic-tag.default has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 4, if/else 3 (4 pts) (nesting depth added 3). Of this number, 14 points are the body's own statements and 3 belong to 2 function literals inside it that branch. 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.
index.default (cognitive 17) packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:17— index.default has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (4 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.
Sorted.isSuperset (cognitive 17) packages/runtime-tags/src/translator/util/optional.ts:226— Sorted.isSuperset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 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.
references.trackDomVarReferences (cognitive 17) packages/runtime-tags/src/translator/util/references.ts:188— references.trackDomVarReferences has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (4 pts), boolean chains 3, loops 2 (3 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.
references.getAllTagReferenceNodes (cognitive 17) packages/runtime-tags/src/translator/util/references.ts:1246— references.getAllTagReferenceNodes has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 3 (5 pts), match/switch 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
textarea.preAnalyze (cognitive 17) packages/runtime-tags/src/translator/core/textarea.ts:6— textarea.preAnalyze has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
index.createInteropTranslator::withInteropEntryBuilder (cognitive 17) packages/runtime-tags/src/translator/interop/index.ts:65— index.createInteropTranslator::withInteropEntryBuilder has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TaglibLookup.forEachAttribute::findAttributesForTagName (cognitive 16) packages/compiler/src/taglib/lookup/index.js:153— TaglibLookup.forEachAttribute::findAttributesForTagName has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (7 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.
migrate.getMigratorsForTag (cognitive 16) packages/compiler/src/babel-plugin/plugins/migrate.js:30— migrate.getMigratorsForTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 7). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (addMigrators). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
transform.getTransformersForTag (cognitive 16) packages/compiler/src/babel-plugin/plugins/transform.js:32— transform.getTransformersForTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 7). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (addTransformers). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
index.stripTypes (cognitive 16) packages/compiler/src/babel-plugin/index.js:530— index.stripTypes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
key-manager.getKeyScope (cognitive 16) packages/runtime-class/src/translator/util/key-manager.js:87— key-manager.getKeyScope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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.
index.getClassHydrationMode (cognitive 16) packages/runtime-class/src/translator/index.js:762— index.getClassHydrationMode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dom.attrsInternal (cognitive 16) packages/runtime-tags/src/dom/dom.ts:268— dom.attrsInternal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 2, loops 2, match/switch 1 (2 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.
serializer.quote (cognitive 16) packages/runtime-tags/src/html/serializer.ts:2334— serializer.quote has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
references.trackAssignment (cognitive 16) packages/runtime-tags/src/translator/util/references.ts:500— references.trackAssignment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 529). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
module-registrations.getExportNames (cognitive 16) packages/runtime-tags/src/translator/util/module-registrations.ts:373— module-registrations.getExportNames has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 1 (2 pts), ternaries 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.
get-declared-binding-expression.getDeclaredBindingExpression (cognitive 16) packages/runtime-tags/src/translator/util/get-declared-binding-expression.ts:15— get-declared-binding-expression.getDeclaredBindingExpression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 1 (3 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.
known-tag.knownTagAnalyze (cognitive 16) packages/runtime-tags/src/translator/util/known-tag.ts:140— known-tag.knownTagAnalyze has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (3 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.
native-tag.addDelimitedAttrObject (cognitive 16) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:2158— native-tag.addDelimitedAttrObject has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
___actualize (cognitive 16) REDACTED:172— ___actualize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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.
MethodTooLong: Chunk.flush REDACTED:1326— MethodTooLong — flush runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Off the main sequence: @marko/compiler — @marko/compiler: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
M1 · Documentation (README)· README may be stale · ×1
README may be stale — 333 code files changed in the last 6 months but the README was not touched — it may no longer reflect the system.
P12 · CI test-gate honesty· Coverage collected but not gated · ×1
Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
Duplication concentrated across 3 sibling directories (9 clone groups) packages/runtime-class/src/translator/util/load-import.js:166— 9 duplicated blocks under packages/ have copies in at least two of the sibling directories compiler, runtime-class, runtime-tags — 8 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 2 sibling directories (5 clone groups) packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:13— 5 of the duplicated blocks reported below have copies in at least two of the sibling directories native-tag[html], native-tag[vdom] under packages/runtime-class/src/translator/tag/. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 4 sibling directories (5 clone groups) packages/runtime-tags/src/translator/core/define.ts:106— 5 duplicated blocks under packages/runtime-tags/src/translator/ have copies in at least two of the sibling directories core, interop, util, visitors — 3 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication· Duplicated block with local edits (74 matched lines × 2 locations) · ×1
Duplicated block with local edits (74 matched lines × 2 locations) packages/runtime-class/src/translator/util/load-import.js:166— packages/runtime-class/src/translator/util/load-import.js:166 · packages/runtime-tags/src/translator/util/tag-import.ts:91 — the two spans are one implementation copied and then locally edited — 339 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (69 matched lines × 2 locations) · ×1
Duplicated block with local edits (69 matched lines × 2 locations) packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:13— packages/runtime-class/src/translator/tag/native-tag[html]/attributes.js:13 · packages/runtime-class/src/translator/tag/native-tag[vdom]/attributes.js:8 — the two spans are one implementation copied and then locally edited — 375 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (35 lines × 2 locations) packages/compiler/src/babel-utils/imports.js:56— packages/compiler/src/babel-utils/imports.js:56 · packages/compiler/src/babel-utils/imports.js: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.
R10 · Code Duplication· Duplicated block with local edits (35 matched lines × 2 locations) · ×1
Duplicated block with local edits (35 matched lines × 2 locations) packages/runtime-class/src/translator/tag/native-tag[html]/index.js:24— packages/runtime-class/src/translator/tag/native-tag[html]/index.js:24 · packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:109 — the two spans are one implementation copied and then locally edited — 195 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (33 lines × 2 locations) packages/compiler/src/babel-plugin/plugins/migrate.js:30— packages/compiler/src/babel-plugin/plugins/migrate.js:30 · packages/compiler/src/babel-plugin/plugins/transform.js:32 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication· Duplicated block with local edits (33 matched lines × 2 locations) · ×1
Duplicated block with local edits (33 matched lines × 2 locations) packages/runtime-class/src/translator/tag/native-tag[html]/index.js:156— packages/runtime-class/src/translator/tag/native-tag[html]/index.js:156 · packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js:29 — the two spans are one implementation copied and then locally edited — 145 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (30 lines × 2 locations) packages/runtime-class/src/translator/tag/attribute/directives/class.js:12— packages/runtime-class/src/translator/tag/attribute/directives/class.js:12 · packages/runtime-class/src/translator/tag/attribute/directives/style.js:12 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (27 lines × 2 locations) packages/runtime-tags/src/html/control-flow.ts:162— packages/runtime-tags/src/html/control-flow.ts:162 · packages/runtime-tags/src/html/control-flow.ts:208 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
Duplicated block (25 lines × 2 locations) packages/runtime-tags/src/html/control-flow.ts:81— packages/runtime-tags/src/html/control-flow.ts:81 · packages/runtime-tags/src/html/control-flow.ts:121 — all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication· Duplicated block with local edits (24 matched lines × 2 locations) · ×1
Duplicated block with local edits (24 matched lines × 2 locations) packages/runtime-class/src/runtime/html/AsyncStream.js:779— packages/runtime-class/src/runtime/html/AsyncStream.js:779 · packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js:424 — the two spans are one implementation copied and then locally edited — 142 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (22 lines × 2 locations) packages/runtime-tags/src/translator/core/let.ts:49— packages/runtime-tags/src/translator/core/let.ts:49 · packages/runtime-tags/src/translator/core/return.ts:44 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication· Duplicated block with local edits (18 matched lines × 2 locations) · ×1
Duplicated block with local edits (18 matched lines × 2 locations) packages/runtime-tags/src/translator/visitors/tag/attribute-tag.ts:41— packages/runtime-tags/src/translator/visitors/tag/attribute-tag.ts:41 · packages/runtime-tags/src/translator/visitors/tag/custom-tag.ts:125 — the two spans are one implementation copied and then locally edited — 66 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (15 matched lines × 2 locations) · ×1
Duplicated block with local edits (15 matched lines × 2 locations) packages/runtime-tags/src/translator/visitors/tag/custom-tag.ts:117— packages/runtime-tags/src/translator/visitors/tag/custom-tag.ts:117 · packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts:231 — the two spans are one implementation copied and then locally edited — 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R2 · Cyclomatic Complexity· Complex function enter (cyclomatic 91, cognitive 172) · ×1
Complex function enter (cyclomatic 91, cognitive 172) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:155— enter has cyclomatic complexity 91 and cognitive complexity 172; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function morphChildren (cyclomatic 88, cognitive 303) packages/runtime-class/src/runtime/vdom/morphdom/index.js:149— morphChildren has cyclomatic complexity 88 and cognitive complexity 303; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function computeNode (cyclomatic 82, cognitive 102) REDACTED:4— computeNode has cyclomatic complexity 82 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function enter (cyclomatic 57, cognitive 85) · ×1
Complex function enter (cyclomatic 57, cognitive 85) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:548— enter has cyclomatic complexity 57 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function exit (cyclomatic 56, cognitive 107) packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts:261— exit has cyclomatic complexity 56 and cognitive complexity 107; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function writeAttrsToSignals (cyclomatic 53, cognitive 118) packages/runtime-tags/src/translator/util/known-tag.ts:1101— writeAttrsToSignals has cyclomatic complexity 53 and cognitive complexity 118; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function analyzeAttrs (cyclomatic 51, cognitive 123) packages/runtime-tags/src/translator/util/known-tag.ts:614— analyzeAttrs has cyclomatic complexity 51 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function MarkoTag (cyclomatic 45, cognitive 59) packages/runtime-class/src/translator/index.js:100— MarkoTag has cyclomatic complexity 45 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 43, cognitive 59) packages/runtime-class/src/translator/tag/native-tag[html]/index.js:22— (anonymous) has cyclomatic complexity 43 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function enter (cyclomatic 40, cognitive 92) · ×1
Complex function enter (cyclomatic 40, cognitive 92) packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:914— enter has cyclomatic complexity 40 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function analyzeExpressionTagName (cyclomatic 39, cognitive 81) packages/runtime-tags/src/translator/util/tag-name-type.ts:134— analyzeExpressionTagName has cyclomatic complexity 39 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function checkStyleInterpolations (cyclomatic 38, cognitive 75) packages/runtime-tags/src/translator/util/style-interpolation.ts:6— checkStyleInterpolations has cyclomatic complexity 38 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function flush (cyclomatic 34, cognitive 64) REDACTED:1326— flush has cyclomatic complexity 34 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function dynamicTag (cyclomatic 33, cognitive 86) packages/runtime-class/src/runtime/helpers/dynamic-tag.js:24— dynamicTag has cyclomatic complexity 33 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function getMarkoFile (cyclomatic 32, cognitive 54) packages/compiler/src/babel-plugin/index.js:169— getMarkoFile has cyclomatic complexity 32 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function writeHTMLResumeStatements (cyclomatic 32, cognitive 48) packages/runtime-tags/src/translator/util/signals.ts:1238— writeHTMLResumeStatements has cyclomatic complexity 32 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function findDynamicTagTypes (cyclomatic 31, cognitive 72) packages/runtime-class/src/translator/tag/index.js:161— findDynamicTagTypes has cyclomatic complexity 31 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function * (cyclomatic 31, cognitive 53) packages/compiler/src/taglib/loader/loadTagFromProps.js:110— * has cyclomatic complexity 31 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· packages/runtime-tags/src/html/serializer.ts · ×1
packages/runtime-tags/src/html/serializer.ts: 2317 lines of code packages/runtime-tags/src/html/serializer.ts:1— packages/runtime-tags/src/html/serializer.ts has 2317 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/visitors/tag/native-tag.ts · ×1
packages/runtime-tags/src/translator/visitors/tag/native-tag.ts: 2065 lines of code packages/runtime-tags/src/translator/visitors/tag/native-tag.ts:1— packages/runtime-tags/src/translator/visitors/tag/native-tag.ts has 2065 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/signals.ts · ×1
packages/runtime-tags/src/translator/util/signals.ts: 1674 lines of code packages/runtime-tags/src/translator/util/signals.ts:1— packages/runtime-tags/src/translator/util/signals.ts has 1674 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 1609 lines of code REDACTED:1— REDACTED has 1609 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/known-tag.ts · ×1
packages/runtime-tags/src/translator/util/known-tag.ts: 1393 lines of code packages/runtime-tags/src/translator/util/known-tag.ts:1— packages/runtime-tags/src/translator/util/known-tag.ts has 1393 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/references.ts · ×1
packages/runtime-tags/src/translator/util/references.ts: 1299 lines of code packages/runtime-tags/src/translator/util/references.ts:1— packages/runtime-tags/src/translator/util/references.ts has 1299 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 1078 lines of code REDACTED:1— REDACTED has 1078 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/finalize-references.ts · ×1
packages/runtime-tags/src/translator/util/finalize-references.ts: 896 lines of code packages/runtime-tags/src/translator/util/finalize-references.ts:1— packages/runtime-tags/src/translator/util/finalize-references.ts has 896 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/compiler/src/babel-plugin/parser.js · ×1
packages/compiler/src/babel-plugin/parser.js: 758 lines of code packages/compiler/src/babel-plugin/parser.js:1— packages/compiler/src/babel-plugin/parser.js has 758 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/optional.ts · ×1
packages/runtime-tags/src/translator/util/optional.ts: 733 lines of code packages/runtime-tags/src/translator/util/optional.ts:1— packages/runtime-tags/src/translator/util/optional.ts has 733 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-class/src/translator/index.js · ×1
packages/runtime-class/src/translator/index.js: 732 lines of code packages/runtime-class/src/translator/index.js:1— packages/runtime-class/src/translator/index.js has 732 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/html/control-flow.ts · ×1
packages/runtime-tags/src/html/control-flow.ts: 713 lines of code packages/runtime-tags/src/html/control-flow.ts:1— packages/runtime-tags/src/html/control-flow.ts has 713 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-class/src/runtime/html/AsyncStream.js · ×1
packages/runtime-class/src/runtime/html/AsyncStream.js: 693 lines of code packages/runtime-class/src/runtime/html/AsyncStream.js:1— packages/runtime-class/src/runtime/html/AsyncStream.js has 693 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/dom/controllable.ts · ×1
packages/runtime-tags/src/dom/controllable.ts: 660 lines of code packages/runtime-tags/src/dom/controllable.ts:1— packages/runtime-tags/src/dom/controllable.ts has 660 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-class/src/runtime/vdom/morphdom/index.js · ×1
packages/runtime-class/src/runtime/vdom/morphdom/index.js: 650 lines of code packages/runtime-class/src/runtime/vdom/morphdom/index.js:1— packages/runtime-class/src/runtime/vdom/morphdom/index.js has 650 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts · ×1
packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts: 647 lines of code packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts:1— packages/runtime-tags/src/translator/visitors/tag/dynamic-tag.ts has 647 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-class/src/runtime/components/Component.js · ×1
packages/runtime-class/src/runtime/components/Component.js: 570 lines of code packages/runtime-class/src/runtime/components/Component.js:1— packages/runtime-class/src/runtime/components/Component.js has 570 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/dom/resume.ts · ×1
packages/runtime-tags/src/dom/resume.ts: 560 lines of code packages/runtime-tags/src/dom/resume.ts:1— packages/runtime-tags/src/dom/resume.ts has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/sections.ts · ×1
packages/runtime-tags/src/translator/util/sections.ts: 560 lines of code packages/runtime-tags/src/translator/util/sections.ts:1— packages/runtime-tags/src/translator/util/sections.ts has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/html/attrs.ts · ×1
packages/runtime-tags/src/html/attrs.ts: 547 lines of code packages/runtime-tags/src/html/attrs.ts:1— packages/runtime-tags/src/html/attrs.ts has 547 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/compiler/src/babel-plugin/index.js · ×1
packages/compiler/src/babel-plugin/index.js: 511 lines of code packages/compiler/src/babel-plugin/index.js:1— packages/compiler/src/babel-plugin/index.js has 511 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/module-registrations.ts · ×1
packages/runtime-tags/src/translator/util/module-registrations.ts: 500 lines of code packages/runtime-tags/src/translator/util/module-registrations.ts:1— packages/runtime-tags/src/translator/util/module-registrations.ts has 500 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/bindings.ts · ×1
packages/runtime-tags/src/translator/util/bindings.ts: 490 lines of code packages/runtime-tags/src/translator/util/bindings.ts:1— packages/runtime-tags/src/translator/util/bindings.ts has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/solve-reasons.ts · ×1
packages/runtime-tags/src/translator/util/solve-reasons.ts: 490 lines of code packages/runtime-tags/src/translator/util/solve-reasons.ts:1— packages/runtime-tags/src/translator/util/solve-reasons.ts has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts · ×1
packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts: 486 lines of code packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts:1— packages/runtime-tags/src/translator/visitors/program/pre-analyze.ts has 486 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/compiler/src/taglib/loader/loadTagFromProps.js · ×1
packages/compiler/src/taglib/loader/loadTagFromProps.js: 481 lines of code packages/compiler/src/taglib/loader/loadTagFromProps.js:1— packages/compiler/src/taglib/loader/loadTagFromProps.js has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/translate-attrs.ts · ×1
packages/runtime-tags/src/translator/util/translate-attrs.ts: 468 lines of code packages/runtime-tags/src/translator/util/translate-attrs.ts:1— packages/runtime-tags/src/translator/util/translate-attrs.ts has 468 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/dom/dom.ts · ×1
packages/runtime-tags/src/dom/dom.ts: 459 lines of code packages/runtime-tags/src/dom/dom.ts:1— packages/runtime-tags/src/dom/dom.ts has 459 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/dom/signals.ts · ×1
packages/runtime-tags/src/dom/signals.ts: 451 lines of code packages/runtime-tags/src/dom/signals.ts:1— packages/runtime-tags/src/dom/signals.ts has 451 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/util/structure.ts · ×1
packages/runtime-tags/src/translator/util/structure.ts: 447 lines of code packages/runtime-tags/src/translator/util/structure.ts:1— packages/runtime-tags/src/translator/util/structure.ts has 447 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/translator/core/for.ts · ×1
packages/runtime-tags/src/translator/core/for.ts: 406 lines of code packages/runtime-tags/src/translator/core/for.ts:1— packages/runtime-tags/src/translator/core/for.ts has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· packages/runtime-tags/src/html/template.ts · ×1
packages/runtime-tags/src/html/template.ts: 401 lines of code packages/runtime-tags/src/html/template.ts:1— packages/runtime-tags/src/html/template.ts has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
Dead file (~304 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 4 in-repo import(s) from 4 other file(s) do name it (packages/runtime-class/src/runtime/helpers/tags-compat/html-debug.js, packages/runtime-class/src/runtime/helpers/tags-compat/html-debug.mjs, packages/runtime-class/src/runtime/helpers/tags-compat/html.js and 1 more) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~293 LoC) packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 4 in-repo import(s) from 4 other file(s) do name it (packages/runtime-class/src/runtime/helpers/tags-compat/dom-debug.js, packages/runtime-class/src/runtime/helpers/tags-compat/dom-debug.mjs, packages/runtime-class/src/runtime/helpers/tags-compat/dom.js and 1 more) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~231 LoC) packages/runtime-class/src/runtime/components/legacy/renderer-legacy.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~177 LoC) packages/runtime-class/src/runtime/components/legacy/dependencies/index.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (packages/runtime-class/src/runtime/components/legacy/dependencies/html.js, packages/runtime-class/src/runtime/components/legacy/dependencies/vdom.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~171 LoC) packages/runtime-class/src/runtime/components/legacy/defineRenderer-legacy.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/runtime-class/src/runtime/components/legacy/defineComponent-legacy.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~122 LoC) packages/runtime-class/src/runtime/vdom/hot-reload.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~79 LoC) scripts/test-parallel-worker.cjs— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~51 LoC) packages/runtime-class/src/core-tags/core/await/client-reorder-runtime.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~27 LoC) packages/runtime-class/src/runtime/components/legacy/defineComponent-legacy.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~11 LoC) packages/runtime-class/helpers/notEmpty.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/runtime-class/helpers/empty.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~8 LoC) packages/runtime-tags/translator.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~7 LoC) packages/runtime-class/legacy-components.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~4 LoC) packages/runtime-class/helpers/empty.js— no import path from any entry point (1892 application, 17 tooling, 6100 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Unused dependency '@ebay/browserslist-config' — Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'express' — Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'complain' — Declared in packages/compiler/package.json but never imported anywhere in that package or its workspace members — while scripts/ts-hooks/index.js DOES import it and no package.json above that file declares it, so the import resolves through the copy this declaration installs. The declaration is misplaced rather than dead: removing it breaks that import. Move it to the package.json that owns the importing file (or, if the two packages are meant to share it, hoist it to the workspace root) rather than deleting it.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×1
Recursive walk over a caller-supplied document has no depth cap packages/runtime-tags/src/common/helpers.ts:129— `toDelimitedString` is exported and takes `val: unknown` from its caller, and it calls itself at line 129 (`toDelimitedString`) with a piece of `val` — and nowhere in `toDelimitedString` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `toDelimitedString` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Duplicated predicate .sizes/comments.csr/runtime.js:67— `!currentNode.nextSibling && currentNode.parentNode` appears character-identically in 4 files — .sizes/comments.csr/runtime.js, .sizes/counter.csr/runtime.js, REDACTED, packages/runtime-tags/src/dom/walker.ts. 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 packages/runtime-tags/src/translator/util/module-registrations.ts:456— `!markoRoot || canIgnoreRegister(markoRoot, exprRoot)` appears character-identically in 2 files — packages/runtime-tags/src/translator/util/module-registrations.ts, packages/runtime-tags/src/translator/visitors/function.ts. 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 packages/runtime-tags/src/translator/util/references.ts:676— `!prop.computed && prop.key.type === "Identifier"` appears character-identically in 2 files — packages/runtime-tags/src/translator/util/references.ts, packages/runtime-tags/src/translator/visitors/tag/native-tag.ts. 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 packages/compiler/src/taglib/index.js:28— `!translator || !Array.isArray(translator.taglibs)` appears character-identically in 2 files — packages/compiler/src/taglib/index.js, packages/runtime-class/src/taglib/index.js. 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 packages/runtime-tags/src/translator/core/id.ts:45— `!valueAttr || evaluate(valueAttr.value).pure` appears character-identically in 2 files — packages/runtime-tags/src/translator/core/id.ts, packages/runtime-tags/src/translator/core/let.ts. 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 packages/runtime-class/src/runtime/components/Component.js:6— `"MARKO_DEBUG" && require("./invoke-lifecycle")` appears character-identically in 4 files — packages/runtime-class/src/runtime/components/Component.js, packages/runtime-class/src/runtime/components/ComponentDef.js, packages/runtime-class/src/runtime/components/ServerComponent.js, packages/runtime-class/src/runtime/components/renderer.js. 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 REDACTED:1723— `"checked" in nextAttrs || "checkedChange" in nextAttrs` appears character-identically in 2 files — REDACTED, packages/runtime-tags/src/dom/controllable.ts. 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 REDACTED:1726— `"checkedValue" in nextAttrs || "checkedValueChange" in nextAttrs` appears character-identically in 2 files — REDACTED, packages/runtime-tags/src/dom/controllable.ts. 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 REDACTED:1758— `"open" in nextAttrs || "openChange" in nextAttrs` appears character-identically in 2 files — REDACTED, packages/runtime-tags/src/dom/controllable.ts. 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 REDACTED:1738— `"value" in nextAttrs || "valueChange" in nextAttrs` appears character-identically in 2 files — REDACTED, packages/runtime-tags/src/dom/controllable.ts. 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 .sizes/comments.csr/runtime.js:23— `(!branchesEnabled || render.b.F?.H !== 0) && render.c(render.b, render.d)` appears character-identically in 2 files — .sizes/comments.csr/runtime.js, REDACTED. 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 REDACTED:1413— `(initialPosition || initialPosition === 0) && (initialPosition !== initialValue.length || /kw/.test(inputType))` appears character-identically in 2 files — REDACTED, packages/runtime-tags/src/dom/resolve-cursor-position.ts. 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 packages/runtime-tags/src/translator/interop/index.ts:181— `(output === "dom" && entry === "page") || output === "hydrate"` appears character-identically in 2 files — packages/runtime-tags/src/translator/interop/index.ts, packages/runtime-tags/src/translator/visitors/program/index.ts. 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 packages/runtime-class/src/translator/tag/native-tag[html]/index.js:33— `(path.node.extra && path.node.extra.properties) || []` appears character-identically in 2 files — packages/runtime-class/src/translator/tag/native-tag[html]/index.js, packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js. 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 packages/compiler/src/babel-plugin/util/plugin-hooks.js:5— `(plugin && (plugin.enter || (plugin.default && plugin.default.enter) || plugin.default)) || plugin` appears character-identically in 2 files — packages/compiler/src/babel-plugin/util/plugin-hooks.js, packages/runtime-class/src/translator/util/plugin-hooks.js. 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 REDACTED:834— `(scope[step[1]] || 0) === step[2] && scope[step[0]]` appears character-identically in 2 files — REDACTED, packages/runtime-tags/src/dom/signals.ts. 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 .sizes/comments.csr/runtime.js:305— `(scope[valueAccessor] !== value || !(valueAccessor in scope)) && ((scope[valueAccessor] = value), fn) && (schedule(), queueRender(scope, fn,…` appears character-identically in 5 files — .sizes/comments.csr/runtime.js, .sizes/comments.ssr/runtime.js, .sizes/counter.csr/runtime.js, .sizes/counter.ssr/runtime.js. 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 .sizes/comments.csr/runtime.js:315— `(scope[valueAccessor] !== value || !(valueAccessor in scope)) && ((scope[valueAccessor] = value), fn?.(scope))` appears character-identically in 2 files — .sizes/comments.csr/runtime.js, REDACTED. 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 REDACTED:656— `(scope[valueChangeAccessor] = valueChange) && (scope[valueAccessor] !== value || !(valueAccessor in scope))` appears character-identically in 2 files — REDACTED, packages/runtime-tags/src/dom/signals.ts. 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 packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js:218— `/^on[-A-Z]/.test(key) && typeof value === "function"` appears character-identically in 2 files — packages/runtime-class/src/runtime/helpers/tags-compat/runtime-dom.js, packages/runtime-class/src/runtime/helpers/tags-compat/runtime-html.js. 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 .sizes/comments.ssr/runtime.js:189— `Array.isArray(scopes) && applyScopes(scopes)` appears character-identically in 3 files — .sizes/comments.ssr/runtime.js, .sizes/counter.ssr/runtime.js, REDACTED. 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 REDACTED:1310— `attr === "checked" && element.tagName === "INPUT" && "checkedValue" in nextAttrs` appears character-identically in 2 files — REDACTED, packages/runtime-tags/src/dom/dom.ts. 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 packages/runtime-tags/src/translator/core/script.ts:78— `attr.type === "MarkoAttribute" && attr.name === "value"` appears character-identically in 2 files — packages/runtime-tags/src/translator/core/script.ts, packages/runtime-tags/src/translator/util/assert.ts. 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 packages/runtime-class/src/translator/taglib/core/parse-client.js:13— `block.body.length === 1 && t.isBlockStatement(block.body[0])` appears character-identically in 4 files — packages/runtime-class/src/translator/taglib/core/parse-client.js, packages/runtime-class/src/translator/taglib/core/parse-server.js, packages/runtime-class/src/translator/taglib/core/parse-static.js, REDACTED. 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 packages/runtime-class/src/translator/tag/native-tag[html]/index.js:185— `childNode.kind === "const" || childNode.kind === "let"` appears character-identically in 2 files — packages/runtime-class/src/translator/tag/native-tag[html]/index.js, packages/runtime-class/src/translator/tag/native-tag[vdom]/index.js. 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.
Orphaned file packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js: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 packages/runtime-class/src/core-tags/core/await/renderer.js: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 packages/compiler/src/taglib/loader/loadAttributeFromProps.js: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 packages/runtime-class/src/runtime/renderable.js: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 packages/runtime-class/src/translator/util/key-manager.js: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 packages/runtime-class/src/translator/tag/attribute/index.js: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 packages/runtime-class/src/compiler/index.js: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 packages/runtime-class/src/translator/taglib/core/translate-for.js: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 packages/runtime-class/src/core-tags/core/await/AsyncValue.js: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 packages/runtime-class/src/runtime/vdom/morphdom/fragment.js: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 packages/runtime-class/src/runtime/components/update-manager.js: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 packages/runtime-class/src/runtime/RenderResult.js: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 packages/runtime-class/src/runtime/vdom/VNode.js: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 packages/runtime-class/src/runtime/dom-insert.js: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 packages/runtime-class/src/runtime/vdom/vdom.js: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 packages/runtime-class/src/runtime/components/State.js: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.
R7 · Dead Code· Unused module-local declaration 'MyClass' · ×5
Unused module-local declaration 'MyClass' packages/runtime-class/test/translator/fixtures/declared-class-member/snapshots/cjs-expected.js:11— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'MyClass' packages/runtime-class/test/translator/fixtures/declared-class-member/snapshots/html-expected.js:5— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'MyClass' packages/runtime-class/test/translator/fixtures/declared-class-member/snapshots/htmlProduction-expected.js:5— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'MyClass' packages/runtime-class/test/translator/fixtures/declared-class-member/snapshots/vdom-expected.js:5— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'MyClass' packages/runtime-class/test/translator/fixtures/declared-class-member/snapshots/vdomProduction-expected.js:5— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code· Unused module-local declaration 'more' · ×4
Unused module-local declaration 'more' packages/runtime-class/test/translator/fixtures/sanity-check/snapshots/cjs-expected.js:25— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'more' packages/runtime-class/test/translator/fixtures/sanity-check/snapshots/html-expected.js:8— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'more' packages/runtime-class/test/translator/fixtures/sanity-check/snapshots/htmlProduction-expected.js:8— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'more' packages/runtime-class/test/translator/fixtures/sanity-check/snapshots/vdom-expected.js:8— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Deprecated: glob REDACTED:2106— glob 10.5.0 is resolved in REDACTED and is marked deprecated by its publisher: "Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting i@izs.me". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
Deprecated: glob REDACTED:2115— glob 7.2.3 is resolved in REDACTED and is marked deprecated by its publisher: "Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting i@izs.me". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
Deprecated: inflight REDACTED:2183— inflight 1.0.6 is resolved in REDACTED and is marked deprecated by its publisher: "This module is not supported, and leaks memory. Do not use it. Check out lru-cache if you want a good and tested way to coalesce async requests by a key value, which is much more comprehensive and powerful.". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
IC1 · Incompleteness & stubs· Empty method body · ×3
Empty method body packages/runtime-class/src/runtime/components/ServerComponent.js:78— `onCreate` has an empty body — confirm it's an intentional no-op and not an unfinished method.
Empty method body packages/runtime-class/src/runtime/components/ServerComponent.js:79— `onInput` has an empty body — confirm it's an intentional no-op and not an unfinished method.
Empty method body packages/runtime-class/src/runtime/components/ServerComponent.js:80— `onRender` has an empty body — confirm it's an intentional no-op and not an unfinished method.
README/code drift packages/runtime-class/README.md:160— packages/runtime-class/README.md links to `.github/CONTRIBUTING.md`, but `packages/runtime-class/.github/CONTRIBUTING.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift packages/runtime-tags/README.md:71— packages/runtime-tags/README.md links to `.github/CONTRIBUTING.md`, but `packages/runtime-tags/.github/CONTRIBUTING.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift packages/runtime-class/docs/webpack.md:6— packages/runtime-class/docs/webpack.md names Marko 4, but the manifest declares `marko` ^5.39.47. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 106 significant file(s) lose their only recent owner: packages/runtime-tags/src/html/serializer.ts, packages/runtime-tags/src/translator/visitors/tag/native-tag.ts, packages/runtime-tags/src/translator/util/signals.ts, REDACTED, packages/runtime-tags/src/translator/util/known-tag.ts, packages/runtime-tags/src/translator/util/references.ts, packages/runtime-class/src/translator/index.js, packages/runtime-class/src/runtime/vdom/morphdom/index.js (+98 more). Pair on, review, or document these before any departure.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 2 of 9 project(s) overshoot their size bounds, lowering Project Cohesion to 5.6/10. The most over is `packages/runtime-tags/src` (37272 LoC, 262 module-visible types across 10 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 16 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: packages/runtime-class/src/runtime/vdom/AsyncVDOMBuilder.js, packages/runtime-class/src/core-tags/core/await/renderer.js, packages/compiler/src/taglib/loader/loadAttributeFromProps.js, packages/runtime-class/src/runtime/renderable.js, packages/runtime-class/src/translator/util/key-manager.js, packages/runtime-class/src/translator/tag/attribute/index.js, packages/runtime-class/src/compiler/index.js, packages/runtime-class/src/translator/taglib/core/translate-for.js (and 8 more) (17 orphaned of 166 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; 166 of the 471 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.
No SAST REDACTED:6— No static application security testing detected. For this repository's stack, add CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 3268 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.
No dependency-update automation package.json:27— `package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
No release approval gate — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
R7 · Dead Code· Unused module-local declaration 'ContentType' · ×1
Unused module-local declaration 'ContentType' packages/runtime-class/src/translator/tag/attribute-tag.js:16— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code· Unused module-local declaration 'findLastIndex' · ×1
Unused module-local declaration 'findLastIndex' packages/runtime-class/src/translator/tag/util.js:228— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Null assertions (`!`) reduce the strict null checking score — ~11.5 `!` null assertions per 1k TypeScript source lines — 482 assertion(s) across the 41806 source line(s) of the 212 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/runtime-tags/src/translator/util/known-tag.ts (37), REDACTED (35), packages/runtime-tags/src/translator/util/signals.ts (21). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
Skipped (documented): (unnamed test) packages/runtime-class/test/vdom-virtualize/index.test.js:14— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/vdom-create/index.test.js:50— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/translator/index.test.js:69— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/taglib-lookup/index.test.js:16— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/taglib-loader/index.test.js:16— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/taglib-finder/index.test.js:17— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/render/index.test.js:31— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/morphdom/index.test.js:22— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/marko-debug-babel-plugin/index.test.js:15— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/hot-reload/index.test.js:18— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/components-server/index.test.js:13— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/components-browser/index.test.js:20— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/components-browser/index.test.js:60— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/api-compiler/index.test.js:17— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/api/index.test.js:18— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): (unnamed test) packages/runtime-class/test/__util__/async-test-suite.js:6— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Outdated (npm): @luxass/strip-json-comments — @luxass/strip-json-comments is pinned at 2.0.1; registry.npmjs.org publishes 2.0.2 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
Outdated (npm): htmljs-parser — htmljs-parser is pinned at 5.17.1; registry.npmjs.org publishes 5.18.0 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
Outdated (npm): magic-string — magic-string is pinned at 0.30.21; registry.npmjs.org publishes 1.4.5 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
Outdated (npm): minimatch — minimatch is pinned at 10.2.5; registry.npmjs.org publishes 11.0.3 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
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 33 file(s) — `packages/compiler/src/index.js`, `packages/compiler/src/taglib/index.js`, `packages/runtime-class/index.d.ts`, `packages/runtime-class/src/translator/index.js`, `packages/runtime-tags/index.d.ts`, … (+28 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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 01a189f3-f981-7e02-a92a-6095494e0bbc · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 40 · Warnings: 1113 · Recommendations: 87 · Info: 20 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 29-10-2026 @ 23:17 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.