Public report of awslabs/llrt, published 14 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 14 November 2026, 16:51 UTC · Survey ID cd_0faca1f96733445fa0c7ca59d855d6b7
awslabs/llrt
Measured 14 November 2026, 16:51 UTC, at code version d23ca87
Code coverage is not measured: JavaScript/TypeScript suite (CouldNotMeasureNoCollector).
CAI scoreAt riskDown 1 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 67,234 lines of product code in 48 projects, tests not counted · Estimated rebuild effort: about 0.6 person-years · Weakest lens: Code Health, 51
Findings by how serious they are
77 critical666 serious99 minor
14 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 16:51 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
60of 60 dimensions measured by tools.
768of 842 findings point to an exact file and line, so you can open each one in the code. The other 74 concern the repository as a whole, such as missing documentation.
60dimensions across 6 lenses, read from 67,234 lines of product code in 48 projects.
awslabs/llrt is rated At risk because critical security findings are open, most of them in the build pipeline. It scores 57 out of 100, which the At risk rating leaves unchanged. We judged it as a preview release, against a lower bar.
Code Health, at 51, is the weakest lens and counts most in the score. The best first step for the work it takes is making the four tests that check nothing check their results, worth about 3 points. Writing log messages as searchable templates would lift Code Health itself, worth about 4 points. Raising Code Health to 67 would lift the score to about 61.
Thirty-six pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Sixteen known security holes in the packages the code depends on can be used by attackers, and six weaknesses in the code could be used by an attacker. Pinning each tool to an exact version, updating the vulnerable packages and fixing the weaknesses the scanner points to would close these risks. Passing outside input through environment variables would fix the five pipeline steps that put outside input straight into a shell command, and setting a waiting period for automatic updates would deal with the automatic dependency update that takes a new release at once. The four tests that check nothing need to check the result they produce.
The product code is 67,234 lines, about €87,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Code Health rose from 51 to 67, the lowest score rated Strong, the score would rise from 57 to about 61.
Code composition: what the lines of code are
Product code 79%Tests 21%
New since the last survey: 235 findings
These 235 critical or serious findings weren't in the previous survey, on 27 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
God Classes · TooManyFields: BasePrimordials libs/llrt_utils/src/primordials.rs
Code Duplication · Edited copy of a member (310 corresponding lines) modules/llrt_stream_web/src/readable/stream/tee.rs
Code Duplication · Edited copy of a member (31 corresponding lines) modules/llrt_crypto/src/provider/rust/aes_variants.rs
Code Duplication · Edited copy of a member (59 corresponding lines) modules/llrt_fetch/src/headers.rs
Code Duplication · Edited copy of a member (56 corresponding lines) modules/llrt_crypto/src/subtle/sign.rs
Code Duplication · Edited copy of a member (52 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs
Code Duplication · Edited copy of a member (45 corresponding lines) modules/llrt_stream_web/src/transform/stream.rs
Code Duplication · Edited copy of a member (78 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs
Code Duplication · Edited copies of one member (3 members, 26+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (32 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs
Code Duplication · Edited copy of a member (1 corresponding lines) modules/llrt_zlib/src/brotli.rs
Code Duplication · Edited copies of one member (6 members, 1+ corresponding lines) modules/llrt_zlib/src/zlib.rs
Code Duplication · Edited copy of a member (1 corresponding lines) modules/llrt_zlib/src/zstd.rs
Code Duplication · Edited copy of a member (62 corresponding lines) modules/llrt_stream_web/src/readable/default_reader.rs
Code Duplication · Edited copy of a member (25 corresponding lines) llrt_core/src/modules/console.rs
Code Duplication · Edited copy of a member (59 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs
Code Duplication · Edited copy of a member (19 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (45 corresponding lines) modules/llrt_crypto/src/subtle/key_algorithm.rs
Code Duplication · Edited copy of a member (67 corresponding lines) modules/llrt_stream_web/src/readable/stream/tee.rs
Code Duplication · Edited copies of one member (3 members, 18+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (33 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs
Code Duplication · Edited copy of a member (32 corresponding lines) modules/llrt_crypto/src/subtle/export_key.rs
Code Duplication · Edited copy of a member (24 corresponding lines) llrt_core/src/builtins_inspect.rs
Code Duplication · Edited copy of a member (32 corresponding lines) modules/llrt_crypto/src/subtle/key_algorithm.rs
Code Duplication · Edited copy of a member (21 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs
Code Duplication · Edited copy of a member (21 corresponding lines) modules/llrt_util/src/text_decoder_stream.rs
Code Duplication · Edited copy of a member (14 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (28 corresponding lines) modules/llrt_fetch/src/request.rs
Code Duplication · Edited copy of a member (24 corresponding lines) modules/llrt_stream_web/src/lib.rs
Code Duplication · Edited copy of a member (28 corresponding lines) modules/llrt_buffer/src/blob.rs
Code Duplication · Edited copy of a member (24 corresponding lines) llrt_modules/src/module/loader.rs
Code Duplication · Edited copy of a member (20 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs
Code Duplication · Edited copy of a member (21 corresponding lines) modules/llrt_temporal/src/utils/time.rs
Code Duplication · Edited copy of a member (45 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs
Code Duplication · Edited copy of a member (39 corresponding lines) modules/llrt_stream_web/src/readable/stream/mod.rs
Code Duplication · Edited copy of a member (22 corresponding lines) modules/llrt_crypto/src/subtle/encapsulation.rs
Code Duplication · Edited copy of a member (23 corresponding lines) modules/llrt_crypto/src/subtle/sign.rs
Code Duplication · Edited copy of a member (17 corresponding lines) modules/llrt_crypto/src/subtle/encapsulation.rs
Code Duplication · Edited copy of a member (21 corresponding lines) modules/llrt_os/src/network.rs
Code Duplication · Edited copy of a member (18 corresponding lines) modules/llrt_stream_web/src/transform/controller.rs
Code Duplication · Edited copies of one member (4 members, 15+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (27 corresponding lines) modules/llrt_stream_web/src/readable/byob_reader.rs
Code Duplication · Edited copy of a member (17 corresponding lines) libs/llrt_utils/src/fs.rs
Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copies of one member (4 members, 16+ corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs
Code Duplication · Edited copy of a member (19 corresponding lines) modules/llrt_fs/src/read_dir.rs
Code Duplication · Edited copy of a member (15 corresponding lines) modules/llrt_stream_web/src/readable/stream/source.rs
Code Duplication · Edited copy of a member (15 corresponding lines) modules/llrt_temporal/src/utils/date.rs
Code Duplication · Edited copy of a member (16 corresponding lines) modules/llrt_fs/src/file_handle.rs
Code Duplication · Edited copy of a member (16 corresponding lines) libs/llrt_utils/src/fs.rs
Code Duplication · Edited copy of a member (20 corresponding lines) modules/llrt_crypto/src/subtle/encryption.rs
Code Duplication · Edited copy of a member (14 corresponding lines) modules/llrt_temporal/src/duration.rs
Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) modules/llrt_stream_web/src/writable/default_controller.rs
Code Duplication · Edited copy of a member (14 corresponding lines) modules/llrt_crypto/src/provider/modern.rs
Code Duplication · Edited copy of a member (15 corresponding lines) libs/llrt_net_policy/src/lib.rs
Code Duplication · Edited copy of a member (12 corresponding lines) modules/llrt_fetch/src/response.rs
Code Duplication · Edited copy of a member (7 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (13 corresponding lines) modules/llrt_fetch/src/form_data.rs
Code Duplication · Edited copy of a member (7 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (20 corresponding lines) modules/llrt_stream_web/src/readable/byob_reader.rs
Code Duplication · Edited copy of a member (9 corresponding lines) modules/llrt_temporal/src/zoned_date_time.rs
Code Duplication · Edited copy of a member (13 corresponding lines) libs/llrt_logging/src/lib.rs
Code Duplication · Edited copy of a member (10 corresponding lines) modules/llrt_crypto/src/provider/rust/aes_variants.rs
Code Duplication · Edited copy of a member (14 corresponding lines) modules/llrt_fs/src/mkdir.rs
Code Duplication · Edited copy of a member (11 corresponding lines) modules/llrt_fetch/src/request.rs
Code Duplication · Edited copy of a member (12 corresponding lines) modules/llrt_stream_web/src/readable/controller.rs
Code Duplication · Edited copies of one member (3 members, 16+ corresponding lines) modules/llrt_stream_web/src/readable/default_reader.rs
Code Duplication · Edited copy of a member (15 corresponding lines) modules/llrt_stream_web/src/readable/stream/algorithms.rs
Code Duplication · Edited copy of a member (8 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (10 corresponding lines) modules/llrt_stream/src/readable.rs
Code Duplication · Edited copy of a member (14 corresponding lines) modules/llrt_stream_web/src/queuing_strategy/mod.rs
Code Duplication · Edited copy of a member (9 corresponding lines) modules/llrt_crypto/src/provider/modern.rs
Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) modules/llrt_fetch/src/response.rs
Code Duplication · Edited copy of a member (15 corresponding lines) modules/llrt_crypto/src/subtle/key_algorithm.rs
Code Duplication · Edited copy of a member (12 corresponding lines) modules/llrt_stream/src/writable.rs
Code Duplication · Edited copy of a member (10 corresponding lines) modules/llrt_console/src/lib.rs
Code Duplication · Edited copy of a member (14 corresponding lines) modules/llrt_fs/src/chmod.rs
Code Duplication · Edited copy of a member (14 corresponding lines) libs/llrt_utils/src/module.rs
Code Duplication · Edited copy of a member (7 corresponding lines) modules/llrt_crypto/src/provider/graviola.rs
Code Duplication · Edited copies of one member (3 members, 6+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (8 corresponding lines) llrt_core/src/modules/llrt/xml.rs
Code Duplication · Edited copy of a member (11 corresponding lines) modules/llrt_stream_web/src/transform/controller.rs
Code Duplication · Edited copy of a member (6 corresponding lines) modules/llrt_fs/src/mkdir.rs
Code Duplication · Edited copy of a member (12 corresponding lines) modules/llrt_fetch/src/form_data.rs
Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) modules/llrt_fs/src/stats.rs
Code Duplication · Edited copy of a member (7 corresponding lines) modules/llrt_temporal/src/plain_date_time.rs
Code Duplication · Edited copy of a member (11 corresponding lines) modules/llrt_fetch/src/request.rs
Code Duplication · Edited copy of a member (12 corresponding lines) modules/llrt_fs/src/rm.rs
Code Duplication · Edited copies of one member (5 members, 13+ corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs
Code Duplication · Edited copy of a member (15 corresponding lines) modules/llrt_stream_web/src/writable/default_writer.rs
Code Duplication · Edited copy of a member (7 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs
Code Duplication · Edited copy of a member (9 corresponding lines) llrt_modules/src/package/loader.rs
Code Duplication · Edited copy of a member (10 corresponding lines) modules/llrt_fs/src/mkdir.rs
Code Duplication · Edited copy of a member (6 corresponding lines) modules/llrt_fetch/src/headers.rs
Code Duplication · Edited copy of a member (17 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs
Code Duplication · Edited copies of one member (3 members, 7+ corresponding lines) modules/llrt_fetch/src/form_data.rs
Code Duplication · Edited copy of a member (11 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs
Code Duplication · Edited copies of one member (5 members, 5+ corresponding lines) modules/llrt_temporal/src/duration.rs
We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 56 findings
These 56 critical or serious findings were in the previous survey, on 27 October 2026, and are gone from this one.
€29,000 to €150,000, for 482 to 1,529 hours of work, about 0.6 person-years for 1 to 2 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 57. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 67,234 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 4 No assertions (empty test) finding(s) in Test Quality — start with jest-expect.test.ts (3), dynamodb.e2e.test.ts.
Raises the score by about 3 points · Low effort · Test Quality
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml.
Raises the score by about 2 points · Low effort · ADR Quality
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €87,000 to build again, about 0.6 person-years of work. Its weakest lens is Code Health, at 51 (Adequate). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Resolve the 4 No assertions (empty test) finding(s) in Test Quality. Of all the actions in this report, it raises the score most for the work it takes: about 3 points for low effort, because it clears the 4 Test Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.0 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 3% to 6% on every change. The history of the code shows how much it changes: about 17,985 lines over the last 90 days, which is about 72,939 lines a year. At that pace, the extra work comes to an estimated 4.6 to 27.7 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
249 modules, with 206 dependencies between them. 3 loops run through 12 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 209 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
llrt_abort.abort_signal uses llrt_events, so a change to llrt_events can break llrt_abort.abort_signal, while a change to llrt_abort.abort_signal can't break llrt_events.
Position
Below the diagonal: llrt_abort.abort_signal uses a module listed above it, which is the healthy direction.
llrt_abort.abort_signal uses llrt_utils.mc_oneshot, so a change to llrt_utils.mc_oneshot can break llrt_abort.abort_signal, while a change to llrt_abort.abort_signal can't break llrt_utils.mc_oneshot.
Position
Below the diagonal: llrt_abort.abort_signal uses a module listed above it, which is the healthy direction.
llrt_buffer.buffer uses llrt_utils.bytes, so a change to llrt_utils.bytes can break llrt_buffer.buffer, while a change to llrt_buffer.buffer can't break llrt_utils.bytes.
Position
Below the diagonal: llrt_buffer.buffer uses a module listed above it, which is the healthy direction.
llrt_buffer.buffer uses llrt_utils.primordials, so a change to llrt_utils.primordials can break llrt_buffer.buffer, while a change to llrt_buffer.buffer can't break llrt_utils.primordials.
Position
Below the diagonal: llrt_buffer.buffer uses a module listed above it, which is the healthy direction.
llrt_crypto.hash uses llrt_utils.bytes, so a change to llrt_utils.bytes can break llrt_crypto.hash, while a change to llrt_crypto.hash can't break llrt_utils.bytes.
Position
Below the diagonal: llrt_crypto.hash uses a module listed above it, which is the healthy direction.
llrt_fetch.response uses llrt_utils.mc_oneshot, so a change to llrt_utils.mc_oneshot can break llrt_fetch.response, while a change to llrt_fetch.response can't break llrt_utils.mc_oneshot.
Position
Below the diagonal: llrt_fetch.response uses a module listed above it, which is the healthy direction.
llrt_net.server uses llrt_utils.mc_oneshot, so a change to llrt_utils.mc_oneshot can break llrt_net.server, while a change to llrt_net.server can't break llrt_utils.mc_oneshot.
Position
Below the diagonal: llrt_net.server uses a module listed above it, which is the healthy direction.
llrt_stream.readable uses llrt_events, so a change to llrt_events can break llrt_stream.readable, while a change to llrt_stream.readable can't break llrt_events.
Position
Below the diagonal: llrt_stream.readable uses a module listed above it, which is the healthy direction.
llrt_stream.readable uses llrt_stream, so a change to llrt_stream can break llrt_stream.readable, while a change to llrt_stream.readable can't break llrt_stream.
Position
Below the diagonal: llrt_stream.readable uses a module listed above it, which is the healthy direction.
llrt_stream.readable uses llrt_utils.mc_oneshot, so a change to llrt_utils.mc_oneshot can break llrt_stream.readable, while a change to llrt_stream.readable can't break llrt_utils.mc_oneshot.
Position
Below the diagonal: llrt_stream.readable uses a module listed above it, which is the healthy direction.
llrt_stream.writable uses llrt_events, so a change to llrt_events can break llrt_stream.writable, while a change to llrt_stream.writable can't break llrt_events.
Position
Below the diagonal: llrt_stream.writable uses a module listed above it, which is the healthy direction.
llrt_stream.writable uses llrt_stream, so a change to llrt_stream can break llrt_stream.writable, while a change to llrt_stream.writable can't break llrt_stream.
Position
Below the diagonal: llrt_stream.writable uses a module listed above it, which is the healthy direction.
llrt_stream.writable uses llrt_utils.mc_oneshot, so a change to llrt_utils.mc_oneshot can break llrt_stream.writable, while a change to llrt_stream.writable can't break llrt_utils.mc_oneshot.
Position
Below the diagonal: llrt_stream.writable uses a module listed above it, which is the healthy direction.
llrt_stream_web.queuing_strategy uses llrt_utils.primordials, so a change to llrt_utils.primordials can break llrt_stream_web.queuing_strategy, while a change to llrt_stream_web.queuing_strategy can't break llrt_utils.primordials.
Position
Below the diagonal: llrt_stream_web.queuing_strategy uses a module listed above it, which is the healthy direction.
18→25 llrt_stream_web.readable.objects uses llrt_stream_web.readable.controllerpart of a loop✕
Connections
1 pair of types, where a type in llrt_stream_web.readable.objects uses a type in llrt_stream_web.readable.controller.
llrt_stream_web.readable.objects uses llrt_stream_web.readable.controller, so a change to llrt_stream_web.readable.controller can break llrt_stream_web.readable.objects, while a change to llrt_stream_web.readable.objects can't break llrt_stream_web.readable.controller.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
llrt_stream_web.utils.promise uses llrt_utils.primordials, so a change to llrt_utils.primordials can break llrt_stream_web.utils.promise, while a change to llrt_stream_web.utils.promise can't break llrt_utils.primordials.
Position
Below the diagonal: llrt_stream_web.utils.promise uses a module listed above it, which is the healthy direction.
llrt_temporal.plain_date_time uses llrt_temporal.duration, so a change to llrt_temporal.duration can break llrt_temporal.plain_date_time, while a change to llrt_temporal.plain_date_time can't break llrt_temporal.duration.
Position
Below the diagonal: llrt_temporal.plain_date_time uses a module listed above it, which is the healthy direction.
llrt_buffer.array_buffer_view uses llrt_buffer.buffer, so a change to llrt_buffer.buffer can break llrt_buffer.array_buffer_view, while a change to llrt_buffer.array_buffer_view can't break llrt_buffer.buffer.
Position
Below the diagonal: llrt_buffer.array_buffer_view uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.key_algorithm uses llrt_crypto.hash, so a change to llrt_crypto.hash can break llrt_crypto.subtle.key_algorithm, while a change to llrt_crypto.subtle.key_algorithm can't break llrt_crypto.hash.
Position
Below the diagonal: llrt_crypto.subtle.key_algorithm uses a module listed above it, which is the healthy direction.
22→29 llrt_crypto.subtle.key_algorithm uses llrt_crypto.subtle.crypto_keypart of a loop✕
Connections
2 pairs of types, where a type in llrt_crypto.subtle.key_algorithm uses a type in llrt_crypto.subtle.crypto_key.
llrt_crypto.subtle.key_algorithm uses llrt_crypto.subtle.crypto_key, so a change to llrt_crypto.subtle.crypto_key can break llrt_crypto.subtle.key_algorithm, while a change to llrt_crypto.subtle.key_algorithm can't break llrt_crypto.subtle.crypto_key.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
22→31 llrt_crypto.subtle.key_algorithm uses llrt_crypto.subtlepart of a loop✕
Connections
1 pair of types, where a type in llrt_crypto.subtle.key_algorithm uses a type in llrt_crypto.subtle.
llrt_crypto.subtle.key_algorithm uses llrt_crypto.subtle, so a change to llrt_crypto.subtle can break llrt_crypto.subtle.key_algorithm, while a change to llrt_crypto.subtle.key_algorithm can't break llrt_crypto.subtle.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
22→33 llrt_crypto.subtle.key_algorithm uses llrt_crypto.providerpart of a loop✕
Connections
3 pairs of types, where a type in llrt_crypto.subtle.key_algorithm uses a type in llrt_crypto.provider.
llrt_crypto.subtle.key_algorithm uses llrt_crypto.provider, so a change to llrt_crypto.provider can break llrt_crypto.subtle.key_algorithm, while a change to llrt_crypto.subtle.key_algorithm can't break llrt_crypto.provider.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
llrt_fetch.fetch uses llrt_utils.bytes, so a change to llrt_utils.bytes can break llrt_fetch.fetch, while a change to llrt_fetch.fetch can't break llrt_utils.bytes.
Position
Below the diagonal: llrt_fetch.fetch uses a module listed above it, which is the healthy direction.
llrt_fetch.fetch uses llrt_utils.mc_oneshot, so a change to llrt_utils.mc_oneshot can break llrt_fetch.fetch, while a change to llrt_fetch.fetch can't break llrt_utils.mc_oneshot.
Position
Below the diagonal: llrt_fetch.fetch uses a module listed above it, which is the healthy direction.
llrt_fetch.fetch uses llrt_fetch.response, so a change to llrt_fetch.response can break llrt_fetch.fetch, while a change to llrt_fetch.fetch can't break llrt_fetch.response.
Position
Below the diagonal: llrt_fetch.fetch uses a module listed above it, which is the healthy direction.
llrt_net.socket uses llrt_stream.readable, so a change to llrt_stream.readable can break llrt_net.socket, while a change to llrt_net.socket can't break llrt_stream.readable.
Position
Below the diagonal: llrt_net.socket uses a module listed above it, which is the healthy direction.
llrt_net.socket uses llrt_stream.writable, so a change to llrt_stream.writable can break llrt_net.socket, while a change to llrt_net.socket can't break llrt_stream.writable.
Position
Below the diagonal: llrt_net.socket uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.controller uses llrt_stream_web.readable.objects, so a change to llrt_stream_web.readable.objects can break llrt_stream_web.readable.controller, while a change to llrt_stream_web.readable.controller can't break llrt_stream_web.readable.objects.
Position
Below the diagonal: llrt_stream_web.readable.controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.writable.default_controller uses llrt_stream_web.writable.objects, so a change to llrt_stream_web.writable.objects can break llrt_stream_web.writable.default_controller, while a change to llrt_stream_web.writable.default_controller can't break llrt_stream_web.writable.objects.
Position
Below the diagonal: llrt_stream_web.writable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.writable.default_controller uses llrt_utils.option, so a change to llrt_utils.option can break llrt_stream_web.writable.default_controller, while a change to llrt_stream_web.writable.default_controller can't break llrt_utils.option.
Position
Below the diagonal: llrt_stream_web.writable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.writable.default_controller uses llrt_utils.primordials, so a change to llrt_utils.primordials can break llrt_stream_web.writable.default_controller, while a change to llrt_stream_web.writable.default_controller can't break llrt_utils.primordials.
Position
Below the diagonal: llrt_stream_web.writable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.writable.default_controller uses llrt_stream_web.queuing_strategy, so a change to llrt_stream_web.queuing_strategy can break llrt_stream_web.writable.default_controller, while a change to llrt_stream_web.writable.default_controller can't break llrt_stream_web.queuing_strategy.
Position
Below the diagonal: llrt_stream_web.writable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.writable.default_controller uses llrt_stream_web.utils.promise, so a change to llrt_stream_web.utils.promise can break llrt_stream_web.writable.default_controller, while a change to llrt_stream_web.writable.default_controller can't break llrt_stream_web.utils.promise.
Position
Below the diagonal: llrt_stream_web.writable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.writable.stream uses llrt_stream_web.writable.objects, so a change to llrt_stream_web.writable.objects can break llrt_stream_web.writable.stream, while a change to llrt_stream_web.writable.stream can't break llrt_stream_web.writable.objects.
Position
Below the diagonal: llrt_stream_web.writable.stream uses a module listed above it, which is the healthy direction.
llrt_stream_web.writable.stream uses llrt_stream_web.queuing_strategy, so a change to llrt_stream_web.queuing_strategy can break llrt_stream_web.writable.stream, while a change to llrt_stream_web.writable.stream can't break llrt_stream_web.queuing_strategy.
Position
Below the diagonal: llrt_stream_web.writable.stream uses a module listed above it, which is the healthy direction.
llrt_stream_web.writable.stream uses llrt_stream_web.utils.promise, so a change to llrt_stream_web.utils.promise can break llrt_stream_web.writable.stream, while a change to llrt_stream_web.writable.stream can't break llrt_stream_web.utils.promise.
Position
Below the diagonal: llrt_stream_web.writable.stream uses a module listed above it, which is the healthy direction.
llrt_temporal.zoned_date_time uses llrt_temporal.plain_date_time, so a change to llrt_temporal.plain_date_time can break llrt_temporal.zoned_date_time, while a change to llrt_temporal.zoned_date_time can't break llrt_temporal.plain_date_time.
Position
Below the diagonal: llrt_temporal.zoned_date_time uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.crypto_key uses llrt_crypto.subtle.key_algorithm, so a change to llrt_crypto.subtle.key_algorithm can break llrt_crypto.subtle.crypto_key, while a change to llrt_crypto.subtle.crypto_key can't break llrt_crypto.subtle.key_algorithm.
Position
Below the diagonal: llrt_crypto.subtle.crypto_key uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.stream.algorithms uses llrt_stream_web.utils.promise, so a change to llrt_stream_web.utils.promise can break llrt_stream_web.readable.stream.algorithms, while a change to llrt_stream_web.readable.stream.algorithms can't break llrt_stream_web.utils.promise.
Position
Below the diagonal: llrt_stream_web.readable.stream.algorithms uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.stream.algorithms uses llrt_stream_web.readable.controller, so a change to llrt_stream_web.readable.controller can break llrt_stream_web.readable.stream.algorithms, while a change to llrt_stream_web.readable.stream.algorithms can't break llrt_stream_web.readable.controller.
Position
Below the diagonal: llrt_stream_web.readable.stream.algorithms uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle uses llrt_crypto.hash, so a change to llrt_crypto.hash can break llrt_crypto.subtle, while a change to llrt_crypto.subtle can't break llrt_crypto.hash.
Position
Below the diagonal: llrt_crypto.subtle uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle uses llrt_crypto.subtle.crypto_key, so a change to llrt_crypto.subtle.crypto_key can break llrt_crypto.subtle, while a change to llrt_crypto.subtle can't break llrt_crypto.subtle.crypto_key.
Position
Below the diagonal: llrt_crypto.subtle uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.stream uses llrt_utils.option, so a change to llrt_utils.option can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_utils.option.
Position
Below the diagonal: llrt_stream_web.readable.stream uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.stream uses llrt_stream_web.queuing_strategy, so a change to llrt_stream_web.queuing_strategy can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_stream_web.queuing_strategy.
Position
Below the diagonal: llrt_stream_web.readable.stream uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.objects, so a change to llrt_stream_web.readable.objects can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_stream_web.readable.objects.
Position
Below the diagonal: llrt_stream_web.readable.stream uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.stream uses llrt_stream_web.utils.promise, so a change to llrt_stream_web.utils.promise can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_stream_web.utils.promise.
Position
Below the diagonal: llrt_stream_web.readable.stream uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.controller, so a change to llrt_stream_web.readable.controller can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_stream_web.readable.controller.
Position
Below the diagonal: llrt_stream_web.readable.stream uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.stream.algorithms, so a change to llrt_stream_web.readable.stream.algorithms can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_stream_web.readable.stream.algorithms.
Position
Below the diagonal: llrt_stream_web.readable.stream uses a module listed above it, which is the healthy direction.
32→37 llrt_stream_web.readable.stream uses llrt_stream_web.readable.default_readerpart of a loop✕
Connections
1 pair of types, where a type in llrt_stream_web.readable.stream uses a type in llrt_stream_web.readable.default_reader.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.default_reader, so a change to llrt_stream_web.readable.default_reader can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_stream_web.readable.default_reader.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
32→38 llrt_stream_web.readable.stream uses llrt_stream_web.readable.readerpart of a loop✕
Connections
2 pairs of types, where a type in llrt_stream_web.readable.stream uses a type in llrt_stream_web.readable.reader.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.reader, so a change to llrt_stream_web.readable.reader can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_stream_web.readable.reader.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
32→39 llrt_stream_web.readable.stream uses llrt_stream_web.readable.byob_readerpart of a loop✕
Connections
2 pairs of types, where a type in llrt_stream_web.readable.stream uses a type in llrt_stream_web.readable.byob_reader.
llrt_stream_web.readable.stream uses llrt_stream_web.readable.byob_reader, so a change to llrt_stream_web.readable.byob_reader can break llrt_stream_web.readable.stream, while a change to llrt_stream_web.readable.stream can't break llrt_stream_web.readable.byob_reader.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
llrt_crypto.provider uses llrt_crypto.hash, so a change to llrt_crypto.hash can break llrt_crypto.provider, while a change to llrt_crypto.provider can't break llrt_crypto.hash.
Position
Below the diagonal: llrt_crypto.provider uses a module listed above it, which is the healthy direction.
llrt_crypto.provider uses llrt_crypto.subtle, so a change to llrt_crypto.subtle can break llrt_crypto.provider, while a change to llrt_crypto.provider can't break llrt_crypto.subtle.
Position
Below the diagonal: llrt_crypto.provider uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.derive_bits uses llrt_crypto.hash, so a change to llrt_crypto.hash can break llrt_crypto.subtle.derive_bits, while a change to llrt_crypto.subtle.derive_bits can't break llrt_crypto.hash.
Position
Below the diagonal: llrt_crypto.subtle.derive_bits uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.derive_bits uses llrt_crypto.subtle.crypto_key, so a change to llrt_crypto.subtle.crypto_key can break llrt_crypto.subtle.derive_bits, while a change to llrt_crypto.subtle.derive_bits can't break llrt_crypto.subtle.crypto_key.
Position
Below the diagonal: llrt_crypto.subtle.derive_bits uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.derive_bits uses llrt_crypto.subtle, so a change to llrt_crypto.subtle can break llrt_crypto.subtle.derive_bits, while a change to llrt_crypto.subtle.derive_bits can't break llrt_crypto.subtle.
Position
Below the diagonal: llrt_crypto.subtle.derive_bits uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.encryption uses llrt_crypto.subtle.encryption_algorithm, so a change to llrt_crypto.subtle.encryption_algorithm can break llrt_crypto.subtle.encryption, while a change to llrt_crypto.subtle.encryption can't break llrt_crypto.subtle.encryption_algorithm.
Position
Below the diagonal: llrt_crypto.subtle.encryption uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.encryption uses llrt_utils.bytes, so a change to llrt_utils.bytes can break llrt_crypto.subtle.encryption, while a change to llrt_crypto.subtle.encryption can't break llrt_utils.bytes.
Position
Below the diagonal: llrt_crypto.subtle.encryption uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.encryption uses llrt_crypto.subtle.key_algorithm, so a change to llrt_crypto.subtle.key_algorithm can break llrt_crypto.subtle.encryption, while a change to llrt_crypto.subtle.encryption can't break llrt_crypto.subtle.key_algorithm.
Position
Below the diagonal: llrt_crypto.subtle.encryption uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.encryption uses llrt_crypto.subtle.crypto_key, so a change to llrt_crypto.subtle.crypto_key can break llrt_crypto.subtle.encryption, while a change to llrt_crypto.subtle.encryption can't break llrt_crypto.subtle.crypto_key.
Position
Below the diagonal: llrt_crypto.subtle.encryption uses a module listed above it, which is the healthy direction.
llrt_crypto.subtle.encryption uses llrt_crypto.subtle, so a change to llrt_crypto.subtle can break llrt_crypto.subtle.encryption, while a change to llrt_crypto.subtle.encryption can't break llrt_crypto.subtle.
Position
Below the diagonal: llrt_crypto.subtle.encryption uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.default_controller uses llrt_utils.option, so a change to llrt_utils.option can break llrt_stream_web.readable.default_controller, while a change to llrt_stream_web.readable.default_controller can't break llrt_utils.option.
Position
Below the diagonal: llrt_stream_web.readable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.default_controller uses llrt_stream_web.queuing_strategy, so a change to llrt_stream_web.queuing_strategy can break llrt_stream_web.readable.default_controller, while a change to llrt_stream_web.readable.default_controller can't break llrt_stream_web.queuing_strategy.
Position
Below the diagonal: llrt_stream_web.readable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.default_controller uses llrt_stream_web.readable.stream.algorithms, so a change to llrt_stream_web.readable.stream.algorithms can break llrt_stream_web.readable.default_controller, while a change to llrt_stream_web.readable.default_controller can't break llrt_stream_web.readable.stream.algorithms.
Position
Below the diagonal: llrt_stream_web.readable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.default_controller uses llrt_stream_web.readable.stream, so a change to llrt_stream_web.readable.stream can break llrt_stream_web.readable.default_controller, while a change to llrt_stream_web.readable.default_controller can't break llrt_stream_web.readable.stream.
Position
Below the diagonal: llrt_stream_web.readable.default_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.default_reader uses llrt_stream_web.utils.promise, so a change to llrt_stream_web.utils.promise can break llrt_stream_web.readable.default_reader, while a change to llrt_stream_web.readable.default_reader can't break llrt_stream_web.utils.promise.
Position
Below the diagonal: llrt_stream_web.readable.default_reader uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.default_reader uses llrt_stream_web.readable.default_controller, so a change to llrt_stream_web.readable.default_controller can break llrt_stream_web.readable.default_reader, while a change to llrt_stream_web.readable.default_reader can't break llrt_stream_web.readable.default_controller.
Position
Below the diagonal: llrt_stream_web.readable.default_reader uses a module listed above it, which is the healthy direction.
37→38 llrt_stream_web.readable.default_reader uses llrt_stream_web.readable.readerpart of a loop✕
Connections
2 pairs of types, where a type in llrt_stream_web.readable.default_reader uses a type in llrt_stream_web.readable.reader.
llrt_stream_web.readable.default_reader uses llrt_stream_web.readable.reader, so a change to llrt_stream_web.readable.reader can break llrt_stream_web.readable.default_reader, while a change to llrt_stream_web.readable.default_reader can't break llrt_stream_web.readable.reader.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
llrt_stream_web.readable.reader uses llrt_stream_web.readable.objects, so a change to llrt_stream_web.readable.objects can break llrt_stream_web.readable.reader, while a change to llrt_stream_web.readable.reader can't break llrt_stream_web.readable.objects.
Position
Below the diagonal: llrt_stream_web.readable.reader uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.reader uses llrt_stream_web.utils.promise, so a change to llrt_stream_web.utils.promise can break llrt_stream_web.readable.reader, while a change to llrt_stream_web.readable.reader can't break llrt_stream_web.utils.promise.
Position
Below the diagonal: llrt_stream_web.readable.reader uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.reader uses llrt_stream_web.readable.stream, so a change to llrt_stream_web.readable.stream can break llrt_stream_web.readable.reader, while a change to llrt_stream_web.readable.reader can't break llrt_stream_web.readable.stream.
Position
Below the diagonal: llrt_stream_web.readable.reader uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.reader uses llrt_stream_web.readable.default_reader, so a change to llrt_stream_web.readable.default_reader can break llrt_stream_web.readable.reader, while a change to llrt_stream_web.readable.reader can't break llrt_stream_web.readable.default_reader.
Position
Below the diagonal: llrt_stream_web.readable.reader uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.byob_reader uses llrt_utils.bytes, so a change to llrt_utils.bytes can break llrt_stream_web.readable.byob_reader, while a change to llrt_stream_web.readable.byob_reader can't break llrt_utils.bytes.
Position
Below the diagonal: llrt_stream_web.readable.byob_reader uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.byob_reader uses llrt_utils.primordials, so a change to llrt_utils.primordials can break llrt_stream_web.readable.byob_reader, while a change to llrt_stream_web.readable.byob_reader can't break llrt_utils.primordials.
Position
Below the diagonal: llrt_stream_web.readable.byob_reader uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.byob_reader uses llrt_stream_web.readable.reader, so a change to llrt_stream_web.readable.reader can break llrt_stream_web.readable.byob_reader, while a change to llrt_stream_web.readable.byob_reader can't break llrt_stream_web.readable.reader.
Position
Below the diagonal: llrt_stream_web.readable.byob_reader uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.byte_controller uses llrt_utils.option, so a change to llrt_utils.option can break llrt_stream_web.readable.byte_controller, while a change to llrt_stream_web.readable.byte_controller can't break llrt_utils.option.
Position
Below the diagonal: llrt_stream_web.readable.byte_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.byte_controller uses llrt_stream_web.readable.stream.algorithms, so a change to llrt_stream_web.readable.stream.algorithms can break llrt_stream_web.readable.byte_controller, while a change to llrt_stream_web.readable.byte_controller can't break llrt_stream_web.readable.stream.algorithms.
Position
Below the diagonal: llrt_stream_web.readable.byte_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.byte_controller uses llrt_stream_web.readable.stream, so a change to llrt_stream_web.readable.stream can break llrt_stream_web.readable.byte_controller, while a change to llrt_stream_web.readable.byte_controller can't break llrt_stream_web.readable.stream.
Position
Below the diagonal: llrt_stream_web.readable.byte_controller uses a module listed above it, which is the healthy direction.
llrt_stream_web.readable.byte_controller uses llrt_stream_web.readable.byob_reader, so a change to llrt_stream_web.readable.byob_reader can break llrt_stream_web.readable.byte_controller, while a change to llrt_stream_web.readable.byte_controller can't break llrt_stream_web.readable.byob_reader.
Position
Below the diagonal: llrt_stream_web.readable.byte_controller uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 51% · Adequate · gated by X4 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
62
High / Critical
A03:2025 — Software Supply Chain Failures
51
High / Critical
Roadmap
Top priorities: Interpolated log message defeats structured logging; Resolve the 4 No assertions (empty test) finding(s) in Test Quality — start with jest-expect.test.ts (3), dynamodb.e2e.test.ts; Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
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.
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
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.
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 — 77
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 — 666
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 — 99
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 14
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 60 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 60 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 768 of 842 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 1,192 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT SCORED: this repository's production source includes .rs, and the rust executor ran against the .rs half and never executed — 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 (1069 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. The half was driven by a runner we ship, so this is not a missing-runner gap.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares 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.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `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.
D44 Platform End-of-Life — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via Dockerfile (example/llrt-sam-container-image/hello-world/Dockerfile). docker build failed (exit 1) — Dockerfile:5 -------------------- 3 | COPY app.mjs ./ 4 | ADD https://github.com/awslabs/llrt/releases/latest/download/llrt-container-arm64 /usr/bin/llrt 5 | >>> RUN chmod +x /usr/bin/llrt 6 | 7 | ENV LAMBDA_HANDLER "app.handler" -------------------- ERROR: failed to solve: process "/bin/sh -c chmod +x /usr/bin/llrt" did not complete successfully: exit code: 255; runtime evidence skipped.
GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Rust, c is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Rust, c is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
R8 Dependency Hygiene — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 25 further occurrence(s) are not listed individually; the score already reflects all 65.
X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X17 Uncapped recursion over a caller-supplied document — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X26 Unsynchronised callback handoff — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Java, Kotlin, Scala, Go, Swift, Python and Ruby source only, and no C# was loaded, no Java, Kotlin, Scala, Go, Swift, Python or Ruby was found, and this repository's C is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X27 Collection changed while being enumerated — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
X3 Exception handling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X4 Structured logging — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 42 further occurrence(s) are not listed individually; the score already reflects all 82.
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
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
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
Bring the 10 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with llrt_fetch::request::assign_request (cyclomatic 60), jest-expect.JestChaiExpect (cyclomatic 59), llrt_logging::format_raw_inner (cyclomatic 57). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 10 together lifts Cyclomatic Complexity from 6.5 to about 7.3/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
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.
+ 40 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 11 bodies over 60 down to 60 or less in Cognitive Complexity — start with llrt_fetch::fetch::get_fetch_options (cognitive 116), llrt_logging::format_raw_inner (cognitive 114), llrt_fetch::request::assign_request (cognitive 113). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 11 together lifts Cognitive Complexity from 5.2 to about 6.1/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.3 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 20 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 (20 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 10 MethodTooLong finding(s) in God Classes — start with tee.rs (4), pipe.rs, key_algorithm.rs. — One of this dimension's main actionable groups (10 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
149 duplicated block group(s) detected. 9.5 % of the production lines (6,412 of 67,234) are in a reported copy. A further 115 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 2 of the 264 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
Edited copy of a member (7 corresponding lines) · ×10modules/llrt_crypto/src/provider/openssl.rs:566
+ 101 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 18 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with openssl.rs (5), mod.rs (2), plain_date.rs (2). — One of this dimension's main actionable groups (18 warning-level).
Resolve the 16 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 (16 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).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling7.4 / 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.
48 production modules (Cargo+npm), 0 dependency cycle(s), 7 unstable depended-on module(s). Read from the build's own module declarations; 7 module(s) off the main sequence, with abstractness counted on 41 of the 48 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: llrt_dns_cache · ×7
Unstable project llrt_child_process
Unstable project llrt_crypto
Unstable project llrt_dgram
Unstable project llrt_fetch
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 7 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (7 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).
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.
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, 31 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 1192 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): should have value · ×4tests/unit/jest-expect.test.ts:540
No assertions: should pass ${file} tests · ×27tests/wpt/_harness-util.js:207
Skipped test: Using since() · ×5tests/unit/temporal.instant.test.ts:149
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), fs.test.ts (3). — One of this dimension's main actionable groups (27 warning-level).
Resolve the 5 Skipped test finding(s) in Test Quality — start with temporal.instant.test.ts (3), temporal.zoneddatetime.test.ts (2). — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
7 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: const-oid · ×7
✓ 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 373 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 (23×20=460); modules/llrt_crypto/src/subtle/export_key.rs (9×27=243); llrt_core/src/clone.rs (5×41=205) Repeated repair below the complexity floor: modules/llrt_crypto/src/subtle/derive_bits.rs (5 of 5 changes were fixes); libs/llrt_encoding/src/lib.rs (4 of 5 changes were fixes); libs/llrt_utils/src/bytes.rs (3 of 5 changes were fixes)
Resolve the 9 Repeated repair finding(s) in Churn × Complexity Hotspots — start with lib.rs (2), derive_bits.rs, bytes.rs. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 5 Hotspot finding(s) in Churn × Complexity Hotspots — start with key_algorithm.rs, export_key.rs, clone.rs. — One of this dimension's main actionable groups (5 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.6 / 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.
25 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 177 of the 262 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 · ×3
Further sole-owners (lower concentration)
What to do
Resolve the 3 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (3 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 67234 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 HackComment finding(s) in Explicit Debt — start with loader.rs (2). — One of this dimension's main actionable groups (2 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).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 12 document(s) read across 2 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.
doc comments repeat the namesbenchmarks/v8-v7/richards.js:258
What to do
Resolve the 7 redundant comment finding(s) in Comment Value — start with s3.e2e.test.ts (3), base.js, cognito_identity.e2e.test.ts. — One of this dimension's main actionable groups (7 recommendation-level).
Detailed fixes: d24_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).
62 finding(s): 0 critical, 49 high, 13 medium, 0 low. 36 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 3 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 5 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 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 36 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 (36 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 14 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (9), REDACTED (5). — One of this dimension's main actionable groups (14 issue-level).
Resolve the 14 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (10), REDACTED (3), REDACTED. — One of this dimension's main actionable groups (14 warning-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.
22 of 177 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 177 of the 262 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with cldr_data.rs, date_time_format.rs, default_writer.rs. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 19 Orphaned file finding(s) in Knowledge Freshness — start with lib.rs (6), objects.rs (2), pattern_formatter.rs. — One of this dimension's main actionable groups (19 recommendation-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 2 Boundary-crossing change coupling finding(s) in Change Coupling — start with clone.rs, vm.rs. — One of this dimension's main actionable groups (2 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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability6.5 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
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.
Add a health-check endpoint (a /health route on your axum/actix router) so orchestrators and load balancers can probe liveness/readiness.
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.
`REDACTED` schedules updates, but no `package-ecosystem` entry covers `gitsubmodule`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the `updates:` list. — REDACTED:7
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.
What to do
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads 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 1 versioned entry, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [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.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
R1 · Type Safety7.9 / 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.
React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): 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. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. 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 · llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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
llrt_core/src/modules/js/@llrt/expect/jest-utils.ts:142 · llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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. — llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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
shims/@aws-sdk/signature-v4-multi-region.js:3 reaches into another package with a relative path (../../node_modules/@aws-sdk/signature-v4-multi-region/dist-es/SignatureV4SignWithCredentials) — import the package by name instead. — shims/@aws-sdk/signature-v4-multi-region.js:3
shims/@aws-sdk/signature-v4-multi-region.js:4 reaches into another package with a relative path (../../node_modules/@aws-sdk/signature-v4-multi-region/dist-es/signature-v4-crt-container) — import the package by name instead. — shims/@aws-sdk/signature-v4-multi-region.js:4
shims/@aws-sdk/signature-v4-multi-region.js:6 reaches into another package with a relative path (../../node_modules/@aws-sdk/signature-v4-multi-region/dist-es/SignatureV4SignWithCredentials) — import the package by name instead. — shims/@aws-sdk/signature-v4-multi-region.js:6
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. — llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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. — llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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
(anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tests/unit/fetch.redirects.test.ts:22
(anonymous) has cyclomatic complexity 14 and cognitive complexity 18; 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/unit/fetch.redirects.test.ts:106
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
(anonymous) has cyclomatic complexity 12 and cognitive complexity 25; 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/unit/fetch.test.ts:34
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.
REDACTED has 695 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
llrt_core/src/modules/js/@llrt/expect/jest-expect.ts has 599 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:1
llrt_core/src/modules/js/@llrt/expect/jest-utils.ts has 460 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — llrt_core/src/modules/js/@llrt/expect/jest-utils.ts:1
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:57
Do you agree with this assessment?
R7 · Dead Code7.5 / 10Strong✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Unreachable from the 51 application, 40 tooling and 152 test entry point(s) detected in this repo. Gate removals on `yarn run esbuild` — an undetected custom entry would make these reachable.
no import path from any entry point (51 application, 40 tooling, 152 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×4) — llrt_core/src/modules/js/@llrt/expect/jest-expect.ts, llrt_core/src/modules/js/stream.ts, shims/string-hasher.js, …
no import path from any entry point (51 application, 40 tooling, 152 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (REDACTED, llrt_core/src/modules/js/@llrt/expect/jest-expect.ts) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — llrt_core/src/modules/js/@llrt/expect/jest-utils.ts
no import path from any entry point (51 application, 40 tooling, 152 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (llrt_core/src/modules/js/@llrt/expect/jest-expect.ts) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — REDACTED
no import path from any entry point (51 application, 40 tooling, 152 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (REDACTED) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — llrt_core/src/modules/js/@llrt/expect/stringify.ts
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Imported but not declared in any reachable package.json — installs work only by hoisting accident. (×3) — tests/e2e/cognito_identity.e2e.test.ts:3, tests/unit/import.test.ts:39, REDACTED:400
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. (×37)
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 · Security — Read from this repository's Rust source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. (×5) — modules/llrt_crypto/src/provider/openssl.rs:76, modules/llrt_crypto/src/provider/openssl.rs:77, modules/llrt_crypto/src/provider/ring.rs:154, …
What to do
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 5 sites, not one: `modules/llrt_crypto/src/provider/openssl.rs:76` (`MessageDigest::md5`), `modules/llrt_crypto/src/provider/openssl.rs:77` (`MessageDigest::sha1`), `modules/llrt_crypto/src/provider/ring.rs:154` (`SHA1_FOR_LEGACY_USE_ONLY`), `modules/llrt_crypto/src/provider/rust/mod.rs:151` (`Md5::new`), `modules/llrt_crypto/src/provider/rust/mod.rs:152` (`Sha1::new`). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader3.5 / 10Weak✓ Tool-verified
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
`size` is read from the bytes being parsed at line 233 (`usize::from_ne_bytes`), then used to size a `vec![…; n]` at line 234 — and nowhere in its scope is `size` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `size` against the bytes actually remaining and a maximum the format allows before allocating. — llrt/src/main.rs:234
What to do
Each finding names the read that takes the length from the input and the site that spends it, and states that the value is never compared in between. Confirm from the two, then bound the length against the remaining stream before using it.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`debug!` at line 116 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — modules/llrt_tls/src/rustls_config.rs:116
`trace!` at line 150 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — modules/llrt_events/src/lib.rs:150
`trace!` at line 170 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — modules/llrt_dgram/src/socket.rs:170
`trace!` at line 52 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — modules/llrt_async_hooks/src/finalization_registry.rs:52
`trace!` at line 247 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — modules/llrt_async_hooks/src/lib.rs:247
`trace!` at line 274 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — modules/llrt_async_hooks/src/lib.rs:274
`trace!` at line 86 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/loader.rs:86
`trace!` at line 91 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/loader.rs:91
`trace!` at line 105 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/loader.rs:105
`trace!` at line 121 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/loader.rs:121
`trace!` at line 136 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/loader.rs:136
`trace!` at line 109 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:109
`trace!` at line 140 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:140
`trace!` at line 205 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:205
`trace!` at line 210 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:210
`trace!` at line 223 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:223
`trace!` at line 230 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:230
`trace!` at line 236 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:236
`trace!` at line 242 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:242
`trace!` at line 251 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:251
`trace!` at line 288 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:288
`trace!` at line 292 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:292
`trace!` at line 314 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:314
`trace!` at line 326 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:326
`trace!` at line 333 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:333
`trace!` at line 345 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:345
`trace!` at line 357 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:357
`trace!` at line 376 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:376
`trace!` at line 387 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:387
`trace!` at line 392 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:392
`trace!` at line 407 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:407
`trace!` at line 419 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:419
`trace!` at line 433 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:433
`trace!` at line 438 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:438
`trace!` at line 450 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:450
`trace!` at line 464 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:464
`trace!` at line 469 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:469
`trace!` at line 475 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:475
`trace!` at line 480 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:480
`trace!` at line 560 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — llrt_modules/src/package/resolver.rs:560
Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
3/5 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
What to do
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 1 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 67 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — AX6 reached only 23% of this repository's production lines — rust (64,702 lines), c (280 lines), python (52 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — Dockerfile:5 -------------------- 3 | COPY app.mjs ./ 4 | ADD https://github.com/awslabs/llrt/releases/latest/download/llrt-container-arm64 /usr/bin/llrt 5 | >>> RUN chmod +x /usr/bin/llrt 6 | 7 | ENV LAMBDA_HANDLER "app.handler" -------------------- ERROR: failed to solve: process "/bin/sh -c chmod +x /usr/bin/llrt" did not complete successfully: exit code: 255; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D11 Test Reliability — Test reliability not scored — polyglot repository, one half's runner produced no measurement
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — N/A — too few peers to establish a naming convention (10594 declarations, no unit with a dominant convention).
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 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.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage NOT MEASURED: the 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.
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (18 value object(s))
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
M4 Documentation accuracy — Not applicable: the 12 current-state document(s) make no claim of a kind M4 checks. 16 claim(s) of kinds M4 does not check were not checked (path 12, command argument 2, environment variable 2); M4 checks only links and versions and artefact counts.
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JavaScript/TypeScript, Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
R4 Test Coverage — 151 test file(s) reach none of 19 production file(s) via imports — exercised outside the JS import graph (integration/bundled), not import-reachable
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X12 Unreachable branch — X12 reached only 23% of this repository's production lines — rust (64,702 lines), c (280 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X16 Unfloored truncation loop — X16 reached only 23% of this repository's production lines — rust (64,702 lines), c (280 lines), python (52 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X17 Uncapped recursion over a caller-supplied document — X17 reached only 23% of this repository's production lines — rust (64,702 lines), c (280 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X2 Cancellation propagation — no C# was loaded; this repository's Rust was read, and no request in it can be cancelled by a caller — a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not 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
X3 Exception handling — X3 reached only 23% of this repository's production lines — rust (64,702 lines), c (280 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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): 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.
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.
Orphaned knowledge modules/llrt_intl/src/cldr_data.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Orphaned knowledge modules/llrt_intl/src/date_time_format.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Orphaned knowledge modules/llrt_stream_web/src/writable/default_writer.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Boundary-crossing change coupling: clone.rs ↔ console.rs libs/llrt_utils/src/clone.rs:1— `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:1— `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 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 `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.
Unlisted import 'chai' tests/e2e/cognito_identity.e2e.test.ts:3— Imported but not declared in any reachable package.json — installs work only by hoisting accident.
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: should pass ${file} tests tests/wpt/_harness-util.js:207— 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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 emit close event tests/unit/dgram.test.ts:119— 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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:161— 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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: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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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: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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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: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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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: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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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:167— 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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:171— 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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:177— 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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:187— 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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.
FileTooLong: subtle/key_algorithm.rs modules/llrt_crypto/src/subtle/key_algorithm.rs— FileTooLong — 1774 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 33 free functions. The bar is 500 significant lines; this is 1274 over it, 3.55× 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 — 1261 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-1657). The bar is 500 significant lines; this is 761 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 — 907 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-988). The bar is 500 significant lines; this is 407 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 — 663 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 163 over it, 1.33× 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 — 613 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-628). The bar is 500 significant lines; this is 113 over it, 1.23× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: readable/default_controller.rs modules/llrt_stream_web/src/readable/default_controller.rs— FileTooLong — 609 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: ReadableStreamDefaultController (4 blocks, 66-739). The bar is 500 significant lines; this is 109 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 — 603 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 103 over it, 1.21× 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: package/resolver.rs llrt_modules/src/package/resolver.rs— FileTooLong — 574 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 74 over it, 1.15× 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 — 554 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 54 over it, 1.11× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: ./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: src/headers.rs modules/llrt_fetch/src/headers.rs— FileTooLong — 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 63% of them inside a single declaration: Headers (4 blocks, 49-602). The bar is 500 significant lines; this is 19 over it, 1.04× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: stream/pipe.rs modules/llrt_stream_web/src/readable/stream/pipe.rs— FileTooLong — 503 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 3 over it, 1.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Duplicated block (6 lines × 2) modules/llrt_buffer/src/blob.rs:177— modules/llrt_buffer/src/blob.rs:177-182 | 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_buffer/src/blob.rs:177` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/modern.rs:595` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
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:1552-1557 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:1235` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:753` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:762` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/subtle/supports.rs:97— modules/llrt_crypto/src/subtle/supports.rs:97-102 | modules/llrt_crypto/src/subtle/supports.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_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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/response.rs:423` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) modules/llrt_stream_web/src/readable/default_reader.rs:335— modules/llrt_stream_web/src/readable/default_reader.rs:335-342 | 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/default_reader.rs:335` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 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_crypto/src/provider/openssl.rs:260— modules/llrt_crypto/src/provider/openssl.rs:260-265 | modules/llrt_crypto/src/provider/openssl.rs:307-312 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:260` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:691— modules/llrt_crypto/src/provider/openssl.rs:691-696 | modules/llrt_crypto/src/provider/openssl.rs:703-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:691` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `llrt_core/src/runtime_client.rs:85` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `llrt_core/src/builtins_inspect.rs:45` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/sign.rs:34` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_temporal/src/plain_date.rs:50` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `libs/llrt_logging/src/lib.rs:674` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:1178` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:1229` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) 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_stream_web/src/readable/stream/tee.rs:877— modules/llrt_stream_web/src/readable/stream/tee.rs:877-886 | modules/llrt_stream_web/src/readable/stream/tee.rs:1224-1233 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:877` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:163— modules/llrt_crypto/src/provider/openssl.rs:163-172 | modules/llrt_crypto/src/provider/openssl.rs:391-400 — both copies are in the same file, so extract the 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/provider/openssl.rs:402— modules/llrt_crypto/src/provider/openssl.rs:402-411 | modules/llrt_crypto/src/provider/openssl.rs:421-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:402` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) modules/llrt_crypto/src/subtle/supports.rs:133— modules/llrt_crypto/src/subtle/supports.rs:133-142 | modules/llrt_crypto/src/subtle/supports.rs:174-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 (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_temporal/src/utils/date.rs:59` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
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_core::clone::structured_clone llrt_core/src/clone.rs:50— FunctionTooLong — llrt_core::clone::structured_clone runs 233 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 133 over it, 2.33× 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_fetch::request::assign_request modules/llrt_fetch/src/request.rs:679— 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:755— 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:1131— 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_modules::module::require::require llrt_modules/src/module/require.rs:23— FunctionTooLong — llrt_modules::module::require::require 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.
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_json::stringify::iterate libs/llrt_json/src/stringify.rs:414— FunctionTooLong — llrt_json::stringify::iterate 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_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.
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.
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 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 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_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_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_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 libs/llrt_numbers/src/lib.rs:161— //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 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.
D30 · Dependency Vulnerabilities· Medium CVE · ×14
Duplicated block (8 lines × 2) llrt_modules/src/package/resolver.rs:315— llrt_modules/src/package/resolver.rs:315-322 | llrt_modules/src/package/resolver.rs:377-384 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `llrt_modules/src/package/resolver.rs:315` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:228` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:750` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:783` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:1134` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fs/src/file_handle.rs:429` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/writable/stream/mod.rs:110` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_util/src/text_decoder_stream.rs:44` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:850— modules/llrt_crypto/src/provider/openssl.rs:850-857 | modules/llrt_crypto/src/provider/openssl.rs:865-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:850` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) modules/llrt_util/src/text_encoder_stream.rs:88— modules/llrt_util/src/text_encoder_stream.rs:88-95 | modules/llrt_util/src/text_encoder_stream.rs:104-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_util/src/text_encoder_stream.rs:88` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/byte_controller.rs:1689` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) modules/llrt_crypto/src/lib.rs:284— modules/llrt_crypto/src/lib.rs:284-291 | modules/llrt_crypto/src/lib.rs:374-381 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/lib.rs:374` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:468` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/encapsulation.rs:142` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:452` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:1013` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) modules/llrt_fetch/src/request.rs:530— modules/llrt_fetch/src/request.rs:530-542 | modules/llrt_fetch/src/response.rs:598-610 — before extracting anything, compare `modules/llrt_fetch/src/request.rs` and `modules/llrt_fetch/src/response.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/request.rs:530` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) modules/llrt_stream_web/src/readable/byte_controller.rs:282— modules/llrt_stream_web/src/readable/byte_controller.rs:282-294 | modules/llrt_stream_web/src/readable/default_controller.rs:275-287 — 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 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/byte_controller.rs:282` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:733— modules/llrt_crypto/src/provider/openssl.rs:733-745 | modules/llrt_crypto/src/provider/openssl.rs:774-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:733` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `modules/llrt_crypto/src/provider/openssl.rs:771` calls `map_err`, `InvalidKey`, `Some` and `modules/llrt_crypto/src/provider/openssl.rs:732` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:752— modules/llrt_crypto/src/provider/openssl.rs:752-764 | modules/llrt_crypto/src/provider/openssl.rs:796-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:752` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `modules/llrt_crypto/src/provider/openssl.rs:793` calls `map_err`, `InvalidKey`, `Some` and `modules/llrt_crypto/src/provider/openssl.rs:751` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:547— modules/llrt_stream_web/src/readable/stream/tee.rs:547-559 | modules/llrt_stream_web/src/readable/stream/tee.rs:595-607 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:547` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) llrt_core/src/modules/console.rs:361— llrt_core/src/modules/console.rs:361-373 | modules/llrt_console/src/lib.rs:153-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 (13 lines × 2) modules/llrt_crypto/src/provider/openssl.rs:328— modules/llrt_crypto/src/provider/openssl.rs:328-340 | modules/llrt_crypto/src/provider/openssl.rs:361-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:328` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) 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 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/byte_controller.rs:1584` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
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.
Boundary violation [package:relative-cross-package] shims/@aws-sdk/signature-v4-multi-region.js:3— shims/@aws-sdk/signature-v4-multi-region.js:3 reaches into another package with a relative path (../../node_modules/@aws-sdk/signature-v4-multi-region/dist-es/SignatureV4SignWithCredentials) — import the package by name instead.
Boundary violation [package:relative-cross-package] shims/@aws-sdk/signature-v4-multi-region.js:4— shims/@aws-sdk/signature-v4-multi-region.js:4 reaches into another package with a relative path (../../node_modules/@aws-sdk/signature-v4-multi-region/dist-es/signature-v4-crt-container) — import the package by name instead.
Boundary violation [package:relative-cross-package] shims/@aws-sdk/signature-v4-multi-region.js:6— shims/@aws-sdk/signature-v4-multi-region.js:6 reaches into another package with a relative path (../../node_modules/@aws-sdk/signature-v4-multi-region/dist-es/SignatureV4SignWithCredentials) — import the package by name instead.
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: TransformStream.new modules/llrt_stream_web/src/transform/stream.rs:62— MethodTooLong — new runs 112 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 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
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.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×10
Edited copy of a member (7 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:566— modules/llrt_crypto/src/provider/openssl.rs:566-572 | modules/llrt_crypto/src/provider/openssl.rs:574-581 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:183— modules/llrt_crypto/src/provider/openssl.rs:183-191 | modules/llrt_crypto/src/provider/openssl.rs:198-204 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) modules/llrt_crypto/src/provider/graviola.rs:35— modules/llrt_crypto/src/provider/graviola.rs:35-41 | modules/llrt_crypto/src/provider/graviola.rs:59-65 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) modules/llrt_temporal/src/plain_date_time.rs:219— modules/llrt_temporal/src/plain_date_time.rs:219-225 | modules/llrt_temporal/src/duration.rs:177-183 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:624— modules/llrt_crypto/src/provider/openssl.rs:624-630 | modules/llrt_crypto/src/provider/openssl.rs:632-638 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) libs/llrt_utils/src/string.rs:4— libs/llrt_utils/src/string.rs:4-10 | modules/llrt_buffer/src/buffer.rs:349-356 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs:1758— modules/llrt_stream_web/src/readable/byte_controller.rs:1758-1764 | modules/llrt_stream_web/src/readable/default_controller.rs:732-738 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) modules/llrt_stream_web/src/readable/objects.rs:50— modules/llrt_stream_web/src/readable/objects.rs:50-56 | modules/llrt_stream_web/src/writable/objects.rs:25-31 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) modules/llrt_stream_web/src/readable/objects.rs:241— modules/llrt_stream_web/src/readable/objects.rs:241-247 | modules/llrt_stream_web/src/writable/objects.rs:35-41 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) modules/llrt_stream_web/src/queuing_strategy/byte_length.rs:16— modules/llrt_stream_web/src/queuing_strategy/byte_length.rs:16-24 | modules/llrt_stream_web/src/queuing_strategy/count.rs:16-22 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Repeated repair: 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 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 15 (its worst body is llrt_crypto::subtle::derive_bits::derive_bits at line 42), AT OR 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: “fixup! fix(webcrypto): limit ECDH output lengths”; “fix(webcrypto): enforce WebIDL integer ranges”; “fix(webcrypto): reject zero PBKDF2 iterations”; “fix(webcrypto): limit HKDF output 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01: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.
Repeated repair: libs/llrt_encoding/src/lib.rs libs/llrt_encoding/src/lib.rs:111— libs/llrt_encoding/src/lib.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 Encoder::encode_to_string at line 111), AT OR 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(buffer): support latin1/ascii/base64url encodings and honor concat totalLength”; “fix(encoding,util): Fix encoding streams behavior and share WTF-8 encoding logic”; “fix(encoding): correct Windows-1252 and streaming decoder behavior”; “fix(zlib): enforce maxOutputLength in the convenience methods (#1734)”. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01:00' --full-history --no-merges -- libs/llrt_encoding/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.
Repeated repair: libs/llrt_utils/src/bytes.rs libs/llrt_utils/src/bytes.rs:391— libs/llrt_utils/src/bytes.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 15 (its worst body is ObjectBytes::from_array_buffer at line 391), AT OR 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(encoding,util): use primordials and atomics in TextEncoderStream”; “fix(encoding,util): Fix encoding streams behavior and share WTF-8 encoding logic”; “fix(utils): validate ObjectBytes DataView ranges”. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01: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.
Repeated repair: modules/llrt_crypto/src/provider/rust/mod.rs modules/llrt_crypto/src/provider/rust/mod.rs:383— modules/llrt_crypto/src/provider/rust/mod.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 13 (its worst body is RustCryptoProvider::rsa_oaep_encrypt at line 383), AT OR 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(llrt_crypto): name UintRef for pkcs1 RSA keys”; “fix(crypto): improve key import validation and HMAC key length handling”; “fix(crypto): Fix OKP key representation for Ed25519 and X25519 (#1735)”. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01:00' --full-history --no-merges -- modules/llrt_crypto/src/provider/rust/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_stream_web/src/transform/stream.rs modules/llrt_stream_web/src/transform/stream.rs:305— modules/llrt_stream_web/src/transform/stream.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_stream_web::transform::stream::sink_close_algorithm at line 305), AT OR 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(stream/web): propagate transformer start errors”; “fix(streams/web): Fix Streams edge cases uncovered by expanded WPT coverage”; “fix(encoding,util): Fix encoding streams behavior and share WTF-8 encoding logic”. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01:00' --full-history --no-merges -- modules/llrt_stream_web/src/transform/stream.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 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 11 (its worst body is llrt_crypto::subtle::verify::verify at line 81), AT OR 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”. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01: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 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 13 (its worst body is EncryptionAlgorithm::from_js at line 38), AT OR 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”. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01: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 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 8 (its worst body is llrt_crypto::subtle::import_key::subtle_import_key at line 19), AT OR 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”. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01: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: libs/llrt_json/src/lib.rs libs/llrt_json/src/lib.rs:16— libs/llrt_json/src/lib.rs changed 3 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 6 (its worst body is llrt_json::redefine_static_methods at line 16), AT OR 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: honor array replacer in JSON.stringify (#1886)”; “fix(json): send surrogate escapes straight to QuickJS”; “fix(json): parse fallback reads untouched input”. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01:00' --full-history --no-merges -- libs/llrt_json/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.
llrt_modules::package::resolver::package_exports_resolve (cognitive 106) llrt_modules/src/package/resolver.rs:777— 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 43) llrt_modules/src/module/require.rs:23— llrt_modules::module::require::require has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 4 (8 pts), boolean chains 1 (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_modules::package::resolver::load_package_exports (cognitive 38) llrt_modules/src/package/resolver.rs:588— llrt_modules::package::resolver::load_package_exports has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
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_node_modules (cognitive 30) llrt_modules/src/package/resolver.rs:458— 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:287— 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:356— 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:714— 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:904— 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.
ClassTooLong: RustCryptoProvider modules/llrt_crypto/src/provider/rust/mod.rs:143— ClassTooLong — 1166 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 766 over it, 2.92× 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 — 612 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-988. The bar is 400 significant lines; this is 212 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
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 — 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 27 methods, 4 blocks, lines 41-787. The bar is 400 significant lines; this is 28 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.
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.
llrt_fetch::fetch::get_fetch_options (cognitive 116) modules/llrt_fetch/src/fetch.rs:755— 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:679— 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:1131— 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 24) modules/llrt_fetch/src/fetch.rs:570— llrt_fetch::fetch::build_request has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, loops 1 (2 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_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::headers::normalize_header_value_inplace (cognitive 18) modules/llrt_fetch/src/headers.rs:695— 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.
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.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×7
Edited copy of a member (14 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:297— modules/llrt_crypto/src/provider/openssl.rs:297-312 | modules/llrt_crypto/src/provider/openssl.rs:417-430 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) modules/llrt_temporal/src/duration.rs:190— modules/llrt_temporal/src/duration.rs:190-205 | modules/llrt_temporal/src/instant.rs:42-55 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) modules/llrt_crypto/src/provider/modern.rs:16— modules/llrt_crypto/src/provider/modern.rs:16-29 | modules/llrt_crypto/src/provider/modern.rs:36-49 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) modules/llrt_fs/src/mkdir.rs:11— modules/llrt_fs/src/mkdir.rs:11-24 | modules/llrt_fs/src/mkdir.rs:26-39 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) modules/llrt_stream_web/src/queuing_strategy/mod.rs:27— modules/llrt_stream_web/src/queuing_strategy/mod.rs:27-42 | modules/llrt_stream_web/src/queuing_strategy/mod.rs:164-177 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) modules/llrt_fs/src/chmod.rs:12— modules/llrt_fs/src/chmod.rs:12-26 | modules/llrt_fs/src/chmod.rs:28-41 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) libs/llrt_utils/src/module.rs:16— libs/llrt_utils/src/module.rs:16-29 | modules/llrt_process/src/lib.rs:276-291 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:440` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:454` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) modules/llrt_fetch/src/request.rs:289— modules/llrt_fetch/src/request.rs:289-300 | modules/llrt_fetch/src/response.rs:357-368 — before extracting anything, compare `modules/llrt_fetch/src/request.rs` and `modules/llrt_fetch/src/response.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/request.rs:289` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) 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 116 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:634— modules/llrt_crypto/src/provider/rust/mod.rs:634-645 | modules/llrt_crypto/src/provider/rust/mod.rs:706-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:634` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/encryption.rs:30` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) llrt_modules/src/package/resolver.rs:342— llrt_modules/src/package/resolver.rs:342-353 | llrt_modules/src/package/resolver.rs:404-415 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `llrt_modules/src/package/resolver.rs:342` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) libs/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. Read the line range as the matched WINDOW rather than a finished unit: at `libs/llrt_utils/src/bytes.rs:104` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/response.rs:470` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) modules/llrt_stream_web/src/readable/stream/pipe.rs:599— modules/llrt_stream_web/src/readable/stream/pipe.rs:599-607 | modules/llrt_stream_web/src/readable/stream/pipe.rs:628-636 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/pipe.rs:599` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `modules/llrt_stream_web/src/readable/stream/pipe.rs:637` calls `clone` and `modules/llrt_stream_web/src/readable/stream/pipe.rs:608` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) modules/llrt_crypto/src/provider/graviola.rs:208— modules/llrt_crypto/src/provider/graviola.rs:208-216 | modules/llrt_crypto/src/provider/graviola.rs:237-245 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/graviola.rs:208` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `modules/llrt_crypto/src/provider/graviola.rs:247` calls `Err`, `InvalidData` and `modules/llrt_crypto/src/provider/graviola.rs:217` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/writable/objects.rs:101` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `llrt_modules/src/module/loader.rs:142` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `libs/llrt_test_tls/src/server.rs:73` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Off the main sequence: llrt_dns_cache — llrt_dns_cache: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: llrt_intl — llrt_intl: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: llrt_net_policy — llrt_net_policy: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: 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_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::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_okp_key (cognitive 21) modules/llrt_crypto/src/subtle/key_algorithm.rs:2005— 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::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.
D4 · Code Duplication· Edited copy of a member (15 corresponding lines) · ×6
Edited copy of a member (15 corresponding lines) modules/llrt_stream_web/src/readable/stream/source.rs:19— modules/llrt_stream_web/src/readable/stream/source.rs:19-34 | modules/llrt_stream_web/src/writable/stream/sink.rs:19-33 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) modules/llrt_temporal/src/utils/date.rs:52— modules/llrt_temporal/src/utils/date.rs:52-68 | modules/llrt_temporal/src/utils/date.rs:73-87 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) libs/llrt_net_policy/src/lib.rs:38— libs/llrt_net_policy/src/lib.rs:38-58 | libs/llrt_net_policy/src/lib.rs:60-74 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) modules/llrt_stream_web/src/readable/stream/algorithms.rs:62— modules/llrt_stream_web/src/readable/stream/algorithms.rs:62-76 | modules/llrt_stream_web/src/readable/stream/algorithms.rs:195-212 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) modules/llrt_crypto/src/subtle/key_algorithm.rs:277— modules/llrt_crypto/src/subtle/key_algorithm.rs:277-291 | modules/llrt_crypto/src/subtle/key_algorithm.rs:293-308 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) modules/llrt_stream_web/src/writable/default_writer.rs:99— modules/llrt_stream_web/src/writable/default_writer.rs:99-113 | modules/llrt_stream_web/src/writable/default_writer.rs:156-174 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×6
Edited copy of a member (12 corresponding lines) modules/llrt_fetch/src/response.rs:422— modules/llrt_fetch/src/response.rs:422-436 | modules/llrt_fetch/src/response.rs:456-467 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) modules/llrt_stream_web/src/readable/controller.rs:91— modules/llrt_stream_web/src/readable/controller.rs:91-102 | modules/llrt_stream_web/src/readable/reader.rs:96-107 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) modules/llrt_stream/src/writable.rs:130— modules/llrt_stream/src/writable.rs:130-142 | modules/llrt_stream/src/writable.rs:144-155 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) modules/llrt_fetch/src/form_data.rs:99— modules/llrt_fetch/src/form_data.rs:99-110 | modules/llrt_url/src/url_search_params.rs:167-178 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) modules/llrt_fs/src/rm.rs:8— modules/llrt_fs/src/rm.rs:8-19 | modules/llrt_fs/src/rm.rs:22-33 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) modules/llrt_stream_web/src/readable/byob_reader.rs:336— modules/llrt_stream_web/src/readable/byob_reader.rs:336-348 | modules/llrt_stream_web/src/readable/default_reader.rs:178-189 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
llrt_modules::package::resolver::package_exports_resolve (cyclomatic 32) llrt_modules/src/package/resolver.rs:777— 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 21) llrt_modules/src/module/require.rs:23— llrt_modules::module::require::require 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.
llrt_modules::package::resolver::load_node_modules (cyclomatic 18) llrt_modules/src/package/resolver.rs:458— 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 18) llrt_modules/src/package/resolver.rs:588— llrt_modules::package::resolver::load_package_exports 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.
Skipped test: Using since() tests/unit/temporal.instant.test.ts:149— Skipped — switched off by it.skip
Skipped test: Balancing the resulting duration tests/unit/temporal.instant.test.ts:156— Skipped — switched off by it.skip
Skipped test: Using until() tests/unit/temporal.instant.test.ts:231— Skipped — switched off by it.skip
Skipped test: 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 — switched off by it.skip
Skipped test: 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 — switched off by it.skip
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 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in KeyAlgorithm::from_js at line 1319. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01: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_crypto/src/subtle/export_key.rs modules/llrt_crypto/src/subtle/export_key.rs:219— modules/llrt_crypto/src/subtle/export_key.rs changed 9 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. 4 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01: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: llrt_core/src/clone.rs llrt_core/src/clone.rs:50— llrt_core/src/clone.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in llrt_core::clone::structured_clone at line 50. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01:00' --full-history --no-merges -- llrt_core/src/clone.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: llrt_modules/src/module/require.rs llrt_modules/src/module/require.rs:23— llrt_modules/src/module/require.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in llrt_modules::module::require::require at line 23. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01:00' --full-history --no-merges -- llrt_modules/src/module/require.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 2 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. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 08:14:37 +01:00' --until='2026-11-14 08:14:37 +01: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.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×5
Edited copy of a member (9 corresponding lines) modules/llrt_temporal/src/zoned_date_time.rs:96— modules/llrt_temporal/src/zoned_date_time.rs:96-104 | modules/llrt_temporal/src/zoned_date_time.rs:144-152 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) modules/llrt_crypto/src/provider/modern.rs:324— modules/llrt_crypto/src/provider/modern.rs:324-333 | modules/llrt_crypto/src/provider/modern.rs:394-402 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) llrt_modules/src/package/loader.rs:135— llrt_modules/src/package/loader.rs:135-144 | llrt_core/src/modules/embedded/loader.rs:150-158 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) modules/llrt_events/src/lib.rs:328— modules/llrt_events/src/lib.rs:328-336 | modules/llrt_net/src/socket.rs:94-103 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:975— modules/llrt_crypto/src/provider/openssl.rs:975-983 | modules/llrt_crypto/src/provider/rust/mod.rs:1258-1266 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×5
Edited copy of a member (10 corresponding lines) modules/llrt_crypto/src/provider/rust/aes_variants.rs:33— modules/llrt_crypto/src/provider/rust/aes_variants.rs:33-42 | modules/llrt_crypto/src/provider/rust/aes_variants.rs:62-71 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) modules/llrt_stream/src/readable.rs:153— modules/llrt_stream/src/readable.rs:153-162 | modules/llrt_stream/src/writable.rs:119-128 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) modules/llrt_console/src/lib.rs:197— modules/llrt_console/src/lib.rs:197-206 | modules/llrt_console/src/lib.rs:257-270 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) modules/llrt_fs/src/mkdir.rs:41— modules/llrt_fs/src/mkdir.rs:41-51 | modules/llrt_fs/src/rm.rs:97-106 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) modules/llrt_stream_web/src/readable/default_controller.rs:587— modules/llrt_stream_web/src/readable/default_controller.rs:587-596 | modules/llrt_stream_web/src/writable/default_controller.rs:593-603 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/aes_variants.rs:217` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/sign.rs:67` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) modules/llrt_stream_web/src/readable/stream/pipe.rs:450— modules/llrt_stream_web/src/readable/stream/pipe.rs:450-456 | modules/llrt_stream_web/src/readable/stream/tee.rs:893-899 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/pipe.rs:450` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) llrt_core/src/modules/console.rs:340— llrt_core/src/modules/console.rs:340-346 | modules/llrt_console/src/lib.rs:130-136 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/encapsulation.rs:119` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Weak hash algorithm modules/llrt_crypto/src/provider/openssl.rs:76— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm modules/llrt_crypto/src/provider/openssl.rs:77— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm modules/llrt_crypto/src/provider/ring.rs:154— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm modules/llrt_crypto/src/provider/rust/mod.rs:151— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm modules/llrt_crypto/src/provider/rust/mod.rs:152— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
llrt_fetch::request::assign_request (cyclomatic 60) modules/llrt_fetch/src/request.rs:679— 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:755— 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:1131— 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 16) modules/llrt_fetch/src/fetch.rs:570— llrt_fetch::fetch::build_request 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.
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:383— 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:476— 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:669— 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:889— 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.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×4
Edited copy of a member (21 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs:279— modules/llrt_crypto/src/provider/rust/mod.rs:279-299 | modules/llrt_crypto/src/provider/rust/mod.rs:334-354 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) modules/llrt_util/src/text_decoder_stream.rs:29— modules/llrt_util/src/text_decoder_stream.rs:29-59 | modules/llrt_util/src/text_encoder_stream.rs:26-46 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) modules/llrt_temporal/src/utils/time.rs:66— modules/llrt_temporal/src/utils/time.rs:66-91 | modules/llrt_temporal/src/utils/time.rs:96-116 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) modules/llrt_os/src/network.rs:56— modules/llrt_os/src/network.rs:56-76 | modules/llrt_os/src/network.rs:78-103 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×4
Edited copy of a member (11 corresponding lines) modules/llrt_fetch/src/request.rs:86— modules/llrt_fetch/src/request.rs:86-97 | modules/llrt_fetch/src/response.rs:135-145 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) modules/llrt_stream_web/src/transform/controller.rs:36— modules/llrt_stream_web/src/transform/controller.rs:36-46 | modules/llrt_stream_web/src/transform/controller.rs:56-68 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) modules/llrt_fetch/src/request.rs:664— modules/llrt_fetch/src/request.rs:664-677 | modules/llrt_fetch/src/body_helpers.rs:233-243 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs:482— modules/llrt_stream_web/src/readable/byte_controller.rs:482-492 | modules/llrt_stream_web/src/readable/default_controller.rs:410-422 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:1243` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) modules/llrt_stream_web/src/readable/byob_reader.rs:108— modules/llrt_stream_web/src/readable/byob_reader.rs:108-124 | modules/llrt_stream_web/src/readable/default_reader.rs:128-145 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/byob_reader.rs:108` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) libs/llrt_test_tls/src/server.rs:86— libs/llrt_test_tls/src/server.rs:86-102 | libs/llrt_test_tls/src/server.rs:162-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. Read the line range as the matched WINDOW rather than a finished unit: at `libs/llrt_test_tls/src/server.rs:86` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) modules/llrt_fetch/src/response.rs:908— modules/llrt_fetch/src/response.rs:908-923 | modules/llrt_fetch/src/response.rs:1004-1019 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/response.rs:908` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
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 (16 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:942— modules/llrt_stream_web/src/readable/stream/tee.rs:942-957 | modules/llrt_stream_web/src/readable/stream/tee.rs:1312-1327 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:942` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (16 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:647— modules/llrt_stream_web/src/readable/stream/tee.rs:647-662 | modules/llrt_stream_web/src/readable/stream/tee.rs:667-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:647` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/mod.rs:781` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) modules/llrt_crypto/src/provider/rust/aes_variants.rs:120— modules/llrt_crypto/src/provider/rust/aes_variants.rs:120-133 | modules/llrt_crypto/src/provider/rust/aes_variants.rs:136-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/byob_reader.rs:48` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:1582` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `modules/llrt_stream_web/src/readable/stream/tee.rs:1578` calls `clone` and `modules/llrt_stream_web/src/readable/stream/tee.rs:1660` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/body_helpers.rs:158` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) 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 5 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 (11 lines × 2) modules/llrt_fetch/src/headers.rs:451— modules/llrt_fetch/src/headers.rs:451-461 | modules/llrt_fetch/src/headers.rs:500-513 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/headers.rs:451` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream/src/readable.rs:362` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
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:739— 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:646— 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:343— 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:383— 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 102) llrt_core/src/clone.rs:50— llrt_core::clone::structured_clone has cognitive complexity 102 (threshold 15). Drivers by points: if/else 24 (75 pts), loops 5 (13 pts), match/switch 5 (12 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_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 59) modules/llrt_path/src/lib.rs:459— llrt_path::join_resolve_path has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (47 pts), boolean chains 6, 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.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×3
REDACTED
REDACTED
REDACTED
D30 · Dependency Vulnerabilities· Medium vulnerability · ×3
REDACTED
REDACTED
REDACTED
D4 · Code Duplication· Edited copy of a member (45 corresponding lines) · ×3
Edited copy of a member (45 corresponding lines) modules/llrt_stream_web/src/transform/stream.rs:391— modules/llrt_stream_web/src/transform/stream.rs:391-435 | modules/llrt_stream_web/src/transform/stream.rs:451-503 — These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (45 corresponding lines) modules/llrt_crypto/src/subtle/key_algorithm.rs:451— modules/llrt_crypto/src/subtle/key_algorithm.rs:451-495 | modules/llrt_crypto/src/subtle/key_algorithm.rs:504-548 — These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (45 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs:96— modules/llrt_stream_web/src/readable/byte_controller.rs:96-148 | modules/llrt_stream_web/src/readable/default_controller.rs:106-150 — These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (32 corresponding lines) · ×3
Edited copy of a member (32 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs:745— modules/llrt_crypto/src/provider/rust/mod.rs:745-776 | modules/llrt_crypto/src/provider/rust/mod.rs:778-809 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (32 corresponding lines) modules/llrt_crypto/src/subtle/export_key.rs:138— modules/llrt_crypto/src/subtle/export_key.rs:138-175 | modules/llrt_crypto/src/subtle/export_key.rs:177-208 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (32 corresponding lines) modules/llrt_crypto/src/subtle/key_algorithm.rs:1228— modules/llrt_crypto/src/subtle/key_algorithm.rs:1228-1259 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1269-1300 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (24 corresponding lines) · ×3
Edited copy of a member (24 corresponding lines) llrt_core/src/builtins_inspect.rs:44— llrt_core/src/builtins_inspect.rs:44-68 | llrt_core/src/builtins_inspect.rs:70-93 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) modules/llrt_stream_web/src/lib.rs:122— modules/llrt_stream_web/src/lib.rs:122-145 | modules/llrt_stream_web/src/lib.rs:157-183 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) llrt_modules/src/module/loader.rs:79— llrt_modules/src/module/loader.rs:79-102 | llrt_modules/src/module/resolver.rs:71-94 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (20 corresponding lines) · ×3
Edited copy of a member (20 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs:308— modules/llrt_crypto/src/provider/rust/mod.rs:308-327 | modules/llrt_crypto/src/provider/rust/mod.rs:362-381 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) modules/llrt_crypto/src/subtle/encryption.rs:27— modules/llrt_crypto/src/subtle/encryption.rs:27-46 | modules/llrt_crypto/src/subtle/encryption.rs:53-72 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) modules/llrt_stream_web/src/readable/byob_reader.rs:359— modules/llrt_stream_web/src/readable/byob_reader.rs:359-378 | modules/llrt_stream_web/src/readable/default_reader.rs:200-219 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×3
Edited copy of a member (17 corresponding lines) modules/llrt_crypto/src/subtle/encapsulation.rs:118— modules/llrt_crypto/src/subtle/encapsulation.rs:118-134 | modules/llrt_crypto/src/subtle/encapsulation.rs:171-188 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) libs/llrt_utils/src/fs.rs:34— libs/llrt_utils/src/fs.rs:34-50 | libs/llrt_utils/src/fs.rs:52-68 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs:382— modules/llrt_stream_web/src/readable/byte_controller.rs:382-403 | modules/llrt_stream_web/src/readable/default_controller.rs:313-329 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×3
Edited copy of a member (6 corresponding lines) modules/llrt_fs/src/mkdir.rs:67— modules/llrt_fs/src/mkdir.rs:67-73 | modules/llrt_fs/src/mkdir.rs:75-80 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) modules/llrt_fetch/src/headers.rs:685— modules/llrt_fetch/src/headers.rs:685-693 | modules/llrt_fetch/src/response.rs:94-99 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) libs/llrt_utils/src/bytes.rs:650— libs/llrt_utils/src/bytes.rs:650-655 | libs/llrt_utils/src/string.rs:12-17 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/export_key.rs:250` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) modules/llrt_fetch/src/request.rs:537— modules/llrt_fetch/src/request.rs:537-546 | modules/llrt_fetch/src/response.rs:570-579 | modules/llrt_fetch/src/response.rs:605-614 — before extracting anything, compare `modules/llrt_fetch/src/request.rs` and `modules/llrt_fetch/src/response.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/request.rs:537` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
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 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/byte_controller.rs:214` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `modules/llrt_stream_web/src/readable/byte_controller.rs:224` calls `clone` and `modules/llrt_stream_web/src/writable/default_controller.rs:186` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9–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. Read the line range as the matched WINDOW rather than a finished unit: at `libs/llrt_utils/src/bytes.rs:92` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:1374` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:750` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:783` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 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.
Duplicated block (5 lines × 2) llrt_modules/src/package/resolver.rs:810— llrt_modules/src/package/resolver.rs:810-814 | llrt_modules/src/package/resolver.rs:865-869 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `llrt_modules/src/package/resolver.rs:816` calls `Some`, `String`, `get` and `llrt_modules/src/package/resolver.rs:871` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) modules/llrt_fetch/src/request.rs:608— modules/llrt_fetch/src/request.rs:608-612 | modules/llrt_fetch/src/response.rs:1061-1065 — before extracting anything, compare `modules/llrt_fetch/src/request.rs` and `modules/llrt_fetch/src/response.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/request.rs:608` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:1083` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
llrt_core::clone::structured_clone (cyclomatic 41) llrt_core/src/clone.rs:50— llrt_core::clone::structured_clone has cyclomatic complexity 41 (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.
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.
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.
FixmeComment libs/llrt_logging/src/lib.rs:370— //FIXME can be removed if https://github.com/DelSkayn/rquickjs/pull/447 is merged
llrt_buffer::blob::process_parts (cognitive 47) modules/llrt_buffer/src/blob.rs:343— 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:646— 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.
llrt_json::stringify::iterate (cognitive 27) libs/llrt_json/src/stringify.rs:414— llrt_json::stringify::iterate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
llrt_json::stringify::write_primitive2 (cognitive 17) libs/llrt_json/src/stringify.rs:208— llrt_json::stringify::write_primitive2 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
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.
D4 · Code Duplication· Edited copy of a member (59 corresponding lines) · ×2
Edited copy of a member (59 corresponding lines) modules/llrt_fetch/src/headers.rs:73— modules/llrt_fetch/src/headers.rs:73-141 | modules/llrt_fetch/src/headers.rs:190-248 — These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (59 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs:256— modules/llrt_stream_web/src/readable/byte_controller.rs:256-314 | modules/llrt_stream_web/src/readable/default_controller.rs:246-307 — These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (1 corresponding lines) · ×2
Edited copy of a member (1 corresponding lines) modules/llrt_zlib/src/brotli.rs:45— modules/llrt_zlib/src/brotli.rs:45-45 | modules/llrt_zlib/src/brotli.rs:48-48 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) modules/llrt_zlib/src/zstd.rs:52— modules/llrt_zlib/src/zstd.rs:52-52 | modules/llrt_zlib/src/zstd.rs:55-55 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×2
Edited copy of a member (19 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:839— modules/llrt_crypto/src/provider/openssl.rs:839-857 | modules/llrt_crypto/src/provider/openssl.rs:892-911 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) modules/llrt_fs/src/read_dir.rs:108— modules/llrt_fs/src/read_dir.rs:108-127 | modules/llrt_fs/src/read_dir.rs:129-147 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (28 corresponding lines) · ×2
Edited copy of a member (28 corresponding lines) modules/llrt_fetch/src/request.rs:484— modules/llrt_fetch/src/request.rs:484-511 | modules/llrt_fetch/src/response.rs:515-552 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) modules/llrt_buffer/src/blob.rs:122— modules/llrt_buffer/src/blob.rs:122-149 | modules/llrt_buffer/src/blob.rs:175-206 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 11+ corresponding lines) · ×2
Edited copies of one member (3 members, 11+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:686— modules/llrt_crypto/src/provider/openssl.rs:686-696 | modules/llrt_crypto/src/provider/openssl.rs:698-708 | modules/llrt_crypto/src/provider/openssl.rs:714-726 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 11+ corresponding lines) modules/llrt_fs/src/stats.rs:174— modules/llrt_fs/src/stats.rs:174-184 | modules/llrt_fs/src/stats.rs:187-197 | modules/llrt_fs/src/stats.rs:200-210 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×2
Edited copy of a member (16 corresponding lines) modules/llrt_fs/src/file_handle.rs:422— modules/llrt_fs/src/file_handle.rs:422-439 | modules/llrt_fs/src/file_handle.rs:450-465 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) libs/llrt_utils/src/fs.rs:70— libs/llrt_utils/src/fs.rs:70-85 | libs/llrt_utils/src/fs.rs:87-102 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×2
Edited copy of a member (13 corresponding lines) modules/llrt_fetch/src/form_data.rs:183— modules/llrt_fetch/src/form_data.rs:183-195 | modules/llrt_url/src/url_search_params.rs:146-165 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) libs/llrt_logging/src/lib.rs:820— libs/llrt_logging/src/lib.rs:820-833 | modules/llrt_console/src/lib.rs:106-118 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×2
Edited copy of a member (8 corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:817— modules/llrt_crypto/src/provider/openssl.rs:817-824 | modules/llrt_crypto/src/provider/openssl.rs:1031-1038 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) llrt_core/src/modules/llrt/xml.rs:462— llrt_core/src/modules/llrt/xml.rs:462-471 | llrt_core/src/modules/llrt/xml.rs:479-486 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (5 corresponding lines) · ×2
Edited copy of a member (5 corresponding lines) modules/llrt_exceptions/src/lib.rs:128— modules/llrt_exceptions/src/lib.rs:128-132 | modules/llrt_stream_web/src/readable/iterator.rs:315-320 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) modules/llrt_temporal/src/instant.rs:133— modules/llrt_temporal/src/instant.rs:133-137 | modules/llrt_temporal/src/zoned_date_time.rs:197-201 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:468` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_temporal/src/utils/date_time.rs:47` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) llrt_core/src/modules/embedded/loader.rs:94— llrt_core/src/modules/embedded/loader.rs:94-111 | llrt_modules/src/package/loader.rs:38-55 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (18 lines × 2) modules/llrt_stream_web/src/transform/stream.rs:401— modules/llrt_stream_web/src/transform/stream.rs:401-418 | modules/llrt_stream_web/src/transform/stream.rs:464-481 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/transform/stream.rs:401` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16–17 lines × 2) libs/llrt_json/src/stringify.rs:484— libs/llrt_json/src/stringify.rs:484-500 | libs/llrt_json/src/stringify.rs:529-544 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `libs/llrt_json/src/stringify.rs:484` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `libs/llrt_json/src/stringify.rs:528` calls `Some` and `libs/llrt_json/src/stringify.rs:483` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16–17 lines × 2) modules/llrt_fetch/src/response.rs:824— modules/llrt_fetch/src/response.rs:824-840 | modules/llrt_fetch/src/response.rs:870-885 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/response.rs:824` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–15 lines × 2) llrt_modules/src/package/resolver.rs:298— llrt_modules/src/package/resolver.rs:298-312 | llrt_modules/src/package/resolver.rs:362-375 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `llrt_modules/src/package/resolver.rs:298` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_intl/src/pattern_formatter.rs:81` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:397` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:456` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/request.rs:393` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `modules/llrt_temporal/src/zoned_date_time.rs:113` calls `to_instant`, `from_zoned` and `modules/llrt_temporal/src/instant.rs:100` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
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: 1 of the 59 points is its own statement and the rest belongs to 15 function items inside it that branch (a function literal at line 420, ordinalOf, a function literal at line 69, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
jest-utils.eq (cyclomatic 37) llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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) llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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.
llrt_path::join_resolve_path (cyclomatic 27) modules/llrt_path/src/lib.rs:459— llrt_path::join_resolve_path 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.
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.
llrt_utils::signals::parse_signal (cyclomatic 18) libs/llrt_utils/src/signals.rs:50— llrt_utils::signals::parse_signal has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
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_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). None of this is in the body itself: all 72 points belong to 15 function items inside it that branch (a function literal at line 420, a function literal at line 69, a function literal at line 140, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
jest-utils.iterableEquality (cognitive 71) llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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) llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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:257— 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:12— 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_stream_web::transform::stream::sink_write_algorithm (cognitive 20) modules/llrt_stream_web/src/transform/stream.rs:230— llrt_stream_web::transform::stream::sink_write_algorithm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
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_numbers::fractional_to_base (cognitive 19) libs/llrt_numbers/src/lib.rs:130— llrt_numbers::fractional_to_base has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
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.
URLSearchParams::from_array (cognitive 16) modules/llrt_url/src/url_search_params.rs:349— 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.
TooManyFields: BasePrimordials libs/llrt_utils/src/primordials.rs:11— TooManyFields — 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×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:287— llrt_modules/src/package/resolver.rs:287-353 | llrt_modules/src/package/resolver.rs:356-415 — 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.
D4 · Code Duplication· Edited copy of a member (310 corresponding lines) · ×1
Edited copy of a member (310 corresponding lines) modules/llrt_stream_web/src/readable/stream/tee.rs:814— modules/llrt_stream_web/src/readable/stream/tee.rs:814-1123 | modules/llrt_stream_web/src/readable/stream/tee.rs:1140-1527 — These two members are one piece of code written twice and then edited apart: 310 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (31 corresponding lines) · ×1
Edited copy of a member (31 corresponding lines) modules/llrt_crypto/src/provider/rust/aes_variants.rs:216— modules/llrt_crypto/src/provider/rust/aes_variants.rs:216-246 | modules/llrt_crypto/src/provider/rust/aes_variants.rs:253-283 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (56 corresponding lines) · ×1
Edited copy of a member (56 corresponding lines) modules/llrt_crypto/src/subtle/sign.rs:66— modules/llrt_crypto/src/subtle/sign.rs:66-121 | modules/llrt_crypto/src/subtle/verify.rs:87-154 — These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (52 corresponding lines) · ×1
Edited copy of a member (52 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs:389— modules/llrt_crypto/src/provider/rust/mod.rs:389-441 | modules/llrt_crypto/src/provider/rust/mod.rs:449-500 — These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (78 corresponding lines) · ×1
Edited copy of a member (78 corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs:158— modules/llrt_stream_web/src/readable/byte_controller.rs:158-251 | modules/llrt_stream_web/src/readable/default_controller.rs:162-239 — These two members are one piece of code written twice and then edited apart: 78 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 26+ corresponding lines) · ×1
Edited copies of one member (3 members, 26+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:320— modules/llrt_crypto/src/provider/openssl.rs:320-345 | modules/llrt_crypto/src/provider/openssl.rs:353-378 | modules/llrt_crypto/src/provider/openssl.rs:590-615 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 1+ corresponding lines) · ×1
Edited copies of one member (6 members, 1+ corresponding lines) modules/llrt_zlib/src/zlib.rs:74— modules/llrt_zlib/src/zlib.rs:74-74 | modules/llrt_zlib/src/zlib.rs:77-77 | modules/llrt_zlib/src/zlib.rs:80-80 | modules/llrt_zlib/src/zlib.rs:83-83 | modules/llrt_zlib/src/zlib.rs:86-86 | modules/llrt_zlib/src/zlib.rs:89-89 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (62 corresponding lines) · ×1
Edited copy of a member (62 corresponding lines) modules/llrt_stream_web/src/readable/default_reader.rs:324— modules/llrt_stream_web/src/readable/default_reader.rs:324-385 | modules/llrt_stream_web/src/readable/iterator.rs:455-523 — These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×1
Edited copy of a member (25 corresponding lines) llrt_core/src/modules/console.rs:358— llrt_core/src/modules/console.rs:358-382 | modules/llrt_console/src/lib.rs:148-178 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (67 corresponding lines) · ×1
Edited copy of a member (67 corresponding lines) modules/llrt_stream_web/src/readable/stream/tee.rs:1543— modules/llrt_stream_web/src/readable/stream/tee.rs:1543-1609 | modules/llrt_stream_web/src/readable/stream/tee.rs:1625-1691 — These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 18+ corresponding lines) · ×1
Edited copies of one member (3 members, 18+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:212— modules/llrt_crypto/src/provider/openssl.rs:212-235 | modules/llrt_crypto/src/provider/openssl.rs:244-265 | modules/llrt_crypto/src/provider/openssl.rs:272-289 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (33 corresponding lines) · ×1
Edited copy of a member (33 corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs:1158— modules/llrt_crypto/src/provider/rust/mod.rs:1158-1190 | modules/llrt_crypto/src/provider/rust/mod.rs:1457-1501 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (39 corresponding lines) · ×1
Edited copy of a member (39 corresponding lines) modules/llrt_stream_web/src/readable/stream/mod.rs:774— modules/llrt_stream_web/src/readable/stream/mod.rs:774-823 | modules/llrt_stream_web/src/readable/stream/mod.rs:877-915 — These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×1
Edited copy of a member (22 corresponding lines) modules/llrt_crypto/src/subtle/encapsulation.rs:141— modules/llrt_crypto/src/subtle/encapsulation.rs:141-162 | modules/llrt_crypto/src/subtle/encapsulation.rs:198-219 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×1
Edited copy of a member (23 corresponding lines) modules/llrt_crypto/src/subtle/sign.rs:26— modules/llrt_crypto/src/subtle/sign.rs:26-48 | modules/llrt_crypto/src/subtle/verify.rs:28-54 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×1
Edited copy of a member (18 corresponding lines) modules/llrt_stream_web/src/transform/controller.rs:305— modules/llrt_stream_web/src/transform/controller.rs:305-322 | modules/llrt_stream_web/src/transform/controller.rs:328-350 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 15+ corresponding lines) · ×1
Edited copies of one member (4 members, 15+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:731— modules/llrt_crypto/src/provider/openssl.rs:731-745 | modules/llrt_crypto/src/provider/openssl.rs:750-764 | modules/llrt_crypto/src/provider/openssl.rs:769-786 | modules/llrt_crypto/src/provider/openssl.rs:791-808 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (27 corresponding lines) · ×1
Edited copy of a member (27 corresponding lines) modules/llrt_stream_web/src/readable/byob_reader.rs:66— modules/llrt_stream_web/src/readable/byob_reader.rs:66-104 | modules/llrt_stream_web/src/readable/default_reader.rs:98-124 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 16+ corresponding lines) · ×1
Edited copies of one member (4 members, 16+ corresponding lines) modules/llrt_crypto/src/provider/rust/mod.rs:988— modules/llrt_crypto/src/provider/rust/mod.rs:988-1003 | modules/llrt_crypto/src/provider/rust/mod.rs:1008-1023 | modules/llrt_crypto/src/provider/rust/mod.rs:1028-1047 | modules/llrt_crypto/src/provider/rust/mod.rs:1052-1069 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 15+ corresponding lines) · ×1
Edited copies of one member (3 members, 15+ corresponding lines) modules/llrt_stream_web/src/writable/default_controller.rs:768— modules/llrt_stream_web/src/writable/default_controller.rs:768-788 | modules/llrt_stream_web/src/writable/default_controller.rs:809-823 | modules/llrt_stream_web/src/writable/default_controller.rs:845-864 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 16+ corresponding lines) · ×1
Edited copies of one member (3 members, 16+ corresponding lines) modules/llrt_stream_web/src/readable/default_reader.rs:409— modules/llrt_stream_web/src/readable/default_reader.rs:409-424 | modules/llrt_stream_web/src/readable/default_reader.rs:439-454 | modules/llrt_stream_web/src/readable/default_reader.rs:469-484 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 13+ corresponding lines) · ×1
Edited copies of one member (3 members, 13+ corresponding lines) modules/llrt_fetch/src/response.rs:469— modules/llrt_fetch/src/response.rs:469-481 | modules/llrt_fetch/src/response.rs:483-495 | modules/llrt_fetch/src/response.rs:497-513 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 6+ corresponding lines) · ×1
Edited copies of one member (3 members, 6+ corresponding lines) modules/llrt_crypto/src/provider/openssl.rs:863— modules/llrt_crypto/src/provider/openssl.rs:863-872 | modules/llrt_crypto/src/provider/openssl.rs:954-959 | modules/llrt_crypto/src/provider/openssl.rs:989-999 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 13+ corresponding lines) · ×1
Edited copies of one member (5 members, 13+ corresponding lines) modules/llrt_stream_web/src/readable/byte_controller.rs:1604— modules/llrt_stream_web/src/readable/byte_controller.rs:1604-1623 | modules/llrt_stream_web/src/readable/default_controller.rs:559-578 | modules/llrt_stream_web/src/writable/default_controller.rs:622-639 | modules/llrt_stream_web/src/writable/default_controller.rs:644-656 | modules/llrt_stream_web/src/writable/default_controller.rs:662-674 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 7+ corresponding lines) · ×1
Edited copies of one member (3 members, 7+ corresponding lines) modules/llrt_fetch/src/form_data.rs:376— modules/llrt_fetch/src/form_data.rs:376-382 | modules/llrt_fetch/src/headers.rs:579-585 | modules/llrt_url/src/url_search_params.rs:477-483 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 5+ corresponding lines) · ×1
Edited copies of one member (5 members, 5+ corresponding lines) modules/llrt_temporal/src/duration.rs:67— modules/llrt_temporal/src/duration.rs:67-71 | 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 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (4 corresponding lines) · ×1
Edited copy of a member (4 corresponding lines) modules/llrt_exceptions/src/lib.rs:118— modules/llrt_exceptions/src/lib.rs:118-121 | modules/llrt_stream_web/src/readable/iterator.rs:305-308 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:1545` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (30–31 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:1160— modules/llrt_crypto/src/provider/rust/mod.rs:1160-1190 | modules/llrt_crypto/src/provider/rust/mod.rs:1460-1489 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `modules/llrt_crypto/src/provider/rust/mod.rs:1458` calls `Some` and `modules/llrt_crypto/src/provider/rust/mod.rs:1158` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/headers.rs:82` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (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 116 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–22 lines × 2) modules/llrt_stream_web/src/readable/byte_controller.rs:214— modules/llrt_stream_web/src/readable/byte_controller.rs:214-232 | modules/llrt_stream_web/src/readable/default_controller.rs:200-221 — 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 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/byte_controller.rs:214` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18–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 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/default_controller.rs:252` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:832` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18–19 lines × 2) modules/llrt_os/src/network.rs:57— modules/llrt_os/src/network.rs:57-74 | modules/llrt_os/src/network.rs:79-97 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_os/src/network.rs:79` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `modules/llrt_intl/src/date_time_format.rs:484` calls `push_str` and `modules/llrt_intl/src/date_time_format.rs:468` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7–15 lines × 2) modules/llrt_stream_web/src/readable/stream/tee.rs:904— modules/llrt_stream_web/src/readable/stream/tee.rs:904-910 | modules/llrt_stream_web/src/readable/stream/tee.rs:1251-1265 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_stream_web/src/readable/stream/tee.rs:904` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `objects` to `ReadableStreamDefaultReaderObjects<'js>` in one and `ReadableStreamBYOBObjects<'js>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `modules/llrt_stream_web/src/readable/stream/tee.rs:1266` calls `clone` and `modules/llrt_stream_web/src/readable/stream/tee.rs:911` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:879` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:969` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11–13 lines × 2) modules/llrt_fetch/src/response.rs:925— modules/llrt_fetch/src/response.rs:925-937 | modules/llrt_fetch/src/response.rs:1021-1031 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/response.rs:925` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11–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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:923` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10–12 lines × 2) modules/llrt_fetch/src/request.rs:500— modules/llrt_fetch/src/request.rs:500-511 | modules/llrt_fetch/src/response.rs:541-550 — before extracting anything, compare `modules/llrt_fetch/src/request.rs` and `modules/llrt_fetch/src/response.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/request.rs:500` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9–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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `modules/llrt_stream_web/src/readable/stream/tee.rs:524` calls `into` and `modules/llrt_stream_web/src/readable/stream/tee.rs:133` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 3) modules/llrt_crypto/src/provider/rust/mod.rs:991— modules/llrt_crypto/src/provider/rust/mod.rs:991-1000 | modules/llrt_crypto/src/provider/rust/mod.rs:1011-1020 | modules/llrt_crypto/src/provider/rust/mod.rs:1034-1044 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:991` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–11 lines × 2) modules/llrt_crypto/src/provider/rust/mod.rs:394— modules/llrt_crypto/src/provider/rust/mod.rs:394-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:394` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_temporal/src/plain_date.rs:62` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/subtle/key_algorithm.rs:857` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 3) modules/llrt_crypto/src/provider/rust/mod.rs:1519— modules/llrt_crypto/src/provider/rust/mod.rs:1519-1527 | modules/llrt_crypto/src/provider/rust/mod.rs:1530-1538 | modules/llrt_crypto/src/provider/rust/mod.rs:1541-1549 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:1519` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/request.rs:393` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/rust/mod.rs:905` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7–8 lines × 3) modules/llrt_crypto/src/provider/openssl.rs:879— modules/llrt_crypto/src/provider/openssl.rs:879-886 | modules/llrt_crypto/src/provider/openssl.rs:904-911 | modules/llrt_crypto/src/provider/openssl.rs:1171-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:879` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (4–6 lines × 4) modules/llrt_crypto/src/provider/openssl.rs:771— modules/llrt_crypto/src/provider/openssl.rs:771-774 | modules/llrt_crypto/src/provider/openssl.rs:793-796 | modules/llrt_crypto/src/provider/openssl.rs:1118-1123 | modules/llrt_crypto/src/provider/openssl.rs:1134-1139 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_crypto/src/provider/openssl.rs:771` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5–6 lines × 2) modules/llrt_fetch/src/response.rs:587— modules/llrt_fetch/src/response.rs:587-591 | modules/llrt_fetch/src/response.rs:622-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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_fetch/src/response.rs:587` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 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. Read the line range as the matched WINDOW rather than a finished unit: at `modules/llrt_buffer/src/array_buffer_view.rs:40` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
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.
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.
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 · llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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) llrt_core/src/modules/js/@llrt/expect/jest-utils.ts:142— llrt_core/src/modules/js/@llrt/expect/jest-utils.ts:142 · llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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) llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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) llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: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 (anonymous) (cyclomatic 17, cognitive 16) tests/unit/fetch.redirects.test.ts:22— (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 14, cognitive 18) tests/unit/fetch.redirects.test.ts:106— (anonymous) has cyclomatic complexity 14 and cognitive complexity 18; 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.
Complex function (anonymous) (cyclomatic 12, cognitive 25) tests/unit/fetch.test.ts:34— (anonymous) has cyclomatic complexity 12 and cognitive complexity 25; 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: 695 lines of code REDACTED:1— REDACTED has 695 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· llrt_core/src/modules/js/@llrt/expect/jest-expect.ts · ×1
llrt_core/src/modules/js/@llrt/expect/jest-expect.ts: 599 lines of code llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:1— llrt_core/src/modules/js/@llrt/expect/jest-expect.ts has 599 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· llrt_core/src/modules/js/@llrt/expect/jest-utils.ts · ×1
llrt_core/src/modules/js/@llrt/expect/jest-utils.ts: 460 lines of code llrt_core/src/modules/js/@llrt/expect/jest-utils.ts:1— llrt_core/src/modules/js/@llrt/expect/jest-utils.ts has 460 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
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:57— 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.
Dead file (~657 LoC) llrt_core/src/modules/js/@llrt/expect/jest-expect.ts— no import path from any entry point (51 application, 40 tooling, 152 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~545 LoC) llrt_core/src/modules/js/@llrt/expect/jest-utils.ts— no import path from any entry point (51 application, 40 tooling, 152 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (REDACTED, llrt_core/src/modules/js/@llrt/expect/jest-expect.ts) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~394 LoC) REDACTED— no import path from any entry point (51 application, 40 tooling, 152 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (llrt_core/src/modules/js/@llrt/expect/jest-expect.ts) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~230 LoC) llrt_core/src/modules/js/stream.ts— no import path from any entry point (51 application, 40 tooling, 152 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~82 LoC) llrt_core/src/modules/js/@llrt/expect/stringify.ts— no import path from any entry point (51 application, 40 tooling, 152 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (REDACTED) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
Dead file (~13 LoC) shims/string-hasher.js— no import path from any entry point (51 application, 40 tooling, 152 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~6 LoC) llrt_core/src/modules/js/stream/promises.ts— no import path from any entry point (51 application, 40 tooling, 152 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Unused dependency '@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.
Unused dependency '@aws-sdk/client-apigatewayv2' — 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-appconfig' — 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-appconfigdata' — 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-appsync' — 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-athena' — 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-auto-scaling' — 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-batch' — 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-bedrock' — 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-bedrock-agent' — 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-bedrock-agent-runtime' — 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-bedrock-runtime' — 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-cloudformation' — 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-cloudwatch' — 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-cloudwatch-events' — 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-cloudwatch-logs' — 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-ecr' — 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-ecs' — 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-efs' — 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-eks' — 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-elastic-load-balancing-v2' — 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-elasticache' — 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-eventbridge' — 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-firehose' — 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-glue' — 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-iam' — 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-kinesis' — 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-kms' — 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-lambda' — 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-location' — 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-mediaconvert' — 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-opensearch' — 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-opensearchserverless' — 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-polly' — 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-rds' — 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.
X15 · Unvalidated length from an untrusted reader· Length read from the parsed input is spent without ever being bounded · ×1
Length read from the parsed input is spent without ever being bounded llrt/src/main.rs:234— `size` is read from the bytes being parsed at line 233 (`usize::from_ne_bytes`), then used to size a `vec![…; n]` at line 234 — and nowhere in its scope is `size` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `size` against the bytes actually remaining and a maximum the format allows before allocating.
Interpolated log message defeats structured logging modules/llrt_tls/src/rustls_config.rs:116— `debug!` at line 116 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging modules/llrt_events/src/lib.rs:150— `trace!` at line 150 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging modules/llrt_dgram/src/socket.rs:170— `trace!` at line 170 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging modules/llrt_async_hooks/src/finalization_registry.rs:52— `trace!` at line 52 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging modules/llrt_async_hooks/src/lib.rs:247— `trace!` at line 247 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging modules/llrt_async_hooks/src/lib.rs:274— `trace!` at line 274 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/loader.rs:86— `trace!` at line 86 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/loader.rs:91— `trace!` at line 91 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/loader.rs:105— `trace!` at line 105 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/loader.rs:121— `trace!` at line 121 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/loader.rs:136— `trace!` at line 136 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:109— `trace!` at line 109 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:140— `trace!` at line 140 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:205— `trace!` at line 205 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:210— `trace!` at line 210 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:223— `trace!` at line 223 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:230— `trace!` at line 230 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:236— `trace!` at line 236 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:242— `trace!` at line 242 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:251— `trace!` at line 251 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:288— `trace!` at line 288 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:292— `trace!` at line 292 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:314— `trace!` at line 314 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:326— `trace!` at line 326 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging llrt_modules/src/package/resolver.rs:333— `trace!` at line 333 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Orphaned file modules/llrt_events/src/lib.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_intl/src/pattern_formatter.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_stream_web/src/readable/objects.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_stream_web/src/readable/reader.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_dgram/src/lib.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_string_decoder/src/lib.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libs/llrt_utils/src/any_of.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_stream_web/src/readable/controller.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_intl/src/lib.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_buffer/src/array_buffer_view.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_stream_web/src/writable/objects.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_tls/src/rustls_config.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libs/llrt_test/src/lib.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_fs/src/open.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_stream_web/src/utils/queue.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libs/llrt_utils/src/option.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libs/llrt_utils/src/fs.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file modules/llrt_http/src/agent.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libs/llrt_compression/src/lib.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
redundant comment benchmarks/v8-v7/base.js:136— "Computes the geometric mean of a set of numbers." repeats the code it sits on: 4 of its 5 words (geometric, mean, set, numbers) are already in `BenchmarkSuite.GeometricMean = function (numbers)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment tests/e2e/cognito_identity.e2e.test.ts:19— "Test getCredentialsForIdentity() with Id from above" repeats the code it sits on: 4 of its 5 words (get, credentials, identity, id) are already in `const getCredentialsResult = await unAuthClient.getCredentialsForIdentity({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment tests/e2e/s3.e2e.test.ts:156— "create multipart upload" repeats the code it sits on: 3 of its 3 words (create, multipart, upload) are already in `const createResult = await client.createMultipartUpload({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment tests/e2e/s3.e2e.test.ts:208— "create multipart upload" repeats the code it sits on: 3 of its 3 words (create, multipart, upload) are already in `const createResult = await client.createMultipartUpload({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment tests/e2e/s3.e2e.test.ts:217— "abort multipart upload" repeats the code it sits on: 3 of its 3 words (abort, multipart, upload) are already in `const abortResult = await client.abortMultipartUpload({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment tests/unit/crypto.subtle.test.ts:2557— "For asymmetric keys, test both public and private keys" repeats the code it sits on: 4 of its 5 words (keys, test, public, private) are already in `const keysToTest = originalKey.publicKey`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment tests/unit/fetch.request.test.ts:343— "── Request.body returns ReadableStream ──" repeats the code it sits on: 4 of its 5 words (body, returns, readable, stream) are already in `it("should return same ReadableStream on multiple body accesses", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 11 significant file(s) lose their only recent owner: llrt_modules/src/package/resolver.rs, modules/llrt_temporal/src/zoned_date_time.rs, modules/llrt_temporal/src/plain_date_time.rs, llrt_modules/src/module/require.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 (+3 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 8 significant file(s) lose their only recent owner: modules/llrt_stream_web/src/readable/byte_controller.rs, modules/llrt_stream_web/src/readable/iterator.rs, libs/llrt_json/src/stringify.rs, libs/llrt_json/src/lib.rs, modules/llrt_stream_web/src/utils/promise.rs, modules/llrt_util/src/style_text.rs, libs/llrt_json/src/parse.rs, modules/llrt_os/src/network.rs. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: modules/llrt_crypto/src/subtle/digest.rs, modules/llrt_crypto/src/subtle/encapsulation.rs, modules/llrt_crypto/src/subtle/derive_bits.rs, modules/llrt_crypto/src/subtle/get_public_key.rs. Pair on, review, or document these before any departure.
Duplicated predicate modules/llrt_fetch/src/fetch.rs:791— `!priority.is_undefined() && !priority.is_null()` appears character-identically in 2 files — modules/llrt_fetch/src/fetch.rs, modules/llrt_fetch/src/request.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate modules/llrt_crypto/src/provider/openssl.rs:1238— `key_data.len() != 1 + 2 * coord_len || key_data[0] != 0x04` appears character-identically in 2 files — modules/llrt_crypto/src/provider/openssl.rs, modules/llrt_crypto/src/provider/rust/mod.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
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 (25 single-owned of 177 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 177 of the 262 production source files in this repository met that bar). They are anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: modules/llrt_stream_web/src/queuing_strategy/tests.rs, libs/llrt_utils/src/signals.rs.
No ADRs found llrt/Cargo.toml:62— No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `llrt/Cargo.toml` makes this repository a deployable product (line 62).
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 46 project(s) overshoot their size bounds, lowering Project Cohesion to 9.6/10. The most over is `(repository root)` (17109 LoC, 26 module-visible types across 12 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 19 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 11 more) (22 orphaned of 177 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 177 of the 262 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
Logging is not universal — Only 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`.
P3 · Security & performance tooling· Dependabot does not watch gitsubmodule · ×1
Dependabot does not watch gitsubmodule REDACTED:7— `REDACTED` schedules updates, but no `package-ecosystem` entry covers `gitsubmodule`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the `updates:` list.
Changelog looks stale/thin — The changelog this check read carries 1 versioned entry, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [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.
X5 · Nullable reference types· Strict null checking is not enabled everywhere the repository type-checks · ×1
Strict null checking is not enabled everywhere the repository type-checks — 3/5 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
Outdated: const-oid — `const-oid` is locked at 0.10.2 but 0.10.3 is the current stable release on crates.io, and it already satisfies the `"0.10"` requirement declared in modules/llrt_crypto/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p const-oid` and commit the updated REDACTED.
Outdated: graviola — `graviola` is locked at 0.4.4 but 0.4.5 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in modules/llrt_crypto/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p graviola` and commit the updated REDACTED.
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: jiff — `jiff` is locked at 0.2.42 but 0.2.43 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in llrt/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p jiff` and commit the updated REDACTED.
Outdated: sysinfo — `sysinfo` is locked at 0.40.1 but 0.40.3 is the current stable release on crates.io, and it already satisfies the `"0.40"` requirement declared in modules/llrt_os/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p sysinfo` and commit the updated REDACTED.
Outdated: webpki-roots — `webpki-roots` is locked at 1.0.11 but 1.0.12 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in modules/llrt_tls/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p webpki-roots` and commit the updated REDACTED.
Outdated: zstd — `zstd` is locked at 0.14.3 but 0.14.4 is the current stable release on crates.io, and it already satisfies the `"0.14"` requirement declared in llrt_core/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p zstd` and commit the updated REDACTED.
doc comments repeat the names benchmarks/v8-v7/richards.js:258— 1 of 16 documented parameters and 0 of 281 summaries in `.` only repeat the member or parameter name (e.g. "the task" for `task`). Delete the restating tags, or add what the name does not say.
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 01a1daf8-8cb2-7e21-81b5-8f4501eb9846 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 77 · Warnings: 666 · Recommendations: 91 · Info: 8 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 14-11-2026 @ 16:51 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.