Public report — llrt, published 29 Sep 2026.
Concrete security findings (which rule fired, in which file, on which line; CVE IDs, secret matches,
dependency versions) are REDACTED in this version; ask the repo owner for the full report.
Public
Codebase surveyMeasured under the Code Assurance Index · rubric rubric-2026.09.17 (frozen) · verify this surveyFiledcd_325a4edab27144d4b43a2453879fed67
Filed 29 September 2026, 07:34 UTC
Public
Medium · 65,981 LoC · 47 projects · rebuild ~0.5 person-years · weakest lens: Readiness (55%)
Findings by grade
54 critical477 serious23 minor27 could not be resolved — could be critical — see Limitations
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
29 September 2026, 07:23 UTC
A measurement, not a certificate. The Code Assurance Index does not certify,
approve or guarantee this codebase; it records a reproducible number and the evidence it was computed from. The
standard is authored by Canine Development, who also build Watchdog — its only implementation today. That is said
here so the number is checked rather than believed.
Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸
513findings with an exact file:lineof 554 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
55/131dimensions across the health lenses65981 LoC · 47 projects — wide & deep
Preview (pre-1.0). This repo hasn't declared a stable release, so it's judged against a relaxed, pre-production bar.
The system holds an adequate standing with a composite score of 56%, indicating a workable asset that carries real operational risk. While the codebase is medium-sized and relatively small to rebuild, its weakest areas threaten delivery speed and reliability. The primary concern is not the code’s complexity, but the lack of safeguards in how changes are deployed and managed.
The value at stake is moderate, with a rebuild effort estimated at roughly half a person-year and a cost near €71,000. This suggests the system is not a massive, unchangeable monolith, but rather a manageable component where targeted improvements can yield significant returns. The low proportion of boilerplate and the clear separation of logic imply that the core business rules are well-defined, making it easier for new teams to understand and maintain the system over time.
The most critical theme is operational fragility. With a Readiness score of 55%, the system lacks robust mechanisms to prevent bad builds from reaching users. This exposes the business to potential outages and customer dissatisfaction, as there is no immediate human gate to stop a faulty release. The risk here is direct: a single bad deployment could disrupt service or introduce security vulnerabilities without a quick rollback path.
A second theme is dependency hygiene. The presence of unused packages and implicit imports creates hidden maintenance costs and potential security exposures. While not immediately catastrophic, this drift slows down future development and increases the attack surface. Addressing these issues requires disciplined housekeeping to ensure that only necessary, vetted code is included in the final product.
What is genuinely good is the system’s modularity and the clarity of its domain modeling. The code is structured in a way that makes it easy to understand and modify, which is a strong foundation for future growth. The low rebuild cost also means that significant changes can be made without prohibitive expense.
Where to focus first is implementing a draft release process. This single action provides the highest leverage by stopping bad builds before they impact users. It is a low-effort, high-impact change that immediately reduces operational risk. Once this gate is in place, the team can systematically address dependency hygiene and other maintenance issues with greater confidence.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
D22 · Inconsistent return types for decoder constructors across compression modules. Most return specific typed decoders (GzDecoder, DeflateDecoder, etc.), while zstd and brotli return a generic Result, and the streaming module uses a constructor pattern with a string encoding argument instead of a generic reader. This forces consumers to handle different initialization patterns and return types depending on the algorithm.
D22 · Ambiguous naming and signature overlap in Encoder. `encode` and `encode_to_string` appear to perform similar encoding operations, but `encode_to_string` explicitly includes a `lossy` parameter while `encode` does not. It is unclear if `encode` defaults to lossy or lossless, or if it returns a different type (e.g., Vec<u8> vs String).
D22 · Inconsistent return types for hex and base64 encoding. `bytes_to_hex` and `bytes_to_b64` return `u8` (likely a bug or internal representation), while `bytes_to_hex_string` and `bytes_to_b64_string` return `String`. This creates confusion about which function to use for actual string output.
D22 · Duplicate Console implementation. There are two distinct `Console` types in different modules (`llrt_core.modules.console` and `llrt_console`) with identical method signatures. This suggests redundant code or a namespace collision that could confuse users about which console instance is active.
D22 · Inconsistent return types for string extraction. `get_coerced_string_bytes` returns `u8` (likely a pointer or handle), while `get_string_bytes` returns a `Result`. This inconsistency makes it difficult to handle errors uniformly when extracting string data from values.
D22 · Fragmented error throwing methods. There are four distinct methods for throwing errors from a Result, differentiated only by the type of error or message handling. This forces users to choose the correct method based on subtle distinctions rather than a single, flexible API.
A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.
0.8× (at 56% quality) — the last 20% of quality is most of the work
Size & shape
Medium · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
This codebase represents roughly ~0.5 person-years of build effort (about ~€71,000 to rebuild). Its weakest lens is Readiness at 55% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Low (×0.9) — library/CLI × a 0.8× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Resolve the 4 No assertions (empty test) finding(s) in Test Quality — start with jest-expect.test.ts (3), dynamodb.e2e.test.ts.
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.
Value concentrated against a weak lens · Medium · Value at risk
This is a Medium asset (~0.5 person-years to rebuild), and its weakest lens is Readiness at 55%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Readiness first — highest risk-reduction per euro on an asset this size.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: 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. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ 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.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture — module dependency matrix
Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)
281 modules, 250 dependencies. 3 dependency cycles across 12 modules, marked above the diagonal.
Showing the 40 most-connected modules; 241 more are not drawn.
Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
llrt_stream_web.queuing_strategy uses llrt_utils.primordials. Changing llrt_utils.primordials can break llrt_stream_web.queuing_strategy, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
17→25 llrt_stream_web.readable.objects depends on llrt_stream_web.readable.controllercycle✕
Type pairs
1 distinct (type in llrt_stream_web.readable.objects → type in llrt_stream_web.readable.controller) reference.
llrt_stream_web.readable.objects uses llrt_stream_web.readable.controller. Changing llrt_stream_web.readable.controller can break llrt_stream_web.readable.objects, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
18→10 llrt_stream_web.utils.promise depends on llrt_utils.primordials✕
Type pairs
1 distinct (type in llrt_stream_web.utils.promise → type in llrt_utils.primordials) reference.
llrt_crypto.subtle.key_algorithm uses llrt_crypto.subtle.crypto_key. Changing llrt_crypto.subtle.crypto_key can break llrt_crypto.subtle.key_algorithm, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
22→31 llrt_crypto.subtle.key_algorithm depends on llrt_crypto.subtlecycle✕
Type pairs
1 distinct (type in llrt_crypto.subtle.key_algorithm → type in llrt_crypto.subtle) reference.
llrt_stream_web.readable.controller uses llrt_stream_web.readable.objects. Changing llrt_stream_web.readable.objects can break llrt_stream_web.readable.controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
26→5 llrt_stream_web.writable.default_controller depends on llrt_stream_web.writable.objects✕
Type pairs
1 distinct (type in llrt_stream_web.writable.default_controller → type in llrt_stream_web.writable.objects) reference.
llrt_stream_web.writable.default_controller uses llrt_stream_web.writable.objects. Changing llrt_stream_web.writable.objects can break llrt_stream_web.writable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
26→9 llrt_stream_web.writable.default_controller depends on llrt_utils.option✕
Type pairs
1 distinct (type in llrt_stream_web.writable.default_controller → type in llrt_utils.option) reference.
llrt_stream_web.writable.default_controller uses llrt_utils.option. Changing llrt_utils.option can break llrt_stream_web.writable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
26→10 llrt_stream_web.writable.default_controller depends on llrt_utils.primordials✕
Type pairs
1 distinct (type in llrt_stream_web.writable.default_controller → type in llrt_utils.primordials) reference.
llrt_stream_web.writable.default_controller uses llrt_utils.primordials. Changing llrt_utils.primordials can break llrt_stream_web.writable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
26→16 llrt_stream_web.writable.default_controller depends on llrt_stream_web.queuing_strategy✕
Type pairs
2 distinct (type in llrt_stream_web.writable.default_controller → type in llrt_stream_web.queuing_strategy) references.
llrt_stream_web.writable.default_controller uses llrt_stream_web.queuing_strategy. Changing llrt_stream_web.queuing_strategy can break llrt_stream_web.writable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
26→18 llrt_stream_web.writable.default_controller depends on llrt_stream_web.utils.promise✕
Type pairs
3 distinct (type in llrt_stream_web.writable.default_controller → type in llrt_stream_web.utils.promise) references.
llrt_stream_web.writable.default_controller uses llrt_stream_web.utils.promise. Changing llrt_stream_web.utils.promise can break llrt_stream_web.writable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
27→19 llrt_temporal.zoned_date_time depends on llrt_temporal.instant✕
Type pairs
1 distinct (type in llrt_temporal.zoned_date_time → type in llrt_temporal.instant) reference.
llrt_temporal.zoned_date_time uses llrt_temporal.plain_date_time. Changing llrt_temporal.plain_date_time can break llrt_temporal.zoned_date_time, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
28→22 llrt_crypto.subtle.crypto_key depends on llrt_crypto.subtle.key_algorithm✕
Type pairs
1 distinct (type in llrt_crypto.subtle.crypto_key → type in llrt_crypto.subtle.key_algorithm) reference.
llrt_crypto.subtle.crypto_key uses llrt_crypto.subtle.key_algorithm. Changing llrt_crypto.subtle.key_algorithm can break llrt_crypto.subtle.crypto_key, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
29→7 llrt_fetch.fetch depends on llrt_utils.bytes✕
Type pairs
1 distinct (type in llrt_fetch.fetch → type in llrt_utils.bytes) reference.
llrt_stream_web.readable.stream.algorithms uses llrt_stream_web.utils.promise. Changing llrt_stream_web.utils.promise can break llrt_stream_web.readable.stream.algorithms, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
30→25 llrt_stream_web.readable.stream.algorithms depends on llrt_stream_web.readable.controller✕
Type pairs
2 distinct (type in llrt_stream_web.readable.stream.algorithms → type in llrt_stream_web.readable.controller) references.
llrt_stream_web.readable.stream.algorithms uses llrt_stream_web.readable.controller. Changing llrt_stream_web.readable.controller can break llrt_stream_web.readable.stream.algorithms, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
31→12 llrt_crypto.subtle depends on llrt_crypto.hash✕
Type pairs
1 distinct (type in llrt_crypto.subtle → type in llrt_crypto.hash) reference.
llrt_stream_web.readable.default_controller uses llrt_utils.option. Changing llrt_utils.option can break llrt_stream_web.readable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
32→14 llrt_stream_web.readable.default_controller depends on llrt_stream.readable✕
Type pairs
1 distinct (type in llrt_stream_web.readable.default_controller → type in llrt_stream.readable) reference.
llrt_stream_web.readable.default_controller uses llrt_stream.readable. Changing llrt_stream.readable can break llrt_stream_web.readable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
32→16 llrt_stream_web.readable.default_controller depends on llrt_stream_web.queuing_strategy✕
Type pairs
1 distinct (type in llrt_stream_web.readable.default_controller → type in llrt_stream_web.queuing_strategy) reference.
llrt_stream_web.readable.default_controller uses llrt_stream_web.queuing_strategy. Changing llrt_stream_web.queuing_strategy can break llrt_stream_web.readable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
32→30 llrt_stream_web.readable.default_controller depends on llrt_stream_web.readable.stream.algorithms✕
Type pairs
3 distinct (type in llrt_stream_web.readable.default_controller → type in llrt_stream_web.readable.stream.algorithms) references.
llrt_stream_web.readable.default_controller uses llrt_stream_web.readable.stream.algorithms. Changing llrt_stream_web.readable.stream.algorithms can break llrt_stream_web.readable.default_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
33→12 llrt_crypto.provider depends on llrt_crypto.hash✕
Type pairs
2 distinct (type in llrt_crypto.provider → type in llrt_crypto.hash) references.
llrt_crypto.subtle.derive_bits uses llrt_crypto.subtle.crypto_key. Changing llrt_crypto.subtle.crypto_key can break llrt_crypto.subtle.derive_bits, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
34→31 llrt_crypto.subtle.derive_bits depends on llrt_crypto.subtle✕
Type pairs
1 distinct (type in llrt_crypto.subtle.derive_bits → type in llrt_crypto.subtle) reference.
llrt_crypto.subtle.encryption uses llrt_crypto.subtle.encryption_algorithm. Changing llrt_crypto.subtle.encryption_algorithm can break llrt_crypto.subtle.encryption, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→7 llrt_crypto.subtle.encryption depends on llrt_utils.bytes✕
Type pairs
1 distinct (type in llrt_crypto.subtle.encryption → type in llrt_utils.bytes) reference.
llrt_crypto.subtle.encryption uses llrt_crypto.subtle.key_algorithm. Changing llrt_crypto.subtle.key_algorithm can break llrt_crypto.subtle.encryption, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→28 llrt_crypto.subtle.encryption depends on llrt_crypto.subtle.crypto_key✕
Type pairs
1 distinct (type in llrt_crypto.subtle.encryption → type in llrt_crypto.subtle.crypto_key) reference.
llrt_crypto.subtle.encryption uses llrt_crypto.subtle.crypto_key. Changing llrt_crypto.subtle.crypto_key can break llrt_crypto.subtle.encryption, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
35→31 llrt_crypto.subtle.encryption depends on llrt_crypto.subtle✕
Type pairs
1 distinct (type in llrt_crypto.subtle.encryption → type in llrt_crypto.subtle) reference.
llrt_stream_web.readable.default_reader uses llrt_stream_web.utils.promise. Changing llrt_stream_web.utils.promise can break llrt_stream_web.readable.default_reader, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→32 llrt_stream_web.readable.default_reader depends on llrt_stream_web.readable.default_controller✕
Type pairs
1 distinct (type in llrt_stream_web.readable.default_reader → type in llrt_stream_web.readable.default_controller) reference.
llrt_stream_web.readable.default_reader uses llrt_stream_web.readable.default_controller. Changing llrt_stream_web.readable.default_controller can break llrt_stream_web.readable.default_reader, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→37 llrt_stream_web.readable.default_reader depends on llrt_stream_web.readable.readercycle✕
Type pairs
2 distinct (type in llrt_stream_web.readable.default_reader → type in llrt_stream_web.readable.reader) references.
llrt_stream_web.readable.default_reader uses llrt_stream_web.readable.reader. Changing llrt_stream_web.readable.reader can break llrt_stream_web.readable.default_reader, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
37→14 llrt_stream_web.readable.reader depends on llrt_stream.readable✕
Type pairs
1 distinct (type in llrt_stream_web.readable.reader → type in llrt_stream.readable) reference.
llrt_stream_web.readable.reader uses llrt_stream_web.readable.objects. Changing llrt_stream_web.readable.objects can break llrt_stream_web.readable.reader, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
37→18 llrt_stream_web.readable.reader depends on llrt_stream_web.utils.promise✕
Type pairs
2 distinct (type in llrt_stream_web.readable.reader → type in llrt_stream_web.utils.promise) references.
llrt_stream_web.readable.reader uses llrt_stream_web.utils.promise. Changing llrt_stream_web.utils.promise can break llrt_stream_web.readable.reader, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
37→36 llrt_stream_web.readable.reader depends on llrt_stream_web.readable.default_reader✕
Type pairs
1 distinct (type in llrt_stream_web.readable.reader → type in llrt_stream_web.readable.default_reader) reference.
llrt_stream_web.readable.reader uses llrt_stream_web.readable.default_reader. Changing llrt_stream_web.readable.default_reader can break llrt_stream_web.readable.reader, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
38→7 llrt_stream_web.readable.byob_reader depends on llrt_utils.bytes✕
Type pairs
1 distinct (type in llrt_stream_web.readable.byob_reader → type in llrt_utils.bytes) reference.
llrt_stream_web.readable.byob_reader uses llrt_utils.primordials. Changing llrt_utils.primordials can break llrt_stream_web.readable.byob_reader, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
38→37 llrt_stream_web.readable.byob_reader depends on llrt_stream_web.readable.reader✕
Type pairs
1 distinct (type in llrt_stream_web.readable.byob_reader → type in llrt_stream_web.readable.reader) reference.
llrt_stream_web.readable.byob_reader uses llrt_stream_web.readable.reader. Changing llrt_stream_web.readable.reader can break llrt_stream_web.readable.byob_reader, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
39→9 llrt_stream_web.readable.byte_controller depends on llrt_utils.option✕
Type pairs
2 distinct (type in llrt_stream_web.readable.byte_controller → type in llrt_utils.option) references.
llrt_stream_web.readable.byte_controller uses llrt_utils.option. Changing llrt_utils.option can break llrt_stream_web.readable.byte_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
39→14 llrt_stream_web.readable.byte_controller depends on llrt_stream.readable✕
Type pairs
1 distinct (type in llrt_stream_web.readable.byte_controller → type in llrt_stream.readable) reference.
llrt_stream_web.readable.byte_controller uses llrt_stream.readable. Changing llrt_stream.readable can break llrt_stream_web.readable.byte_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
39→30 llrt_stream_web.readable.byte_controller depends on llrt_stream_web.readable.stream.algorithms✕
Type pairs
3 distinct (type in llrt_stream_web.readable.byte_controller → type in llrt_stream_web.readable.stream.algorithms) references.
llrt_stream_web.readable.byte_controller uses llrt_stream_web.readable.stream.algorithms. Changing llrt_stream_web.readable.stream.algorithms can break llrt_stream_web.readable.byte_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
39→38 llrt_stream_web.readable.byte_controller depends on llrt_stream_web.readable.byob_reader✕
Type pairs
3 distinct (type in llrt_stream_web.readable.byte_controller → type in llrt_stream_web.readable.byob_reader) references.
llrt_stream_web.readable.byte_controller uses llrt_stream_web.readable.byob_reader. Changing llrt_stream_web.readable.byob_reader can break llrt_stream_web.readable.byte_controller, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→9 llrt_stream_web.readable.stream depends on llrt_utils.option✕
Type pairs
1 distinct (type in llrt_stream_web.readable.stream → type in llrt_utils.option) reference.
llrt_stream_web.readable.stream uses llrt_stream_web.queuing_strategy. Changing llrt_stream_web.queuing_strategy can break llrt_stream_web.readable.stream, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→17 llrt_stream_web.readable.stream depends on llrt_stream_web.readable.objects✕
Type pairs
2 distinct (type in llrt_stream_web.readable.stream → type in llrt_stream_web.readable.objects) references.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.objects. Changing llrt_stream_web.readable.objects can break llrt_stream_web.readable.stream, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→18 llrt_stream_web.readable.stream depends on llrt_stream_web.utils.promise✕
Type pairs
2 distinct (type in llrt_stream_web.readable.stream → type in llrt_stream_web.utils.promise) references.
llrt_stream_web.readable.stream uses llrt_stream_web.utils.promise. Changing llrt_stream_web.utils.promise can break llrt_stream_web.readable.stream, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→25 llrt_stream_web.readable.stream depends on llrt_stream_web.readable.controller✕
Type pairs
1 distinct (type in llrt_stream_web.readable.stream → type in llrt_stream_web.readable.controller) reference.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.controller. Changing llrt_stream_web.readable.controller can break llrt_stream_web.readable.stream, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→30 llrt_stream_web.readable.stream depends on llrt_stream_web.readable.stream.algorithms✕
Type pairs
3 distinct (type in llrt_stream_web.readable.stream → type in llrt_stream_web.readable.stream.algorithms) references.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.stream.algorithms. Changing llrt_stream_web.readable.stream.algorithms can break llrt_stream_web.readable.stream, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→36 llrt_stream_web.readable.stream depends on llrt_stream_web.readable.default_reader✕
Type pairs
1 distinct (type in llrt_stream_web.readable.stream → type in llrt_stream_web.readable.default_reader) reference.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.default_reader. Changing llrt_stream_web.readable.default_reader can break llrt_stream_web.readable.stream, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→37 llrt_stream_web.readable.stream depends on llrt_stream_web.readable.reader✕
Type pairs
2 distinct (type in llrt_stream_web.readable.stream → type in llrt_stream_web.readable.reader) references.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.reader. Changing llrt_stream_web.readable.reader can break llrt_stream_web.readable.stream, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→38 llrt_stream_web.readable.stream depends on llrt_stream_web.readable.byob_reader✕
Type pairs
2 distinct (type in llrt_stream_web.readable.stream → type in llrt_stream_web.readable.byob_reader) references.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.byob_reader. Changing llrt_stream_web.readable.byob_reader can break llrt_stream_web.readable.stream, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
At a glance — Code Health · 59% · Adequate · gated by X5 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2021 — Injection
38
High / Critical
A06:2021 — Vulnerable & Outdated Components
22
High / Critical
Roadmap
First, secure the release process by implementing draft releases or manual gates to prevent bad builds from reaching users. Next, clean up the codebase by removing unused dependencies, explicitly declaring imports, and enforcing strict import boundaries to eliminate cross-layer violations. Finally, ensure production reliability by extending structured logging to all runnable modules and correcting dependency directions so that domain logic remains independent of infrastructure details.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 4 No assertions (empty test) finding(s) in Test Quality — start with jest-expect.test.ts (3), dynamodb.e2e.test.ts.
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.
Test Quality: No assertions (empty test): should have value
tests/e2e/s3.e2e.test.ts
6.6
Mixed
Explicit Debt: TodoComment
modules/llrt_url/src/url_search_params.rs
6.7
Mixed
Explicit Debt: TodoComment
How the grades work
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 54
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 — 477
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 — 23
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 27
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. 51 of 55 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. 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 — 55 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, 513 of 554 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.
D10 Test 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. The 1,121 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 9 test source file(s) (.rs) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — 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 reliability NOT SCORED: this repository's production source includes .rs, and the built-in reliability runner cannot re-run the .rs test suite(s) — so reliability was not measured for the repository as a whole. The JavaScript/TypeScript (vitest via `yarn install --immutable --mode=skip-build` in the repository root (956 tests)): measured (0 flaky) suite(s) did re-run, and came back with 0 flaky across 1 measured tier(s) — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — test reliability is excluded from the score rather than counted.
D14 License Compliance — 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 repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D15 Churn × Complexity Hotspots — 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. A hotspot's complexity is meant to be the worst body its churn actually touched. For modules/llrt_exceptions/src/lib.rs that could not be established — the complexity reader for the file reports no body extents, or the history carries no per-line attribution — so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
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. `types/console.d.ts`, `types/stream/web.d.ts`, `types/util.d.ts` 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.
ED5 Idempotency — 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 finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
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.
X1 Async correctness — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X12 Unreachable branch — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X13 Undrained process stream — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X14 Bypassable address classification — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X15 Unvalidated length from an untrusted reader — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X16 Unfloored truncation loop — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X17 Uncapped recursion over a caller-supplied document — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X18 Disposal-pattern correctness — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X19 Unrestored process-global state — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X20 Mistyped argument guard — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X21 Side-effecting pattern guard — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X23 Unguarded diagnostic materialisation — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X25 Inert configuration knob — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X26 Unsynchronised callback handoff — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X27 Collection changed while being enumerated — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X28 Index access outside its own emptiness guard — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X29 Per-element action decided by a fixed element — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X30 Support guard that admits what it rejects — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X32 Type resolved by simple name across every loaded assembly — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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: 4 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
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 is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
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.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (4): D19, D21, D22, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
55 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was llrt_fetch::request::assign_request at 60. A further 14 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 llrt_intl::cldr_data::get_locale_data at 62 — they are counted neither in the figure above nor in this dimension's score. 9 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: modules/llrt_intl/src/cldr_data.rs (llrt_intl::cldr_data::get_locale_data at 62), modules/llrt_util/src/style_text.rs (llrt_util::style_text::ansi_codes at 45), modules/llrt_crypto/src/provider/rust/mod.rs (RustCryptoProvider::aes_encrypt at 35), modules/llrt_exceptions/src/lib.rs (DOMExceptionName::as_str at 34), libs/llrt_encoding/src/lib.rs (llrt_encoding::index_windows_1252 at 28), and 4 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 28 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 llrt_modules finding(s) in Cyclomatic Complexity — start with resolver.rs (4), require.rs. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 llrt_fetch finding(s) in Cyclomatic Complexity — start with fetch.rs (2), request.rs, response.rs. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 3 llrt_logging finding(s) in Cyclomatic Complexity — start with lib.rs (3). — One of this dimension's main actionable groups (3 warning-level).
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.
+ 39 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 9 llrt_modules finding(s) in Cognitive Complexity — start with resolver.rs (8), require.rs. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 8 llrt_fetch finding(s) in Cognitive Complexity — start with fetch.rs (4), request.rs, response.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 6 llrt_crypto finding(s) in Cognitive Complexity — start with key_algorithm.rs (3), encryption.rs, export_key.rs. — One of this dimension's main actionable groups (6 warning-level).
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.4 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 19 FileTooLong finding(s) in God Classes — start with mod.rs (3), default_controller.rs (2), key_algorithm.rs. — One of this dimension's main actionable groups (19 warning-level).
Resolve the 15 FunctionTooLong finding(s) in God Classes — start with lib.rs (3), jest-expect.ts, clone.rs. — One of this dimension's main actionable groups (15 warning-level).
Resolve the 9 MethodTooLong finding(s) in God Classes — start with tee.rs (4), pipe.rs, key_algorithm.rs. — One of this dimension's main actionable groups (9 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
146 duplicated block group(s) detected. A further 5 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 2 of the 151 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 49 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 24 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with openssl.rs (6), mod.rs (2), plain_date.rs (2). — One of this dimension's main actionable groups (24 warning-level).
Resolve the 13 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with mod.rs (3), openssl.rs (2), resolver.rs. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 12 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with read_dir.rs (4), file_handle.rs (3), key_algorithm.rs (2). — One of this dimension's main actionable groups (12 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.0 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
47 production modules (Cargo+npm), 0 dependency cycle(s), 6 unstable depended-on module(s). Read from the build's own module declarations; 4 module(s) off the main sequence, with abstractness counted on 40 of the 47 (the rest declare no modelled class or interface, export only macros, or have no source directory of their own).
Off the main sequence: llrt_tls · ×4
Unstable project llrt_child_process
Unstable project llrt_crypto
Unstable project llrt_fetch
Unstable project llrt_modules
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 4 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 1 Unstable project llrt_child_process finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project llrt_crypto 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.
D9 · Test Distribution9.7 / 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.
1387 test methods: 1355 unit, 0 integration, 0 BDD, 32 e2e. The JavaScript/TypeScript suite contributes 1121 `it`/`test` case(s) across 60 test file(s) declaring at least one; its tier split is read from package names and paths only. The Rust suite contributes 266 `#[test]` function(s) across 45 file(s) declaring at least one; its unit/integration split is Cargo's own — 0 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality9.5 / 10Adequategated by 4 critical 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.
5 skipped (5 with a documented reason), 31 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 1121 tests. Measured on the JavaScript/TypeScript suite only — at least 9 test source file(s) (.rs) went unread, so its test quality is unmeasured and is not in these counts.
No assertions (empty test): is using a random TableName=${TableName} · ×4tests/e2e/dynamodb.e2e.test.ts:506
No assertions: can batch write · ×27tests/e2e/dynamodb.e2e.test.ts:537
Skipped (documented): If you use offset: `use`, then the offset will be used as-is to obtain the exact time first, and then recalculate the offset · ×5tests/unit/temporal.zoneddatetime.test.ts:485
What to do
Resolve the 4 No assertions (empty test) finding(s) in Test Quality — start with jest-expect.test.ts (3), dynamodb.e2e.test.ts. — One of this dimension's main actionable groups (4 issue-level).
Resolve the 27 No assertions finding(s) in Test Quality — start with require.test.ts (8), executable.test.ts (4), dynamodb.e2e.test.ts (3). — One of this dimension's main actionable groups (27 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.
2 outdated, 0 yanked direct Cargo dependencies. Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Outdated: http · ×2
✓ On the Gold path — maintain.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 379 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares package.json, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
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: modules/llrt_crypto/src/subtle/key_algorithm.rs (28×20=560); modules/llrt_exceptions/src/lib.rs (8×34=272); modules/llrt_crypto/src/subtle/export_key.rs (10×27=270) Repeated repair below the complexity floor: modules/llrt_crypto/src/subtle/mod.rs (9 of 13 changes were fixes); modules/llrt_crypto/src/subtle/verify.rs (5 of 7 changes were fixes); modules/llrt_crypto/src/subtle/encryption_algorithm.rs (5 of 6 changes were fixes)
Resolve the 8 Hotspot finding(s) in Churn × Complexity Hotspots — start with key_algorithm.rs, lib.rs, export_key.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 8 Repeated repair finding(s) in Churn × Complexity Hotspots — start with mod.rs, verify.rs, encryption_algorithm.rs. — One of this dimension's main actionable groups (8 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.8 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
21 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is modules/llrt_stream_web/src/readable/byte_controller.rs. Counted over 176 of the 261 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1 · ×2
Further sole-owners (lower concentration)
What to do
Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
18 deducted task-comment markers across 65981 LoC (0.0/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 14 TodoComment finding(s) in Explicit Debt — start with lib.rs (5), s3.e2e.test.ts (4), server.rs (2). — One of this dimension's main actionable groups (14 warning-level).
Resolve the 2 FixmeComment finding(s) in Explicit Debt — start with lib.rs (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 HackComment finding(s) in Explicit Debt — start with loader.rs (2). — One of this dimension's main actionable groups (2 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: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README is excellent: it states what LLRT is (a lightweight Rust/QuickJS runtime with startup ~10x faster than other runtimes on AWS Lambda), gives a strong one-line benchmark comparison, warns it is experimental, and links CI/release workflows. It also documents the four recommended deployment options for Lambda functions plus an exhaustive architecture outline of Option 1 through Option 5 (Custom Runtime, Layer, Container Image, SAM, CDK) and dozens of sub-options such as WSL2 setup, crypto/back-end choices, and a compatibility matrix. The llrt_modules README is focused on the modules directory, documenting it as a meta-module over rquickjs modules rather than the repository; its Usage section shows how to clone the repo and import it locally with a Cargo.toml dependency (llrt_modules = path), which is an internal-focused Cargo build step not exposed in any usage example. The benchmarks/v8-v7 README, example/llrt-sam, and modules directories are all focused on their own subdirectories rather than the repository root, so they do not fall under missing-overview or missing-installation.
✓ 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 names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
0 naming inconsistencies across 0 sampled symbols.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md.
Do you agree with this assessment?
D22 · Internal API ConsistencyWeak◐ Sampled · advisory
What it measures: Whether the internal API surface is consistent and coherent.
Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.
6 API inconsistencies across a 400-member sample of 254 exposed types.
Inconsistent return types for decoder constructors across compression modules. Most return specific typed decoders (GzDecoder, DeflateDecoder, etc.), while zstd and brotli return a generic Result, and the streaming module uses a constructor pattern with a string encoding argument instead of a generic reader. This forces consumers to handle different initialization patterns and return types depending on the algorithm.
Ambiguous naming and signature overlap in Encoder. `encode` and `encode_to_string` appear to perform similar encoding operations, but `encode_to_string` explicitly includes a `lossy` parameter while `encode` does not. It is unclear if `encode` defaults to lossy or lossless, or if it returns a different type (e.g., Vec<u8> vs String).
Inconsistent return types for hex and base64 encoding. `bytes_to_hex` and `bytes_to_b64` return `u8` (likely a bug or internal representation), while `bytes_to_hex_string` and `bytes_to_b64_string` return `String`. This creates confusion about which function to use for actual string output.
Duplicate Console implementation. There are two distinct `Console` types in different modules (`llrt_core.modules.console` and `llrt_console`) with identical method signatures. This suggests redundant code or a namespace collision that could confuse users about which console instance is active.
Inconsistent return types for string extraction. `get_coerced_string_bytes` returns `u8` (likely a pointer or handle), while `get_string_bytes` returns a `Result`. This inconsistency makes it difficult to handle errors uniformly when extracting string data from values.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 Inconsistent return types for decoder constructors across compression… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Ambiguous naming and signature overlap in Encoder. `encode` and… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Inconsistent return types for hex and base64 encoding. `bytes_to_hex`… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d22_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
38 finding(s): 0 critical, 33 high, 5 medium, 0 low. 20 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 6 file(s) — `libs/llrt_test/src/lib.rs` (line 84), `llrt/src/main.rs` (line 89, line 186), `llrt_core/src/runtime_client.rs` (line 671), `types/console.d.ts` (line 49), `types/stream/web.d.ts` (line 3, line 6, line 11, …), … (+1 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 2 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
No action in Static Analysis (SAST) — all 20 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 (20 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.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 8 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (7), REDACTED. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 6 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (6). — One of this dimension's main actionable groups (6 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).
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.
21 of 176 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is modules/llrt_intl/src/cldr_data.rs. Counted over 176 of the 261 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 4 Orphaned knowledge finding(s) in Knowledge Freshness — start with cldr_data.rs, file_handle.rs, socket.rs. — One of this dimension's main actionable groups (4 issue-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 3 Boundary-crossing change coupling finding(s) in Change Coupling — start with clone.rs, vm.rs, fetch.rs. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with index.d.ts. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
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.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 4 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
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.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
`llrt_core` is a Domain project but references `llrt_build`, a Web project. The clean-architecture rule is that dependencies point INWARD — the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in 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: members that only throw a "not implemented" exception, methods that take inputs and return a constant, async methods that never await, dead `if (false)` / `#if false` branches, and skeleton types most of whose members are holes. A real, objective slice of technical debt.
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.
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.
What to do
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 2 of 2 project(s) that lack one — worth up to 2 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).
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.
LLRT runtime is Rust/QuickJS but README claims it's built in Rust with QuickJS — reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong.
What to do
Reconcile the README with reality: LLRT runtime is Rust/QuickJS but README claims it's built in Rust with QuickJS.
Only 9/11 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `libs/llrt_test_tls`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Consider OpenTelemetry tracing/metrics (opentelemetry with tracing-opentelemetry) and a health-check endpoint (a /health route on your axum/actix router) for operability.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Dependabot is configured but does not watch `gitsubmodule` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
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.
Do you agree with this assessment?
P6 · Release Hygiene8.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
The changelog this check read carries 2 versioned entries, against a bar of 3. Counted as either an `x.y.z` string or a version-shaped section heading (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
What to do
Keep the changelog current — add a versioned entry (Keep-a-Changelog ## [x.y.z]) for each release so the history isn't a stub.
Do you agree with this assessment?
R1 · Type Safety7.8 / 10Strong✓ 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.
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.
shims/@aws-crypto/crc32.js:3 · shims/@aws-crypto/crc32c.js:3 — 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. — shims/@aws-crypto/crc32.js:3
llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:515 · llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:566 — 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. — llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:515
shims/@smithy/getAwsChunkedEncodingStream.js:36 · shims/@smithy/getAwsChunkedEncodingStream.js:77 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — shims/@smithy/getAwsChunkedEncodingStream.js:36
llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:79 · llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:434 — 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. — llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:79
llrt_core/src/modules/js/stream.ts:89 · llrt_core/src/modules/js/stream.ts:119 — 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. — llrt_core/src/modules/js/stream.ts:89
llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:244 · llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:257 · llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:270 — 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. — llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:244
REDACTED:107 · REDACTED:123 — 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. — REDACTED:107
REDACTED:124 · REDACTED:238 — the two spans are one implementation copied and then locally edited — 93 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. — REDACTED:124
REDACTED:142 · REDACTED:295 — the two spans are one implementation copied and then locally edited — 57 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. — REDACTED:142
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.
llrt_core/src/modules/js/stream.ts:5 imports readable-stream/lib/_stream_readable.js, 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. — llrt_core/src/modules/js/stream.ts:5
llrt_core/src/modules/js/stream.ts:7 imports readable-stream/lib/_stream_writable.js, 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. — llrt_core/src/modules/js/stream.ts:7
llrt_core/src/modules/js/stream.ts:9 imports readable-stream/lib/_stream_duplex.js, 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. — llrt_core/src/modules/js/stream.ts:9
llrt_core/src/modules/js/stream.ts:11 imports readable-stream/lib/_stream_transform.js, 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. — llrt_core/src/modules/js/stream.ts:11
llrt_core/src/modules/js/stream.ts:13 imports readable-stream/lib/_stream_passthrough.js, 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. — llrt_core/src/modules/js/stream.ts:13
llrt_core/src/modules/js/stream.ts:15 imports readable-stream/lib/internal/streams/end-of-stream.js, 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. — llrt_core/src/modules/js/stream.ts:15
llrt_core/src/modules/js/stream.ts:17 imports readable-stream/lib/internal/streams/pipeline.js, 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. — llrt_core/src/modules/js/stream.ts:17
llrt_core/src/modules/js/stream/promises.ts:4 imports readable-stream/lib/stream/promises.js, 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. — llrt_core/src/modules/js/stream/promises.ts:4
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.
eq has cyclomatic complexity 37 and cognitive complexity 37; 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:79
iterableEquality has cyclomatic complexity 32 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. — REDACTED:288
(anonymous) has cyclomatic complexity 28 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tests/e2e/dynamodb.e2e.test.ts:155
(anonymous) has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:420
defaultEndpointResolver has cyclomatic complexity 21 and cognitive complexity 22; 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:237
pull has cyclomatic complexity 13 and cognitive complexity 32; 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. — shims/@smithy/getAwsChunkedEncodingStream.js:31
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files4.5 / 10Weak✓ 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.
3 file(s) over 400 lines (counted as significant lines — blank lines excluded — over production source only, tests excluded), largest first: REDACTED (695), llrt_core/src/modules/js/@llrt/expect/jest-expect.ts (599), REDACTED (460).
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
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.
This repository declares test tooling, and the ✓ above records that declaration — but tests/unit/import.test.ts cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to. — tests/unit/import.test.ts
Do you agree with this assessment?
R7 · Dead Code10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
170 file(s) (~20556 LoC) were excluded from dead-code analysis. This package's entry point(s) resolved, but the walk stopped one hop in: shims/@aws-sdk/signature-v4-multi-region.js imports '../../node_modules/@aws-sdk/signature-v4-multi-region/dist-es/SignatureV4SignWithCredentials', 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.
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. — tests/unit/import.test.ts:39
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. (×3)
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.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
0/2 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
What to do
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
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.
Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 75 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
AX6 Interface segregation — no public interfaces
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release.
Install the buildx component to build images with BuildKit:
https://docs.docker.com/go/bui…; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D11 Test Reliability — Test reliability not scored — polyglot repository, one half has no runner
D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution, but this repository's production source is mostly .c, .rs, .ts, .tsx, which the C#/VB workspace does not load — the projects that loaded are an immaterial minority, so solution shape was not assessed for this repository. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D23 Boundary Type-Coupling — At only 65k LoC across 2 projects this is a small multi-module codebase that clearly needs boundaries. No bounded-context organisation was detected either — neither a context-shaped layout nor 2+ sibling source directories each declaring an aggregate root. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — symbol resolution incomplete — navigability not assessed
D32 Data Compliance (PII/GDPR) — 3 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
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 JavaScript/TypeScript half could not be measured — the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (16 value object(s))
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF2 Allocation hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF3 Async & latency hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
R4 Test Coverage — 145 test file(s) reach none of 19 production file(s) via imports — exercised outside the JS import graph (integration/bundled), not import-reachable
S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — 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
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
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 reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, 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.
D10 · Test Quality· No assertions (empty test) · ×4
No assertions (empty test): is using a random TableName=${TableName} tests/e2e/dynamodb.e2e.test.ts:506— Test method has an empty body — it asserts nothing and exercises no code.
No assertions (empty test): should have value tests/unit/jest-expect.test.ts:540— Test method has an empty body — it asserts nothing and exercises no code.
No assertions (empty test): should have value tests/unit/jest-expect.test.ts:549— Test method has an empty body — it asserts nothing and exercises no code.
No assertions (empty test): should have aggregated value tests/unit/jest-expect.test.ts:563— Test method has an empty body — it asserts nothing and exercises no code.
Orphaned knowledge modules/llrt_intl/src/cldr_data.rs— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Orphaned knowledge modules/llrt_fs/src/file_handle.rs— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Orphaned knowledge modules/llrt_dgram/src/socket.rs— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge modules/llrt_stream_web/src/writable/default_writer.rs— 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.
Boundary-crossing change coupling: clone.rs ↔ console.rs libs/llrt_utils/src/clone.rs— `libs/llrt_utils/src/clone.rs` (context llrt_utils) and `llrt_core/src/modules/console.rs` (context llrt_core) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `b700f3d0` fix: Require primordials to be initialized from module once to avoid …; `b0a905d5` Update deps (#663) (at that commit the file was still `llrt_core/src/utils/clone.rs`); `07f96b4f` CJS import capability and refactor (#651) (at that commit the file was still `llrt_core/src/utils/clone.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: vm.rs ↔ require.rs llrt_core/src/vm.rs— `llrt_core/src/vm.rs` (context llrt_core) and `llrt_modules/src/module/require.rs` (context llrt_modules) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `63cbff71` refactor(require): further separation of npm-require and bytecode-req… (at that commit the file was still `llrt_core/src/modules/require/mod.rs`); `d29013f8` refactor(require/module): further separation of require and module (#… (at that commit the file was still `llrt_core/src/modules/require/mod.rs`); `48b4b4b0` chore(core/vm): clean up initial process (#931) (at that commit the file was still `llrt_core/src/modules/require/mod.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: fetch.rs ↔ lib.rs modules/llrt_fetch/src/fetch.rs— `modules/llrt_fetch/src/fetch.rs` (context llrt_fetch) and `modules/llrt_net/src/lib.rs` (context llrt_net) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `9824e416` refactor: organize net module implementation (#489) (at that commit the files were still `llrt_core/src/modules/http/fetch.rs` and `llrt_core/src/modules/net/mod.rs`); `9e8dc2ed` add support for extra ca certs (#470) (at that commit the files were still `llrt_core/src/modules/http/fetch.rs` and `llrt_core/src/modules/net/mod.rs`); `6296878e` JS lambda runtime to Rust (#260) (at that commit the files were still `src/http/fetch.rs` and `src/net/mod.rs`) — run `git show` on any of them.
Dependency-rule violation: llrt_core (Domain) → llrt_build (Web) — `llrt_core` is a Domain project but references `llrt_build`, a Web project. The clean-architecture rule is that dependencies point INWARD — the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one.
Unlisted import 'package.json' tests/unit/import.test.ts:39— Imported but not declared in any reachable package.json — installs work only by hoisting accident.
No assertions: can batch write tests/e2e/dynamodb.e2e.test.ts:537— 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: can transact write tests/e2e/dynamodb.e2e.test.ts:551— 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: can execute transactions tests/e2e/dynamodb.e2e.test.ts:567— 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 set nested timeout tests/unit/timers.test.ts:19— 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: encodings tests/unit/string_decoder.test.ts:255— 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 create a server and connect to it tests/unit/socket.test.ts:4— 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 handle server destroy tests/unit/socket.test.ts:72— 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: require builtin modules tests/unit/require.test.ts:143— 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: require `debug` module element tests/unit/require.test.ts:147— 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: require `lodash.merge` module element tests/unit/require.test.ts:151— 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: require `uuid` module element tests/unit/require.test.ts:155— 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: require `react-dom` module element tests/unit/require.test.ts:159— 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: require `@aws-lambda-powertools` module element tests/unit/require.test.ts:163— 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: require `hono/utils/url` module element tests/unit/require.test.ts:169— 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: regression testing for issue #1245 tests/unit/require.test.ts:179— 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: regression testing for issue #1492 tests/unit/import.test.ts:56— 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 access a file tests/unit/fs.test.ts:433— 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 access a file tests/unit/fs.test.ts:459— 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 access a file synchronously tests/unit/fs.test.ts:466— 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 fetch a website in parallel tests/unit/fetch.test.ts:151— 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 compile JavaScript to a self-contained executable tests/unit/executable.test.ts:55— 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 result in the correct exit code tests/unit/executable.test.ts:87— 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 result in the correct exit code passed via argument tests/unit/executable.test.ts:106— 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 log output from the executable tests/unit/executable.test.ts:125— 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 handle events emitted recursively tests/unit/events.test.ts:101— 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.
Duplicated block (6 lines × 2) llrt_core/src/modules/console.rs:361— llrt_core/src/modules/console.rs:361-366 | modules/llrt_console/src/lib.rs:150-155 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) modules/llrt_buffer/src/blob.rs:176— modules/llrt_buffer/src/blob.rs:176-181 | modules/llrt_fetch/src/body_helpers.rs:74-79 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/graviola.rs:211— modules/llrt_crypto/src/provider/graviola.rs:211-216 | modules/llrt_crypto/src/provider/graviola.rs:240-245 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/modern.rs:595— modules/llrt_crypto/src/provider/modern.rs:595-600 | modules/llrt_crypto/src/provider/rust/mod.rs:559-566 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:163— modules/llrt_crypto/src/provider/openssl.rs:163-168 | modules/llrt_crypto/src/provider/openssl.rs:391-396 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:335— modules/llrt_crypto/src/provider/openssl.rs:335-340 | modules/llrt_crypto/src/provider/openssl.rs:368-373 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:1118— modules/llrt_crypto/src/provider/openssl.rs:1118-1123 | modules/llrt_crypto/src/provider/openssl.rs:1134-1139 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:1235— modules/llrt_crypto/src/provider/openssl.rs:1235-1241 | modules/llrt_crypto/src/provider/rust/mod.rs:1548-1553 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/rust/aes_variants.rs:128— modules/llrt_crypto/src/provider/rust/aes_variants.rs:128-133 | modules/llrt_crypto/src/provider/rust/aes_variants.rs:144-149 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:753— modules/llrt_crypto/src/provider/rust/mod.rs:753-758 | modules/llrt_crypto/src/provider/rust/mod.rs:786-791 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:762— modules/llrt_crypto/src/provider/rust/mod.rs:762-767 | modules/llrt_crypto/src/provider/rust/mod.rs:795-800 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/subtle/supports.rs:97— modules/llrt_crypto/src/subtle/supports.rs:97-102 | modules/llrt_crypto/src/subtle/supports.rs:303-308 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_fetch/src/response.rs:423— modules/llrt_fetch/src/response.rs:423-428 | modules/llrt_fetch/src/response.rs:457-462 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_stream_web/src/readable/default_reader.rs:337— modules/llrt_stream_web/src/readable/default_reader.rs:337-344 | modules/llrt_stream_web/src/readable/iterator.rs:469-474 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:547— modules/llrt_stream_web/src/readable/stream/tee.rs:547-552 | modules/llrt_stream_web/src/readable/stream/tee.rs:595-600 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_temporal/src/utils/date_time.rs:44— modules/llrt_temporal/src/utils/date_time.rs:44-49 | modules/llrt_temporal/src/utils/zoned.rs:36-41 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) modules/llrt_util/src/text_encoder_stream.rs:90— modules/llrt_util/src/text_encoder_stream.rs:90-95 | modules/llrt_util/src/text_encoder_stream.rs:106-111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) llrt_core/src/runtime_client.rs:85— llrt_core/src/runtime_client.rs:85-90 | modules/llrt_timers/src/lib.rs:160-165 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) modules/llrt_temporal/src/plain_date.rs:183— modules/llrt_temporal/src/plain_date.rs:183-188 | modules/llrt_temporal/src/plain_time.rs:161-166 — before extracting anything, compare `modules/llrt_temporal/src/plain_date.rs` and `modules/llrt_temporal/src/plain_time.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) llrt_core/src/builtins_inspect.rs:45— llrt_core/src/builtins_inspect.rs:45-51 | llrt_core/src/builtins_inspect.rs:71-76 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/subtle/sign.rs:34— modules/llrt_crypto/src/subtle/sign.rs:34-39 | modules/llrt_crypto/src/subtle/verify.rs:41-46 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:215— modules/llrt_crypto/src/provider/openssl.rs:215-220 | modules/llrt_crypto/src/provider/openssl.rs:275-280 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:247— modules/llrt_crypto/src/provider/openssl.rs:247-252 | modules/llrt_crypto/src/provider/openssl.rs:300-305 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) modules/llrt_temporal/src/plain_date.rs:50— modules/llrt_temporal/src/plain_date.rs:50-55 | modules/llrt_temporal/src/plain_time.rs:44-49 — before extracting anything, compare `modules/llrt_temporal/src/plain_date.rs` and `modules/llrt_temporal/src/plain_time.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
FileTooLong: subtle/key_algorithm.rs modules/llrt_crypto/src/subtle/key_algorithm.rs— FileTooLong — 1764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 32 free functions. The bar is 500 significant lines; this is 1264 over it, 3.53× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/cldr_data.rs modules/llrt_intl/src/cldr_data.rs— FileTooLong — 1319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 819 over it, 2.64× 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: readable/byte_controller.rs modules/llrt_stream_web/src/readable/byte_controller.rs— FileTooLong — 1291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 77% of them inside a single declaration: ReadableByteStreamController (4 blocks, 46-1765). The bar is 500 significant lines; this is 791 over it, 2.58× 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: rust/mod.rs modules/llrt_crypto/src/provider/rust/mod.rs— FileTooLong — 1259 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 92% of them inside a single declaration: RustCryptoProvider (145-1653). The bar is 500 significant lines; this is 759 over it, 2.52× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: stream/tee.rs modules/llrt_stream_web/src/readable/stream/tee.rs— FileTooLong — 1240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 82% of them inside a single declaration: ReadableStream (2 blocks, 101-1692). The bar is 500 significant lines; this is 740 over it, 2.48× 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: provider/openssl.rs modules/llrt_crypto/src/provider/openssl.rs— FileTooLong — 1078 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 94% of them inside a single declaration: OpenSslProvider (108-1319). The bar is 500 significant lines; this is 578 over it, 2.16× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/response.rs modules/llrt_fetch/src/response.rs— FileTooLong — 905 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 67% of them inside a single declaration: Response (5 blocks, 119-985). The bar is 500 significant lines; this is 405 over it, 1.81× 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: provider/mod.rs modules/llrt_crypto/src/provider/mod.rs— FileTooLong — 742 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 242 over it, 1.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: stream/mod.rs modules/llrt_stream_web/src/readable/stream/mod.rs— FileTooLong — 707 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 81% of them inside a single declaration: ReadableStream (4 blocks, 147-1073). The bar is 500 significant lines; this is 207 over it, 1.41× 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: provider/modern.rs modules/llrt_crypto/src/provider/modern.rs— FileTooLong — 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 39 free functions. The bar is 500 significant lines; this is 176 over it, 1.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/fetch.rs modules/llrt_fetch/src/fetch.rs— FileTooLong — 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 154 over it, 1.31× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/request.rs modules/llrt_fetch/src/request.rs— FileTooLong — 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 60% of them inside a single declaration: Request (4 blocks, 73-625). The bar is 500 significant lines; this is 111 over it, 1.22× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/buffer.rs modules/llrt_buffer/src/buffer.rs— FileTooLong — 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 101 over it, 1.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/lib.rs libs/llrt_logging/src/lib.rs— FileTooLong — 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 95 over it, 1.19× 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: readable/default_controller.rs modules/llrt_stream_web/src/readable/default_controller.rs— FileTooLong — 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 68% of them inside a single declaration: ReadableStreamDefaultController (4 blocks, 66-739). The bar is 500 significant lines; this is 92 over it, 1.18× 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: package/resolver.rs llrt_modules/src/package/resolver.rs— FileTooLong — 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 56 over it, 1.11× 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 — 551 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 51 over it, 1.10× 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: writable/default_controller.rs modules/llrt_stream_web/src/writable/default_controller.rs— FileTooLong — 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 74% of them inside a single declaration: WritableStreamDefaultController (3 blocks, 37-720). The bar is 500 significant lines; this is 49 over it, 1.10× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/headers.rs modules/llrt_fetch/src/headers.rs— FileTooLong — 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 62% of them inside a single declaration: Headers (4 blocks, 49-586). The bar is 500 significant lines; this is 9 over it, 1.02× 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.
FunctionTooLong: jest-expect.JestChaiExpect llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:42— FunctionTooLong — JestChaiExpect runs 412 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 312 over it, 4.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: llrt_logging::format_raw_inner libs/llrt_logging/src/lib.rs:309— FunctionTooLong — llrt_logging::format_raw_inner runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15× 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: llrt_core::clone::structured_clone llrt_core/src/clone.rs:48— FunctionTooLong — llrt_core::clone::structured_clone runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: llrt_fetch::request::assign_request modules/llrt_fetch/src/request.rs:676— FunctionTooLong — llrt_fetch::request::assign_request runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: llrt_crypto::subtle::encryption::encrypt_decrypt modules/llrt_crypto/src/subtle/encryption.rs:90— FunctionTooLong — llrt_crypto::subtle::encryption::encrypt_decrypt runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: llrt_fetch::fetch::get_fetch_options modules/llrt_fetch/src/fetch.rs:742— FunctionTooLong — llrt_fetch::fetch::get_fetch_options runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: llrt_fetch::response::create_body_stream modules/llrt_fetch/src/response.rs:1128— FunctionTooLong — llrt_fetch::response::create_body_stream runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: llrt::start_cli llrt/src/main.rs:194— FunctionTooLong — llrt::start_cli runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× 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: llrt_child_process::spawn modules/llrt_child_process/src/lib.rs:368— FunctionTooLong — llrt_child_process::spawn runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 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: llrt::repl::run_repl llrt/src/repl.rs:59— FunctionTooLong — llrt::repl::run_repl runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: llrt_stream_web::readable::stream::tee::tee_pull_algorithm modules/llrt_stream_web/src/readable/stream/tee.rs:278— FunctionTooLong — llrt_stream_web::readable::stream::tee::tee_pull_algorithm runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× 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: llrt_crypto::subtle::export_key::export_jwk modules/llrt_crypto/src/subtle/export_key.rs:219— FunctionTooLong — llrt_crypto::subtle::export_key::export_jwk runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05× 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: llrt_logging::write_object libs/llrt_logging/src/lib.rs:624— FunctionTooLong — llrt_logging::write_object runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: llrt_modules::module::require::require llrt_modules/src/module/require.rs:18— FunctionTooLong — llrt_modules::module::require::require runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: llrt_json::stringify::iterate libs/llrt_json/src/stringify.rs:423— FunctionTooLong — llrt_json::stringify::iterate runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× 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.
TodoComment libs/llrt_logging/src/lib.rs:547— //TODO fix when quickjs-ng exposes these types — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment libs/llrt_numbers/src/lib.rs:154— //TODO impl round up — 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 modules/llrt_net/src/server.rs:131— ///TODO add backlog support — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment modules/llrt_net/src/server.rs:141— //TODO add backlog support — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment modules/llrt_perf_hooks/src/lib.rs:79— // // TODO: Delaying with setTimeout — 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 modules/llrt_process/src/lib.rs:346— // TODO: Delaying with setTimeout — 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 modules/llrt_process/src/lib.rs:381— // TODO: Delaying with setTimeout — 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 modules/llrt_stream_web/src/writable/default_controller.rs:128— // TODO: 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 modules/llrt_url/src/url_search_params.rs:270— // TODO: This should probably be fixed in the Url crate — 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 tests/e2e/s3.e2e.test.ts:107— // TODO FB Open a bug — 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 tests/e2e/s3.e2e.test.ts:190— //complete multipart upload // TODO FB bug here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/e2e/s3.e2e.test.ts:225— //validate multipart upload is aborted // TODO FB bug here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/e2e/s3.e2e.test.ts:268— // TODO FB — 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 tests/unit/temporal.instant.test.ts:210— // expect(instant.toString()).toBe("2021-08-01T10:40:12.345Z"); // TODO: Expected value — 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.
Duplicated block (8 lines × 2) llrt_modules/src/package/resolver.rs:294— llrt_modules/src/package/resolver.rs:294-301 | llrt_modules/src/package/resolver.rs:356-363 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:228— modules/llrt_crypto/src/provider/openssl.rs:228-235 | modules/llrt_crypto/src/provider/openssl.rs:282-289 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:404— modules/llrt_crypto/src/provider/openssl.rs:404-411 | modules/llrt_crypto/src/provider/openssl.rs:423-430 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:750— modules/llrt_crypto/src/provider/rust/mod.rs:750-757 | modules/llrt_crypto/src/provider/rust/mod.rs:759-766 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:783— modules/llrt_crypto/src/provider/rust/mod.rs:783-790 | modules/llrt_crypto/src/provider/rust/mod.rs:792-799 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_crypto/src/subtle/key_algorithm.rs:1134— modules/llrt_crypto/src/subtle/key_algorithm.rs:1134-1141 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1166-1173 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_crypto/src/subtle/supports.rs:135— modules/llrt_crypto/src/subtle/supports.rs:135-142 | modules/llrt_crypto/src/subtle/supports.rs:176-183 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_fs/src/file_handle.rs:429— modules/llrt_fs/src/file_handle.rs:429-436 | modules/llrt_fs/src/file_handle.rs:456-463 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:642— modules/llrt_stream_web/src/readable/stream/tee.rs:642-649 | modules/llrt_stream_web/src/readable/stream/tee.rs:662-669 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_stream_web/src/writable/stream/mod.rs:110— modules/llrt_stream_web/src/writable/stream/mod.rs:110-117 | modules/llrt_stream_web/src/writable/stream/mod.rs:221-228 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) modules/llrt_util/src/text_decoder_stream.rs:44— modules/llrt_util/src/text_decoder_stream.rs:44-52 | modules/llrt_util/src/text_encoder_stream.rs:35-42 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) modules/llrt_tls/src/openssl_config.rs:15— modules/llrt_tls/src/openssl_config.rs:15-22 | modules/llrt_tls/src/rustls_config.rs:38-45 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) modules/llrt_stream_web/src/readable/byte_controller.rs:1689— modules/llrt_stream_web/src/readable/byte_controller.rs:1689-1696 | modules/llrt_stream_web/src/readable/byte_controller.rs:1734-1742 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) libs/llrt_logging/src/lib.rs:674— libs/llrt_logging/src/lib.rs:674-683 | libs/llrt_logging/src/lib.rs:734-743 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) modules/llrt_crypto/src/subtle/key_algorithm.rs:1151— modules/llrt_crypto/src/subtle/key_algorithm.rs:1151-1160 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1178-1187 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) modules/llrt_crypto/src/subtle/key_algorithm.rs:1229— modules/llrt_crypto/src/subtle/key_algorithm.rs:1229-1238 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1270-1279 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) modules/llrt_fs/src/file_handle.rs:171— modules/llrt_fs/src/file_handle.rs:171-180 | modules/llrt_fs/src/file_handle.rs:317-326 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) modules/llrt_fs/src/file_handle.rs:190— modules/llrt_fs/src/file_handle.rs:190-199 | modules/llrt_fs/src/file_handle.rs:335-344 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) modules/llrt_temporal/src/utils/date.rs:36— modules/llrt_temporal/src/utils/date.rs:36-45 | modules/llrt_temporal/src/utils/date_time.rs:37-46 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) modules/llrt_fs/src/file_handle.rs:474— modules/llrt_fs/src/file_handle.rs:474-483 | modules/llrt_fs/src/read_file.rs:60-69 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) modules/llrt_fs/src/read_dir.rs:34— modules/llrt_fs/src/read_dir.rs:34-43 | modules/llrt_fs/src/stats.rs:272-281 — before extracting anything, compare `modules/llrt_fs/src/read_dir.rs` and `modules/llrt_fs/src/stats.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) modules/llrt_fs/src/read_dir.rs:45— modules/llrt_fs/src/read_dir.rs:45-54 | modules/llrt_fs/src/stats.rs:283-292 — before extracting anything, compare `modules/llrt_fs/src/read_dir.rs` and `modules/llrt_fs/src/stats.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) modules/llrt_fs/src/read_dir.rs:56— modules/llrt_fs/src/read_dir.rs:56-65 | modules/llrt_fs/src/stats.rs:294-303 — before extracting anything, compare `modules/llrt_fs/src/read_dir.rs` and `modules/llrt_fs/src/stats.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) modules/llrt_fs/src/read_dir.rs:67— modules/llrt_fs/src/read_dir.rs:67-76 | modules/llrt_fs/src/stats.rs:305-314 — before extracting anything, compare `modules/llrt_fs/src/read_dir.rs` and `modules/llrt_fs/src/stats.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) modules/llrt_temporal/src/utils/date.rs:59— modules/llrt_temporal/src/utils/date.rs:59-68 | modules/llrt_temporal/src/utils/time.rs:82-91 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:735— modules/llrt_crypto/src/provider/openssl.rs:735-745 | modules/llrt_crypto/src/provider/openssl.rs:776-786 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:754— modules/llrt_crypto/src/provider/openssl.rs:754-764 | modules/llrt_crypto/src/provider/openssl.rs:798-808 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:392— modules/llrt_crypto/src/provider/rust/mod.rs:392-402 | modules/llrt_crypto/src/provider/rust/mod.rs:451-461 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:993— modules/llrt_crypto/src/provider/rust/mod.rs:993-1003 | modules/llrt_crypto/src/provider/rust/mod.rs:1035-1045 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) modules/llrt_fetch/src/body_helpers.rs:158— modules/llrt_fetch/src/body_helpers.rs:158-168 | modules/llrt_fetch/src/body_helpers.rs:188-198 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:652— modules/llrt_stream_web/src/readable/stream/tee.rs:652-662 | modules/llrt_stream_web/src/readable/stream/tee.rs:672-682 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) modules/llrt_temporal/src/plain_date_time.rs:49— modules/llrt_temporal/src/plain_date_time.rs:49-59 | modules/llrt_temporal/src/zoned_date_time.rs:49-59 — before extracting anything, compare `modules/llrt_temporal/src/plain_date_time.rs` and `modules/llrt_temporal/src/zoned_date_time.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) modules/llrt_fetch/src/headers.rs:435— modules/llrt_fetch/src/headers.rs:435-445 | modules/llrt_fetch/src/headers.rs:484-497 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) modules/llrt_stream/src/readable.rs:362— modules/llrt_stream/src/readable.rs:362-372 | modules/llrt_stream/src/writable.rs:300-310 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) libs/llrt_test_tls/src/server.rs:92— libs/llrt_test_tls/src/server.rs:92-102 | libs/llrt_test_tls/src/server.rs:168-178 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
llrt_modules::package::resolver::package_exports_resolve (cognitive 106) llrt_modules/src/package/resolver.rs:749— llrt_modules::package::resolver::package_exports_resolve has cognitive complexity 106 (threshold 15). Drivers by points: if/else 34 (106 pts) (nesting depth added 72). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
llrt_modules::module::require::require (cognitive 40) llrt_modules/src/module/require.rs:18— llrt_modules::module::require::require has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (31 pts), loops 4 (8 pts), boolean chains 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.
llrt_modules::package::resolver::require_resolve (cognitive 34) llrt_modules/src/package/resolver.rs:118— llrt_modules::package::resolver::require_resolve has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
llrt_modules::package::resolver::load_package_exports (cognitive 33) llrt_modules/src/package/resolver.rs:567— llrt_modules::package::resolver::load_package_exports has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 3, loops 2 (3 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.
llrt_modules::package::resolver::load_node_modules (cognitive 30) llrt_modules/src/package/resolver.rs:437— llrt_modules::package::resolver::load_node_modules has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 5 (6 pts) (nesting depth added 12). Of this number, 27 points are the body's own statements and 3 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.
llrt_modules::package::resolver::load_as_file (cognitive 26) llrt_modules/src/package/resolver.rs:266— llrt_modules::package::resolver::load_as_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 1 (4 pts), boolean chains 1, loops 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.
llrt_modules::package::resolver::load_index (cognitive 24) llrt_modules/src/package/resolver.rs:335— llrt_modules::package::resolver::load_index has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 1 (4 pts), loops 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.
llrt_modules::package::resolver::load_package_self (cognitive 19) llrt_modules/src/package/resolver.rs:686— llrt_modules::package::resolver::load_package_self has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (2 pts), match/switch 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.
llrt_modules::package::resolver::package_imports_resolve (cognitive 16) llrt_modules/src/package/resolver.rs:876— llrt_modules::package::resolver::package_imports_resolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 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.
MethodTooLong: ReadableStream.readable_byte_stream_pull_with_byob_reader modules/llrt_stream_web/src/readable/stream/tee.rs:1126— MethodTooLong — readable_byte_stream_pull_with_byob_reader runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ReadableStream.readable_byte_stream_pull_with_default_reader modules/llrt_stream_web/src/readable/stream/tee.rs:802— MethodTooLong — readable_byte_stream_pull_with_default_reader runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.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.
MethodTooLong: ReadableStream.readable_stream_pipe_to modules/llrt_stream_web/src/readable/stream/pipe.rs:43— MethodTooLong — readable_stream_pipe_to runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.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.
MethodTooLong: KeyAlgorithm.from_js modules/llrt_crypto/src/subtle/key_algorithm.rs:1319— MethodTooLong — from_js runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ReadableStream.readable_byte_stream_tee modules/llrt_stream_web/src/readable/stream/tee.rs:510— MethodTooLong — readable_byte_stream_tee runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Socket.start_listening modules/llrt_dgram/src/socket.rs:106— MethodTooLong — start_listening runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ReadableStream.readable_stream_default_tee modules/llrt_stream_web/src/readable/stream/tee.rs:121— MethodTooLong — readable_stream_default_tee runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 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.
MethodTooLong: ReadableStreamBYOBReader.read modules/llrt_stream_web/src/readable/byob_reader.rs:169— MethodTooLong — read runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Request.new modules/llrt_fetch/src/request.rs:103— MethodTooLong — new runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Hotspot: modules/llrt_crypto/src/subtle/key_algorithm.rs modules/llrt_crypto/src/subtle/key_algorithm.rs:1319— modules/llrt_crypto/src/subtle/key_algorithm.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in KeyAlgorithm::from_js at line 1319. 19 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/key_algorithm.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: modules/llrt_exceptions/src/lib.rs modules/llrt_exceptions/src/lib.rs:303— modules/llrt_exceptions/src/lib.rs changed 8 times in last 90 days, max cyclomatic complexity 34 in DOMExceptionName::as_str at line 303. 4 of those changes were fix/bug commits, and the other 4 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_exceptions/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: modules/llrt_crypto/src/subtle/export_key.rs modules/llrt_crypto/src/subtle/export_key.rs:219— modules/llrt_crypto/src/subtle/export_key.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in llrt_crypto::subtle::export_key::export_jwk at line 219. 5 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/export_key.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libs/llrt_utils/src/bytes.rs libs/llrt_utils/src/bytes.rs:391— libs/llrt_utils/src/bytes.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ObjectBytes::from_array_buffer at line 391. 3 of those changes were fix/bug commits, and the other 4 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- libs/llrt_utils/src/bytes.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: modules/llrt_buffer/src/blob.rs modules/llrt_buffer/src/blob.rs:335— modules/llrt_buffer/src/blob.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in llrt_buffer::blob::process_parts at line 335. 1 of those changes was a fix/bug commit, and the other 4 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_buffer/src/blob.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: modules/llrt_crypto/src/subtle/derive_bits.rs modules/llrt_crypto/src/subtle/derive_bits.rs:42— modules/llrt_crypto/src/subtle/derive_bits.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in llrt_crypto::subtle::derive_bits::derive_bits at line 42. 5 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/derive_bits.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: modules/llrt_crypto/src/subtle/encryption.rs modules/llrt_crypto/src/subtle/encryption.rs:90— modules/llrt_crypto/src/subtle/encryption.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in llrt_crypto::subtle::encryption::encrypt_decrypt at line 90. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/encryption.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: modules/llrt_fetch/src/fetch.rs modules/llrt_fetch/src/fetch.rs:191— modules/llrt_fetch/src/fetch.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in llrt_fetch::fetch::send_stream at line 191. 1 of those changes was a fix/bug commit, and the other 1 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_fetch/src/fetch.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: modules/llrt_crypto/src/subtle/mod.rs modules/llrt_crypto/src/subtle/mod.rs:209— modules/llrt_crypto/src/subtle/mod.rs changed 13 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 4 (its worst body is llrt_crypto::subtle::normalize_algorithm_name at line 209), 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(webcrypto): address review and CI failures”; “fix(webcrypto): derive shared secrets into KDF keys”; “fix(webcrypto): enforce WebIDL integer ranges”; “fix(webcrypto): validate RSA-PSS salt lengths”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: modules/llrt_crypto/src/subtle/verify.rs modules/llrt_crypto/src/subtle/verify.rs:81— modules/llrt_crypto/src/subtle/verify.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is llrt_crypto::subtle::verify::verify at line 81), 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(webcrypto): address review and CI failures”; “fix(webcrypto): compare HMAC signatures in constant time”; “fix(webcrypto): validate RSA-PSS salt lengths”; “fix(crypto): align sign and verify with WebCrypto”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/verify.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: modules/llrt_crypto/src/subtle/encryption_algorithm.rs modules/llrt_crypto/src/subtle/encryption_algorithm.rs:38— modules/llrt_crypto/src/subtle/encryption_algorithm.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is EncryptionAlgorithm::from_js at line 38), 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(webcrypto): validate AES-GCM IVs during operations”; “fix(webcrypto): reject null RSA-OAEP labels”; “fix(webcrypto): enforce WebIDL integer ranges”; “fix(crypto): support string encryption algorithm identifiers (#1717)”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/encryption_algorithm.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: modules/llrt_crypto/src/subtle/import_key.rs modules/llrt_crypto/src/subtle/import_key.rs:19— modules/llrt_crypto/src/subtle/import_key.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is llrt_crypto::subtle::import_key::subtle_import_key at line 19), 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(webcrypto): derive shared secrets into KDF keys”; “fix(webcrypto): convert key formats asynchronously”; “fix(webcrypto): follow importKey validation order”; “fix(crypto): validate JWK extractability”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/import_key.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: modules/llrt_crypto/src/subtle/sign.rs modules/llrt_crypto/src/subtle/sign.rs:61— modules/llrt_crypto/src/subtle/sign.rs changed 6 times in last 90 days and 4 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 llrt_crypto::subtle::sign::sign at line 61), 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(webcrypto): address review and CI failures”; “fix(webcrypto): validate RSA-PSS salt lengths”; “fix(crypto): align sign and verify with WebCrypto”; “fix(crypto): Add WPT tests and improve deriveBits and deriveKey compatibility (#1704)”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/sign.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: modules/llrt_crypto/src/subtle/sign_algorithm.rs modules/llrt_crypto/src/subtle/sign_algorithm.rs:32— modules/llrt_crypto/src/subtle/sign_algorithm.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is SigningAlgorithm::from_js at line 32), 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(webcrypto): address review and CI failures”; “fix(webcrypto): enforce WebIDL integer ranges”; “fix(crypto): align sign and verify with WebCrypto”; “fix(crypto): support string encryption algorithm identifiers (#1717)”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/sign_algorithm.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: modules/llrt_crypto/src/subtle/derive_keys.rs modules/llrt_crypto/src/subtle/derive_keys.rs:65— modules/llrt_crypto/src/subtle/derive_keys.rs changed 5 times in last 90 days and 3 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 llrt_crypto::subtle::derive_keys::derive_key at line 65), 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(webcrypto): derive shared secrets into KDF keys”; “fix(webcrypto): enforce HMAC key length constraints”; “fix(crypto): Add WPT tests and improve encrypt and decrypt compatibility (#1710)”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/derive_keys.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: modules/llrt_crypto/src/subtle/wrapping.rs modules/llrt_crypto/src/subtle/wrapping.rs:53— modules/llrt_crypto/src/subtle/wrapping.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is llrt_crypto::subtle::wrapping::subtle_unwrap_key at line 53), 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(webcrypto): convert key formats asynchronously”; “fix(crypto): Allow `Uint8Array` for `wrappedKey` in `crypto.unwrapKey`”; “fix(crypto): Add WPT tests and improve deriveBits and deriveKey compatibility (#1704)”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 10:07:21 +02:00' --until='2026-09-28 10:07:21 +02:00' --full-history --no-merges -- modules/llrt_crypto/src/subtle/wrapping.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
llrt_fetch::fetch::get_fetch_options (cognitive 116) modules/llrt_fetch/src/fetch.rs:742— llrt_fetch::fetch::get_fetch_options has cognitive complexity 116 (threshold 15). Drivers by points: if/else 38 (101 pts), match/switch 3 (10 pts), boolean chains 5 (nesting depth added 70). 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.
llrt_fetch::request::assign_request (cognitive 113) modules/llrt_fetch/src/request.rs:676— llrt_fetch::request::assign_request has cognitive complexity 113 (threshold 15). Drivers by points: if/else 55 (105 pts), boolean chains 8 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_fetch::response::create_body_stream (cognitive 52) modules/llrt_fetch/src/response.rs:1128— llrt_fetch::response::create_body_stream has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 8 (21 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_fetch::fetch::send_stream (cognitive 29) modules/llrt_fetch/src/fetch.rs:191— llrt_fetch::fetch::send_stream has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 4 (10 pts), loops 3 (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.
llrt_fetch::fetch::build_request (cognitive 28) modules/llrt_fetch/src/fetch.rs:548— llrt_fetch::fetch::build_request has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_fetch::body_helpers::collect_readable_stream (cognitive 20) modules/llrt_fetch/src/body_helpers.rs:147— llrt_fetch::body_helpers::collect_readable_stream has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_fetch::fetch::send (cognitive 19) modules/llrt_fetch/src/fetch.rs:401— llrt_fetch::fetch::send has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_fetch::headers::normalize_header_value_inplace (cognitive 18) modules/llrt_fetch/src/headers.rs:679— llrt_fetch::headers::normalize_header_value_inplace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), boolean chains 6, loops 3, 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.
ClassTooLong: RustCryptoProvider modules/llrt_crypto/src/provider/rust/mod.rs:143— ClassTooLong — 1164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods. The bar is 400 significant lines; this is 764 over it, 2.91× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: OpenSslProvider modules/llrt_crypto/src/provider/openssl.rs:24— ClassTooLong — 1008 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods. The bar is 400 significant lines; this is 608 over it, 2.52× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ReadableByteStreamController modules/llrt_stream_web/src/readable/byte_controller.rs:46— ClassTooLong — 990 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 43 methods, 4 blocks, lines 46-1765. The bar is 400 significant lines; this is 590 over it, 2.48× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Response modules/llrt_fetch/src/response.rs:119— ClassTooLong — 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 26 methods, 5 blocks, lines 119-985. The bar is 400 significant lines; this is 210 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ReadableStream modules/llrt_stream_web/src/readable/stream/mod.rs:147— ClassTooLong — 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 38 methods, 4 blocks, lines 147-1073. The bar is 400 significant lines; this is 175 over it, 1.44× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: WritableStream modules/llrt_stream_web/src/writable/stream/mod.rs:41— ClassTooLong — 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 26 methods, 4 blocks, lines 41-774. The bar is 400 significant lines; this is 18 over it, 1.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: WritableStreamDefaultController modules/llrt_stream_web/src/writable/default_controller.rs:37— ClassTooLong — 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 3 blocks, lines 37-720. The bar is 400 significant lines; this is 9 over it, 1.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ReadableStreamDefaultController modules/llrt_stream_web/src/readable/default_controller.rs:66— ClassTooLong — 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 20 methods, 4 blocks, lines 66-739. The bar is 400 significant lines; this is 5 over it, 1.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (12 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:440— modules/llrt_crypto/src/provider/openssl.rs:440-451 | modules/llrt_crypto/src/provider/openssl.rs:506-517 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:454— modules/llrt_crypto/src/provider/openssl.rs:454-465 | modules/llrt_crypto/src/provider/openssl.rs:520-531 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) modules/llrt_fetch/src/request.rs:289— modules/llrt_fetch/src/request.rs:289-300 | modules/llrt_fetch/src/response.rs:357-368 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) modules/llrt_fetch/src/request.rs:527— modules/llrt_fetch/src/request.rs:527-538 | modules/llrt_fetch/src/response.rs:595-606 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) modules/llrt_stream_web/src/readable/byte_controller.rs:1633— modules/llrt_stream_web/src/readable/byte_controller.rs:1633-1644 | modules/llrt_stream_web/src/readable/default_controller.rs:606-617 — before extracting anything, compare `modules/llrt_stream_web/src/readable/byte_controller.rs` and `modules/llrt_stream_web/src/readable/default_controller.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:878— modules/llrt_stream_web/src/readable/stream/tee.rs:878-889 | modules/llrt_stream_web/src/readable/stream/tee.rs:1225-1236 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) modules/llrt_crypto/src/subtle/encryption.rs:30— modules/llrt_crypto/src/subtle/encryption.rs:30-41 | modules/llrt_crypto/src/subtle/encryption.rs:56-67 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) llrt_modules/src/package/resolver.rs:321— llrt_modules/src/package/resolver.rs:321-332 | llrt_modules/src/package/resolver.rs:383-394 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Boundary violation [package:third-party-deep-import] llrt_core/src/modules/js/stream.ts:5— llrt_core/src/modules/js/stream.ts:5 imports readable-stream/lib/_stream_readable.js, 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:third-party-deep-import] llrt_core/src/modules/js/stream.ts:7— llrt_core/src/modules/js/stream.ts:7 imports readable-stream/lib/_stream_writable.js, 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:third-party-deep-import] llrt_core/src/modules/js/stream.ts:9— llrt_core/src/modules/js/stream.ts:9 imports readable-stream/lib/_stream_duplex.js, 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:third-party-deep-import] llrt_core/src/modules/js/stream.ts:11— llrt_core/src/modules/js/stream.ts:11 imports readable-stream/lib/_stream_transform.js, 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:third-party-deep-import] llrt_core/src/modules/js/stream.ts:13— llrt_core/src/modules/js/stream.ts:13 imports readable-stream/lib/_stream_passthrough.js, 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:third-party-deep-import] llrt_core/src/modules/js/stream.ts:15— llrt_core/src/modules/js/stream.ts:15 imports readable-stream/lib/internal/streams/end-of-stream.js, 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:third-party-deep-import] llrt_core/src/modules/js/stream.ts:17— llrt_core/src/modules/js/stream.ts:17 imports readable-stream/lib/internal/streams/pipeline.js, 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:third-party-deep-import] llrt_core/src/modules/js/stream/promises.ts:4— llrt_core/src/modules/js/stream/promises.ts:4 imports readable-stream/lib/stream/promises.js, 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.
TooManyMethods: ZonedDateTime modules/llrt_temporal/src/zoned_date_time.rs:26— TooManyMethods — 45 methods. The bar is 30 methods; this is 15 over it, 1.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ReadableByteStreamController modules/llrt_stream_web/src/readable/byte_controller.rs:46— TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ReadableStream modules/llrt_stream_web/src/readable/stream/mod.rs:147— TooManyMethods — 38 methods, declared across 3 files: stream/mod.rs (28), stream/tee.rs (9), stream/pipe.rs (1). The bar is 30 methods; this is 8 over it, 1.27× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PlainDateTime modules/llrt_temporal/src/plain_date_time.rs:25— TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: URL modules/llrt_url/src/url_class.rs:20— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Duration modules/llrt_temporal/src/duration.rs:22— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Request modules/llrt_fetch/src/request.rs:73— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (9 lines × 2) libs/llrt_utils/src/bytes.rs:104— libs/llrt_utils/src/bytes.rs:104-112 | libs/llrt_utils/src/bytes.rs:120-128 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:637— modules/llrt_crypto/src/provider/rust/mod.rs:637-645 | modules/llrt_crypto/src/provider/rust/mod.rs:709-717 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) modules/llrt_fetch/src/response.rs:470— modules/llrt_fetch/src/response.rs:470-478 | modules/llrt_fetch/src/response.rs:484-492 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) modules/llrt_stream_web/src/readable/stream/pipe.rs:590— modules/llrt_stream_web/src/readable/stream/pipe.rs:590-598 | modules/llrt_stream_web/src/readable/stream/pipe.rs:619-627 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) modules/llrt_stream_web/src/readable/objects.rs:431— modules/llrt_stream_web/src/readable/objects.rs:431-439 | modules/llrt_stream_web/src/writable/objects.rs:101-109 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) llrt_modules/src/module/loader.rs:142— llrt_modules/src/module/loader.rs:142-150 | llrt_modules/src/module/resolver.rs:150-158 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) libs/llrt_test_tls/src/server.rs:73— libs/llrt_test_tls/src/server.rs:73-81 | libs/llrt_test_tls/src/server.rs:135-143 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
llrt_crypto::subtle::encryption::encrypt_decrypt (cognitive 31) modules/llrt_crypto/src/subtle/encryption.rs:90— llrt_crypto::subtle::encryption::encrypt_decrypt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 9 (14 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
llrt_crypto::subtle::export_key::export_jwk (cognitive 28) modules/llrt_crypto/src/subtle/export_key.rs:219— llrt_crypto::subtle::export_key::export_jwk has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 3 (5 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.
llrt_crypto::subtle::key_algorithm::from_hmac (cognitive 23) modules/llrt_crypto/src/subtle/key_algorithm.rs:617— llrt_crypto::subtle::key_algorithm::from_hmac has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 7). Of this number, 13 points are the body's own statements and 10 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.
llrt_crypto::subtle::key_algorithm::import_okp_key (cognitive 21) modules/llrt_crypto/src/subtle/key_algorithm.rs:2003— llrt_crypto::subtle::key_algorithm::import_okp_key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_crypto::subtle::derive_bits::derive_bits (cognitive 21) modules/llrt_crypto/src/subtle/derive_bits.rs:42— llrt_crypto::subtle::derive_bits::derive_bits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
llrt_crypto::subtle::key_algorithm::import_rsa_key (cognitive 19) modules/llrt_crypto/src/subtle/key_algorithm.rs:1727— llrt_crypto::subtle::key_algorithm::import_rsa_key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_modules::package::resolver::package_exports_resolve (cyclomatic 32) llrt_modules/src/package/resolver.rs:749— llrt_modules::package::resolver::package_exports_resolve has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
llrt_modules::package::resolver::require_resolve (cyclomatic 22) llrt_modules/src/package/resolver.rs:118— llrt_modules::package::resolver::require_resolve has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
llrt_modules::module::require::require (cyclomatic 20) llrt_modules/src/module/require.rs:18— llrt_modules::module::require::require 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.
llrt_modules::package::resolver::load_node_modules (cyclomatic 18) llrt_modules/src/package/resolver.rs:437— llrt_modules::package::resolver::load_node_modules has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 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.
llrt_modules::package::resolver::load_package_exports (cyclomatic 17) llrt_modules/src/package/resolver.rs:567— llrt_modules::package::resolver::load_package_exports 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.
Duplicated block (13 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:468— modules/llrt_crypto/src/provider/openssl.rs:468-480 | modules/llrt_crypto/src/provider/openssl.rs:534-546 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) modules/llrt_crypto/src/subtle/encapsulation.rs:142— modules/llrt_crypto/src/subtle/encapsulation.rs:142-154 | modules/llrt_crypto/src/subtle/encapsulation.rs:199-211 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) modules/llrt_crypto/src/subtle/key_algorithm.rs:452— modules/llrt_crypto/src/subtle/key_algorithm.rs:452-464 | modules/llrt_crypto/src/subtle/key_algorithm.rs:505-517 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) modules/llrt_crypto/src/subtle/key_algorithm.rs:1013— modules/llrt_crypto/src/subtle/key_algorithm.rs:1013-1025 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1104-1116 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) modules/llrt_stream_web/src/readable/byte_controller.rs:1584— modules/llrt_stream_web/src/readable/byte_controller.rs:1584-1596 | modules/llrt_stream_web/src/readable/default_controller.rs:539-551 — before extracting anything, compare `modules/llrt_stream_web/src/readable/byte_controller.rs` and `modules/llrt_stream_web/src/readable/default_controller.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:851— modules/llrt_crypto/src/provider/openssl.rs:851-857 | modules/llrt_crypto/src/provider/openssl.rs:866-872 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) modules/llrt_crypto/src/provider/rust/aes_variants.rs:217— modules/llrt_crypto/src/provider/rust/aes_variants.rs:217-223 | modules/llrt_crypto/src/provider/rust/aes_variants.rs:254-260 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) modules/llrt_crypto/src/subtle/sign.rs:67— modules/llrt_crypto/src/subtle/sign.rs:67-73 | modules/llrt_crypto/src/subtle/verify.rs:88-94 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) llrt_core/src/modules/console.rs:340— llrt_core/src/modules/console.rs:340-346 | modules/llrt_console/src/lib.rs:129-135 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) modules/llrt_crypto/src/subtle/encapsulation.rs:119— modules/llrt_crypto/src/subtle/encapsulation.rs:119-125 | modules/llrt_crypto/src/subtle/encapsulation.rs:172-178 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) llrt_modules/src/package/resolver.rs:782— llrt_modules/src/package/resolver.rs:782-786 | llrt_modules/src/package/resolver.rs:837-841 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:261— modules/llrt_crypto/src/provider/openssl.rs:261-265 | modules/llrt_crypto/src/provider/openssl.rs:308-312 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:692— modules/llrt_crypto/src/provider/openssl.rs:692-696 | modules/llrt_crypto/src/provider/openssl.rs:704-708 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) modules/llrt_fetch/src/request.rs:605— modules/llrt_fetch/src/request.rs:605-609 | modules/llrt_fetch/src/response.rs:1058-1062 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:1083— modules/llrt_crypto/src/provider/openssl.rs:1083-1087 | modules/llrt_crypto/src/provider/openssl.rs:1096-1100 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
llrt_fetch::request::assign_request (cyclomatic 60) modules/llrt_fetch/src/request.rs:676— llrt_fetch::request::assign_request has cyclomatic complexity 60 (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.
llrt_fetch::fetch::get_fetch_options (cyclomatic 49) modules/llrt_fetch/src/fetch.rs:742— llrt_fetch::fetch::get_fetch_options has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
llrt_fetch::response::create_body_stream (cyclomatic 25) modules/llrt_fetch/src/response.rs:1128— llrt_fetch::response::create_body_stream 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.
llrt_fetch::fetch::build_request (cyclomatic 19) modules/llrt_fetch/src/fetch.rs:548— llrt_fetch::fetch::build_request 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.
ReadableStream::do_process (cognitive 47) modules/llrt_stream/src/readable.rs:229— ReadableStream::do_process has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 3 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ReadableStream::readable_byte_stream_pull_with_byob_reader (cognitive 29) modules/llrt_stream_web/src/readable/stream/tee.rs:1126— ReadableStream::readable_byte_stream_pull_with_byob_reader has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (24 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
ReadableStream::readable_stream_pipe_to (cognitive 27) modules/llrt_stream_web/src/readable/stream/pipe.rs:43— ReadableStream::readable_stream_pipe_to has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ReadableStream::readable_byte_stream_pull_with_default_reader (cognitive 18) modules/llrt_stream_web/src/readable/stream/tee.rs:802— ReadableStream::readable_byte_stream_pull_with_default_reader has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, match/switch 2 (3 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Headers::from_value (cognitive 41) modules/llrt_fetch/src/headers.rs:367— Headers::from_value has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (35 pts), boolean chains 3, loops 1 (3 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.
Headers::from_array (cognitive 32) modules/llrt_fetch/src/headers.rs:460— Headers::from_array has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Headers::append (cognitive 22) modules/llrt_fetch/src/headers.rs:73— Headers::append has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4 (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.
Headers::set (cognitive 18) modules/llrt_fetch/src/headers.rs:190— Headers::set has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Response::new (cognitive 37) modules/llrt_fetch/src/response.rs:155— Response::new has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 3 (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.
Response::json_static (cognitive 20) modules/llrt_fetch/src/response.rs:666— Response::json_static has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 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.
Response::take_bytes (cognitive 18) modules/llrt_fetch/src/response.rs:886— Response::take_bytes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Response::body (cognitive 17) modules/llrt_fetch/src/response.rs:304— Response::body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, match/switch 1 (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.
Duplicated block (14 lines × 2) modules/llrt_fetch/src/response.rs:567— modules/llrt_fetch/src/response.rs:567-580 | modules/llrt_fetch/src/response.rs:602-615 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) modules/llrt_stream_web/src/readable/stream/mod.rs:781— modules/llrt_stream_web/src/readable/stream/mod.rs:781-794 | modules/llrt_stream_web/src/readable/stream/mod.rs:878-891 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) modules/llrt_stream_web/src/readable/byob_reader.rs:48— modules/llrt_stream_web/src/readable/byob_reader.rs:48-61 | modules/llrt_stream_web/src/readable/default_reader.rs:52-66 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:1582— modules/llrt_stream_web/src/readable/stream/tee.rs:1582-1595 | modules/llrt_stream_web/src/readable/stream/tee.rs:1664-1677 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Off the main sequence: llrt_tls — llrt_tls: 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.
Off the main sequence: llrt_exceptions — llrt_exceptions: abstractness 0.00, instability 0.20, distance 0.80 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: llrt_buffer — llrt_buffer: abstractness 0.00, instability 0.23, distance 0.77 — zone of pain — concrete and depended on by 10 project(s), so it's rigid to change.
Off the main sequence: llrt_json — llrt_json: abstractness 0.00, instability 0.29, distance 0.71 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
llrt_logging::format_raw_inner (cyclomatic 57) libs/llrt_logging/src/lib.rs:309— llrt_logging::format_raw_inner has cyclomatic complexity 57 (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.
llrt_logging::write_object (cyclomatic 31) libs/llrt_logging/src/lib.rs:624— llrt_logging::write_object 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.
llrt_logging::build_formatted_string (cyclomatic 20) libs/llrt_logging/src/lib.rs:201— llrt_logging::build_formatted_string 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.
llrt_crypto::subtle::export_key::export_jwk (cyclomatic 27) modules/llrt_crypto/src/subtle/export_key.rs:219— llrt_crypto::subtle::export_key::export_jwk 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.
llrt_crypto::subtle::encryption::encrypt_decrypt (cyclomatic 21) modules/llrt_crypto/src/subtle/encryption.rs:90— llrt_crypto::subtle::encryption::encrypt_decrypt has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
llrt_crypto::subtle::key_algorithm::from_hmac (cyclomatic 17) modules/llrt_crypto/src/subtle/key_algorithm.rs:617— llrt_crypto::subtle::key_algorithm::from_hmac has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ReadableStream::readable_byte_stream_pull_with_byob_reader (cyclomatic 23) modules/llrt_stream_web/src/readable/stream/tee.rs:1126— ReadableStream::readable_byte_stream_pull_with_byob_reader has cyclomatic complexity 23 (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.
ReadableStream::do_process (cyclomatic 19) modules/llrt_stream/src/readable.rs:229— ReadableStream::do_process 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.
ReadableStream::readable_byte_stream_pull_with_default_reader (cyclomatic 19) modules/llrt_stream_web/src/readable/stream/tee.rs:802— ReadableStream::readable_byte_stream_pull_with_default_reader has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
llrt_buffer::buffer::read_buf (cyclomatic 21) modules/llrt_buffer/src/buffer.rs:733— llrt_buffer::buffer::read_buf has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
llrt_buffer::buffer::write_buf (cyclomatic 18) modules/llrt_buffer/src/buffer.rs:640— llrt_buffer::buffer::write_buf 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.
llrt_buffer::blob::process_parts (cyclomatic 17) modules/llrt_buffer/src/blob.rs:335— llrt_buffer::blob::process_parts 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.
Headers::append (cyclomatic 18) modules/llrt_fetch/src/headers.rs:73— Headers::append 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.
Headers::from_value (cyclomatic 17) modules/llrt_fetch/src/headers.rs:367— Headers::from_value 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.
Headers::set (cyclomatic 16) modules/llrt_fetch/src/headers.rs:190— Headers::set has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
llrt_logging::format_raw_inner (cognitive 114) libs/llrt_logging/src/lib.rs:309— llrt_logging::format_raw_inner has cognitive complexity 114 (threshold 15). Drivers by points: if/else 42 (102 pts), match/switch 3 (6 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_logging::write_object (cognitive 88) libs/llrt_logging/src/lib.rs:624— llrt_logging::write_object has cognitive complexity 88 (threshold 15). Drivers by points: if/else 29 (78 pts), boolean chains 5, loops 2 (5 pts) (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.
llrt_logging::build_formatted_string (cognitive 37) libs/llrt_logging/src/lib.rs:201— llrt_logging::build_formatted_string has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 1 (7 pts), loops 2 (5 pts), boolean chains 2 (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.
llrt_core::clone::structured_clone (cognitive 84) llrt_core/src/clone.rs:48— llrt_core::clone::structured_clone has cognitive complexity 84 (threshold 15). Drivers by points: if/else 19 (59 pts), loops 5 (13 pts), match/switch 5 (12 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_core::modules::console::write_lambda_log (cognitive 79) llrt_core/src/modules/console.rs:176— llrt_core::modules::console::write_lambda_log has cognitive complexity 79 (threshold 15). Drivers by points: if/else 20 (58 pts), loops 3 (15 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
llrt_core::modules::embedded::loader::init_client_connection (cognitive 19) llrt_core/src/modules/embedded/loader.rs:182— llrt_core::modules::embedded::loader::init_client_connection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
llrt::repl::run_repl (cognitive 59) llrt/src/repl.rs:59— llrt::repl::run_repl has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (47 pts), match/switch 2 (8 pts), boolean chains 3, 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.
llrt::start_cli (cognitive 47) llrt/src/main.rs:194— llrt::start_cli has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt::run_tests (cognitive 27) llrt/src/main.rs:375— llrt::run_tests has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (5 pts), boolean chains 3 (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.
llrt_path::join_resolve_path (cognitive 55) modules/llrt_path/src/lib.rs:459— llrt_path::join_resolve_path has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (45 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 31). 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.
llrt_path::dirname (cognitive 17) modules/llrt_path/src/lib.rs:73— llrt_path::dirname has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
llrt_path::relative (cognitive 17) modules/llrt_path/src/lib.rs:382— llrt_path::relative has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_intl::pattern_formatter::format_with_pattern (cognitive 45) modules/llrt_intl/src/pattern_formatter.rs:14— llrt_intl::pattern_formatter::format_with_pattern has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (32 pts), match/switch 3 (7 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_intl::date_time_format::build_format_parts (cognitive 30) modules/llrt_intl/src/date_time_format.rs:92— llrt_intl::date_time_format::build_format_parts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
llrt_intl::date_time_format::format_date_in_timezone (cognitive 16) modules/llrt_intl/src/date_time_format.rs:421— llrt_intl::date_time_format::format_date_in_timezone has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), 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.
Socket::bind (cognitive 38) modules/llrt_dgram/src/socket.rs:304— Socket::bind has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (38 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Socket::start_listening (cognitive 34) modules/llrt_dgram/src/socket.rs:106— Socket::start_listening has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 5 (11 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Socket::connect (cognitive 29) modules/llrt_net/src/socket.rs:190— Socket::connect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (9–10 lines × 2) libs/llrt_utils/src/bytes.rs:92— libs/llrt_utils/src/bytes.rs:92-100 | libs/llrt_utils/src/bytes.rs:105-114 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–10 lines × 2) modules/llrt_crypto/src/subtle/encryption_algorithm.rs:79— modules/llrt_crypto/src/subtle/encryption_algorithm.rs:79-88 | modules/llrt_crypto/src/subtle/encryption_algorithm.rs:108-116 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–10 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:1374— modules/llrt_stream_web/src/readable/stream/tee.rs:1374-1382 | modules/llrt_stream_web/src/readable/stream/tee.rs:1389-1398 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 3) modules/llrt_crypto/src/provider/rust/mod.rs:750— modules/llrt_crypto/src/provider/rust/mod.rs:750-755 | modules/llrt_crypto/src/provider/rust/mod.rs:759-764 | modules/llrt_crypto/src/provider/rust/mod.rs:768-773 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) modules/llrt_crypto/src/provider/rust/mod.rs:783— modules/llrt_crypto/src/provider/rust/mod.rs:783-788 | modules/llrt_crypto/src/provider/rust/mod.rs:792-797 | modules/llrt_crypto/src/provider/rust/mod.rs:801-806 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) modules/llrt_events/src/event_target.rs:37— modules/llrt_events/src/event_target.rs:37-42 | modules/llrt_events/src/lib.rs:130-135 | modules/llrt_perf_hooks/src/performance.rs:44-49 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
llrt_core::clone::structured_clone (cyclomatic 34) llrt_core/src/clone.rs:48— llrt_core::clone::structured_clone 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.
llrt_core::modules::console::write_lambda_log (cyclomatic 26) llrt_core/src/modules/console.rs:176— llrt_core::modules::console::write_lambda_log has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
llrt_intl::pattern_formatter::format_with_pattern (cyclomatic 30) modules/llrt_intl/src/pattern_formatter.rs:14— llrt_intl::pattern_formatter::format_with_pattern 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.
llrt_intl::date_time_format::build_format_parts (cyclomatic 22) modules/llrt_intl/src/date_time_format.rs:92— llrt_intl::date_time_format::build_format_parts has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
llrt::repl::run_repl (cyclomatic 27) llrt/src/repl.rs:59— llrt::repl::run_repl 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.
llrt::start_cli (cyclomatic 25) llrt/src/main.rs:194— llrt::start_cli 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.
FixmeComment libs/llrt_logging/src/lib.rs:370— //FIXME can be removed if https://github.com/DelSkayn/rquickjs/pull/447 is merged
FixmeComment libs/llrt_test_tls/src/lib.rs:4— // FIXME this library is only needed until TLS is natively supported in wiremock. — 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.
HackComment llrt_core/src/modules/embedded/loader.rs:169— //hack to move, is safe since runtime is still alive in spawn — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment llrt_core/src/modules/embedded/loader.rs:247— //hack to move, is safe since runtime is still alive in spawn — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
llrt_buffer::blob::process_parts (cognitive 47) modules/llrt_buffer/src/blob.rs:335— llrt_buffer::blob::process_parts has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
llrt_buffer::buffer::write_buf (cognitive 24) modules/llrt_buffer/src/buffer.rs:640— llrt_buffer::buffer::write_buf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RustCryptoProvider::rsa_oaep_encrypt (cognitive 21) modules/llrt_crypto/src/provider/rust/mod.rs:383— RustCryptoProvider::rsa_oaep_encrypt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (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. This shape REPEATS in the file: one other method here (RustCryptoProvider::rsa_oaep_decrypt) 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.
RustCryptoProvider::rsa_oaep_decrypt (cognitive 21) modules/llrt_crypto/src/provider/rust/mod.rs:443— RustCryptoProvider::rsa_oaep_decrypt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (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. This shape REPEATS in the file: one other method here (RustCryptoProvider::rsa_oaep_encrypt) 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.
llrt_json::stringify::write_primitive2 (cognitive 20) libs/llrt_json/src/stringify.rs:208— llrt_json::stringify::write_primitive2 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1, match/switch 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.
llrt_json::stringify::iterate (cognitive 20) libs/llrt_json/src/stringify.rs:423— llrt_json::stringify::iterate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Duplicated block (20 lines × 2) modules/llrt_crypto/src/subtle/key_algorithm.rs:468— modules/llrt_crypto/src/subtle/key_algorithm.rs:468-487 | modules/llrt_crypto/src/subtle/key_algorithm.rs:521-540 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) modules/llrt_temporal/src/utils/date_time.rs:47— modules/llrt_temporal/src/utils/date_time.rs:47-66 | modules/llrt_temporal/src/utils/time.rs:42-61 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (16–17 lines × 2) libs/llrt_json/src/stringify.rs:487— libs/llrt_json/src/stringify.rs:487-503 | libs/llrt_json/src/stringify.rs:532-547 — both copies are in the same file, so extract the 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–17 lines × 2) modules/llrt_fetch/src/response.rs:821— modules/llrt_fetch/src/response.rs:821-837 | modules/llrt_fetch/src/response.rs:867-882 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) modules/llrt_child_process/src/lib.rs:559— modules/llrt_child_process/src/lib.rs:559-575 | modules/llrt_child_process/src/lib.rs:577-593 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) modules/llrt_crypto/src/subtle/key_algorithm.rs:1243— modules/llrt_crypto/src/subtle/key_algorithm.rs:1243-1259 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1284-1300 — both copies are in the same file, so extract the 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) modules/llrt_fetch/src/response.rs:905— modules/llrt_fetch/src/response.rs:905-920 | modules/llrt_fetch/src/response.rs:1001-1016 — both copies are in the same file, so extract the 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) modules/llrt_stream_web/src/readable/stream/tee.rs:857— modules/llrt_stream_web/src/readable/stream/tee.rs:857-872 | modules/llrt_stream_web/src/readable/stream/tee.rs:1193-1208 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–15 lines × 2) llrt_modules/src/package/resolver.rs:277— llrt_modules/src/package/resolver.rs:277-291 | llrt_modules/src/package/resolver.rs:341-354 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–15 lines × 2) modules/llrt_intl/src/pattern_formatter.rs:81— modules/llrt_intl/src/pattern_formatter.rs:81-95 | modules/llrt_intl/src/pattern_formatter.rs:99-112 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 3) modules/llrt_crypto/src/subtle/export_key.rs:250— modules/llrt_crypto/src/subtle/export_key.rs:250-259 | modules/llrt_crypto/src/subtle/export_key.rs:263-272 | modules/llrt_crypto/src/subtle/export_key.rs:276-285 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) modules/llrt_stream_web/src/readable/byte_controller.rs:214— modules/llrt_stream_web/src/readable/byte_controller.rs:214-223 | modules/llrt_stream_web/src/readable/default_controller.rs:202-211 | modules/llrt_stream_web/src/writable/default_controller.rs:176-185 — before extracting anything, compare `modules/llrt_stream_web/src/readable/byte_controller.rs` and `modules/llrt_stream_web/src/readable/default_controller.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 4) modules/llrt_crypto/src/provider/rust/mod.rs:397— modules/llrt_crypto/src/provider/rust/mod.rs:397-405 | modules/llrt_crypto/src/provider/rust/mod.rs:408-416 | modules/llrt_crypto/src/provider/rust/mod.rs:419-427 | modules/llrt_crypto/src/provider/rust/mod.rs:430-438 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 4) modules/llrt_crypto/src/provider/rust/mod.rs:456— modules/llrt_crypto/src/provider/rust/mod.rs:456-464 | modules/llrt_crypto/src/provider/rust/mod.rs:467-475 | modules/llrt_crypto/src/provider/rust/mod.rs:478-486 | modules/llrt_crypto/src/provider/rust/mod.rs:489-497 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) modules/llrt_crypto/src/provider/rust/mod.rs:992— modules/llrt_crypto/src/provider/rust/mod.rs:992-1000 | modules/llrt_crypto/src/provider/rust/mod.rs:1012-1020 | modules/llrt_crypto/src/provider/rust/mod.rs:1034-1042 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) modules/llrt_crypto/src/provider/rust/mod.rs:1515— modules/llrt_crypto/src/provider/rust/mod.rs:1515-1523 | modules/llrt_crypto/src/provider/rust/mod.rs:1526-1534 | modules/llrt_crypto/src/provider/rust/mod.rs:1537-1545 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 5) modules/llrt_fetch/src/request.rs:393— modules/llrt_fetch/src/request.rs:393-399 | modules/llrt_fetch/src/request.rs:426-432 | modules/llrt_fetch/src/request.rs:441-447 | modules/llrt_fetch/src/request.rs:456-462 | modules/llrt_fetch/src/request.rs:472-478 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 5) modules/llrt_temporal/src/instant.rs:33— modules/llrt_temporal/src/instant.rs:33-39 | modules/llrt_temporal/src/plain_date.rs:40-46 | modules/llrt_temporal/src/plain_date_time.rs:39-45 | modules/llrt_temporal/src/plain_time.rs:34-40 | modules/llrt_temporal/src/zoned_date_time.rs:39-45 — before extracting anything, compare `modules/llrt_temporal/src/plain_date.rs` and `modules/llrt_temporal/src/plain_date_time.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 5) modules/llrt_temporal/src/instant.rs:69— modules/llrt_temporal/src/instant.rs:69-74 | modules/llrt_temporal/src/plain_date.rs:73-78 | modules/llrt_temporal/src/plain_date_time.rs:64-69 | modules/llrt_temporal/src/plain_time.rs:67-72 | modules/llrt_temporal/src/zoned_date_time.rs:64-69 — before extracting anything, compare `modules/llrt_temporal/src/plain_date.rs` and `modules/llrt_temporal/src/plain_date_time.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 5) modules/llrt_temporal/src/instant.rs:91— modules/llrt_temporal/src/instant.rs:91-96 | modules/llrt_temporal/src/plain_date.rs:88-93 | modules/llrt_temporal/src/plain_date_time.rs:86-91 | modules/llrt_temporal/src/plain_time.rs:89-94 | modules/llrt_temporal/src/zoned_date_time.rs:106-111 — before extracting anything, compare `modules/llrt_temporal/src/plain_date.rs` and `modules/llrt_temporal/src/plain_date_time.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
jest-expect.JestChaiExpect (cyclomatic 59) llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:42— jest-expect.JestChaiExpect has cyclomatic complexity 59 (threshold 15). Most of this is not in the body itself: 2 of the 59 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 420, 405, 69, …). 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.
jest-utils.eq (cyclomatic 37) REDACTED:79— jest-utils.eq has cyclomatic complexity 37 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
StringDecoder::decode_data (cyclomatic 32) modules/llrt_string_decoder/src/string_decoder.rs:29— StringDecoder::decode_data has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
jest-utils.iterableEquality (cyclomatic 32) REDACTED:288— jest-utils.iterableEquality has cyclomatic complexity 32 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
llrt_child_process::spawn (cyclomatic 29) modules/llrt_child_process/src/lib.rs:368— llrt_child_process::spawn has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Request::new (cyclomatic 27) modules/llrt_fetch/src/request.rs:103— Request::new 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.
TextDecoder::decode (cyclomatic 25) modules/llrt_util/src/text_decoder.rs:113— TextDecoder::decode 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.
Server::listen (cyclomatic 24) modules/llrt_net/src/server.rs:132— Server::listen 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.
Response::new (cyclomatic 23) modules/llrt_fetch/src/response.rs:155— Response::new has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
llrt_path::join_resolve_path (cyclomatic 23) modules/llrt_path/src/lib.rs:459— llrt_path::join_resolve_path has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
build.defaultEndpointResolver (cyclomatic 21) REDACTED:237— build.defaultEndpointResolver 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.
KeyAlgorithm::from_js (cyclomatic 20) modules/llrt_crypto/src/subtle/key_algorithm.rs:1319— KeyAlgorithm::from_js has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ReadableStreamBYOBReader::read (cyclomatic 20) modules/llrt_stream_web/src/readable/byob_reader.rs:169— ReadableStreamBYOBReader::read has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
LookupOptions::from_js (cyclomatic 19) modules/llrt_dns/src/lookup.rs:146— LookupOptions::from_js 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.
Socket::connect (cyclomatic 19) modules/llrt_net/src/socket.rs:190— Socket::connect 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.
KeyUsage::classify_and_check_usages (cyclomatic 18) modules/llrt_crypto/src/subtle/key_algorithm.rs:120— KeyUsage::classify_and_check_usages 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.
DateTimeFormat::new (cyclomatic 18) modules/llrt_intl/src/date_time_format.rs:287— DateTimeFormat::new 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.
getAwsChunkedEncodingStream.getAwsChunkedEncodingStream (cyclomatic 18) shims/@smithy/getAwsChunkedEncodingStream.js:12— getAwsChunkedEncodingStream.getAwsChunkedEncodingStream 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.
llrt_timers::poll_timers (cyclomatic 17) modules/llrt_timers/src/lib.rs:305— llrt_timers::poll_timers 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.
llrt_json::stringify::write_primitive2 (cyclomatic 16) libs/llrt_json/src/stringify.rs:208— llrt_json::stringify::write_primitive2 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.
llrt_async_hooks::invoke_async_hook (cyclomatic 16) modules/llrt_async_hooks/src/lib.rs:230— llrt_async_hooks::invoke_async_hook 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.
FormData::from_multipart_bytes (cyclomatic 16) modules/llrt_fetch/src/form_data.rs:209— FormData::from_multipart_bytes 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.
llrt_util::text_decoder::utf8_incomplete_tail (cyclomatic 16) modules/llrt_util/src/text_decoder.rs:24— llrt_util::text_decoder::utf8_incomplete_tail 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.
StringDecoder::decode_data (cognitive 94) modules/llrt_string_decoder/src/string_decoder.rs:29— StringDecoder::decode_data has cognitive complexity 94 (threshold 15). Drivers by points: if/else 28 (77 pts), loops 3 (12 pts), boolean chains 5 (nesting depth added 58). 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.
jest-expect.JestChaiExpect (cognitive 72) llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:42— jest-expect.JestChaiExpect has cognitive complexity 72 (threshold 15). Drivers by points: if/else 36 (42 pts), boolean chains 21, ternaries 5 (7 pts), error handling 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 72 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 420, 69, 140, …). 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.
jest-utils.iterableEquality (cognitive 71) REDACTED:288— jest-utils.iterableEquality has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (48 pts), loops 6 (18 pts), boolean chains 5 (nesting depth added 44). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
Server::listen (cognitive 67) modules/llrt_net/src/server.rs:132— Server::listen has cognitive complexity 67 (threshold 15). Drivers by points: if/else 21 (62 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 42). 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.
llrt_child_process::spawn (cognitive 56) modules/llrt_child_process/src/lib.rs:368— llrt_child_process::spawn has cognitive complexity 56 (threshold 15). Drivers by points: if/else 29 (43 pts), loops 2 (7 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Request::new (cognitive 48) modules/llrt_fetch/src/request.rs:103— Request::new has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (42 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.
FormData::from_multipart_bytes (cognitive 43) modules/llrt_fetch/src/form_data.rs:209— FormData::from_multipart_bytes has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (6 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.
getAwsChunkedEncodingStream.getAwsChunkedEncodingStream (cognitive 37) shims/@smithy/getAwsChunkedEncodingStream.js:12— getAwsChunkedEncodingStream.getAwsChunkedEncodingStream has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (8 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WritableStream::process (cognitive 36) modules/llrt_stream/src/writable.rs:213— WritableStream::process has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 3 (12 pts), loops 1 (2 pts), boolean chains 1 (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.
jest-utils.eq (cognitive 36) REDACTED:79— jest-utils.eq has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 11, loops 3, match/switch 1 (nesting depth added 4). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
TextDecoder::decode (cognitive 35) modules/llrt_util/src/text_decoder.rs:113— TextDecoder::decode has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_timers::poll_timers (cognitive 33) modules/llrt_timers/src/lib.rs:305— llrt_timers::poll_timers has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 3 (8 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.
getAwsChunkedEncodingStream::pull (cognitive 32) shims/@smithy/getAwsChunkedEncodingStream.js:31— getAwsChunkedEncodingStream::pull has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (8 pts), ternaries 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LookupOptions::from_js (cognitive 31) modules/llrt_dns/src/lookup.rs:146— LookupOptions::from_js has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 2 (7 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.
llrt_util::text_decoder::utf8_incomplete_tail (cognitive 29) modules/llrt_util/src/text_decoder.rs:24— llrt_util::text_decoder::utf8_incomplete_tail has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (8 pts), loops 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
XmlNode::to_string (cognitive 28) llrt_core/src/modules/llrt/xml.rs:488— XmlNode::to_string has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (8 pts), match/switch 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.
llrt_async_hooks::invoke_async_hook (cognitive 25) modules/llrt_async_hooks/src/lib.rs:230— llrt_async_hooks::invoke_async_hook has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DateTimeFormat::new (cognitive 24) modules/llrt_intl/src/date_time_format.rs:287— DateTimeFormat::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (24 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.
MinimalTracer::enabled (cognitive 22) llrt/src/minimal_tracer.rs:91— MinimalTracer::enabled has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Blob::from_parts (cognitive 22) modules/llrt_buffer/src/blob.rs:256— Blob::from_parts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 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.
defaultEndpointResolver (cognitive 22) REDACTED:237— defaultEndpointResolver has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, ternaries 3 (5 pts) (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.
KeyUsage::classify_and_check_usages (cognitive 20) modules/llrt_crypto/src/subtle/key_algorithm.rs:120— KeyUsage::classify_and_check_usages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_os::network::get_network_interfaces (cognitive 20) modules/llrt_os/src/network.rs:17— llrt_os::network::get_network_interfaces has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llrt_url::url_format (cognitive 19) modules/llrt_url/src/lib.rs:62— llrt_url::url_format has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 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.
llrt_utils::bytes::replace_invalid_utf8_and_utf16_into (cognitive 17) libs/llrt_utils/src/bytes.rs:78— llrt_utils::bytes::replace_invalid_utf8_and_utf16_into has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PackageLoader::load_cjs_module (cognitive 17) llrt_modules/src/package/loader.rs:20— PackageLoader::load_cjs_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 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.
URLSearchParams::from_array (cognitive 16) modules/llrt_url/src/url_search_params.rs:355— URLSearchParams::from_array has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (16 pts) (nesting depth added 9). 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.
lambda-server.app.all("*") (cognitive 16) REDACTED:149— lambda-server.app.all("*") has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, loops 1 (3 pts), error handling 2 (nesting depth added 4). Of this number, 14 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.
(anonymous) (cognitive 16) REDACTED:149— (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, loops 1 (3 pts), error handling 2 (nesting depth added 4). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D22 · Internal API Consistency· Inconsistent return types for decoder constructors across compression modules. Most return specific typed decoders (GzDecoder, DeflateDecoder, etc.), while zstd and brotli return a generic Result, and the streaming module uses a constructor pattern with a string encoding argument instead of a generic reader. This forces consumers to handle different initialization patterns and return types depending on the algorithm. · ×1
Inconsistent return types for decoder constructors across compression modules. Most return specific typed decoders (GzDecoder, DeflateDecoder, etc.), while zstd and brotli return a generic Result, and the streaming module uses a constructor pattern with a string encoding argument instead of a generic reader. This forces consumers to handle different initialization patterns and return types depending on the algorithm. — Unify decoder creation to return a specific, concrete decoder type for all algorithms. If a generic interface is needed, use a trait object or enum. Ensure the streaming decoder also accepts a reader or aligns its initialization with the non-streaming counterparts. (signatures: llrt_compression.gz.decoder(r: R): GzDecoder | llrt_compression.deflate.decoder(r: R): DeflateDecoder | llrt_compression.zlib.decoder(r: R): ZlibDecoder | llrt_compression.zstd.decoder(r: R): Result | llrt_compression.brotli.decoder(r: R): BrotliDecoder | llrt_compression.streaming.StreamingDecoder.new(encoding: str): Result)
D22 · Internal API Consistency· Ambiguous naming and signature overlap in Encoder. `encode` and `encode_to_string` appear to perform similar encoding operations, but `encode_to_string` explicitly includes a `lossy` parameter while `encode` does not. It is unclear if `encode` defaults to lossy or lossless, or if it returns a different type (e.g., Vec<u8> vs String). · ×1
Ambiguous naming and signature overlap in Encoder. `encode` and `encode_to_string` appear to perform similar encoding operations, but `encode_to_string` explicitly includes a `lossy` parameter while `encode` does not. It is unclear if `encode` defaults to lossy or lossless, or if it returns a different type (e.g., Vec<u8> vs String). — Rename `encode` to `encode_to_bytes` if it returns bytes, or clarify the default behavior. If both return strings, unify into a single method with an optional `lossy` parameter or distinct names like `encode_lossy` and `encode_strict`. (signatures: llrt_encoding.Encoder.encode(bytes: &[u8]): Result | llrt_encoding.Encoder.encode_to_string(bytes: &[u8], lossy: bool): Result)
D22 · Internal API Consistency· Inconsistent return types for hex and base64 encoding. `bytes_to_hex` and `bytes_to_b64` return `u8` (likely a bug or internal representation), while `bytes_to_hex_string` and `bytes_to_b64_string` return `String`. This creates confusion about which function to use for actual string output. · ×1
Inconsistent return types for hex and base64 encoding. `bytes_to_hex` and `bytes_to_b64` return `u8` (likely a bug or internal representation), while `bytes_to_hex_string` and `bytes_to_b64_string` return `String`. This creates confusion about which function to use for actual string output. — Remove the `u8` returning functions if they are not intended for public use, or rename them to indicate they return a specific internal type. Ensure all public encoding functions return `String` or `Vec<u8>` consistently. (signatures: llrt_encoding.bytes_to_hex(bytes: &[u8]): u8 | llrt_encoding.bytes_to_hex_string(bytes: &[u8]): String | llrt_encoding.bytes_to_b64(bytes: &[u8]): u8 | llrt_encoding.bytes_to_b64_string(bytes: &[u8]): String)
D22 · Internal API Consistency· Duplicate Console implementation. There are two distinct `Console` types in different modules (`llrt_core.modules.console` and `llrt_console`) with identical method signatures. This suggests redundant code or a namespace collision that could confuse users about which console instance is active. · ×1
Duplicate Console implementation. There are two distinct `Console` types in different modules (`llrt_core.modules.console` and `llrt_console`) with identical method signatures. This suggests redundant code or a namespace collision that could confuse users about which console instance is active. — Consolidate into a single `Console` type. If the duplication is intentional for different contexts (e.g., internal vs public), ensure the public API exposes only one entry point. (signatures: llrt_core.modules.console.Console.log(ctx: Ctx, args: Rest): Result | llrt_console.Console.log(ctx: Ctx, args: Rest): Result)
D22 · Internal API Consistency· Inconsistent return types for string extraction. `get_coerced_string_bytes` returns `u8` (likely a pointer or handle), while `get_string_bytes` returns a `Result`. This inconsistency makes it difficult to handle errors uniformly when extracting string data from values. · ×1
Inconsistent return types for string extraction. `get_coerced_string_bytes` returns `u8` (likely a pointer or handle), while `get_string_bytes` returns a `Result`. This inconsistency makes it difficult to handle errors uniformly when extracting string data from values. — Unify return types. If both can fail, both should return `Result`. If one is guaranteed to succeed, document it clearly and consider renaming to indicate safety (e.g., `get_string_bytes_unchecked`). (signatures: llrt_utils.bytes.get_coerced_string_bytes(value: Value, offset: usize, length: usize): u8 | llrt_utils.bytes.get_string_bytes(value: Value, offset: usize, length: usize): Result)
D22 · Internal API Consistency· Fragmented error throwing methods. There are four distinct methods for throwing errors from a Result, differentiated only by the type of error or message handling. This forces users to choose the correct method based on subtle distinctions rather than a single, flexible API. · ×1
Fragmented error throwing methods. There are four distinct methods for throwing errors from a Result, differentiated only by the type of error or message handling. This forces users to choose the correct method based on subtle distinctions rather than a single, flexible API. — Provide a single `or_throw` method that accepts an optional message or error type, or use a builder pattern. Alternatively, document the specific use cases for each variant clearly to reduce cognitive load. (signatures: llrt_utils.result.ResultExt.or_throw(ctx: Ctx): Result | llrt_utils.result.ResultExt.or_throw_msg(ctx: Ctx, msg: str): Result | llrt_utils.result.ResultExt.or_throw_range(ctx: Ctx, msg: str): Result | llrt_utils.result.ResultExt.or_throw_type(ctx: Ctx, msg: str): Result)
D30 · Dependency Vulnerabilities· Medium vulnerability · ×1
Change-coupling hub: index.d.ts → REDACTED, mod.rs, lib.rs types/index.d.ts— `types/index.d.ts` changes together with 3 other files — `REDACTED`, `llrt_core/src/modules/mod.rs`, `llrt_modules/src/lib.rs` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
Near-duplicate member pair (41 shared lines) modules/llrt_crypto/src/subtle/key_algorithm.rs:920— modules/llrt_crypto/src/subtle/key_algorithm.rs:920-1027 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1037-1118 — These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (37 shared lines) modules/llrt_crypto/src/provider/openssl.rs:439— modules/llrt_crypto/src/provider/openssl.rs:439-496 | modules/llrt_crypto/src/provider/openssl.rs:505-564 — These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (34 shared lines) llrt_modules/src/package/resolver.rs:266— llrt_modules/src/package/resolver.rs:266-332 | llrt_modules/src/package/resolver.rs:335-394 — These two members are variants of one another: 34 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) modules/llrt_fetch/src/request.rs:392— modules/llrt_fetch/src/request.rs:392-406 | modules/llrt_fetch/src/request.rs:425-438 | modules/llrt_fetch/src/request.rs:440-453 | modules/llrt_fetch/src/request.rs:455-468 | modules/llrt_fetch/src/request.rs:470-482 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) modules/llrt_temporal/src/plain_date.rs:49— modules/llrt_temporal/src/plain_date.rs:49-71 | modules/llrt_temporal/src/plain_date_time.rs:48-62 | modules/llrt_temporal/src/plain_time.rs:43-65 | modules/llrt_temporal/src/zoned_date_time.rs:48-62 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (33 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:1545— modules/llrt_stream_web/src/readable/stream/tee.rs:1545-1577 | modules/llrt_stream_web/src/readable/stream/tee.rs:1627-1659 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (30–31 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:1156— modules/llrt_crypto/src/provider/rust/mod.rs:1156-1186 | modules/llrt_crypto/src/provider/rust/mod.rs:1456-1485 — both copies are in the same file, so extract the 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 (31 lines × 2) modules/llrt_fetch/src/headers.rs:82— modules/llrt_fetch/src/headers.rs:82-112 | modules/llrt_fetch/src/headers.rs:199-229 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (25 lines × 2) modules/llrt_stream_web/src/readable/byte_controller.rs:100— modules/llrt_stream_web/src/readable/byte_controller.rs:100-124 | modules/llrt_stream_web/src/readable/default_controller.rs:110-134 — before extracting anything, compare `modules/llrt_stream_web/src/readable/byte_controller.rs` and `modules/llrt_stream_web/src/readable/default_controller.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18–21 lines × 2) modules/llrt_stream_web/src/readable/byte_controller.rs:262— modules/llrt_stream_web/src/readable/byte_controller.rs:262-279 | modules/llrt_stream_web/src/readable/default_controller.rs:252-272 — before extracting anything, compare `modules/llrt_stream_web/src/readable/byte_controller.rs` and `modules/llrt_stream_web/src/readable/default_controller.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17–20 lines × 2) modules/llrt_stream_web/src/readable/byte_controller.rs:214— modules/llrt_stream_web/src/readable/byte_controller.rs:214-230 | modules/llrt_stream_web/src/readable/default_controller.rs:200-219 — before extracting anything, compare `modules/llrt_stream_web/src/readable/byte_controller.rs` and `modules/llrt_stream_web/src/readable/default_controller.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (19–20 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:832— modules/llrt_stream_web/src/readable/stream/tee.rs:832-850 | modules/llrt_stream_web/src/readable/stream/tee.rs:1159-1178 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–19 lines × 2) modules/llrt_os/src/network.rs:62— modules/llrt_os/src/network.rs:62-79 | modules/llrt_os/src/network.rs:84-102 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–18 lines × 3) modules/llrt_intl/src/date_time_format.rs:441— modules/llrt_intl/src/date_time_format.rs:441-452 | modules/llrt_intl/src/date_time_format.rs:471-483 | modules/llrt_intl/src/date_time_format.rs:487-504 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (18 lines × 2) llrt_core/src/modules/embedded/loader.rs:94— llrt_core/src/modules/embedded/loader.rs:94-111 | llrt_modules/src/package/loader.rs:61-78 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 3) modules/llrt_fetch/src/headers.rs:74— modules/llrt_fetch/src/headers.rs:74-90 | modules/llrt_fetch/src/headers.rs:191-207 | modules/llrt_fetch/src/headers.rs:251-267 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14 lines × 3) modules/llrt_crypto/src/subtle/key_algorithm.rs:879— modules/llrt_crypto/src/subtle/key_algorithm.rs:879-892 | modules/llrt_crypto/src/subtle/key_algorithm.rs:996-1009 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1087-1100 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (13–14 lines × 2) modules/llrt_crypto/src/subtle/key_algorithm.rs:969— modules/llrt_crypto/src/subtle/key_algorithm.rs:969-981 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1059-1072 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–13 lines × 2) modules/llrt_fetch/src/response.rs:922— modules/llrt_fetch/src/response.rs:922-934 | modules/llrt_fetch/src/response.rs:1018-1028 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–12 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:923— modules/llrt_crypto/src/provider/openssl.rs:923-933 | modules/llrt_crypto/src/provider/openssl.rs:936-947 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–12 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:135— modules/llrt_stream_web/src/readable/stream/tee.rs:135-146 | modules/llrt_stream_web/src/readable/stream/tee.rs:528-536 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 4) modules/llrt_temporal/src/plain_date.rs:62— modules/llrt_temporal/src/plain_date.rs:62-71 | modules/llrt_temporal/src/plain_date_time.rs:53-62 | modules/llrt_temporal/src/plain_time.rs:56-65 | modules/llrt_temporal/src/zoned_date_time.rs:53-62 — before extracting anything, compare `modules/llrt_temporal/src/plain_date.rs` and `modules/llrt_temporal/src/plain_date_time.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9–10 lines × 3) modules/llrt_crypto/src/subtle/key_algorithm.rs:857— modules/llrt_crypto/src/subtle/key_algorithm.rs:857-865 | modules/llrt_crypto/src/subtle/key_algorithm.rs:974-982 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1065-1074 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 4) modules/llrt_fetch/src/request.rs:393— modules/llrt_fetch/src/request.rs:393-400 | modules/llrt_fetch/src/request.rs:426-433 | modules/llrt_fetch/src/request.rs:441-448 | modules/llrt_fetch/src/request.rs:456-463 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) modules/llrt_crypto/src/provider/rust/mod.rs:905— modules/llrt_crypto/src/provider/rust/mod.rs:905-912 | modules/llrt_crypto/src/provider/rust/mod.rs:915-922 | modules/llrt_crypto/src/provider/rust/mod.rs:925-932 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6–7 lines × 3) modules/llrt_crypto/src/provider/openssl.rs:880— modules/llrt_crypto/src/provider/openssl.rs:880-886 | modules/llrt_crypto/src/provider/openssl.rs:905-911 | modules/llrt_crypto/src/provider/openssl.rs:1172-1177 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5–6 lines × 2) modules/llrt_fetch/src/response.rs:584— modules/llrt_fetch/src/response.rs:584-588 | modules/llrt_fetch/src/response.rs:619-624 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 11) modules/llrt_buffer/src/array_buffer_view.rs:40— modules/llrt_buffer/src/array_buffer_view.rs:40-44 | modules/llrt_buffer/src/array_buffer_view.rs:47-51 | modules/llrt_buffer/src/array_buffer_view.rs:54-58 | modules/llrt_buffer/src/array_buffer_view.rs:61-65 | modules/llrt_buffer/src/array_buffer_view.rs:68-72 | modules/llrt_buffer/src/array_buffer_view.rs:75-79 | modules/llrt_buffer/src/array_buffer_view.rs:82-86 | modules/llrt_buffer/src/array_buffer_view.rs:89-93 | modules/llrt_buffer/src/array_buffer_view.rs:96-100 | modules/llrt_buffer/src/array_buffer_view.rs:103-107 | modules/llrt_buffer/src/array_buffer_view.rs:110-114 — all 11 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (4–5 lines × 3) modules/llrt_crypto/src/provider/openssl.rs:792— modules/llrt_crypto/src/provider/openssl.rs:792-795 | modules/llrt_crypto/src/provider/openssl.rs:1115-1119 | modules/llrt_crypto/src/provider/openssl.rs:1210-1214 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 4) modules/llrt_temporal/src/instant.rs:80— modules/llrt_temporal/src/instant.rs:80-85 | modules/llrt_temporal/src/plain_date_time.rs:75-80 | modules/llrt_temporal/src/plain_time.rs:78-83 | modules/llrt_temporal/src/zoned_date_time.rs:89-94 — before extracting anything, compare `modules/llrt_temporal/src/plain_date_time.rs` and `modules/llrt_temporal/src/plain_time.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 3) modules/llrt_temporal/src/plain_date.rs:200— modules/llrt_temporal/src/plain_date.rs:200-204 | modules/llrt_temporal/src/plain_date_time.rs:237-241 | modules/llrt_temporal/src/plain_time.rs:178-182 — before extracting anything, compare `modules/llrt_temporal/src/plain_date.rs` and `modules/llrt_temporal/src/plain_date_time.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) modules/llrt_stream_web/src/readable/byte_controller.rs:1634— modules/llrt_stream_web/src/readable/byte_controller.rs:1634-1644 | modules/llrt_stream_web/src/readable/default_controller.rs:607-617 | modules/llrt_stream_web/src/writable/default_controller.rs:664-674 — before extracting anything, compare `modules/llrt_stream_web/src/readable/byte_controller.rs` and `modules/llrt_stream_web/src/readable/default_controller.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
Duplicated block (28 lines × 2 locations) shims/@aws-crypto/crc32.js:3— shims/@aws-crypto/crc32.js:3 · shims/@aws-crypto/crc32c.js:3 — 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 (23 lines × 2 locations) llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:515— llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:515 · llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:566 — 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 (18 lines × 2 locations) shims/@smithy/getAwsChunkedEncodingStream.js:36— shims/@smithy/getAwsChunkedEncodingStream.js:36 · shims/@smithy/getAwsChunkedEncodingStream.js:77 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2 locations) llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:79— llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:79 · llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:434 — 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) llrt_core/src/modules/js/stream.ts:89— llrt_core/src/modules/js/stream.ts:89 · llrt_core/src/modules/js/stream.ts:119 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (12 lines × 3 locations) llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:244— llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:244 · llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:257 · llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:270 — 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 (10 lines × 2 locations) REDACTED:107— REDACTED:107 · REDACTED:123 — 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.
R10 · Code Duplication· Duplicated block with local edits (10 matched lines × 2 locations) · ×1
Duplicated block with local edits (10 matched lines × 2 locations) REDACTED:124— REDACTED:124 · REDACTED:238 — the two spans are one implementation copied and then locally edited — 93 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 (9 matched lines × 2 locations) · ×1
Duplicated block with local edits (9 matched lines × 2 locations) REDACTED:142— REDACTED:142 · REDACTED:295 — the two spans are one implementation copied and then locally edited — 57 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.
Complex function eq (cyclomatic 37, cognitive 37) REDACTED:79— eq has cyclomatic complexity 37 and cognitive complexity 37; 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 iterableEquality (cyclomatic 32, cognitive 72) REDACTED:288— iterableEquality has cyclomatic complexity 32 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 (anonymous) (cyclomatic 28, cognitive 36) tests/e2e/dynamodb.e2e.test.ts:155— (anonymous) has cyclomatic complexity 28 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 23, cognitive 27) llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:420— (anonymous) has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function defaultEndpointResolver (cyclomatic 21, cognitive 22) REDACTED:237— defaultEndpointResolver has cyclomatic complexity 21 and cognitive complexity 22; 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 pull (cyclomatic 13, cognitive 32) shims/@smithy/getAwsChunkedEncodingStream.js:31— pull has cyclomatic complexity 13 and cognitive complexity 32; 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.
Large Files — 3 file(s) over 400 lines (counted as significant lines — blank lines excluded — over production source only, tests excluded), largest first: REDACTED (695), llrt_core/src/modules/js/@llrt/expect/jest-expect.ts (599), REDACTED (460).
R6 · Tooling· The declared test suite includes a file that cannot be loaded · ×1
The declared test suite includes a file that cannot be loaded tests/unit/import.test.ts— This repository declares test tooling, and the ✓ above records that declaration — but tests/unit/import.test.ts cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to.
Unused dependency '@aws-sdk/client-acm' — 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 '@aws-sdk/client-amplify' — 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 '@aws-sdk/client-api-gateway' — 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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 12 significant file(s) lose their only recent owner: llrt_core/src/clone.rs, modules/llrt_string_decoder/src/string_decoder.rs, modules/llrt_temporal/src/zoned_date_time.rs, modules/llrt_temporal/src/plain_date_time.rs, modules/llrt_temporal/src/duration.rs, llrt_modules/src/module/mod.rs, modules/llrt_temporal/src/instant.rs, modules/llrt_temporal/src/utils/mod.rs (+4 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 6 significant file(s) lose their only recent owner: modules/llrt_stream_web/src/readable/byte_controller.rs, modules/llrt_stream_web/src/readable/default_controller.rs, modules/llrt_stream_web/src/writable/default_controller.rs, modules/llrt_stream_web/src/readable/iterator.rs, modules/llrt_stream_web/src/utils/promise.rs, modules/llrt_util/src/style_text.rs. Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (21 single-owned of 176 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 176 of the 261 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above.
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/`.
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 17 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: modules/llrt_events/src/lib.rs, modules/llrt_intl/src/pattern_formatter.rs, modules/llrt_stream_web/src/readable/objects.rs, modules/llrt_stream_web/src/readable/reader.rs, modules/llrt_dgram/src/lib.rs, modules/llrt_string_decoder/src/lib.rs, libs/llrt_utils/src/any_of.rs, modules/llrt_stream_web/src/readable/controller.rs (and 9 more) (21 orphaned of 176 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 176 of the 261 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.
README/code drift — LLRT runtime is Rust/QuickJS but README claims it's built in Rust with QuickJS — reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong.
Logging is not universal — Only 9/11 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `libs/llrt_test_tls`.
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.
Changelog looks stale/thin — The changelog this check read carries 2 versioned entries, against a bar of 3. Counted as either an `x.y.z` string or a version-shaped section heading (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
Nullable reference types not enabled everywhere — 0/2 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
Skipped (documented): If you use offset: `use`, then the offset will be used as-is to obtain the exact time first, and then recalculate the offset tests/unit/temporal.zoneddatetime.test.ts:485— Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skip
Skipped (documented): You can also set offset: `reject` to throw an error if the original offset is invalid, forcing an explicit new offset to be specified tests/unit/temporal.zoneddatetime.test.ts:496— Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skip
Skipped (documented): Using since() tests/unit/temporal.instant.test.ts:149— Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skip
Skipped (documented): Balancing the resulting duration tests/unit/temporal.instant.test.ts:156— Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skip
Skipped (documented): Using until() tests/unit/temporal.instant.test.ts:231— Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skip
Outdated: http — `http` is locked at 1.4.2 but 1.5.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in libs/llrt_test_tls/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p http` and commit the updated REDACTED.
Outdated: tokio-rustls — `tokio-rustls` is locked at 0.26.5 but 0.26.6 is the current stable release on crates.io, and it already satisfies the `"0.26"` requirement declared in libs/llrt_test_tls/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tokio-rustls` and commit the updated REDACTED.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 3 file(s) — `types/console.d.ts`, `types/stream/web.d.ts`, `types/util.d.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a0ec0c-24a0-784c-a992-a8c6061cf86c · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 54 · Warnings: 477 · Recommendations: 16 · Info: 7 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 29-09-2026 @ 07:23 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.